./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/array-memsafety/diff_usafe_false-valid-deref.i --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_900b3a26-91bf-480a-8631-8757ec3ca5ba/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_900b3a26-91bf-480a-8631-8757ec3ca5ba/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_900b3a26-91bf-480a-8631-8757ec3ca5ba/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_900b3a26-91bf-480a-8631-8757ec3ca5ba/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/array-memsafety/diff_usafe_false-valid-deref.i -s /tmp/vcloud-vcloud-master/worker/working_dir_900b3a26-91bf-480a-8631-8757ec3ca5ba/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_900b3a26-91bf-480a-8631-8757ec3ca5ba/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c4e0be718883e167d4be051b03c3a4364271b932 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 15:08:46,935 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:08:46,937 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:08:46,944 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:08:46,944 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:08:46,945 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:08:46,946 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:08:46,947 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:08:46,948 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:08:46,949 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:08:46,950 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:08:46,950 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:08:46,950 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:08:46,951 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:08:46,952 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:08:46,952 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:08:46,953 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:08:46,955 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:08:46,956 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:08:46,957 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:08:46,958 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:08:46,959 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:08:46,960 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:08:46,961 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:08:46,961 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:08:46,961 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:08:46,962 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:08:46,963 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:08:46,963 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:08:46,964 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:08:46,964 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:08:46,965 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:08:46,965 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:08:46,965 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:08:46,966 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:08:46,966 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:08:46,966 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_900b3a26-91bf-480a-8631-8757ec3ca5ba/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-11-23 15:08:46,976 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:08:46,976 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:08:46,977 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:08:46,977 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 15:08:46,978 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:08:46,978 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:08:46,978 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:08:46,978 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:08:46,978 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:08:46,978 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 15:08:46,979 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:08:46,979 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:08:46,979 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:08:46,979 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-11-23 15:08:46,979 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-11-23 15:08:46,979 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-11-23 15:08:46,979 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:08:46,979 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:08:46,980 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:08:46,980 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:08:46,980 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:08:46,980 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:08:46,980 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 15:08:46,980 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:08:46,980 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:08:46,981 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:08:46,981 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:08:46,981 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:08:46,981 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_900b3a26-91bf-480a-8631-8757ec3ca5ba/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c4e0be718883e167d4be051b03c3a4364271b932 [2018-11-23 15:08:47,003 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:08:47,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:08:47,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:08:47,015 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:08:47,015 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:08:47,016 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_900b3a26-91bf-480a-8631-8757ec3ca5ba/bin-2019/uautomizer/../../sv-benchmarks/c/array-memsafety/diff_usafe_false-valid-deref.i [2018-11-23 15:08:47,051 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_900b3a26-91bf-480a-8631-8757ec3ca5ba/bin-2019/uautomizer/data/a5ce99bc1/7f67554ce6534987bc0f4d4bfd0ef737/FLAG22c83148e [2018-11-23 15:08:47,351 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:08:47,352 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_900b3a26-91bf-480a-8631-8757ec3ca5ba/sv-benchmarks/c/array-memsafety/diff_usafe_false-valid-deref.i [2018-11-23 15:08:47,357 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_900b3a26-91bf-480a-8631-8757ec3ca5ba/bin-2019/uautomizer/data/a5ce99bc1/7f67554ce6534987bc0f4d4bfd0ef737/FLAG22c83148e [2018-11-23 15:08:47,367 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_900b3a26-91bf-480a-8631-8757ec3ca5ba/bin-2019/uautomizer/data/a5ce99bc1/7f67554ce6534987bc0f4d4bfd0ef737 [2018-11-23 15:08:47,369 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:08:47,371 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-23 15:08:47,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:08:47,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:08:47,374 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:08:47,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:08:47" (1/1) ... [2018-11-23 15:08:47,376 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49ef1641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:08:47, skipping insertion in model container [2018-11-23 15:08:47,376 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:08:47" (1/1) ... [2018-11-23 15:08:47,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:08:47,394 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:08:47,499 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:08:47,505 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:08:47,515 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:08:47,524 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:08:47,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:08:47 WrapperNode [2018-11-23 15:08:47,525 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:08:47,525 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:08:47,525 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:08:47,525 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:08:47,536 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:08:47" (1/1) ... [2018-11-23 15:08:47,537 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:08:47" (1/1) ... [2018-11-23 15:08:47,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:08:47" (1/1) ... [2018-11-23 15:08:47,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:08:47" (1/1) ... [2018-11-23 15:08:47,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:08:47" (1/1) ... [2018-11-23 15:08:47,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:08:47" (1/1) ... [2018-11-23 15:08:47,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:08:47" (1/1) ... [2018-11-23 15:08:47,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:08:47,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:08:47,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:08:47,593 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:08:47,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:08:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_900b3a26-91bf-480a-8631-8757ec3ca5ba/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:08:47,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 15:08:47,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:08:47,643 INFO L138 BoogieDeclarations]: Found implementation of procedure diff [2018-11-23 15:08:47,644 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 15:08:47,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-23 15:08:47,644 INFO L130 BoogieDeclarations]: Found specification of procedure diff [2018-11-23 15:08:47,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 15:08:47,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:08:47,644 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 15:08:47,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 15:08:47,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:08:47,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:08:47,803 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:08:47,803 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 15:08:47,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:08:47 BoogieIcfgContainer [2018-11-23 15:08:47,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:08:47,804 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 15:08:47,805 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 15:08:47,808 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 15:08:47,808 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:08:47" (1/3) ... [2018-11-23 15:08:47,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39df6b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:08:47, skipping insertion in model container [2018-11-23 15:08:47,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:08:47" (2/3) ... [2018-11-23 15:08:47,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39df6b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:08:47, skipping insertion in model container [2018-11-23 15:08:47,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:08:47" (3/3) ... [2018-11-23 15:08:47,811 INFO L112 eAbstractionObserver]: Analyzing ICFG diff_usafe_false-valid-deref.i [2018-11-23 15:08:47,820 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 15:08:47,826 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-11-23 15:08:47,841 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-11-23 15:08:47,863 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:08:47,864 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 15:08:47,864 INFO L383 AbstractCegarLoop]: Hoare is false [2018-11-23 15:08:47,864 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 15:08:47,864 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:08:47,864 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:08:47,864 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 15:08:47,865 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:08:47,865 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 15:08:47,880 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-23 15:08:47,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 15:08:47,888 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:08:47,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:08:47,891 INFO L423 AbstractCegarLoop]: === Iteration 1 === [diffErr4REQUIRES_VIOLATION, diffErr0REQUIRES_VIOLATION, diffErr5REQUIRES_VIOLATION, diffErr6REQUIRES_VIOLATION, diffErr1REQUIRES_VIOLATION, diffErr2REQUIRES_VIOLATION, diffErr7REQUIRES_VIOLATION, diffErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK]=== [2018-11-23 15:08:47,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:08:47,896 INFO L82 PathProgramCache]: Analyzing trace with hash -633667021, now seen corresponding path program 1 times [2018-11-23 15:08:47,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:08:47,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:08:47,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:08:47,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:08:47,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:08:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:08:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:08:48,006 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=12, |#NULL.offset|=4, |old(#NULL.base)|=12, |old(#NULL.offset)|=4] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=4] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=4] [?] RET #63#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret8 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] havoc ~A~0.base, ~A~0.offset;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~Alen~0 := #t~nondet6;havoc #t~nondet6;havoc ~B~0.base, ~B~0.offset;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~Blen~0 := #t~nondet7;havoc #t~nondet7;havoc ~D~0.base, ~D~0.offset; VAL [main_~Alen~0=2, main_~Blen~0=3, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call diff(~A~0.base, ~A~0.offset, ~Alen~0, ~B~0.base, ~B~0.offset, ~Blen~0, ~D~0.base, ~D~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |diff_#in~A.base|=11, |diff_#in~A.offset|=7, |diff_#in~Alen|=2, |diff_#in~B.base|=8, |diff_#in~B.offset|=10, |diff_#in~Blen|=3, |diff_#in~D.base|=5, |diff_#in~D.offset|=9] [?] ~A.base, ~A.offset := #in~A.base, #in~A.offset;~Alen := #in~Alen;~B.base, ~B.offset := #in~B.base, #in~B.offset;~Blen := #in~Blen;~D.base, ~D.offset := #in~D.base, #in~D.offset;~k~0 := 0;~i~0 := 0;~l1~0 := ~Alen;~l2~0 := ~Blen;havoc ~found~0; VAL [diff_~A.base=11, diff_~A.offset=7, diff_~Alen=2, diff_~B.base=8, diff_~B.offset=10, diff_~Blen=3, diff_~D.base=5, diff_~D.offset=9, diff_~i~0=0, diff_~k~0=0, diff_~l1~0=2, diff_~l2~0=3, |#NULL.base|=0, |#NULL.offset|=0, |diff_#in~A.base|=11, |diff_#in~A.offset|=7, |diff_#in~Alen|=2, |diff_#in~B.base|=8, |diff_#in~B.offset|=10, |diff_#in~Blen|=3, |diff_#in~D.base|=5, |diff_#in~D.offset|=9] [?] assume !!(~i~0 < ~l1~0);~j~0 := 0;~found~0 := 0; VAL [diff_~A.base=11, diff_~A.offset=7, diff_~Alen=2, diff_~B.base=8, diff_~B.offset=10, diff_~Blen=3, diff_~D.base=5, diff_~D.offset=9, diff_~found~0=0, diff_~i~0=0, diff_~j~0=0, diff_~k~0=0, diff_~l1~0=2, diff_~l2~0=3, |#NULL.base|=0, |#NULL.offset|=0, |diff_#in~A.base|=11, |diff_#in~A.offset|=7, |diff_#in~Alen|=2, |diff_#in~B.base|=8, |diff_#in~B.offset|=10, |diff_#in~Blen|=3, |diff_#in~D.base|=5, |diff_#in~D.offset|=9] [?] assume !!(~j~0 < ~l2~0 && 0 == ~found~0); VAL [diff_~A.base=11, diff_~A.offset=7, diff_~Alen=2, diff_~B.base=8, diff_~B.offset=10, diff_~Blen=3, diff_~D.base=5, diff_~D.offset=9, diff_~found~0=0, diff_~i~0=0, diff_~j~0=0, diff_~k~0=0, diff_~l1~0=2, diff_~l2~0=3, |#NULL.base|=0, |#NULL.offset|=0, |diff_#in~A.base|=11, |diff_#in~A.offset|=7, |diff_#in~Alen|=2, |diff_#in~B.base|=8, |diff_#in~B.offset|=10, |diff_#in~Blen|=3, |diff_#in~D.base|=5, |diff_#in~D.offset|=9] [?] assume !(1 == #valid[~A.base]); VAL [diff_~A.base=11, diff_~A.offset=7, diff_~Alen=2, diff_~B.base=8, diff_~B.offset=10, diff_~Blen=3, diff_~D.base=5, diff_~D.offset=9, diff_~found~0=0, diff_~i~0=0, diff_~j~0=0, diff_~k~0=0, diff_~l1~0=2, diff_~l2~0=3, |#NULL.base|=0, |#NULL.offset|=0, |diff_#in~A.base|=11, |diff_#in~A.offset|=7, |diff_#in~Alen|=2, |diff_#in~B.base|=8, |diff_#in~B.offset|=10, |diff_#in~Blen|=3, |diff_#in~D.base|=5, |diff_#in~D.offset|=9] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=4, old(#NULL.base)=12, old(#NULL.offset)=4] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=4] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=4] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L27] havoc ~A~0.base, ~A~0.offset; [L28] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L28] ~Alen~0 := #t~nondet6; [L28] havoc #t~nondet6; [L29] havoc ~B~0.base, ~B~0.offset; [L30] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L30] ~Blen~0 := #t~nondet7; [L30] havoc #t~nondet7; [L31] havoc ~D~0.base, ~D~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~Alen~0=2, ~Blen~0=3] [L32] CALL call diff(~A~0.base, ~A~0.offset, ~Alen~0, ~B~0.base, ~B~0.offset, ~Blen~0, ~D~0.base, ~D~0.offset); VAL [#in~A.base=11, #in~A.offset=7, #in~Alen=2, #in~B.base=8, #in~B.offset=10, #in~Blen=3, #in~D.base=5, #in~D.offset=9, #NULL.base=0, #NULL.offset=0] [L2-L25] ~A.base, ~A.offset := #in~A.base, #in~A.offset; [L2-L25] ~Alen := #in~Alen; [L2-L25] ~B.base, ~B.offset := #in~B.base, #in~B.offset; [L2-L25] ~Blen := #in~Blen; [L2-L25] ~D.base, ~D.offset := #in~D.base, #in~D.offset; [L4] ~k~0 := 0; [L5] ~i~0 := 0; [L6] ~l1~0 := ~Alen; [L7] ~l2~0 := ~Blen; [L8] havoc ~found~0; VAL [#in~A.base=11, #in~A.offset=7, #in~Alen=2, #in~B.base=8, #in~B.offset=10, #in~Blen=3, #in~D.base=5, #in~D.offset=9, #NULL.base=0, #NULL.offset=0, ~A.base=11, ~A.offset=7, ~Alen=2, ~B.base=8, ~B.offset=10, ~Blen=3, ~D.base=5, ~D.offset=9, ~i~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [L9-L24] assume !!(~i~0 < ~l1~0); [L10] ~j~0 := 0; [L11] ~found~0 := 0; VAL [#in~A.base=11, #in~A.offset=7, #in~Alen=2, #in~B.base=8, #in~B.offset=10, #in~Blen=3, #in~D.base=5, #in~D.offset=9, #NULL.base=0, #NULL.offset=0, ~A.base=11, ~A.offset=7, ~Alen=2, ~B.base=8, ~B.offset=10, ~Blen=3, ~D.base=5, ~D.offset=9, ~found~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [L12-L18] assume !!(~j~0 < ~l2~0 && 0 == ~found~0); VAL [#in~A.base=11, #in~A.offset=7, #in~Alen=2, #in~B.base=8, #in~B.offset=10, #in~Blen=3, #in~D.base=5, #in~D.offset=9, #NULL.base=0, #NULL.offset=0, ~A.base=11, ~A.offset=7, ~Alen=2, ~B.base=8, ~B.offset=10, ~Blen=3, ~D.base=5, ~D.offset=9, ~found~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [L13] call #t~mem0 := read~int(~A.base, ~A.offset + 4 * ~i~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~A.base=11, #in~A.offset=7, #in~Alen=2, #in~B.base=8, #in~B.offset=10, #in~Blen=3, #in~D.base=5, #in~D.offset=9, #NULL.base=0, #NULL.offset=0, ~A.base=11, ~A.offset=7, ~Alen=2, ~B.base=8, ~B.offset=10, ~Blen=3, ~D.base=5, ~D.offset=9, ~found~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=4, old(#NULL.base)=12, old(#NULL.offset)=4] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=4] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=4] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L27] havoc ~A~0.base, ~A~0.offset; [L28] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L28] ~Alen~0 := #t~nondet6; [L28] havoc #t~nondet6; [L29] havoc ~B~0.base, ~B~0.offset; [L30] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L30] ~Blen~0 := #t~nondet7; [L30] havoc #t~nondet7; [L31] havoc ~D~0.base, ~D~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~Alen~0=2, ~Blen~0=3] [L32] CALL call diff(~A~0.base, ~A~0.offset, ~Alen~0, ~B~0.base, ~B~0.offset, ~Blen~0, ~D~0.base, ~D~0.offset); VAL [#in~A.base=11, #in~A.offset=7, #in~Alen=2, #in~B.base=8, #in~B.offset=10, #in~Blen=3, #in~D.base=5, #in~D.offset=9, #NULL.base=0, #NULL.offset=0] [L2-L25] ~A.base, ~A.offset := #in~A.base, #in~A.offset; [L2-L25] ~Alen := #in~Alen; [L2-L25] ~B.base, ~B.offset := #in~B.base, #in~B.offset; [L2-L25] ~Blen := #in~Blen; [L2-L25] ~D.base, ~D.offset := #in~D.base, #in~D.offset; [L4] ~k~0 := 0; [L5] ~i~0 := 0; [L6] ~l1~0 := ~Alen; [L7] ~l2~0 := ~Blen; [L8] havoc ~found~0; VAL [#in~A.base=11, #in~A.offset=7, #in~Alen=2, #in~B.base=8, #in~B.offset=10, #in~Blen=3, #in~D.base=5, #in~D.offset=9, #NULL.base=0, #NULL.offset=0, ~A.base=11, ~A.offset=7, ~Alen=2, ~B.base=8, ~B.offset=10, ~Blen=3, ~D.base=5, ~D.offset=9, ~i~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [L9-L24] assume !!(~i~0 < ~l1~0); [L10] ~j~0 := 0; [L11] ~found~0 := 0; VAL [#in~A.base=11, #in~A.offset=7, #in~Alen=2, #in~B.base=8, #in~B.offset=10, #in~Blen=3, #in~D.base=5, #in~D.offset=9, #NULL.base=0, #NULL.offset=0, ~A.base=11, ~A.offset=7, ~Alen=2, ~B.base=8, ~B.offset=10, ~Blen=3, ~D.base=5, ~D.offset=9, ~found~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [L12-L18] assume !!(~j~0 < ~l2~0 && 0 == ~found~0); VAL [#in~A.base=11, #in~A.offset=7, #in~Alen=2, #in~B.base=8, #in~B.offset=10, #in~Blen=3, #in~D.base=5, #in~D.offset=9, #NULL.base=0, #NULL.offset=0, ~A.base=11, ~A.offset=7, ~Alen=2, ~B.base=8, ~B.offset=10, ~Blen=3, ~D.base=5, ~D.offset=9, ~found~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [L13] call #t~mem0 := read~int(~A.base, ~A.offset + 4 * ~i~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~A.base=11, #in~A.offset=7, #in~Alen=2, #in~B.base=8, #in~B.offset=10, #in~Blen=3, #in~D.base=5, #in~D.offset=9, #NULL.base=0, #NULL.offset=0, ~A.base=11, ~A.offset=7, ~Alen=2, ~B.base=8, ~B.offset=10, ~Blen=3, ~D.base=5, ~D.offset=9, ~found~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=4, old(#NULL!base)=12, old(#NULL!offset)=4] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=4] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L27] havoc ~A~0; [L28] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L28] ~Alen~0 := #t~nondet6; [L28] havoc #t~nondet6; [L29] havoc ~B~0; [L30] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L30] ~Blen~0 := #t~nondet7; [L30] havoc #t~nondet7; [L31] havoc ~D~0; VAL [#NULL!base=0, #NULL!offset=0, ~Alen~0=2, ~Blen~0=3] [L32] CALL call diff(~A~0, ~Alen~0, ~B~0, ~Blen~0, ~D~0); VAL [#in~A!base=11, #in~A!offset=7, #in~Alen=2, #in~B!base=8, #in~B!offset=10, #in~Blen=3, #in~D!base=5, #in~D!offset=9, #NULL!base=0, #NULL!offset=0] [L2-L25] ~A := #in~A; [L2-L25] ~Alen := #in~Alen; [L2-L25] ~B := #in~B; [L2-L25] ~Blen := #in~Blen; [L2-L25] ~D := #in~D; [L4] ~k~0 := 0; [L5] ~i~0 := 0; [L6] ~l1~0 := ~Alen; [L7] ~l2~0 := ~Blen; [L8] havoc ~found~0; VAL [#in~A!base=11, #in~A!offset=7, #in~Alen=2, #in~B!base=8, #in~B!offset=10, #in~Blen=3, #in~D!base=5, #in~D!offset=9, #NULL!base=0, #NULL!offset=0, ~A!base=11, ~A!offset=7, ~Alen=2, ~B!base=8, ~B!offset=10, ~Blen=3, ~D!base=5, ~D!offset=9, ~i~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [L9-L24] COND FALSE !(!(~i~0 < ~l1~0)) [L10] ~j~0 := 0; [L11] ~found~0 := 0; VAL [#in~A!base=11, #in~A!offset=7, #in~Alen=2, #in~B!base=8, #in~B!offset=10, #in~Blen=3, #in~D!base=5, #in~D!offset=9, #NULL!base=0, #NULL!offset=0, ~A!base=11, ~A!offset=7, ~Alen=2, ~B!base=8, ~B!offset=10, ~Blen=3, ~D!base=5, ~D!offset=9, ~found~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [L12-L18] COND FALSE !(!(~j~0 < ~l2~0 && 0 == ~found~0)) VAL [#in~A!base=11, #in~A!offset=7, #in~Alen=2, #in~B!base=8, #in~B!offset=10, #in~Blen=3, #in~D!base=5, #in~D!offset=9, #NULL!base=0, #NULL!offset=0, ~A!base=11, ~A!offset=7, ~Alen=2, ~B!base=8, ~B!offset=10, ~Blen=3, ~D!base=5, ~D!offset=9, ~found~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [L13] FCALL call #t~mem0 := read~int({ base: ~A!base, offset: ~A!offset + 4 * ~i~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~A!base=11, #in~A!offset=7, #in~Alen=2, #in~B!base=8, #in~B!offset=10, #in~Blen=3, #in~D!base=5, #in~D!offset=9, #NULL!base=0, #NULL!offset=0, ~A!base=11, ~A!offset=7, ~Alen=2, ~B!base=8, ~B!offset=10, ~Blen=3, ~D!base=5, ~D!offset=9, ~found~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=4, old(#NULL!base)=12, old(#NULL!offset)=4] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=4] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L27] havoc ~A~0; [L28] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L28] ~Alen~0 := #t~nondet6; [L28] havoc #t~nondet6; [L29] havoc ~B~0; [L30] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L30] ~Blen~0 := #t~nondet7; [L30] havoc #t~nondet7; [L31] havoc ~D~0; VAL [#NULL!base=0, #NULL!offset=0, ~Alen~0=2, ~Blen~0=3] [L32] CALL call diff(~A~0, ~Alen~0, ~B~0, ~Blen~0, ~D~0); VAL [#in~A!base=11, #in~A!offset=7, #in~Alen=2, #in~B!base=8, #in~B!offset=10, #in~Blen=3, #in~D!base=5, #in~D!offset=9, #NULL!base=0, #NULL!offset=0] [L2-L25] ~A := #in~A; [L2-L25] ~Alen := #in~Alen; [L2-L25] ~B := #in~B; [L2-L25] ~Blen := #in~Blen; [L2-L25] ~D := #in~D; [L4] ~k~0 := 0; [L5] ~i~0 := 0; [L6] ~l1~0 := ~Alen; [L7] ~l2~0 := ~Blen; [L8] havoc ~found~0; VAL [#in~A!base=11, #in~A!offset=7, #in~Alen=2, #in~B!base=8, #in~B!offset=10, #in~Blen=3, #in~D!base=5, #in~D!offset=9, #NULL!base=0, #NULL!offset=0, ~A!base=11, ~A!offset=7, ~Alen=2, ~B!base=8, ~B!offset=10, ~Blen=3, ~D!base=5, ~D!offset=9, ~i~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [L9-L24] COND FALSE !(!(~i~0 < ~l1~0)) [L10] ~j~0 := 0; [L11] ~found~0 := 0; VAL [#in~A!base=11, #in~A!offset=7, #in~Alen=2, #in~B!base=8, #in~B!offset=10, #in~Blen=3, #in~D!base=5, #in~D!offset=9, #NULL!base=0, #NULL!offset=0, ~A!base=11, ~A!offset=7, ~Alen=2, ~B!base=8, ~B!offset=10, ~Blen=3, ~D!base=5, ~D!offset=9, ~found~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [L12-L18] COND FALSE !(!(~j~0 < ~l2~0 && 0 == ~found~0)) VAL [#in~A!base=11, #in~A!offset=7, #in~Alen=2, #in~B!base=8, #in~B!offset=10, #in~Blen=3, #in~D!base=5, #in~D!offset=9, #NULL!base=0, #NULL!offset=0, ~A!base=11, ~A!offset=7, ~Alen=2, ~B!base=8, ~B!offset=10, ~Blen=3, ~D!base=5, ~D!offset=9, ~found~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [L13] FCALL call #t~mem0 := read~int({ base: ~A!base, offset: ~A!offset + 4 * ~i~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~A!base=11, #in~A!offset=7, #in~Alen=2, #in~B!base=8, #in~B!offset=10, #in~Blen=3, #in~D!base=5, #in~D!offset=9, #NULL!base=0, #NULL!offset=0, ~A!base=11, ~A!offset=7, ~Alen=2, ~B!base=8, ~B!offset=10, ~Blen=3, ~D!base=5, ~D!offset=9, ~found~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [L27] int *A; [L28] int Alen = __VERIFIER_nondet_int(); [L29] int *B; [L30] int Blen = __VERIFIER_nondet_int(); [L31] int *D; VAL [Alen=2, Blen=3] [L32] CALL diff(A, Alen, B, Blen, D) VAL [\old(Alen)=2, \old(Blen)=3, A={11:7}, B={8:10}, D={5:9}] [L4] int k = 0; [L5] int i = 0; [L6] int l1 = Alen; [L7] int l2 = Blen; [L8] int found; VAL [\old(Alen)=2, \old(Blen)=3, A={11:7}, A={11:7}, Alen=2, B={8:10}, B={8:10}, Blen=3, D={5:9}, D={5:9}, i=0, k=0, l1=2, l2=3] [L9] COND TRUE i < l1 [L10] int j = 0; [L11] found = 0 VAL [\old(Alen)=2, \old(Blen)=3, A={11:7}, A={11:7}, Alen=2, B={8:10}, B={8:10}, Blen=3, D={5:9}, D={5:9}, found=0, i=0, j=0, k=0, l1=2, l2=3] [L12] COND TRUE j < l2 && !found VAL [\old(Alen)=2, \old(Blen)=3, A={11:7}, A={11:7}, Alen=2, B={8:10}, B={8:10}, Blen=3, D={5:9}, D={5:9}, found=0, i=0, j=0, k=0, l1=2, l2=3] [L13] A[i] ----- [2018-11-23 15:08:48,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:08:48 BoogieIcfgContainer [2018-11-23 15:08:48,043 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 15:08:48,043 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:08:48,043 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:08:48,044 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:08:48,044 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:08:47" (3/4) ... [2018-11-23 15:08:48,046 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|=12, |#NULL.offset|=4, |old(#NULL.base)|=12, |old(#NULL.offset)|=4] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=4] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=4] [?] RET #63#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret8 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] havoc ~A~0.base, ~A~0.offset;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~Alen~0 := #t~nondet6;havoc #t~nondet6;havoc ~B~0.base, ~B~0.offset;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~Blen~0 := #t~nondet7;havoc #t~nondet7;havoc ~D~0.base, ~D~0.offset; VAL [main_~Alen~0=2, main_~Blen~0=3, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call diff(~A~0.base, ~A~0.offset, ~Alen~0, ~B~0.base, ~B~0.offset, ~Blen~0, ~D~0.base, ~D~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |diff_#in~A.base|=11, |diff_#in~A.offset|=7, |diff_#in~Alen|=2, |diff_#in~B.base|=8, |diff_#in~B.offset|=10, |diff_#in~Blen|=3, |diff_#in~D.base|=5, |diff_#in~D.offset|=9] [?] ~A.base, ~A.offset := #in~A.base, #in~A.offset;~Alen := #in~Alen;~B.base, ~B.offset := #in~B.base, #in~B.offset;~Blen := #in~Blen;~D.base, ~D.offset := #in~D.base, #in~D.offset;~k~0 := 0;~i~0 := 0;~l1~0 := ~Alen;~l2~0 := ~Blen;havoc ~found~0; VAL [diff_~A.base=11, diff_~A.offset=7, diff_~Alen=2, diff_~B.base=8, diff_~B.offset=10, diff_~Blen=3, diff_~D.base=5, diff_~D.offset=9, diff_~i~0=0, diff_~k~0=0, diff_~l1~0=2, diff_~l2~0=3, |#NULL.base|=0, |#NULL.offset|=0, |diff_#in~A.base|=11, |diff_#in~A.offset|=7, |diff_#in~Alen|=2, |diff_#in~B.base|=8, |diff_#in~B.offset|=10, |diff_#in~Blen|=3, |diff_#in~D.base|=5, |diff_#in~D.offset|=9] [?] assume !!(~i~0 < ~l1~0);~j~0 := 0;~found~0 := 0; VAL [diff_~A.base=11, diff_~A.offset=7, diff_~Alen=2, diff_~B.base=8, diff_~B.offset=10, diff_~Blen=3, diff_~D.base=5, diff_~D.offset=9, diff_~found~0=0, diff_~i~0=0, diff_~j~0=0, diff_~k~0=0, diff_~l1~0=2, diff_~l2~0=3, |#NULL.base|=0, |#NULL.offset|=0, |diff_#in~A.base|=11, |diff_#in~A.offset|=7, |diff_#in~Alen|=2, |diff_#in~B.base|=8, |diff_#in~B.offset|=10, |diff_#in~Blen|=3, |diff_#in~D.base|=5, |diff_#in~D.offset|=9] [?] assume !!(~j~0 < ~l2~0 && 0 == ~found~0); VAL [diff_~A.base=11, diff_~A.offset=7, diff_~Alen=2, diff_~B.base=8, diff_~B.offset=10, diff_~Blen=3, diff_~D.base=5, diff_~D.offset=9, diff_~found~0=0, diff_~i~0=0, diff_~j~0=0, diff_~k~0=0, diff_~l1~0=2, diff_~l2~0=3, |#NULL.base|=0, |#NULL.offset|=0, |diff_#in~A.base|=11, |diff_#in~A.offset|=7, |diff_#in~Alen|=2, |diff_#in~B.base|=8, |diff_#in~B.offset|=10, |diff_#in~Blen|=3, |diff_#in~D.base|=5, |diff_#in~D.offset|=9] [?] assume !(1 == #valid[~A.base]); VAL [diff_~A.base=11, diff_~A.offset=7, diff_~Alen=2, diff_~B.base=8, diff_~B.offset=10, diff_~Blen=3, diff_~D.base=5, diff_~D.offset=9, diff_~found~0=0, diff_~i~0=0, diff_~j~0=0, diff_~k~0=0, diff_~l1~0=2, diff_~l2~0=3, |#NULL.base|=0, |#NULL.offset|=0, |diff_#in~A.base|=11, |diff_#in~A.offset|=7, |diff_#in~Alen|=2, |diff_#in~B.base|=8, |diff_#in~B.offset|=10, |diff_#in~Blen|=3, |diff_#in~D.base|=5, |diff_#in~D.offset|=9] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=4, old(#NULL.base)=12, old(#NULL.offset)=4] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=4] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=4] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L27] havoc ~A~0.base, ~A~0.offset; [L28] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L28] ~Alen~0 := #t~nondet6; [L28] havoc #t~nondet6; [L29] havoc ~B~0.base, ~B~0.offset; [L30] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L30] ~Blen~0 := #t~nondet7; [L30] havoc #t~nondet7; [L31] havoc ~D~0.base, ~D~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~Alen~0=2, ~Blen~0=3] [L32] CALL call diff(~A~0.base, ~A~0.offset, ~Alen~0, ~B~0.base, ~B~0.offset, ~Blen~0, ~D~0.base, ~D~0.offset); VAL [#in~A.base=11, #in~A.offset=7, #in~Alen=2, #in~B.base=8, #in~B.offset=10, #in~Blen=3, #in~D.base=5, #in~D.offset=9, #NULL.base=0, #NULL.offset=0] [L2-L25] ~A.base, ~A.offset := #in~A.base, #in~A.offset; [L2-L25] ~Alen := #in~Alen; [L2-L25] ~B.base, ~B.offset := #in~B.base, #in~B.offset; [L2-L25] ~Blen := #in~Blen; [L2-L25] ~D.base, ~D.offset := #in~D.base, #in~D.offset; [L4] ~k~0 := 0; [L5] ~i~0 := 0; [L6] ~l1~0 := ~Alen; [L7] ~l2~0 := ~Blen; [L8] havoc ~found~0; VAL [#in~A.base=11, #in~A.offset=7, #in~Alen=2, #in~B.base=8, #in~B.offset=10, #in~Blen=3, #in~D.base=5, #in~D.offset=9, #NULL.base=0, #NULL.offset=0, ~A.base=11, ~A.offset=7, ~Alen=2, ~B.base=8, ~B.offset=10, ~Blen=3, ~D.base=5, ~D.offset=9, ~i~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [L9-L24] assume !!(~i~0 < ~l1~0); [L10] ~j~0 := 0; [L11] ~found~0 := 0; VAL [#in~A.base=11, #in~A.offset=7, #in~Alen=2, #in~B.base=8, #in~B.offset=10, #in~Blen=3, #in~D.base=5, #in~D.offset=9, #NULL.base=0, #NULL.offset=0, ~A.base=11, ~A.offset=7, ~Alen=2, ~B.base=8, ~B.offset=10, ~Blen=3, ~D.base=5, ~D.offset=9, ~found~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [L12-L18] assume !!(~j~0 < ~l2~0 && 0 == ~found~0); VAL [#in~A.base=11, #in~A.offset=7, #in~Alen=2, #in~B.base=8, #in~B.offset=10, #in~Blen=3, #in~D.base=5, #in~D.offset=9, #NULL.base=0, #NULL.offset=0, ~A.base=11, ~A.offset=7, ~Alen=2, ~B.base=8, ~B.offset=10, ~Blen=3, ~D.base=5, ~D.offset=9, ~found~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [L13] call #t~mem0 := read~int(~A.base, ~A.offset + 4 * ~i~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~A.base=11, #in~A.offset=7, #in~Alen=2, #in~B.base=8, #in~B.offset=10, #in~Blen=3, #in~D.base=5, #in~D.offset=9, #NULL.base=0, #NULL.offset=0, ~A.base=11, ~A.offset=7, ~Alen=2, ~B.base=8, ~B.offset=10, ~Blen=3, ~D.base=5, ~D.offset=9, ~found~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=4, old(#NULL.base)=12, old(#NULL.offset)=4] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=4] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=4] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L27] havoc ~A~0.base, ~A~0.offset; [L28] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L28] ~Alen~0 := #t~nondet6; [L28] havoc #t~nondet6; [L29] havoc ~B~0.base, ~B~0.offset; [L30] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L30] ~Blen~0 := #t~nondet7; [L30] havoc #t~nondet7; [L31] havoc ~D~0.base, ~D~0.offset; VAL [#NULL.base=0, #NULL.offset=0, ~Alen~0=2, ~Blen~0=3] [L32] CALL call diff(~A~0.base, ~A~0.offset, ~Alen~0, ~B~0.base, ~B~0.offset, ~Blen~0, ~D~0.base, ~D~0.offset); VAL [#in~A.base=11, #in~A.offset=7, #in~Alen=2, #in~B.base=8, #in~B.offset=10, #in~Blen=3, #in~D.base=5, #in~D.offset=9, #NULL.base=0, #NULL.offset=0] [L2-L25] ~A.base, ~A.offset := #in~A.base, #in~A.offset; [L2-L25] ~Alen := #in~Alen; [L2-L25] ~B.base, ~B.offset := #in~B.base, #in~B.offset; [L2-L25] ~Blen := #in~Blen; [L2-L25] ~D.base, ~D.offset := #in~D.base, #in~D.offset; [L4] ~k~0 := 0; [L5] ~i~0 := 0; [L6] ~l1~0 := ~Alen; [L7] ~l2~0 := ~Blen; [L8] havoc ~found~0; VAL [#in~A.base=11, #in~A.offset=7, #in~Alen=2, #in~B.base=8, #in~B.offset=10, #in~Blen=3, #in~D.base=5, #in~D.offset=9, #NULL.base=0, #NULL.offset=0, ~A.base=11, ~A.offset=7, ~Alen=2, ~B.base=8, ~B.offset=10, ~Blen=3, ~D.base=5, ~D.offset=9, ~i~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [L9-L24] assume !!(~i~0 < ~l1~0); [L10] ~j~0 := 0; [L11] ~found~0 := 0; VAL [#in~A.base=11, #in~A.offset=7, #in~Alen=2, #in~B.base=8, #in~B.offset=10, #in~Blen=3, #in~D.base=5, #in~D.offset=9, #NULL.base=0, #NULL.offset=0, ~A.base=11, ~A.offset=7, ~Alen=2, ~B.base=8, ~B.offset=10, ~Blen=3, ~D.base=5, ~D.offset=9, ~found~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [L12-L18] assume !!(~j~0 < ~l2~0 && 0 == ~found~0); VAL [#in~A.base=11, #in~A.offset=7, #in~Alen=2, #in~B.base=8, #in~B.offset=10, #in~Blen=3, #in~D.base=5, #in~D.offset=9, #NULL.base=0, #NULL.offset=0, ~A.base=11, ~A.offset=7, ~Alen=2, ~B.base=8, ~B.offset=10, ~Blen=3, ~D.base=5, ~D.offset=9, ~found~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [L13] call #t~mem0 := read~int(~A.base, ~A.offset + 4 * ~i~0, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~A.base=11, #in~A.offset=7, #in~Alen=2, #in~B.base=8, #in~B.offset=10, #in~Blen=3, #in~D.base=5, #in~D.offset=9, #NULL.base=0, #NULL.offset=0, ~A.base=11, ~A.offset=7, ~Alen=2, ~B.base=8, ~B.offset=10, ~Blen=3, ~D.base=5, ~D.offset=9, ~found~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=4, old(#NULL!base)=12, old(#NULL!offset)=4] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=4] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L27] havoc ~A~0; [L28] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L28] ~Alen~0 := #t~nondet6; [L28] havoc #t~nondet6; [L29] havoc ~B~0; [L30] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L30] ~Blen~0 := #t~nondet7; [L30] havoc #t~nondet7; [L31] havoc ~D~0; VAL [#NULL!base=0, #NULL!offset=0, ~Alen~0=2, ~Blen~0=3] [L32] CALL call diff(~A~0, ~Alen~0, ~B~0, ~Blen~0, ~D~0); VAL [#in~A!base=11, #in~A!offset=7, #in~Alen=2, #in~B!base=8, #in~B!offset=10, #in~Blen=3, #in~D!base=5, #in~D!offset=9, #NULL!base=0, #NULL!offset=0] [L2-L25] ~A := #in~A; [L2-L25] ~Alen := #in~Alen; [L2-L25] ~B := #in~B; [L2-L25] ~Blen := #in~Blen; [L2-L25] ~D := #in~D; [L4] ~k~0 := 0; [L5] ~i~0 := 0; [L6] ~l1~0 := ~Alen; [L7] ~l2~0 := ~Blen; [L8] havoc ~found~0; VAL [#in~A!base=11, #in~A!offset=7, #in~Alen=2, #in~B!base=8, #in~B!offset=10, #in~Blen=3, #in~D!base=5, #in~D!offset=9, #NULL!base=0, #NULL!offset=0, ~A!base=11, ~A!offset=7, ~Alen=2, ~B!base=8, ~B!offset=10, ~Blen=3, ~D!base=5, ~D!offset=9, ~i~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [L9-L24] COND FALSE !(!(~i~0 < ~l1~0)) [L10] ~j~0 := 0; [L11] ~found~0 := 0; VAL [#in~A!base=11, #in~A!offset=7, #in~Alen=2, #in~B!base=8, #in~B!offset=10, #in~Blen=3, #in~D!base=5, #in~D!offset=9, #NULL!base=0, #NULL!offset=0, ~A!base=11, ~A!offset=7, ~Alen=2, ~B!base=8, ~B!offset=10, ~Blen=3, ~D!base=5, ~D!offset=9, ~found~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [L12-L18] COND FALSE !(!(~j~0 < ~l2~0 && 0 == ~found~0)) VAL [#in~A!base=11, #in~A!offset=7, #in~Alen=2, #in~B!base=8, #in~B!offset=10, #in~Blen=3, #in~D!base=5, #in~D!offset=9, #NULL!base=0, #NULL!offset=0, ~A!base=11, ~A!offset=7, ~Alen=2, ~B!base=8, ~B!offset=10, ~Blen=3, ~D!base=5, ~D!offset=9, ~found~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [L13] FCALL call #t~mem0 := read~int({ base: ~A!base, offset: ~A!offset + 4 * ~i~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~A!base=11, #in~A!offset=7, #in~Alen=2, #in~B!base=8, #in~B!offset=10, #in~Blen=3, #in~D!base=5, #in~D!offset=9, #NULL!base=0, #NULL!offset=0, ~A!base=11, ~A!offset=7, ~Alen=2, ~B!base=8, ~B!offset=10, ~Blen=3, ~D!base=5, ~D!offset=9, ~found~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=4, old(#NULL!base)=12, old(#NULL!offset)=4] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=4] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret8 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L27] havoc ~A~0; [L28] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L28] ~Alen~0 := #t~nondet6; [L28] havoc #t~nondet6; [L29] havoc ~B~0; [L30] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L30] ~Blen~0 := #t~nondet7; [L30] havoc #t~nondet7; [L31] havoc ~D~0; VAL [#NULL!base=0, #NULL!offset=0, ~Alen~0=2, ~Blen~0=3] [L32] CALL call diff(~A~0, ~Alen~0, ~B~0, ~Blen~0, ~D~0); VAL [#in~A!base=11, #in~A!offset=7, #in~Alen=2, #in~B!base=8, #in~B!offset=10, #in~Blen=3, #in~D!base=5, #in~D!offset=9, #NULL!base=0, #NULL!offset=0] [L2-L25] ~A := #in~A; [L2-L25] ~Alen := #in~Alen; [L2-L25] ~B := #in~B; [L2-L25] ~Blen := #in~Blen; [L2-L25] ~D := #in~D; [L4] ~k~0 := 0; [L5] ~i~0 := 0; [L6] ~l1~0 := ~Alen; [L7] ~l2~0 := ~Blen; [L8] havoc ~found~0; VAL [#in~A!base=11, #in~A!offset=7, #in~Alen=2, #in~B!base=8, #in~B!offset=10, #in~Blen=3, #in~D!base=5, #in~D!offset=9, #NULL!base=0, #NULL!offset=0, ~A!base=11, ~A!offset=7, ~Alen=2, ~B!base=8, ~B!offset=10, ~Blen=3, ~D!base=5, ~D!offset=9, ~i~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [L9-L24] COND FALSE !(!(~i~0 < ~l1~0)) [L10] ~j~0 := 0; [L11] ~found~0 := 0; VAL [#in~A!base=11, #in~A!offset=7, #in~Alen=2, #in~B!base=8, #in~B!offset=10, #in~Blen=3, #in~D!base=5, #in~D!offset=9, #NULL!base=0, #NULL!offset=0, ~A!base=11, ~A!offset=7, ~Alen=2, ~B!base=8, ~B!offset=10, ~Blen=3, ~D!base=5, ~D!offset=9, ~found~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [L12-L18] COND FALSE !(!(~j~0 < ~l2~0 && 0 == ~found~0)) VAL [#in~A!base=11, #in~A!offset=7, #in~Alen=2, #in~B!base=8, #in~B!offset=10, #in~Blen=3, #in~D!base=5, #in~D!offset=9, #NULL!base=0, #NULL!offset=0, ~A!base=11, ~A!offset=7, ~Alen=2, ~B!base=8, ~B!offset=10, ~Blen=3, ~D!base=5, ~D!offset=9, ~found~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [L13] FCALL call #t~mem0 := read~int({ base: ~A!base, offset: ~A!offset + 4 * ~i~0 }, 4); [?] requires 1 == #valid[#ptr.base]; VAL [#in~A!base=11, #in~A!offset=7, #in~Alen=2, #in~B!base=8, #in~B!offset=10, #in~Blen=3, #in~D!base=5, #in~D!offset=9, #NULL!base=0, #NULL!offset=0, ~A!base=11, ~A!offset=7, ~Alen=2, ~B!base=8, ~B!offset=10, ~Blen=3, ~D!base=5, ~D!offset=9, ~found~0=0, ~i~0=0, ~j~0=0, ~k~0=0, ~l1~0=2, ~l2~0=3] [L27] int *A; [L28] int Alen = __VERIFIER_nondet_int(); [L29] int *B; [L30] int Blen = __VERIFIER_nondet_int(); [L31] int *D; VAL [Alen=2, Blen=3] [L32] CALL diff(A, Alen, B, Blen, D) VAL [\old(Alen)=2, \old(Blen)=3, A={11:7}, B={8:10}, D={5:9}] [L4] int k = 0; [L5] int i = 0; [L6] int l1 = Alen; [L7] int l2 = Blen; [L8] int found; VAL [\old(Alen)=2, \old(Blen)=3, A={11:7}, A={11:7}, Alen=2, B={8:10}, B={8:10}, Blen=3, D={5:9}, D={5:9}, i=0, k=0, l1=2, l2=3] [L9] COND TRUE i < l1 [L10] int j = 0; [L11] found = 0 VAL [\old(Alen)=2, \old(Blen)=3, A={11:7}, A={11:7}, Alen=2, B={8:10}, B={8:10}, Blen=3, D={5:9}, D={5:9}, found=0, i=0, j=0, k=0, l1=2, l2=3] [L12] COND TRUE j < l2 && !found VAL [\old(Alen)=2, \old(Blen)=3, A={11:7}, A={11:7}, Alen=2, B={8:10}, B={8:10}, Blen=3, D={5:9}, D={5:9}, found=0, i=0, j=0, k=0, l1=2, l2=3] [L13] A[i] ----- [2018-11-23 15:08:48,095 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_900b3a26-91bf-480a-8631-8757ec3ca5ba/bin-2019/uautomizer/witness.graphml [2018-11-23 15:08:48,095 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:08:48,096 INFO L168 Benchmark]: Toolchain (without parser) took 726.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -121.8 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-11-23 15:08:48,097 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:08:48,098 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.63 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:08:48,098 INFO L168 Benchmark]: Boogie Preprocessor took 67.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2018-11-23 15:08:48,099 INFO L168 Benchmark]: RCFGBuilder took 211.41 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: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. [2018-11-23 15:08:48,099 INFO L168 Benchmark]: TraceAbstraction took 238.51 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: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2018-11-23 15:08:48,100 INFO L168 Benchmark]: Witness Printer took 52.11 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.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-23 15:08:48,102 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 153.63 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 211.41 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: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 238.51 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: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * Witness Printer took 52.11 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.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L27] int *A; [L28] int Alen = __VERIFIER_nondet_int(); [L29] int *B; [L30] int Blen = __VERIFIER_nondet_int(); [L31] int *D; VAL [Alen=2, Blen=3] [L32] CALL diff(A, Alen, B, Blen, D) VAL [\old(Alen)=2, \old(Blen)=3, A={11:7}, B={8:10}, D={5:9}] [L4] int k = 0; [L5] int i = 0; [L6] int l1 = Alen; [L7] int l2 = Blen; [L8] int found; VAL [\old(Alen)=2, \old(Blen)=3, A={11:7}, A={11:7}, Alen=2, B={8:10}, B={8:10}, Blen=3, D={5:9}, D={5:9}, i=0, k=0, l1=2, l2=3] [L9] COND TRUE i < l1 [L10] int j = 0; [L11] found = 0 VAL [\old(Alen)=2, \old(Blen)=3, A={11:7}, A={11:7}, Alen=2, B={8:10}, B={8:10}, Blen=3, D={5:9}, D={5:9}, found=0, i=0, j=0, k=0, l1=2, l2=3] [L12] COND TRUE j < l2 && !found VAL [\old(Alen)=2, \old(Blen)=3, A={11:7}, A={11:7}, Alen=2, B={8:10}, B={8:10}, Blen=3, D={5:9}, D={5:9}, found=0, i=0, j=0, k=0, l1=2, l2=3] [L13] A[i] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 34 locations, 9 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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...