./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength_false-valid-deref-read.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_d98c4aa7-08cf-48be-aec3-45b550838a08/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d98c4aa7-08cf-48be-aec3-45b550838a08/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d98c4aa7-08cf-48be-aec3-45b550838a08/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d98c4aa7-08cf-48be-aec3-45b550838a08/bin-2019/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength_false-valid-deref-read.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d98c4aa7-08cf-48be-aec3-45b550838a08/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d98c4aa7-08cf-48be-aec3-45b550838a08/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aeae4642ea0f346b37f312868ec7e7128e333d20 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 06:40:56,612 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 06:40:56,612 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 06:40:56,619 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 06:40:56,619 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 06:40:56,620 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 06:40:56,621 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 06:40:56,622 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 06:40:56,623 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 06:40:56,624 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 06:40:56,624 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 06:40:56,625 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 06:40:56,625 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 06:40:56,626 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 06:40:56,627 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 06:40:56,627 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 06:40:56,628 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 06:40:56,629 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 06:40:56,631 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 06:40:56,632 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 06:40:56,632 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 06:40:56,633 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 06:40:56,635 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 06:40:56,635 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 06:40:56,635 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 06:40:56,636 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 06:40:56,636 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 06:40:56,637 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 06:40:56,637 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 06:40:56,638 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 06:40:56,638 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 06:40:56,639 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 06:40:56,639 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 06:40:56,639 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 06:40:56,640 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 06:40:56,640 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 06:40:56,640 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d98c4aa7-08cf-48be-aec3-45b550838a08/bin-2019/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2018-11-23 06:40:56,649 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 06:40:56,649 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 06:40:56,649 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 06:40:56,650 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 06:40:56,650 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 06:40:56,650 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 06:40:56,650 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 06:40:56,650 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 06:40:56,650 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 06:40:56,651 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 06:40:56,651 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 06:40:56,651 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 06:40:56,651 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 06:40:56,652 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 06:40:56,652 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 06:40:56,652 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 06:40:56,652 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 06:40:56,652 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 06:40:56,652 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 06:40:56,652 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 06:40:56,653 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 06:40:56,653 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 06:40:56,653 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 06:40:56,653 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 06:40:56,653 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 06:40:56,653 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 06:40:56,653 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 06:40:56,654 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 06:40:56,654 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 06:40:56,654 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 06:40:56,654 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 06:40:56,654 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:40:56,654 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 06:40:56,654 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 06:40:56,655 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 06:40:56,655 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 06:40:56,655 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 06:40:56,655 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_d98c4aa7-08cf-48be-aec3-45b550838a08/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aeae4642ea0f346b37f312868ec7e7128e333d20 [2018-11-23 06:40:56,675 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 06:40:56,684 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 06:40:56,687 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 06:40:56,688 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 06:40:56,688 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 06:40:56,689 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d98c4aa7-08cf-48be-aec3-45b550838a08/bin-2019/utaipan/../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength_false-valid-deref-read.c [2018-11-23 06:40:56,731 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d98c4aa7-08cf-48be-aec3-45b550838a08/bin-2019/utaipan/data/332be1e95/e63167a49c724ca19e9bc89da4b2d866/FLAG7a0ede68c [2018-11-23 06:40:57,135 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 06:40:57,135 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d98c4aa7-08cf-48be-aec3-45b550838a08/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength_false-valid-deref-read.c [2018-11-23 06:40:57,139 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d98c4aa7-08cf-48be-aec3-45b550838a08/bin-2019/utaipan/data/332be1e95/e63167a49c724ca19e9bc89da4b2d866/FLAG7a0ede68c [2018-11-23 06:40:57,149 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d98c4aa7-08cf-48be-aec3-45b550838a08/bin-2019/utaipan/data/332be1e95/e63167a49c724ca19e9bc89da4b2d866 [2018-11-23 06:40:57,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 06:40:57,152 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 06:40:57,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 06:40:57,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 06:40:57,156 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 06:40:57,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:40:57" (1/1) ... [2018-11-23 06:40:57,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa4fa66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:40:57, skipping insertion in model container [2018-11-23 06:40:57,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:40:57" (1/1) ... [2018-11-23 06:40:57,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 06:40:57,177 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 06:40:57,287 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:40:57,293 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 06:40:57,304 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 06:40:57,313 INFO L195 MainTranslator]: Completed translation [2018-11-23 06:40:57,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:40:57 WrapperNode [2018-11-23 06:40:57,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 06:40:57,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 06:40:57,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 06:40:57,314 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 06:40:57,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:40:57" (1/1) ... [2018-11-23 06:40:57,330 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:40:57" (1/1) ... [2018-11-23 06:40:57,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 06:40:57,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 06:40:57,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 06:40:57,337 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 06:40:57,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:40:57" (1/1) ... [2018-11-23 06:40:57,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:40:57" (1/1) ... [2018-11-23 06:40:57,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:40:57" (1/1) ... [2018-11-23 06:40:57,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:40:57" (1/1) ... [2018-11-23 06:40:57,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:40:57" (1/1) ... [2018-11-23 06:40:57,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:40:57" (1/1) ... [2018-11-23 06:40:57,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:40:57" (1/1) ... [2018-11-23 06:40:57,399 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 06:40:57,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 06:40:57,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 06:40:57,399 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 06:40:57,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:40:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d98c4aa7-08cf-48be-aec3-45b550838a08/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 06:40:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 06:40:57,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 06:40:57,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 06:40:57,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 06:40:57,446 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2018-11-23 06:40:57,446 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2018-11-23 06:40:57,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 06:40:57,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 06:40:57,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 06:40:57,446 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 06:40:57,446 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 06:40:57,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 06:40:57,640 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 06:40:57,640 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 06:40:57,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:40:57 BoogieIcfgContainer [2018-11-23 06:40:57,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 06:40:57,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 06:40:57,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 06:40:57,644 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 06:40:57,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:40:57" (1/3) ... [2018-11-23 06:40:57,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4085ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:40:57, skipping insertion in model container [2018-11-23 06:40:57,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:40:57" (2/3) ... [2018-11-23 06:40:57,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4085ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:40:57, skipping insertion in model container [2018-11-23 06:40:57,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:40:57" (3/3) ... [2018-11-23 06:40:57,648 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_false-valid-deref-read.c [2018-11-23 06:40:57,656 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 06:40:57,662 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-11-23 06:40:57,678 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-11-23 06:40:57,702 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 06:40:57,702 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 06:40:57,703 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 06:40:57,703 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 06:40:57,703 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 06:40:57,703 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 06:40:57,703 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 06:40:57,703 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 06:40:57,718 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-11-23 06:40:57,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 06:40:57,726 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:40:57,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:40:57,729 INFO L423 AbstractCegarLoop]: === Iteration 1 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-23 06:40:57,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:40:57,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1189570050, now seen corresponding path program 1 times [2018-11-23 06:40:57,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:40:57,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:57,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:40:57,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:57,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:40:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 06:40:57,855 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 06:40:57,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 06:40:57,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 06:40:57,856 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 06:40:57,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 06:40:57,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 06:40:57,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 06:40:57,869 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2018-11-23 06:40:57,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 06:40:57,921 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-11-23 06:40:57,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 06:40:57,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 06:40:57,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 06:40:57,928 INFO L225 Difference]: With dead ends: 46 [2018-11-23 06:40:57,928 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 06:40:57,929 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 06:40:57,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 06:40:57,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2018-11-23 06:40:57,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 06:40:57,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-23 06:40:57,958 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 10 [2018-11-23 06:40:57,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 06:40:57,959 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-23 06:40:57,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 06:40:57,959 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-23 06:40:57,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 06:40:57,959 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 06:40:57,959 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 06:40:57,960 INFO L423 AbstractCegarLoop]: === Iteration 2 === [fooErr0ASSERT_VIOLATIONARRAY_INDEX, fooErr1REQUIRES_VIOLATION, fooErr2REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION]=== [2018-11-23 06:40:57,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 06:40:57,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1775375512, now seen corresponding path program 1 times [2018-11-23 06:40:57,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 06:40:57,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:57,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 06:40:57,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 06:40:57,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 06:40:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 06:40:58,002 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=403, |#NULL.offset|=401, |old(#NULL.base)|=403, |old(#NULL.offset)|=401] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=403, |old(#NULL.offset)|=401] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=403, |old(#NULL.offset)|=401] [?] RET #73#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret5 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400);~i~1 := 0; VAL [main_~i~1=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#b~0.base|=402, |main_~#b~0.offset|=0] [?] assume !!(~i~1 < 100); VAL [main_~i~1=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#b~0.base|=402, |main_~#b~0.offset|=0] [?] CALL call #t~ret3 := foo(~i~1, ~#b~0.base, ~#b~0.offset, ~i~1); VAL [|#NULL.base|=0, |#NULL.offset|=0, |foo_#in~b.base|=402, |foo_#in~b.offset|=0, |foo_#in~n|=0, |foo_#in~size|=0] [?] ~n := #in~n;~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; VAL [foo_~b.base=402, foo_~b.offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, |#NULL.base|=0, |#NULL.offset|=0, |foo_#in~b.base|=402, |foo_#in~b.offset|=0, |foo_#in~n|=0, |foo_#in~size|=0] [?] assume !!(~i~0 < 1 + ~size); VAL [foo_~b.base=402, foo_~b.offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, |#NULL.base|=0, |#NULL.offset|=0, |foo_#in~b.base|=402, |foo_#in~b.offset|=0, |foo_#in~n|=0, |foo_#in~size|=0] [?] assume !(0 <= ~i~0 && ~i~0 < ~n); VAL [foo_~b.base=402, foo_~b.offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, |#NULL.base|=0, |#NULL.offset|=0, |foo_#in~b.base|=402, |foo_#in~b.offset|=0, |foo_#in~n|=0, |foo_#in~size|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=403, #NULL.offset=401, old(#NULL.base)=403, old(#NULL.offset)=401] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=403, old(#NULL.offset)=401] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=403, old(#NULL.offset)=401] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L21] havoc ~i~1; [L21] call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400); [L22] ~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#b~0.base=402, ~#b~0.offset=0, ~i~1=0] [L22-L24] assume !!(~i~1 < 100); VAL [#NULL.base=0, #NULL.offset=0, ~#b~0.base=402, ~#b~0.offset=0, ~i~1=0] [L23] CALL call #t~ret3 := foo(~i~1, ~#b~0.base, ~#b~0.offset, ~i~1); VAL [#in~b.base=402, #in~b.offset=0, #in~n=0, #in~size=0, #NULL.base=0, #NULL.offset=0] [L12-L18] ~n := #in~n; [L12-L18] ~b.base, ~b.offset := #in~b.base, #in~b.offset; [L12-L18] ~size := #in~size; [L13] havoc ~a~0; [L13] havoc ~i~0; [L14] ~i~0 := 0; VAL [#in~b.base=402, #in~b.offset=0, #in~n=0, #in~size=0, #NULL.base=0, #NULL.offset=0, ~b.base=402, ~b.offset=0, ~i~0=0, ~n=0, ~size=0] [L14-L16] assume !!(~i~0 < 1 + ~size); VAL [#in~b.base=402, #in~b.offset=0, #in~n=0, #in~size=0, #NULL.base=0, #NULL.offset=0, ~b.base=402, ~b.offset=0, ~i~0=0, ~n=0, ~size=0] [L15] assert 0 <= ~i~0 && ~i~0 < ~n; VAL [#in~b.base=402, #in~b.offset=0, #in~n=0, #in~size=0, #NULL.base=0, #NULL.offset=0, ~b.base=402, ~b.offset=0, ~i~0=0, ~n=0, ~size=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=403, #NULL.offset=401, old(#NULL.base)=403, old(#NULL.offset)=401] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=403, old(#NULL.offset)=401] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=403, old(#NULL.offset)=401] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L21] havoc ~i~1; [L21] call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400); [L22] ~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#b~0.base=402, ~#b~0.offset=0, ~i~1=0] [L22-L24] assume !!(~i~1 < 100); VAL [#NULL.base=0, #NULL.offset=0, ~#b~0.base=402, ~#b~0.offset=0, ~i~1=0] [L23] CALL call #t~ret3 := foo(~i~1, ~#b~0.base, ~#b~0.offset, ~i~1); VAL [#in~b.base=402, #in~b.offset=0, #in~n=0, #in~size=0, #NULL.base=0, #NULL.offset=0] [L12-L18] ~n := #in~n; [L12-L18] ~b.base, ~b.offset := #in~b.base, #in~b.offset; [L12-L18] ~size := #in~size; [L13] havoc ~a~0; [L13] havoc ~i~0; [L14] ~i~0 := 0; VAL [#in~b.base=402, #in~b.offset=0, #in~n=0, #in~size=0, #NULL.base=0, #NULL.offset=0, ~b.base=402, ~b.offset=0, ~i~0=0, ~n=0, ~size=0] [L14-L16] assume !!(~i~0 < 1 + ~size); VAL [#in~b.base=402, #in~b.offset=0, #in~n=0, #in~size=0, #NULL.base=0, #NULL.offset=0, ~b.base=402, ~b.offset=0, ~i~0=0, ~n=0, ~size=0] [L15] assert 0 <= ~i~0 && ~i~0 < ~n; VAL [#in~b.base=402, #in~b.offset=0, #in~n=0, #in~size=0, #NULL.base=0, #NULL.offset=0, ~b.base=402, ~b.offset=0, ~i~0=0, ~n=0, ~size=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=403, #NULL!offset=401, old(#NULL!base)=403, old(#NULL!offset)=401] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=403, old(#NULL!offset)=401] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L21] havoc ~i~1; [L21] FCALL call ~#b~0 := #Ultimate.alloc(400); [L22] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#b~0!base=402, ~#b~0!offset=0, ~i~1=0] [L22-L24] COND FALSE !(!(~i~1 < 100)) VAL [#NULL!base=0, #NULL!offset=0, ~#b~0!base=402, ~#b~0!offset=0, ~i~1=0] [L23] CALL call #t~ret3 := foo(~i~1, ~#b~0, ~i~1); VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0] [L12-L18] ~n := #in~n; [L12-L18] ~b := #in~b; [L12-L18] ~size := #in~size; [L13] havoc ~a~0; [L13] havoc ~i~0; [L14] ~i~0 := 0; VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0, ~b!base=402, ~b!offset=0, ~i~0=0, ~n=0, ~size=0] [L14-L16] COND FALSE !(!(~i~0 < 1 + ~size)) VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0, ~b!base=402, ~b!offset=0, ~i~0=0, ~n=0, ~size=0] [L15] assert 0 <= ~i~0 && ~i~0 < ~n; VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0, ~b!base=402, ~b!offset=0, ~i~0=0, ~n=0, ~size=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=403, #NULL!offset=401, old(#NULL!base)=403, old(#NULL!offset)=401] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=403, old(#NULL!offset)=401] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L21] havoc ~i~1; [L21] FCALL call ~#b~0 := #Ultimate.alloc(400); [L22] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#b~0!base=402, ~#b~0!offset=0, ~i~1=0] [L22-L24] COND FALSE !(!(~i~1 < 100)) VAL [#NULL!base=0, #NULL!offset=0, ~#b~0!base=402, ~#b~0!offset=0, ~i~1=0] [L23] CALL call #t~ret3 := foo(~i~1, ~#b~0, ~i~1); VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0] [L12-L18] ~n := #in~n; [L12-L18] ~b := #in~b; [L12-L18] ~size := #in~size; [L13] havoc ~a~0; [L13] havoc ~i~0; [L14] ~i~0 := 0; VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0, ~b!base=402, ~b!offset=0, ~i~0=0, ~n=0, ~size=0] [L14-L16] COND FALSE !(!(~i~0 < 1 + ~size)) VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0, ~b!base=402, ~b!offset=0, ~i~0=0, ~n=0, ~size=0] [L15] assert 0 <= ~i~0 && ~i~0 < ~n; VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0, ~b!base=402, ~b!offset=0, ~i~0=0, ~n=0, ~size=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=403, #NULL!offset=401, old(#NULL!base)=403, old(#NULL!offset)=401] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=403, old(#NULL!offset)=401] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L21] havoc ~i~1; [L21] FCALL call ~#b~0 := #Ultimate.alloc(400); [L22] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#b~0!base=402, ~#b~0!offset=0, ~i~1=0] [L22-L24] COND FALSE !(!(~i~1 < 100)) VAL [#NULL!base=0, #NULL!offset=0, ~#b~0!base=402, ~#b~0!offset=0, ~i~1=0] [L23] CALL call #t~ret3 := foo(~i~1, ~#b~0, ~i~1); VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0] [L12-L18] ~n := #in~n; [L12-L18] ~b := #in~b; [L12-L18] ~size := #in~size; [L13] havoc ~a~0; [L13] havoc ~i~0; [L14] ~i~0 := 0; VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0, ~b!base=402, ~b!offset=0, ~i~0=0, ~n=0, ~size=0] [L14-L16] COND FALSE !(!(~i~0 < 1 + ~size)) VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0, ~b!base=402, ~b!offset=0, ~i~0=0, ~n=0, ~size=0] [L15] assert 0 <= ~i~0 && ~i~0 < ~n; VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0, ~b!base=402, ~b!offset=0, ~i~0=0, ~n=0, ~size=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=403, #NULL!offset=401, old(#NULL!base)=403, old(#NULL!offset)=401] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=403, old(#NULL!offset)=401] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L21] havoc ~i~1; [L21] FCALL call ~#b~0 := #Ultimate.alloc(400); [L22] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#b~0!base=402, ~#b~0!offset=0, ~i~1=0] [L22-L24] COND FALSE !(!(~i~1 < 100)) VAL [#NULL!base=0, #NULL!offset=0, ~#b~0!base=402, ~#b~0!offset=0, ~i~1=0] [L23] CALL call #t~ret3 := foo(~i~1, ~#b~0, ~i~1); VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0] [L12-L18] ~n := #in~n; [L12-L18] ~b := #in~b; [L12-L18] ~size := #in~size; [L13] havoc ~a~0; [L13] havoc ~i~0; [L14] ~i~0 := 0; VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0, ~b!base=402, ~b!offset=0, ~i~0=0, ~n=0, ~size=0] [L14-L16] COND FALSE !(!(~i~0 < 1 + ~size)) VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0, ~b!base=402, ~b!offset=0, ~i~0=0, ~n=0, ~size=0] [L15] assert 0 <= ~i~0 && ~i~0 < ~n; VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0, ~b!base=402, ~b!offset=0, ~i~0=0, ~n=0, ~size=0] [L21] int i, b[100]; [L22] i = 0 VAL [b={402:0}, i=0] [L22] COND TRUE i < 100 VAL [b={402:0}, i=0] [L23] CALL foo(i, b, i) VAL [\old(n)=0, \old(size)=0, b={402:0}] [L13] int a[n], i; [L14] i = 0 VAL [\old(n)=0, \old(size)=0, b={402:0}, b={402:0}, i=0, n=0, size=0] [L14] COND TRUE i < size + 1 VAL [\old(n)=0, \old(size)=0, b={402:0}, b={402:0}, i=0, n=0, size=0] [L15] a[i] VAL [\old(n)=0, \old(size)=0, b={402:0}, b={402:0}, i=0, n=0, size=0] ----- [2018-11-23 06:40:58,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:40:58 BoogieIcfgContainer [2018-11-23 06:40:58,028 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 06:40:58,028 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 06:40:58,028 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 06:40:58,028 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 06:40:58,029 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:40:57" (3/4) ... [2018-11-23 06:40:58,030 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|=403, |#NULL.offset|=401, |old(#NULL.base)|=403, |old(#NULL.offset)|=401] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=403, |old(#NULL.offset)|=401] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=403, |old(#NULL.offset)|=401] [?] RET #73#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret5 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] havoc ~i~1;call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400);~i~1 := 0; VAL [main_~i~1=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#b~0.base|=402, |main_~#b~0.offset|=0] [?] assume !!(~i~1 < 100); VAL [main_~i~1=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#b~0.base|=402, |main_~#b~0.offset|=0] [?] CALL call #t~ret3 := foo(~i~1, ~#b~0.base, ~#b~0.offset, ~i~1); VAL [|#NULL.base|=0, |#NULL.offset|=0, |foo_#in~b.base|=402, |foo_#in~b.offset|=0, |foo_#in~n|=0, |foo_#in~size|=0] [?] ~n := #in~n;~b.base, ~b.offset := #in~b.base, #in~b.offset;~size := #in~size;havoc ~a~0;havoc ~i~0;~i~0 := 0; VAL [foo_~b.base=402, foo_~b.offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, |#NULL.base|=0, |#NULL.offset|=0, |foo_#in~b.base|=402, |foo_#in~b.offset|=0, |foo_#in~n|=0, |foo_#in~size|=0] [?] assume !!(~i~0 < 1 + ~size); VAL [foo_~b.base=402, foo_~b.offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, |#NULL.base|=0, |#NULL.offset|=0, |foo_#in~b.base|=402, |foo_#in~b.offset|=0, |foo_#in~n|=0, |foo_#in~size|=0] [?] assume !(0 <= ~i~0 && ~i~0 < ~n); VAL [foo_~b.base=402, foo_~b.offset=0, foo_~i~0=0, foo_~n=0, foo_~size=0, |#NULL.base|=0, |#NULL.offset|=0, |foo_#in~b.base|=402, |foo_#in~b.offset|=0, |foo_#in~n|=0, |foo_#in~size|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=403, #NULL.offset=401, old(#NULL.base)=403, old(#NULL.offset)=401] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=403, old(#NULL.offset)=401] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=403, old(#NULL.offset)=401] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L21] havoc ~i~1; [L21] call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400); [L22] ~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#b~0.base=402, ~#b~0.offset=0, ~i~1=0] [L22-L24] assume !!(~i~1 < 100); VAL [#NULL.base=0, #NULL.offset=0, ~#b~0.base=402, ~#b~0.offset=0, ~i~1=0] [L23] CALL call #t~ret3 := foo(~i~1, ~#b~0.base, ~#b~0.offset, ~i~1); VAL [#in~b.base=402, #in~b.offset=0, #in~n=0, #in~size=0, #NULL.base=0, #NULL.offset=0] [L12-L18] ~n := #in~n; [L12-L18] ~b.base, ~b.offset := #in~b.base, #in~b.offset; [L12-L18] ~size := #in~size; [L13] havoc ~a~0; [L13] havoc ~i~0; [L14] ~i~0 := 0; VAL [#in~b.base=402, #in~b.offset=0, #in~n=0, #in~size=0, #NULL.base=0, #NULL.offset=0, ~b.base=402, ~b.offset=0, ~i~0=0, ~n=0, ~size=0] [L14-L16] assume !!(~i~0 < 1 + ~size); VAL [#in~b.base=402, #in~b.offset=0, #in~n=0, #in~size=0, #NULL.base=0, #NULL.offset=0, ~b.base=402, ~b.offset=0, ~i~0=0, ~n=0, ~size=0] [L15] assert 0 <= ~i~0 && ~i~0 < ~n; VAL [#in~b.base=402, #in~b.offset=0, #in~n=0, #in~size=0, #NULL.base=0, #NULL.offset=0, ~b.base=402, ~b.offset=0, ~i~0=0, ~n=0, ~size=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=403, #NULL.offset=401, old(#NULL.base)=403, old(#NULL.offset)=401] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=403, old(#NULL.offset)=401] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=403, old(#NULL.offset)=401] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L21] havoc ~i~1; [L21] call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400); [L22] ~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#b~0.base=402, ~#b~0.offset=0, ~i~1=0] [L22-L24] assume !!(~i~1 < 100); VAL [#NULL.base=0, #NULL.offset=0, ~#b~0.base=402, ~#b~0.offset=0, ~i~1=0] [L23] CALL call #t~ret3 := foo(~i~1, ~#b~0.base, ~#b~0.offset, ~i~1); VAL [#in~b.base=402, #in~b.offset=0, #in~n=0, #in~size=0, #NULL.base=0, #NULL.offset=0] [L12-L18] ~n := #in~n; [L12-L18] ~b.base, ~b.offset := #in~b.base, #in~b.offset; [L12-L18] ~size := #in~size; [L13] havoc ~a~0; [L13] havoc ~i~0; [L14] ~i~0 := 0; VAL [#in~b.base=402, #in~b.offset=0, #in~n=0, #in~size=0, #NULL.base=0, #NULL.offset=0, ~b.base=402, ~b.offset=0, ~i~0=0, ~n=0, ~size=0] [L14-L16] assume !!(~i~0 < 1 + ~size); VAL [#in~b.base=402, #in~b.offset=0, #in~n=0, #in~size=0, #NULL.base=0, #NULL.offset=0, ~b.base=402, ~b.offset=0, ~i~0=0, ~n=0, ~size=0] [L15] assert 0 <= ~i~0 && ~i~0 < ~n; VAL [#in~b.base=402, #in~b.offset=0, #in~n=0, #in~size=0, #NULL.base=0, #NULL.offset=0, ~b.base=402, ~b.offset=0, ~i~0=0, ~n=0, ~size=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=403, #NULL!offset=401, old(#NULL!base)=403, old(#NULL!offset)=401] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=403, old(#NULL!offset)=401] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L21] havoc ~i~1; [L21] FCALL call ~#b~0 := #Ultimate.alloc(400); [L22] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#b~0!base=402, ~#b~0!offset=0, ~i~1=0] [L22-L24] COND FALSE !(!(~i~1 < 100)) VAL [#NULL!base=0, #NULL!offset=0, ~#b~0!base=402, ~#b~0!offset=0, ~i~1=0] [L23] CALL call #t~ret3 := foo(~i~1, ~#b~0, ~i~1); VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0] [L12-L18] ~n := #in~n; [L12-L18] ~b := #in~b; [L12-L18] ~size := #in~size; [L13] havoc ~a~0; [L13] havoc ~i~0; [L14] ~i~0 := 0; VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0, ~b!base=402, ~b!offset=0, ~i~0=0, ~n=0, ~size=0] [L14-L16] COND FALSE !(!(~i~0 < 1 + ~size)) VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0, ~b!base=402, ~b!offset=0, ~i~0=0, ~n=0, ~size=0] [L15] assert 0 <= ~i~0 && ~i~0 < ~n; VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0, ~b!base=402, ~b!offset=0, ~i~0=0, ~n=0, ~size=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=403, #NULL!offset=401, old(#NULL!base)=403, old(#NULL!offset)=401] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=403, old(#NULL!offset)=401] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L21] havoc ~i~1; [L21] FCALL call ~#b~0 := #Ultimate.alloc(400); [L22] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#b~0!base=402, ~#b~0!offset=0, ~i~1=0] [L22-L24] COND FALSE !(!(~i~1 < 100)) VAL [#NULL!base=0, #NULL!offset=0, ~#b~0!base=402, ~#b~0!offset=0, ~i~1=0] [L23] CALL call #t~ret3 := foo(~i~1, ~#b~0, ~i~1); VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0] [L12-L18] ~n := #in~n; [L12-L18] ~b := #in~b; [L12-L18] ~size := #in~size; [L13] havoc ~a~0; [L13] havoc ~i~0; [L14] ~i~0 := 0; VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0, ~b!base=402, ~b!offset=0, ~i~0=0, ~n=0, ~size=0] [L14-L16] COND FALSE !(!(~i~0 < 1 + ~size)) VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0, ~b!base=402, ~b!offset=0, ~i~0=0, ~n=0, ~size=0] [L15] assert 0 <= ~i~0 && ~i~0 < ~n; VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0, ~b!base=402, ~b!offset=0, ~i~0=0, ~n=0, ~size=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=403, #NULL!offset=401, old(#NULL!base)=403, old(#NULL!offset)=401] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=403, old(#NULL!offset)=401] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L21] havoc ~i~1; [L21] FCALL call ~#b~0 := #Ultimate.alloc(400); [L22] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#b~0!base=402, ~#b~0!offset=0, ~i~1=0] [L22-L24] COND FALSE !(!(~i~1 < 100)) VAL [#NULL!base=0, #NULL!offset=0, ~#b~0!base=402, ~#b~0!offset=0, ~i~1=0] [L23] CALL call #t~ret3 := foo(~i~1, ~#b~0, ~i~1); VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0] [L12-L18] ~n := #in~n; [L12-L18] ~b := #in~b; [L12-L18] ~size := #in~size; [L13] havoc ~a~0; [L13] havoc ~i~0; [L14] ~i~0 := 0; VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0, ~b!base=402, ~b!offset=0, ~i~0=0, ~n=0, ~size=0] [L14-L16] COND FALSE !(!(~i~0 < 1 + ~size)) VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0, ~b!base=402, ~b!offset=0, ~i~0=0, ~n=0, ~size=0] [L15] assert 0 <= ~i~0 && ~i~0 < ~n; VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0, ~b!base=402, ~b!offset=0, ~i~0=0, ~n=0, ~size=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=403, #NULL!offset=401, old(#NULL!base)=403, old(#NULL!offset)=401] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=403, old(#NULL!offset)=401] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret5 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L21] havoc ~i~1; [L21] FCALL call ~#b~0 := #Ultimate.alloc(400); [L22] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#b~0!base=402, ~#b~0!offset=0, ~i~1=0] [L22-L24] COND FALSE !(!(~i~1 < 100)) VAL [#NULL!base=0, #NULL!offset=0, ~#b~0!base=402, ~#b~0!offset=0, ~i~1=0] [L23] CALL call #t~ret3 := foo(~i~1, ~#b~0, ~i~1); VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0] [L12-L18] ~n := #in~n; [L12-L18] ~b := #in~b; [L12-L18] ~size := #in~size; [L13] havoc ~a~0; [L13] havoc ~i~0; [L14] ~i~0 := 0; VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0, ~b!base=402, ~b!offset=0, ~i~0=0, ~n=0, ~size=0] [L14-L16] COND FALSE !(!(~i~0 < 1 + ~size)) VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0, ~b!base=402, ~b!offset=0, ~i~0=0, ~n=0, ~size=0] [L15] assert 0 <= ~i~0 && ~i~0 < ~n; VAL [#in~b!base=402, #in~b!offset=0, #in~n=0, #in~size=0, #NULL!base=0, #NULL!offset=0, ~b!base=402, ~b!offset=0, ~i~0=0, ~n=0, ~size=0] [L21] int i, b[100]; [L22] i = 0 VAL [b={402:0}, i=0] [L22] COND TRUE i < 100 VAL [b={402:0}, i=0] [L23] CALL foo(i, b, i) VAL [\old(n)=0, \old(size)=0, b={402:0}] [L13] int a[n], i; [L14] i = 0 VAL [\old(n)=0, \old(size)=0, b={402:0}, b={402:0}, i=0, n=0, size=0] [L14] COND TRUE i < size + 1 VAL [\old(n)=0, \old(size)=0, b={402:0}, b={402:0}, i=0, n=0, size=0] [L15] a[i] VAL [\old(n)=0, \old(size)=0, b={402:0}, b={402:0}, i=0, n=0, size=0] ----- [2018-11-23 06:40:58,065 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d98c4aa7-08cf-48be-aec3-45b550838a08/bin-2019/utaipan/witness.graphml [2018-11-23 06:40:58,065 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 06:40:58,066 INFO L168 Benchmark]: Toolchain (without parser) took 914.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 953.8 MB in the beginning and 1.1 GB in the end (delta: -119.7 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 06:40:58,067 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 06:40:58,067 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.20 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:40:58,068 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.60 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 06:40:58,068 INFO L168 Benchmark]: Boogie Preprocessor took 62.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -188.6 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-23 06:40:58,068 INFO L168 Benchmark]: RCFGBuilder took 241.67 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: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-11-23 06:40:58,069 INFO L168 Benchmark]: TraceAbstraction took 386.52 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: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. [2018-11-23 06:40:58,069 INFO L168 Benchmark]: Witness Printer took 37.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 06:40:58,071 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 161.20 ms. Allocated memory is still 1.0 GB. Free memory was 953.8 MB in the beginning and 943.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.60 ms. Allocated memory is still 1.0 GB. Free memory was 943.0 MB in the beginning and 940.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -188.6 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 241.67 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: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 386.52 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: 34.0 MB). Peak memory consumption was 34.0 MB. Max. memory is 11.5 GB. * Witness Printer took 37.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 15]: array index can be out of bounds array index can be out of bounds We found a FailurePath: [L21] int i, b[100]; [L22] i = 0 VAL [b={402:0}, i=0] [L22] COND TRUE i < 100 VAL [b={402:0}, i=0] [L23] CALL foo(i, b, i) VAL [\old(n)=0, \old(size)=0, b={402:0}] [L13] int a[n], i; [L14] i = 0 VAL [\old(n)=0, \old(size)=0, b={402:0}, b={402:0}, i=0, n=0, size=0] [L14] COND TRUE i < size + 1 VAL [\old(n)=0, \old(size)=0, b={402:0}, b={402:0}, i=0, n=0, size=0] [L15] a[i] VAL [\old(n)=0, \old(size)=0, b={402:0}, b={402:0}, i=0, n=0, size=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 39 locations, 8 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 32 SDtfs, 15 SDslu, 24 SDs, 0 SdLazy, 14 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred 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, 1 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 99 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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...