./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext3/derefInLoop1_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_bce903cd-125e-49f6-a519-3469c9704891/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bce903cd-125e-49f6-a519-3469c9704891/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bce903cd-125e-49f6-a519-3469c9704891/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bce903cd-125e-49f6-a519-3469c9704891/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext3/derefInLoop1_false-valid-deref.c -s /tmp/vcloud-vcloud-master/worker/working_dir_bce903cd-125e-49f6-a519-3469c9704891/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bce903cd-125e-49f6-a519-3469c9704891/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 aa3ae4378a5284e50be7191d52900376e96b0fdc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-23 13:14:20,570 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:14:20,571 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:14:20,578 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:14:20,579 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:14:20,579 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:14:20,580 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:14:20,581 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:14:20,582 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:14:20,582 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:14:20,583 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:14:20,583 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:14:20,584 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:14:20,585 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:14:20,585 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:14:20,586 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:14:20,587 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:14:20,588 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:14:20,589 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:14:20,590 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:14:20,591 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:14:20,592 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:14:20,593 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:14:20,593 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:14:20,594 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:14:20,594 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:14:20,595 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:14:20,596 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:14:20,596 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:14:20,597 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:14:20,597 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:14:20,597 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:14:20,598 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:14:20,598 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:14:20,598 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:14:20,599 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:14:20,599 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bce903cd-125e-49f6-a519-3469c9704891/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-23 13:14:20,607 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:14:20,607 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:14:20,608 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:14:20,608 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:14:20,608 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:14:20,608 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:14:20,608 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:14:20,609 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:14:20,609 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:14:20,609 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 13:14:20,609 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:14:20,609 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:14:20,609 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:14:20,609 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 13:14:20,609 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 13:14:20,610 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 13:14:20,610 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:14:20,610 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:14:20,610 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:14:20,610 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:14:20,610 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:14:20,611 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:14:20,611 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:14:20,611 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:14:20,611 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:14:20,611 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:14:20,611 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:14:20,611 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:14:20,611 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_bce903cd-125e-49f6-a519-3469c9704891/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 -> aa3ae4378a5284e50be7191d52900376e96b0fdc [2018-11-23 13:14:20,635 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:14:20,644 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:14:20,646 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:14:20,648 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:14:20,648 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:14:20,648 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bce903cd-125e-49f6-a519-3469c9704891/bin-2019/uautomizer/../../sv-benchmarks/c/memsafety-ext3/derefInLoop1_false-valid-deref.c [2018-11-23 13:14:20,690 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bce903cd-125e-49f6-a519-3469c9704891/bin-2019/uautomizer/data/cc3a24802/b8749436d41742c9b935dba02fb2335c/FLAG3887cb708 [2018-11-23 13:14:21,088 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:14:21,088 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bce903cd-125e-49f6-a519-3469c9704891/sv-benchmarks/c/memsafety-ext3/derefInLoop1_false-valid-deref.c [2018-11-23 13:14:21,092 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bce903cd-125e-49f6-a519-3469c9704891/bin-2019/uautomizer/data/cc3a24802/b8749436d41742c9b935dba02fb2335c/FLAG3887cb708 [2018-11-23 13:14:21,103 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bce903cd-125e-49f6-a519-3469c9704891/bin-2019/uautomizer/data/cc3a24802/b8749436d41742c9b935dba02fb2335c [2018-11-23 13:14:21,106 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:14:21,107 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-23 13:14:21,108 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:14:21,108 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:14:21,111 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:14:21,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:14:21" (1/1) ... [2018-11-23 13:14:21,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@787be1fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:14:21, skipping insertion in model container [2018-11-23 13:14:21,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:14:21" (1/1) ... [2018-11-23 13:14:21,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:14:21,136 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:14:21,254 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:14:21,260 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:14:21,270 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:14:21,279 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:14:21,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:14:21 WrapperNode [2018-11-23 13:14:21,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:14:21,280 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:14:21,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:14:21,280 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:14:21,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:14:21" (1/1) ... [2018-11-23 13:14:21,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:14:21" (1/1) ... [2018-11-23 13:14:21,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:14:21" (1/1) ... [2018-11-23 13:14:21,293 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:14:21" (1/1) ... [2018-11-23 13:14:21,296 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:14:21" (1/1) ... [2018-11-23 13:14:21,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:14:21" (1/1) ... [2018-11-23 13:14:21,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:14:21" (1/1) ... [2018-11-23 13:14:21,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:14:21,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:14:21,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:14:21,335 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:14:21,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:14:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce903cd-125e-49f6-a519-3469c9704891/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-23 13:14:21,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:14:21,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:14:21,374 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:14:21,374 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:14:21,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:14:21,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:14:21,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:14:21,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:14:21,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:14:21,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:14:21,476 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:14:21,476 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:14:21,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:14:21 BoogieIcfgContainer [2018-11-23 13:14:21,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:14:21,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:14:21,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:14:21,481 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:14:21,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:14:21" (1/3) ... [2018-11-23 13:14:21,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27dba840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:14:21, skipping insertion in model container [2018-11-23 13:14:21,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:14:21" (2/3) ... [2018-11-23 13:14:21,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27dba840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:14:21, skipping insertion in model container [2018-11-23 13:14:21,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:14:21" (3/3) ... [2018-11-23 13:14:21,483 INFO L112 eAbstractionObserver]: Analyzing ICFG derefInLoop1_false-valid-deref.c [2018-11-23 13:14:21,489 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:14:21,493 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-23 13:14:21,502 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-23 13:14:21,519 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:14:21,520 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:14:21,520 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 13:14:21,520 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:14:21,520 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:14:21,520 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:14:21,520 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:14:21,521 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:14:21,521 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:14:21,529 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-23 13:14:21,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 13:14:21,536 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:21,536 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:21,538 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-23 13:14:21,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:21,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1075805963, now seen corresponding path program 1 times [2018-11-23 13:14:21,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:21,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:21,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:21,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:14:21,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:21,613 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-23 13:14:21,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:14:21,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:14:21,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:14:21,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:14:21,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:14:21,627 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-23 13:14:21,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:21,636 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 13:14:21,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:14:21,637 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-11-23 13:14:21,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:21,642 INFO L225 Difference]: With dead ends: 18 [2018-11-23 13:14:21,642 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 13:14:21,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:14:21,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 13:14:21,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 13:14:21,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:14:21,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-23 13:14:21,664 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 9 [2018-11-23 13:14:21,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:21,664 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-23 13:14:21,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:14:21,665 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 13:14:21,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 13:14:21,665 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:21,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:21,665 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-23 13:14:21,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:21,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1075819417, now seen corresponding path program 1 times [2018-11-23 13:14:21,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:21,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:21,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:21,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:14:21,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:21,719 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-23 13:14:21,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:14:21,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:14:21,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:14:21,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:14:21,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:14:21,721 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 3 states. [2018-11-23 13:14:21,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:21,746 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 13:14:21,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:14:21,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-23 13:14:21,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:21,747 INFO L225 Difference]: With dead ends: 18 [2018-11-23 13:14:21,747 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 13:14:21,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:14:21,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 13:14:21,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-23 13:14:21,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:14:21,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-23 13:14:21,750 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 9 [2018-11-23 13:14:21,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:21,750 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-23 13:14:21,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:14:21,750 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 13:14:21,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:14:21,751 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:21,751 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:21,751 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-23 13:14:21,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:21,751 INFO L82 PathProgramCache]: Analyzing trace with hash -643356833, now seen corresponding path program 1 times [2018-11-23 13:14:21,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:21,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:21,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:21,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:14:21,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:21,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:21,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:14:21,798 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bce903cd-125e-49f6-a519-3469c9704891/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:14:21,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:14:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:21,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:21,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:21,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:14:21,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:14:21,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:14:21,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:14:21,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:14:21,865 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 5 states. [2018-11-23 13:14:21,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:21,883 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 13:14:21,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:14:21,883 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-23 13:14:21,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:14:21,883 INFO L225 Difference]: With dead ends: 19 [2018-11-23 13:14:21,883 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 13:14:21,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:14:21,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 13:14:21,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 13:14:21,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:14:21,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-23 13:14:21,885 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 12 [2018-11-23 13:14:21,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:14:21,886 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-23 13:14:21,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:14:21,886 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 13:14:21,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 13:14:21,886 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:14:21,886 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:14:21,886 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr1REQUIRES_VIOLATION, mainErr2ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION]=== [2018-11-23 13:14:21,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:21,886 INFO L82 PathProgramCache]: Analyzing trace with hash -643355199, now seen corresponding path program 1 times [2018-11-23 13:14:21,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:21,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:21,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:21,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:14:21,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:14:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:14:21,923 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=44, |#NULL.offset|=41, |old(#NULL.base)|=44, |old(#NULL.offset)|=41] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=44, |old(#NULL.offset)|=41] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=44, |old(#NULL.offset)|=41] [?] RET #31#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret1 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] havoc ~p~0.base, ~p~0.offset;~i~0 := 0; VAL [main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 2);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); VAL [main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=42, |main_~#a~0.offset|=0] [?] assume 0 == ~i~0;~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=0, main_~p~0.base=42, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=42, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=1, main_~p~0.base=42, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 2);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); VAL [main_~i~0=1, main_~p~0.base=42, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=43, |main_~#a~0.offset|=0] [?] assume !(0 == ~i~0); VAL [main_~i~0=1, main_~p~0.base=42, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=43, |main_~#a~0.offset|=0] [?] assume !(1 == #valid[~p~0.base]); VAL [main_~i~0=1, main_~p~0.base=42, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=43, |main_~#a~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=44, #NULL.offset=41, old(#NULL.base)=44, old(#NULL.offset)=41] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=44, old(#NULL.offset)=41] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=44, old(#NULL.offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L2] havoc ~p~0.base, ~p~0.offset; [L3] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=0] [L3-L10] assume !!(~i~0 < 2); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=42, ~#a~0.offset=0, ~i~0=0] [L5-L9] assume 0 == ~i~0; [L6] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=42, ~#a~0.offset=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L3-L10] assume !!(~i~0 < 2); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L5-L9] assume !(0 == ~i~0); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L8] call write~int(1, ~p~0.base, ~p~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=44, #NULL.offset=41, old(#NULL.base)=44, old(#NULL.offset)=41] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=44, old(#NULL.offset)=41] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=44, old(#NULL.offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L2] havoc ~p~0.base, ~p~0.offset; [L3] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=0] [L3-L10] assume !!(~i~0 < 2); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=42, ~#a~0.offset=0, ~i~0=0] [L5-L9] assume 0 == ~i~0; [L6] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=42, ~#a~0.offset=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L3-L10] assume !!(~i~0 < 2); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L5-L9] assume !(0 == ~i~0); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L8] call write~int(1, ~p~0.base, ~p~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=44, #NULL!offset=41, old(#NULL!base)=44, old(#NULL!offset)=41] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=44, old(#NULL!offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L2] havoc ~p~0; [L3] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=0] [L3-L10] COND FALSE !(!(~i~0 < 2)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=42, ~#a~0!offset=0, ~i~0=0] [L5] COND TRUE 0 == ~i~0 [L6] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=42, ~#a~0!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L3-L10] COND FALSE !(!(~i~0 < 2)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L5] COND FALSE !(0 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L8] 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, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~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=44, #NULL!offset=41, old(#NULL!base)=44, old(#NULL!offset)=41] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=44, old(#NULL!offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L2] havoc ~p~0; [L3] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=0] [L3-L10] COND FALSE !(!(~i~0 < 2)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=42, ~#a~0!offset=0, ~i~0=0] [L5] COND TRUE 0 == ~i~0 [L6] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=42, ~#a~0!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L3-L10] COND FALSE !(!(~i~0 < 2)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L5] COND FALSE !(0 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L8] 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, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L2] int* p; [L3] int i = 0; VAL [i=0] [L3] COND TRUE i < 2 [L4] int a[10]; VAL [a={42:0}, i=0] [L5] COND TRUE i == 0 [L6] p = a VAL [a={42:0}, i=0, p={42:0}] [L3] i++ [L3] COND TRUE i < 2 [L4] int a[10]; VAL [a={43:0}, i=1, p={42:0}] [L5] COND FALSE !(i == 0) VAL [a={43:0}, i=1, p={42:0}] [L8] p[0] = 1 ----- [2018-11-23 13:14:21,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:14:21 BoogieIcfgContainer [2018-11-23 13:14:21,944 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:14:21,944 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:14:21,944 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:14:21,944 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:14:21,945 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:14:21" (3/4) ... [2018-11-23 13:14:21,947 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|=44, |#NULL.offset|=41, |old(#NULL.base)|=44, |old(#NULL.offset)|=41] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=44, |old(#NULL.offset)|=41] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=44, |old(#NULL.offset)|=41] [?] RET #31#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret1 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] havoc ~p~0.base, ~p~0.offset;~i~0 := 0; VAL [main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 2);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); VAL [main_~i~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=42, |main_~#a~0.offset|=0] [?] assume 0 == ~i~0;~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=0, main_~p~0.base=42, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=42, |main_~#a~0.offset|=0] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0;call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset);havoc ~#a~0.base, ~#a~0.offset; VAL [main_~i~0=1, main_~p~0.base=42, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !!(~i~0 < 2);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); VAL [main_~i~0=1, main_~p~0.base=42, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=43, |main_~#a~0.offset|=0] [?] assume !(0 == ~i~0); VAL [main_~i~0=1, main_~p~0.base=42, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=43, |main_~#a~0.offset|=0] [?] assume !(1 == #valid[~p~0.base]); VAL [main_~i~0=1, main_~p~0.base=42, main_~p~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=43, |main_~#a~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=44, #NULL.offset=41, old(#NULL.base)=44, old(#NULL.offset)=41] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=44, old(#NULL.offset)=41] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=44, old(#NULL.offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L2] havoc ~p~0.base, ~p~0.offset; [L3] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=0] [L3-L10] assume !!(~i~0 < 2); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=42, ~#a~0.offset=0, ~i~0=0] [L5-L9] assume 0 == ~i~0; [L6] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=42, ~#a~0.offset=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L3-L10] assume !!(~i~0 < 2); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L5-L9] assume !(0 == ~i~0); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L8] call write~int(1, ~p~0.base, ~p~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=44, #NULL.offset=41, old(#NULL.base)=44, old(#NULL.offset)=41] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=44, old(#NULL.offset)=41] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=44, old(#NULL.offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L2] havoc ~p~0.base, ~p~0.offset; [L3] ~i~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=0] [L3-L10] assume !!(~i~0 < 2); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=42, ~#a~0.offset=0, ~i~0=0] [L5-L9] assume 0 == ~i~0; [L6] ~p~0.base, ~p~0.offset := ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=42, ~#a~0.offset=0, ~i~0=0, ~p~0.base=42, ~p~0.offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] call ULTIMATE.dealloc(~#a~0.base, ~#a~0.offset); [L4] havoc ~#a~0.base, ~#a~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L3-L10] assume !!(~i~0 < 2); [L4] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L5-L9] assume !(0 == ~i~0); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [L8] call write~int(1, ~p~0.base, ~p~0.offset, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=43, ~#a~0.offset=0, ~i~0=1, ~p~0.base=42, ~p~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=44, #NULL!offset=41, old(#NULL!base)=44, old(#NULL!offset)=41] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=44, old(#NULL!offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L2] havoc ~p~0; [L3] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=0] [L3-L10] COND FALSE !(!(~i~0 < 2)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=42, ~#a~0!offset=0, ~i~0=0] [L5] COND TRUE 0 == ~i~0 [L6] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=42, ~#a~0!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L3-L10] COND FALSE !(!(~i~0 < 2)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L5] COND FALSE !(0 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L8] 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, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~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=44, #NULL!offset=41, old(#NULL!base)=44, old(#NULL!offset)=41] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=44, old(#NULL!offset)=41] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret1 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L2] havoc ~p~0; [L3] ~i~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=0] [L3-L10] COND FALSE !(!(~i~0 < 2)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=42, ~#a~0!offset=0, ~i~0=0] [L5] COND TRUE 0 == ~i~0 [L6] ~p~0 := ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=42, ~#a~0!offset=0, ~i~0=0, ~p~0!base=42, ~p~0!offset=0] [L3] #t~post0 := ~i~0; [L3] ~i~0 := 1 + #t~post0; [L3] havoc #t~post0; [L4] FCALL call ULTIMATE.dealloc(~#a~0); [L4] havoc ~#a~0; VAL [#NULL!base=0, #NULL!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L3-L10] COND FALSE !(!(~i~0 < 2)) [L4] FCALL call ~#a~0 := #Ultimate.alloc(40); VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L5] COND FALSE !(0 == ~i~0) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L8] 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, ~#a~0!base=43, ~#a~0!offset=0, ~i~0=1, ~p~0!base=42, ~p~0!offset=0] [L2] int* p; [L3] int i = 0; VAL [i=0] [L3] COND TRUE i < 2 [L4] int a[10]; VAL [a={42:0}, i=0] [L5] COND TRUE i == 0 [L6] p = a VAL [a={42:0}, i=0, p={42:0}] [L3] i++ [L3] COND TRUE i < 2 [L4] int a[10]; VAL [a={43:0}, i=1, p={42:0}] [L5] COND FALSE !(i == 0) VAL [a={43:0}, i=1, p={42:0}] [L8] p[0] = 1 ----- [2018-11-23 13:14:21,980 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_bce903cd-125e-49f6-a519-3469c9704891/bin-2019/uautomizer/witness.graphml [2018-11-23 13:14:21,980 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:14:21,981 INFO L168 Benchmark]: Toolchain (without parser) took 874.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -109.7 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2018-11-23 13:14:21,982 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:14:21,982 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.50 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:14:21,982 INFO L168 Benchmark]: Boogie Preprocessor took 55.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 948.5 MB in the beginning and 1.1 GB in the end (delta: -191.3 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2018-11-23 13:14:21,983 INFO L168 Benchmark]: RCFGBuilder took 141.58 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 13:14:21,983 INFO L168 Benchmark]: TraceAbstraction took 466.61 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: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 11.5 GB. [2018-11-23 13:14:21,983 INFO L168 Benchmark]: Witness Printer took 36.12 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:14:21,985 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 171.50 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 948.5 MB in the beginning and 1.1 GB in the end (delta: -191.3 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 141.58 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: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 466.61 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: 48.5 MB). Peak memory consumption was 48.5 MB. Max. memory is 11.5 GB. * Witness Printer took 36.12 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: 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: 8]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L2] int* p; [L3] int i = 0; VAL [i=0] [L3] COND TRUE i < 2 [L4] int a[10]; VAL [a={42:0}, i=0] [L5] COND TRUE i == 0 [L6] p = a VAL [a={42:0}, i=0, p={42:0}] [L3] i++ [L3] COND TRUE i < 2 [L4] int a[10]; VAL [a={43:0}, i=1, p={42:0}] [L5] COND FALSE !(i == 0) VAL [a={43:0}, i=1, p={42:0}] [L8] p[0] = 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 18 locations, 3 error locations. UNSAFE Result, 0.4s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 44 SDtfs, 9 SDslu, 30 SDs, 0 SdLazy, 20 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=3, 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, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 562 SizeOfPredicates, 1 NumberOfNonLiveVariables, 50 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 0/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...