./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2_false-valid-deref-write.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_53c7250c-433c-444a-a0a3-259593487a2e/bin-2019/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_53c7250c-433c-444a-a0a3-259593487a2e/bin-2019/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_53c7250c-433c-444a-a0a3-259593487a2e/bin-2019/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_53c7250c-433c-444a-a0a3-259593487a2e/bin-2019/ukojak/config/KojakMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2_false-valid-deref-write.c -s /tmp/vcloud-vcloud-master/worker/working_dir_53c7250c-433c-444a-a0a3-259593487a2e/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_53c7250c-433c-444a-a0a3-259593487a2e/bin-2019/ukojak --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 Kojak --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a6853fb9e064ccfef5e54a8bac94eb86beeed80f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 05:20:56,928 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 05:20:56,929 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 05:20:56,939 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 05:20:56,940 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 05:20:56,941 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 05:20:56,942 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 05:20:56,943 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 05:20:56,944 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 05:20:56,945 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 05:20:56,946 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 05:20:56,946 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 05:20:56,947 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 05:20:56,948 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 05:20:56,950 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 05:20:56,950 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 05:20:56,951 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 05:20:56,952 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 05:20:56,955 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 05:20:56,956 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 05:20:56,957 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 05:20:56,958 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 05:20:56,960 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 05:20:56,960 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 05:20:56,960 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 05:20:56,961 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 05:20:56,963 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 05:20:56,963 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 05:20:56,964 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 05:20:56,965 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 05:20:56,965 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 05:20:56,966 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 05:20:56,966 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 05:20:56,966 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 05:20:56,967 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 05:20:56,968 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 05:20:56,968 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_53c7250c-433c-444a-a0a3-259593487a2e/bin-2019/ukojak/config/svcomp-DerefFreeMemtrack-32bit-Kojak_Default.epf [2018-11-23 05:20:56,980 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 05:20:56,980 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 05:20:56,982 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 05:20:56,982 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 05:20:56,982 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 05:20:56,982 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 05:20:56,982 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 05:20:56,983 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 05:20:56,983 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 05:20:56,983 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 05:20:56,983 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 05:20:56,983 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 05:20:56,983 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 05:20:56,983 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 05:20:56,984 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 05:20:56,984 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 05:20:56,984 INFO L131 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2018-11-23 05:20:56,984 INFO L133 SettingsManager]: * Timeout in seconds=1000000 [2018-11-23 05:20:56,984 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 05:20:56,984 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 05:20:56,985 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2018-11-23 05:20:56,985 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 05:20:56,985 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 05:20:56,985 INFO L133 SettingsManager]: * Trace refinement strategy=PENGUIN [2018-11-23 05:20:56,985 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 05:20:56,988 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_53c7250c-433c-444a-a0a3-259593487a2e/bin-2019/ukojak 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 -> Kojak 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 -> a6853fb9e064ccfef5e54a8bac94eb86beeed80f [2018-11-23 05:20:57,016 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 05:20:57,026 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 05:20:57,028 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 05:20:57,029 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 05:20:57,030 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 05:20:57,030 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_53c7250c-433c-444a-a0a3-259593487a2e/bin-2019/ukojak/../../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2_false-valid-deref-write.c [2018-11-23 05:20:57,076 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_53c7250c-433c-444a-a0a3-259593487a2e/bin-2019/ukojak/data/095c73d92/3eb2b7ee3cb84060b7cb5bde49a6bf1e/FLAG8ec5ebc46 [2018-11-23 05:20:57,424 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 05:20:57,425 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_53c7250c-433c-444a-a0a3-259593487a2e/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength2_false-valid-deref-write.c [2018-11-23 05:20:57,429 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_53c7250c-433c-444a-a0a3-259593487a2e/bin-2019/ukojak/data/095c73d92/3eb2b7ee3cb84060b7cb5bde49a6bf1e/FLAG8ec5ebc46 [2018-11-23 05:20:57,443 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_53c7250c-433c-444a-a0a3-259593487a2e/bin-2019/ukojak/data/095c73d92/3eb2b7ee3cb84060b7cb5bde49a6bf1e [2018-11-23 05:20:57,445 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 05:20:57,446 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 05:20:57,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 05:20:57,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 05:20:57,450 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 05:20:57,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:20:57" (1/1) ... [2018-11-23 05:20:57,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57fd911c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:20:57, skipping insertion in model container [2018-11-23 05:20:57,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 05:20:57" (1/1) ... [2018-11-23 05:20:57,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 05:20:57,474 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 05:20:57,604 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:20:57,611 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 05:20:57,625 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 05:20:57,636 INFO L195 MainTranslator]: Completed translation [2018-11-23 05:20:57,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:20:57 WrapperNode [2018-11-23 05:20:57,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 05:20:57,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 05:20:57,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 05:20:57,637 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 05:20:57,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:20:57" (1/1) ... [2018-11-23 05:20:57,652 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:20:57" (1/1) ... [2018-11-23 05:20:57,668 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 05:20:57,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 05:20:57,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 05:20:57,668 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 05:20:57,721 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:20:57" (1/1) ... [2018-11-23 05:20:57,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:20:57" (1/1) ... [2018-11-23 05:20:57,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:20:57" (1/1) ... [2018-11-23 05:20:57,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:20:57" (1/1) ... [2018-11-23 05:20:57,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:20:57" (1/1) ... [2018-11-23 05:20:57,731 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:20:57" (1/1) ... [2018-11-23 05:20:57,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:20:57" (1/1) ... [2018-11-23 05:20:57,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 05:20:57,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 05:20:57,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 05:20:57,734 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 05:20:57,735 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 05:20:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_53c7250c-433c-444a-a0a3-259593487a2e/bin-2019/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (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:10000 [2018-11-23 05:20:57,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 05:20:57,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 05:20:57,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 05:20:57,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 05:20:57,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 05:20:57,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 05:20:58,194 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 05:20:58,195 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-11-23 05:20:58,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:20:58 BoogieIcfgContainer [2018-11-23 05:20:58,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 05:20:58,196 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2018-11-23 05:20:58,196 INFO L271 PluginConnector]: Initializing CodeCheck... [2018-11-23 05:20:58,205 INFO L276 PluginConnector]: CodeCheck initialized [2018-11-23 05:20:58,205 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:20:58" (1/1) ... [2018-11-23 05:20:58,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 05:20:58,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:20:58,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 24 states and 28 transitions. [2018-11-23 05:20:58,243 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 05:20:58,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 05:20:58,245 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:20:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:20:58,352 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 05:20:58,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:20:58,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 25 states and 30 transitions. [2018-11-23 05:20:58,403 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2018-11-23 05:20:58,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 05:20:58,404 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:20:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:20:58,467 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 05:20:58,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:20:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 27 states and 35 transitions. [2018-11-23 05:20:58,569 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-11-23 05:20:58,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-11-23 05:20:58,572 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:20:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:20:58,670 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 05:20:58,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:20:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 30 states and 41 transitions. [2018-11-23 05:20:58,931 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2018-11-23 05:20:58,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 05:20:58,931 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:20:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 05:20:58,970 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 05:20:59,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2018-11-23 05:20:59,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 31 states and 43 transitions. [2018-11-23 05:20:59,102 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-11-23 05:20:59,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-11-23 05:20:59,102 INFO L427 CodeCheckObserver]: Error Path is FOUND. [2018-11-23 05:20:59,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:20:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:20:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:20:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 05:20:59,170 WARN L493 CodeCheckObserver]: This program is UNSAFE, Check terminated with 5 iterations. ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];main_old_#valid := #valid;havoc main_#res;havoc main_#t~ret6, main_#t~post5, main_#t~mem7, main_~i~2, main_~#b~0.base, main_~#b~0.offset;havoc main_~i~2;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.alloc(400);main_~i~2 := 0; VAL [ULTIMATE.start_main_~i~2=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#b~0.base|=5, |ULTIMATE.start_main_~#b~0.offset|=0] [?] assume !!(main_~i~2 < 100);foo_#in~n, foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~i~2, main_~#b~0.base, main_~#b~0.offset, 1 + main_~i~2;havoc foo_#res;havoc foo_#t~mem3, foo_#t~post2, foo_#t~ret4, foo_~n, foo_~b.base, foo_~b.offset, foo_~size, foo_~#a~0.base, foo_~#a~0.offset, foo_~i~1;foo_~n := foo_#in~n;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;call foo_~#a~0.base, foo_~#a~0.offset := #Ultimate.alloc(4 * foo_~n);havoc foo_~i~1;foo_~i~1 := 0; VAL [ULTIMATE.start_foo_~b.base=5, ULTIMATE.start_foo_~b.offset=0, ULTIMATE.start_foo_~i~1=0, ULTIMATE.start_foo_~n=0, ULTIMATE.start_foo_~size=1, ULTIMATE.start_main_~i~2=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_foo_#in~b.base|=5, |ULTIMATE.start_foo_#in~b.offset|=0, |ULTIMATE.start_foo_#in~n|=0, |ULTIMATE.start_foo_#in~size|=1, |ULTIMATE.start_foo_~#a~0.base|=2, |ULTIMATE.start_foo_~#a~0.offset|=0, |ULTIMATE.start_main_~#b~0.base|=5, |ULTIMATE.start_main_~#b~0.offset|=0] [?] assume !!(foo_~i~1 < foo_~size); VAL [ULTIMATE.start_foo_~b.base=5, ULTIMATE.start_foo_~b.offset=0, ULTIMATE.start_foo_~i~1=0, ULTIMATE.start_foo_~n=0, ULTIMATE.start_foo_~size=1, ULTIMATE.start_main_~i~2=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_foo_#in~b.base|=5, |ULTIMATE.start_foo_#in~b.offset|=0, |ULTIMATE.start_foo_#in~n|=0, |ULTIMATE.start_foo_#in~size|=1, |ULTIMATE.start_foo_~#a~0.base|=2, |ULTIMATE.start_foo_~#a~0.offset|=0, |ULTIMATE.start_main_~#b~0.base|=5, |ULTIMATE.start_main_~#b~0.offset|=0] [?] SUMMARY for call foo_#t~mem3 := read~int(foo_~b.base, foo_~b.offset + 4 * foo_~i~1, 4); srcloc: L23 VAL [ULTIMATE.start_foo_~b.base=5, ULTIMATE.start_foo_~b.offset=0, ULTIMATE.start_foo_~i~1=0, ULTIMATE.start_foo_~n=0, ULTIMATE.start_foo_~size=1, ULTIMATE.start_main_~i~2=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_foo_#in~b.base|=5, |ULTIMATE.start_foo_#in~b.offset|=0, |ULTIMATE.start_foo_#in~n|=0, |ULTIMATE.start_foo_#in~size|=1, |ULTIMATE.start_foo_#t~mem3|=9, |ULTIMATE.start_foo_~#a~0.base|=2, |ULTIMATE.start_foo_~#a~0.offset|=0, |ULTIMATE.start_main_~#b~0.base|=5, |ULTIMATE.start_main_~#b~0.offset|=0] [?] assume !(4 + (foo_~#a~0.offset + 4 * foo_~i~1) <= #length[foo_~#a~0.base] && 0 <= foo_~#a~0.offset + 4 * foo_~i~1); VAL [ULTIMATE.start_foo_~b.base=5, ULTIMATE.start_foo_~b.offset=0, ULTIMATE.start_foo_~i~1=0, ULTIMATE.start_foo_~n=0, ULTIMATE.start_foo_~size=1, ULTIMATE.start_main_~i~2=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_foo_#in~b.base|=5, |ULTIMATE.start_foo_#in~b.offset|=0, |ULTIMATE.start_foo_#in~n|=0, |ULTIMATE.start_foo_#in~size|=1, |ULTIMATE.start_foo_#t~mem3|=9, |ULTIMATE.start_foo_~#a~0.base|=2, |ULTIMATE.start_foo_~#a~0.offset|=0, |ULTIMATE.start_main_~#b~0.base|=5, |ULTIMATE.start_main_~#b~0.offset|=0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~post5, main_#t~mem7, main_~i~2, main_~#b~0.base, main_~#b~0.offset; [L32] havoc main_~i~2; [L32] call main_~#b~0.base, main_~#b~0.offset := #Ultimate.alloc(400); [L33] main_~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#b~0.base=5, main_~#b~0.offset=0, main_~i~2=0] [L33-L35] assume !!(main_~i~2 < 100); [L34] foo_#in~n, foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~i~2, main_~#b~0.base, main_~#b~0.offset, 1 + main_~i~2; [L34] havoc foo_#res; [L34] havoc foo_#t~mem3, foo_#t~post2, foo_#t~ret4, foo_~n, foo_~b.base, foo_~b.offset, foo_~size, foo_~#a~0.base, foo_~#a~0.offset, foo_~i~1; [L20-L29] foo_~n := foo_#in~n; [L20-L29] foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset; [L20-L29] foo_~size := foo_#in~size; [L21] call foo_~#a~0.base, foo_~#a~0.offset := #Ultimate.alloc(4 * foo_~n); [L21] havoc foo_~i~1; [L22] foo_~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, foo_#in~b.base=5, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=1, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=5, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0.base=5, main_~#b~0.offset=0, main_~i~2=0] [L22-L24] assume !!(foo_~i~1 < foo_~size); VAL [#NULL.base=0, #NULL.offset=0, foo_#in~b.base=5, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=1, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=5, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0.base=5, main_~#b~0.offset=0, main_~i~2=0] [L23] call foo_#t~mem3 := read~int(foo_~b.base, foo_~b.offset + 4 * foo_~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, foo_#in~b.base=5, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=1, foo_#t~mem3=9, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=5, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0.base=5, main_~#b~0.offset=0, main_~i~2=0] [L23] call write~int(foo_#t~mem3, foo_~#a~0.base, foo_~#a~0.offset + 4 * foo_~i~1, 4); [?] requires #sizeOfWrittenType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#NULL.base=0, #NULL.offset=0, foo_#in~b.base=5, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=1, foo_#t~mem3=9, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=5, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0.base=5, main_~#b~0.offset=0, main_~i~2=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~post5, main_#t~mem7, main_~i~2, main_~#b~0.base, main_~#b~0.offset; [L32] havoc main_~i~2; [L32] call main_~#b~0.base, main_~#b~0.offset := #Ultimate.alloc(400); [L33] main_~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#b~0.base=5, main_~#b~0.offset=0, main_~i~2=0] [L33-L35] assume !!(main_~i~2 < 100); [L34] foo_#in~n, foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~i~2, main_~#b~0.base, main_~#b~0.offset, 1 + main_~i~2; [L34] havoc foo_#res; [L34] havoc foo_#t~mem3, foo_#t~post2, foo_#t~ret4, foo_~n, foo_~b.base, foo_~b.offset, foo_~size, foo_~#a~0.base, foo_~#a~0.offset, foo_~i~1; [L20-L29] foo_~n := foo_#in~n; [L20-L29] foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset; [L20-L29] foo_~size := foo_#in~size; [L21] call foo_~#a~0.base, foo_~#a~0.offset := #Ultimate.alloc(4 * foo_~n); [L21] havoc foo_~i~1; [L22] foo_~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, foo_#in~b.base=5, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=1, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=5, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0.base=5, main_~#b~0.offset=0, main_~i~2=0] [L22-L24] assume !!(foo_~i~1 < foo_~size); VAL [#NULL.base=0, #NULL.offset=0, foo_#in~b.base=5, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=1, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=5, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0.base=5, main_~#b~0.offset=0, main_~i~2=0] [L23] call foo_#t~mem3 := read~int(foo_~b.base, foo_~b.offset + 4 * foo_~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, foo_#in~b.base=5, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=1, foo_#t~mem3=9, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=5, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0.base=5, main_~#b~0.offset=0, main_~i~2=0] [L23] call write~int(foo_#t~mem3, foo_~#a~0.base, foo_~#a~0.offset + 4 * foo_~i~1, 4); [?] requires #sizeOfWrittenType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#NULL.base=0, #NULL.offset=0, foo_#in~b.base=5, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=1, foo_#t~mem3=9, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=5, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0.base=5, main_~#b~0.offset=0, main_~i~2=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~post5, main_#t~mem7, main_~i~2, main_~#b~0; [L32] havoc main_~i~2; [L32] FCALL call main_~#b~0 := #Ultimate.alloc(400); [L33] main_~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#b~0!base=5, main_~#b~0!offset=0, main_~i~2=0] [L33-L35] COND FALSE !(!(main_~i~2 < 100)) [L34] foo_#in~n, foo_#in~b, foo_#in~size := main_~i~2, main_~#b~0, 1 + main_~i~2; [L34] havoc foo_#res; [L34] havoc foo_#t~mem3, foo_#t~post2, foo_#t~ret4, foo_~n, foo_~b, foo_~size, foo_~#a~0, foo_~i~1; [L20-L29] foo_~n := foo_#in~n; [L20-L29] foo_~b := foo_#in~b; [L20-L29] foo_~size := foo_#in~size; [L21] FCALL call foo_~#a~0 := #Ultimate.alloc(4 * foo_~n); [L21] havoc foo_~i~1; [L22] foo_~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, foo_#in~b!base=5, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=1, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=5, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0!base=5, main_~#b~0!offset=0, main_~i~2=0] [L22-L24] COND FALSE !(!(foo_~i~1 < foo_~size)) VAL [#NULL!base=0, #NULL!offset=0, foo_#in~b!base=5, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=1, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=5, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0!base=5, main_~#b~0!offset=0, main_~i~2=0] [L23] FCALL call foo_#t~mem3 := read~int({ base: foo_~b!base, offset: foo_~b!offset + 4 * foo_~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, foo_#in~b!base=5, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=1, foo_#t~mem3=9, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=5, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0!base=5, main_~#b~0!offset=0, main_~i~2=0] [L23] FCALL call write~int(foo_#t~mem3, { base: foo_~#a~0!base, offset: foo_~#a~0!offset + 4 * foo_~i~1 }, 4); [?] requires #sizeOfWrittenType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#NULL!base=0, #NULL!offset=0, foo_#in~b!base=5, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=1, foo_#t~mem3=9, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=5, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0!base=5, main_~#b~0!offset=0, main_~i~2=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~post5, main_#t~mem7, main_~i~2, main_~#b~0; [L32] havoc main_~i~2; [L32] FCALL call main_~#b~0 := #Ultimate.alloc(400); [L33] main_~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#b~0!base=5, main_~#b~0!offset=0, main_~i~2=0] [L33-L35] COND FALSE !(!(main_~i~2 < 100)) [L34] foo_#in~n, foo_#in~b, foo_#in~size := main_~i~2, main_~#b~0, 1 + main_~i~2; [L34] havoc foo_#res; [L34] havoc foo_#t~mem3, foo_#t~post2, foo_#t~ret4, foo_~n, foo_~b, foo_~size, foo_~#a~0, foo_~i~1; [L20-L29] foo_~n := foo_#in~n; [L20-L29] foo_~b := foo_#in~b; [L20-L29] foo_~size := foo_#in~size; [L21] FCALL call foo_~#a~0 := #Ultimate.alloc(4 * foo_~n); [L21] havoc foo_~i~1; [L22] foo_~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, foo_#in~b!base=5, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=1, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=5, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0!base=5, main_~#b~0!offset=0, main_~i~2=0] [L22-L24] COND FALSE !(!(foo_~i~1 < foo_~size)) VAL [#NULL!base=0, #NULL!offset=0, foo_#in~b!base=5, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=1, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=5, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0!base=5, main_~#b~0!offset=0, main_~i~2=0] [L23] FCALL call foo_#t~mem3 := read~int({ base: foo_~b!base, offset: foo_~b!offset + 4 * foo_~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, foo_#in~b!base=5, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=1, foo_#t~mem3=9, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=5, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0!base=5, main_~#b~0!offset=0, main_~i~2=0] [L23] FCALL call write~int(foo_#t~mem3, { base: foo_~#a~0!base, offset: foo_~#a~0!offset + 4 * foo_~i~1 }, 4); [?] requires #sizeOfWrittenType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#NULL!base=0, #NULL!offset=0, foo_#in~b!base=5, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=1, foo_#t~mem3=9, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=5, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0!base=5, main_~#b~0!offset=0, main_~i~2=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L32] havoc ~i~2; [L32] FCALL call ~#b~0 := #Ultimate.alloc(400); [L33] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L33-L35] COND FALSE !(!(~i~2 < 100)) [L20-L29] ~n := #in~n; [L20-L29] ~b := #in~b; [L20-L29] ~size := #in~size; [L21] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~n); [L21] havoc ~i~1; [L22] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L22-L24] COND FALSE !(!(~i~1 < ~size)) VAL [#NULL!base=0, #NULL!offset=0] [L23] FCALL call #t~mem3 := read~int({ base: ~b!base, offset: ~b!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L23] FCALL call write~int(#t~mem3, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~1 }, 4); [?] requires #sizeOfWrittenType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L32] havoc ~i~2; [L32] FCALL call ~#b~0 := #Ultimate.alloc(400); [L33] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L33-L35] COND FALSE !(!(~i~2 < 100)) [L20-L29] ~n := #in~n; [L20-L29] ~b := #in~b; [L20-L29] ~size := #in~size; [L21] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~n); [L21] havoc ~i~1; [L22] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L22-L24] COND FALSE !(!(~i~1 < ~size)) VAL [#NULL!base=0, #NULL!offset=0] [L23] FCALL call #t~mem3 := read~int({ base: ~b!base, offset: ~b!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L23] FCALL call write~int(#t~mem3, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~1 }, 4); [?] requires #sizeOfWrittenType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#NULL!base=0, #NULL!offset=0] [L32] int i, b[100]; [L33] i = 0 [L33] COND TRUE i < 100 [L21] int a[n], i; [L22] i = 0 [L22] COND TRUE i < size [L23] EXPR b[i] [L23] a[i] = b[i] ----- [2018-11-23 05:20:59,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 23.11 05:20:59 ImpRootNode [2018-11-23 05:20:59,213 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2018-11-23 05:20:59,213 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 05:20:59,213 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 05:20:59,214 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 05:20:59,214 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 05:20:58" (3/4) ... [2018-11-23 05:20:59,217 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];main_old_#valid := #valid;havoc main_#res;havoc main_#t~ret6, main_#t~post5, main_#t~mem7, main_~i~2, main_~#b~0.base, main_~#b~0.offset;havoc main_~i~2;call main_~#b~0.base, main_~#b~0.offset := #Ultimate.alloc(400);main_~i~2 := 0; VAL [ULTIMATE.start_main_~i~2=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_main_~#b~0.base|=5, |ULTIMATE.start_main_~#b~0.offset|=0] [?] assume !!(main_~i~2 < 100);foo_#in~n, foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~i~2, main_~#b~0.base, main_~#b~0.offset, 1 + main_~i~2;havoc foo_#res;havoc foo_#t~mem3, foo_#t~post2, foo_#t~ret4, foo_~n, foo_~b.base, foo_~b.offset, foo_~size, foo_~#a~0.base, foo_~#a~0.offset, foo_~i~1;foo_~n := foo_#in~n;foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset;foo_~size := foo_#in~size;call foo_~#a~0.base, foo_~#a~0.offset := #Ultimate.alloc(4 * foo_~n);havoc foo_~i~1;foo_~i~1 := 0; VAL [ULTIMATE.start_foo_~b.base=5, ULTIMATE.start_foo_~b.offset=0, ULTIMATE.start_foo_~i~1=0, ULTIMATE.start_foo_~n=0, ULTIMATE.start_foo_~size=1, ULTIMATE.start_main_~i~2=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_foo_#in~b.base|=5, |ULTIMATE.start_foo_#in~b.offset|=0, |ULTIMATE.start_foo_#in~n|=0, |ULTIMATE.start_foo_#in~size|=1, |ULTIMATE.start_foo_~#a~0.base|=2, |ULTIMATE.start_foo_~#a~0.offset|=0, |ULTIMATE.start_main_~#b~0.base|=5, |ULTIMATE.start_main_~#b~0.offset|=0] [?] assume !!(foo_~i~1 < foo_~size); VAL [ULTIMATE.start_foo_~b.base=5, ULTIMATE.start_foo_~b.offset=0, ULTIMATE.start_foo_~i~1=0, ULTIMATE.start_foo_~n=0, ULTIMATE.start_foo_~size=1, ULTIMATE.start_main_~i~2=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_foo_#in~b.base|=5, |ULTIMATE.start_foo_#in~b.offset|=0, |ULTIMATE.start_foo_#in~n|=0, |ULTIMATE.start_foo_#in~size|=1, |ULTIMATE.start_foo_~#a~0.base|=2, |ULTIMATE.start_foo_~#a~0.offset|=0, |ULTIMATE.start_main_~#b~0.base|=5, |ULTIMATE.start_main_~#b~0.offset|=0] [?] SUMMARY for call foo_#t~mem3 := read~int(foo_~b.base, foo_~b.offset + 4 * foo_~i~1, 4); srcloc: L23 VAL [ULTIMATE.start_foo_~b.base=5, ULTIMATE.start_foo_~b.offset=0, ULTIMATE.start_foo_~i~1=0, ULTIMATE.start_foo_~n=0, ULTIMATE.start_foo_~size=1, ULTIMATE.start_main_~i~2=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_foo_#in~b.base|=5, |ULTIMATE.start_foo_#in~b.offset|=0, |ULTIMATE.start_foo_#in~n|=0, |ULTIMATE.start_foo_#in~size|=1, |ULTIMATE.start_foo_#t~mem3|=9, |ULTIMATE.start_foo_~#a~0.base|=2, |ULTIMATE.start_foo_~#a~0.offset|=0, |ULTIMATE.start_main_~#b~0.base|=5, |ULTIMATE.start_main_~#b~0.offset|=0] [?] assume !(4 + (foo_~#a~0.offset + 4 * foo_~i~1) <= #length[foo_~#a~0.base] && 0 <= foo_~#a~0.offset + 4 * foo_~i~1); VAL [ULTIMATE.start_foo_~b.base=5, ULTIMATE.start_foo_~b.offset=0, ULTIMATE.start_foo_~i~1=0, ULTIMATE.start_foo_~n=0, ULTIMATE.start_foo_~size=1, ULTIMATE.start_main_~i~2=0, |#NULL.base|=0, |#NULL.offset|=0, |ULTIMATE.start_foo_#in~b.base|=5, |ULTIMATE.start_foo_#in~b.offset|=0, |ULTIMATE.start_foo_#in~n|=0, |ULTIMATE.start_foo_#in~size|=1, |ULTIMATE.start_foo_#t~mem3|=9, |ULTIMATE.start_foo_~#a~0.base|=2, |ULTIMATE.start_foo_~#a~0.offset|=0, |ULTIMATE.start_main_~#b~0.base|=5, |ULTIMATE.start_main_~#b~0.offset|=0] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~post5, main_#t~mem7, main_~i~2, main_~#b~0.base, main_~#b~0.offset; [L32] havoc main_~i~2; [L32] call main_~#b~0.base, main_~#b~0.offset := #Ultimate.alloc(400); [L33] main_~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#b~0.base=5, main_~#b~0.offset=0, main_~i~2=0] [L33-L35] assume !!(main_~i~2 < 100); [L34] foo_#in~n, foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~i~2, main_~#b~0.base, main_~#b~0.offset, 1 + main_~i~2; [L34] havoc foo_#res; [L34] havoc foo_#t~mem3, foo_#t~post2, foo_#t~ret4, foo_~n, foo_~b.base, foo_~b.offset, foo_~size, foo_~#a~0.base, foo_~#a~0.offset, foo_~i~1; [L20-L29] foo_~n := foo_#in~n; [L20-L29] foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset; [L20-L29] foo_~size := foo_#in~size; [L21] call foo_~#a~0.base, foo_~#a~0.offset := #Ultimate.alloc(4 * foo_~n); [L21] havoc foo_~i~1; [L22] foo_~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, foo_#in~b.base=5, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=1, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=5, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0.base=5, main_~#b~0.offset=0, main_~i~2=0] [L22-L24] assume !!(foo_~i~1 < foo_~size); VAL [#NULL.base=0, #NULL.offset=0, foo_#in~b.base=5, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=1, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=5, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0.base=5, main_~#b~0.offset=0, main_~i~2=0] [L23] call foo_#t~mem3 := read~int(foo_~b.base, foo_~b.offset + 4 * foo_~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, foo_#in~b.base=5, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=1, foo_#t~mem3=9, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=5, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0.base=5, main_~#b~0.offset=0, main_~i~2=0] [L23] call write~int(foo_#t~mem3, foo_~#a~0.base, foo_~#a~0.offset + 4 * foo_~i~1, 4); [?] requires #sizeOfWrittenType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#NULL.base=0, #NULL.offset=0, foo_#in~b.base=5, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=1, foo_#t~mem3=9, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=5, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0.base=5, main_~#b~0.offset=0, main_~i~2=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~post5, main_#t~mem7, main_~i~2, main_~#b~0.base, main_~#b~0.offset; [L32] havoc main_~i~2; [L32] call main_~#b~0.base, main_~#b~0.offset := #Ultimate.alloc(400); [L33] main_~i~2 := 0; VAL [#NULL.base=0, #NULL.offset=0, main_~#b~0.base=5, main_~#b~0.offset=0, main_~i~2=0] [L33-L35] assume !!(main_~i~2 < 100); [L34] foo_#in~n, foo_#in~b.base, foo_#in~b.offset, foo_#in~size := main_~i~2, main_~#b~0.base, main_~#b~0.offset, 1 + main_~i~2; [L34] havoc foo_#res; [L34] havoc foo_#t~mem3, foo_#t~post2, foo_#t~ret4, foo_~n, foo_~b.base, foo_~b.offset, foo_~size, foo_~#a~0.base, foo_~#a~0.offset, foo_~i~1; [L20-L29] foo_~n := foo_#in~n; [L20-L29] foo_~b.base, foo_~b.offset := foo_#in~b.base, foo_#in~b.offset; [L20-L29] foo_~size := foo_#in~size; [L21] call foo_~#a~0.base, foo_~#a~0.offset := #Ultimate.alloc(4 * foo_~n); [L21] havoc foo_~i~1; [L22] foo_~i~1 := 0; VAL [#NULL.base=0, #NULL.offset=0, foo_#in~b.base=5, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=1, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=5, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0.base=5, main_~#b~0.offset=0, main_~i~2=0] [L22-L24] assume !!(foo_~i~1 < foo_~size); VAL [#NULL.base=0, #NULL.offset=0, foo_#in~b.base=5, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=1, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=5, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0.base=5, main_~#b~0.offset=0, main_~i~2=0] [L23] call foo_#t~mem3 := read~int(foo_~b.base, foo_~b.offset + 4 * foo_~i~1, 4); VAL [#NULL.base=0, #NULL.offset=0, foo_#in~b.base=5, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=1, foo_#t~mem3=9, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=5, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0.base=5, main_~#b~0.offset=0, main_~i~2=0] [L23] call write~int(foo_#t~mem3, foo_~#a~0.base, foo_~#a~0.offset + 4 * foo_~i~1, 4); [?] requires #sizeOfWrittenType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#NULL.base=0, #NULL.offset=0, foo_#in~b.base=5, foo_#in~b.offset=0, foo_#in~n=0, foo_#in~size=1, foo_#t~mem3=9, foo_~#a~0.base=2, foo_~#a~0.offset=0, foo_~b.base=5, foo_~b.offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0.base=5, main_~#b~0.offset=0, main_~i~2=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~post5, main_#t~mem7, main_~i~2, main_~#b~0; [L32] havoc main_~i~2; [L32] FCALL call main_~#b~0 := #Ultimate.alloc(400); [L33] main_~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#b~0!base=5, main_~#b~0!offset=0, main_~i~2=0] [L33-L35] COND FALSE !(!(main_~i~2 < 100)) [L34] foo_#in~n, foo_#in~b, foo_#in~size := main_~i~2, main_~#b~0, 1 + main_~i~2; [L34] havoc foo_#res; [L34] havoc foo_#t~mem3, foo_#t~post2, foo_#t~ret4, foo_~n, foo_~b, foo_~size, foo_~#a~0, foo_~i~1; [L20-L29] foo_~n := foo_#in~n; [L20-L29] foo_~b := foo_#in~b; [L20-L29] foo_~size := foo_#in~size; [L21] FCALL call foo_~#a~0 := #Ultimate.alloc(4 * foo_~n); [L21] havoc foo_~i~1; [L22] foo_~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, foo_#in~b!base=5, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=1, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=5, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0!base=5, main_~#b~0!offset=0, main_~i~2=0] [L22-L24] COND FALSE !(!(foo_~i~1 < foo_~size)) VAL [#NULL!base=0, #NULL!offset=0, foo_#in~b!base=5, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=1, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=5, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0!base=5, main_~#b~0!offset=0, main_~i~2=0] [L23] FCALL call foo_#t~mem3 := read~int({ base: foo_~b!base, offset: foo_~b!offset + 4 * foo_~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, foo_#in~b!base=5, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=1, foo_#t~mem3=9, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=5, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0!base=5, main_~#b~0!offset=0, main_~i~2=0] [L23] FCALL call write~int(foo_#t~mem3, { base: foo_~#a~0!base, offset: foo_~#a~0!offset + 4 * foo_~i~1 }, 4); [?] requires #sizeOfWrittenType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#NULL!base=0, #NULL!offset=0, foo_#in~b!base=5, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=1, foo_#t~mem3=9, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=5, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0!base=5, main_~#b~0!offset=0, main_~i~2=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] main_old_#valid := #valid; [?] havoc main_#res; [?] havoc main_#t~ret6, main_#t~post5, main_#t~mem7, main_~i~2, main_~#b~0; [L32] havoc main_~i~2; [L32] FCALL call main_~#b~0 := #Ultimate.alloc(400); [L33] main_~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0, main_~#b~0!base=5, main_~#b~0!offset=0, main_~i~2=0] [L33-L35] COND FALSE !(!(main_~i~2 < 100)) [L34] foo_#in~n, foo_#in~b, foo_#in~size := main_~i~2, main_~#b~0, 1 + main_~i~2; [L34] havoc foo_#res; [L34] havoc foo_#t~mem3, foo_#t~post2, foo_#t~ret4, foo_~n, foo_~b, foo_~size, foo_~#a~0, foo_~i~1; [L20-L29] foo_~n := foo_#in~n; [L20-L29] foo_~b := foo_#in~b; [L20-L29] foo_~size := foo_#in~size; [L21] FCALL call foo_~#a~0 := #Ultimate.alloc(4 * foo_~n); [L21] havoc foo_~i~1; [L22] foo_~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0, foo_#in~b!base=5, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=1, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=5, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0!base=5, main_~#b~0!offset=0, main_~i~2=0] [L22-L24] COND FALSE !(!(foo_~i~1 < foo_~size)) VAL [#NULL!base=0, #NULL!offset=0, foo_#in~b!base=5, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=1, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=5, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0!base=5, main_~#b~0!offset=0, main_~i~2=0] [L23] FCALL call foo_#t~mem3 := read~int({ base: foo_~b!base, offset: foo_~b!offset + 4 * foo_~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0, foo_#in~b!base=5, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=1, foo_#t~mem3=9, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=5, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0!base=5, main_~#b~0!offset=0, main_~i~2=0] [L23] FCALL call write~int(foo_#t~mem3, { base: foo_~#a~0!base, offset: foo_~#a~0!offset + 4 * foo_~i~1 }, 4); [?] requires #sizeOfWrittenType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#NULL!base=0, #NULL!offset=0, foo_#in~b!base=5, foo_#in~b!offset=0, foo_#in~n=0, foo_#in~size=1, foo_#t~mem3=9, foo_~#a~0!base=2, foo_~#a~0!offset=0, foo_~b!base=5, foo_~b!offset=0, foo_~i~1=0, foo_~n=0, foo_~size=1, main_~#b~0!base=5, main_~#b~0!offset=0, main_~i~2=0] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L32] havoc ~i~2; [L32] FCALL call ~#b~0 := #Ultimate.alloc(400); [L33] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L33-L35] COND FALSE !(!(~i~2 < 100)) [L20-L29] ~n := #in~n; [L20-L29] ~b := #in~b; [L20-L29] ~size := #in~size; [L21] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~n); [L21] havoc ~i~1; [L22] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L22-L24] COND FALSE !(!(~i~1 < ~size)) VAL [#NULL!base=0, #NULL!offset=0] [L23] FCALL call #t~mem3 := read~int({ base: ~b!base, offset: ~b!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L23] FCALL call write~int(#t~mem3, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~1 }, 4); [?] requires #sizeOfWrittenType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#NULL!base=0, #NULL!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L32] havoc ~i~2; [L32] FCALL call ~#b~0 := #Ultimate.alloc(400); [L33] ~i~2 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L33-L35] COND FALSE !(!(~i~2 < 100)) [L20-L29] ~n := #in~n; [L20-L29] ~b := #in~b; [L20-L29] ~size := #in~size; [L21] FCALL call ~#a~0 := #Ultimate.alloc(4 * ~n); [L21] havoc ~i~1; [L22] ~i~1 := 0; VAL [#NULL!base=0, #NULL!offset=0] [L22-L24] COND FALSE !(!(~i~1 < ~size)) VAL [#NULL!base=0, #NULL!offset=0] [L23] FCALL call #t~mem3 := read~int({ base: ~b!base, offset: ~b!offset + 4 * ~i~1 }, 4); VAL [#NULL!base=0, #NULL!offset=0] [L23] FCALL call write~int(#t~mem3, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~1 }, 4); [?] requires #sizeOfWrittenType + #ptr.offset <= #length[#ptr.base] && 0 <= #ptr.offset; VAL [#NULL!base=0, #NULL!offset=0] [L32] int i, b[100]; [L33] i = 0 [L33] COND TRUE i < 100 [L21] int a[n], i; [L22] i = 0 [L22] COND TRUE i < size [L23] EXPR b[i] [L23] a[i] = b[i] ----- [2018-11-23 05:20:59,275 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_53c7250c-433c-444a-a0a3-259593487a2e/bin-2019/ukojak/witness.graphml [2018-11-23 05:20:59,275 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 05:20:59,276 INFO L168 Benchmark]: Toolchain (without parser) took 1829.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 953.8 MB in the beginning and 988.3 MB in the end (delta: -34.5 MB). Peak memory consumption was 119.1 MB. Max. memory is 11.5 GB. [2018-11-23 05:20:59,278 INFO L168 Benchmark]: CDTParser took 0.13 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 05:20:59,278 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.34 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 05:20:59,279 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.96 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 05:20:59,280 INFO L168 Benchmark]: Boogie Preprocessor took 65.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -207.4 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 05:20:59,281 INFO L168 Benchmark]: RCFGBuilder took 461.25 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: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. [2018-11-23 05:20:59,282 INFO L168 Benchmark]: CodeCheck took 1017.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 991.8 MB in the end (delta: 116.4 MB). Peak memory consumption was 116.4 MB. Max. memory is 11.5 GB. [2018-11-23 05:20:59,283 INFO L168 Benchmark]: Witness Printer took 61.69 ms. Allocated memory is still 1.2 GB. Free memory was 991.8 MB in the beginning and 988.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-23 05:20:59,289 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 1 procedures, 40 locations, 11 error locations. UNSAFE Result, 0.9s OverallTime, 5 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 80 SDtfs, 34 SDslu, 16 SDs, 0 SdLazy, 290 SolverSat, 92 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 238 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - CounterExampleResult [Line: 23]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L32] int i, b[100]; [L33] i = 0 [L33] COND TRUE i < 100 [L21] int a[n], i; [L22] i = 0 [L22] COND TRUE i < size [L23] EXPR b[i] [L23] a[i] = b[i] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 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 189.34 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 30.96 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 65.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -207.4 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 461.25 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: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. * CodeCheck took 1017.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 991.8 MB in the end (delta: 116.4 MB). Peak memory consumption was 116.4 MB. Max. memory is 11.5 GB. * Witness Printer took 61.69 ms. Allocated memory is still 1.2 GB. Free memory was 991.8 MB in the beginning and 988.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...