java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-0220_false-valid-memtrack.i_26.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:47:21,674 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:47:21,676 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:47:21,688 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:47:21,689 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:47:21,690 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:47:21,691 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:47:21,693 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:47:21,694 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:47:21,695 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:47:21,696 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:47:21,696 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:47:21,697 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:47:21,698 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:47:21,699 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:47:21,700 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:47:21,701 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:47:21,703 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:47:21,705 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:47:21,707 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:47:21,708 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:47:21,709 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:47:21,712 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:47:21,712 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:47:21,712 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:47:21,713 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:47:21,714 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:47:21,715 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:47:21,716 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:47:21,717 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:47:21,717 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:47:21,718 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:47:21,718 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:47:21,718 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:47:21,719 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:47:21,720 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:47:21,721 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-10 15:47:21,730 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:47:21,731 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:47:21,732 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:47:21,732 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:47:21,732 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:47:21,732 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:47:21,733 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:47:21,733 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:47:21,733 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:47:21,734 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:47:21,734 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:47:21,734 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:47:21,734 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:47:21,735 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:47:21,735 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:47:21,781 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:47:21,799 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:47:21,806 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:47:21,807 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:47:21,808 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:47:21,809 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-0220_false-valid-memtrack.i_26.bpl [2018-10-10 15:47:21,809 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-0220_false-valid-memtrack.i_26.bpl' [2018-10-10 15:47:21,914 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:47:21,916 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:47:21,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:47:21,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:47:21,917 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:47:21,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "test-0220_false-valid-memtrack.i_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:47:21" (1/1) ... [2018-10-10 15:47:21,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "test-0220_false-valid-memtrack.i_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:47:21" (1/1) ... [2018-10-10 15:47:21,976 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "test-0220_false-valid-memtrack.i_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:47:21" (1/1) ... [2018-10-10 15:47:21,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "test-0220_false-valid-memtrack.i_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:47:21" (1/1) ... [2018-10-10 15:47:21,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "test-0220_false-valid-memtrack.i_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:47:21" (1/1) ... [2018-10-10 15:47:21,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "test-0220_false-valid-memtrack.i_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:47:21" (1/1) ... [2018-10-10 15:47:22,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "test-0220_false-valid-memtrack.i_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:47:21" (1/1) ... [2018-10-10 15:47:22,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:47:22,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:47:22,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:47:22,016 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:47:22,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "test-0220_false-valid-memtrack.i_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:47:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-10 15:47:22,088 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:47:22,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:47:22,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:47:22,939 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:47:22,940 INFO L202 PluginConnector]: Adding new model test-0220_false-valid-memtrack.i_26.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:47:22 BoogieIcfgContainer [2018-10-10 15:47:22,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:47:22,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:47:22,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:47:22,947 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:47:22,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-0220_false-valid-memtrack.i_26.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:47:21" (1/2) ... [2018-10-10 15:47:22,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26cbd67f and model type test-0220_false-valid-memtrack.i_26.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:47:22, skipping insertion in model container [2018-10-10 15:47:22,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-0220_false-valid-memtrack.i_26.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:47:22" (2/2) ... [2018-10-10 15:47:22,951 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0220_false-valid-memtrack.i_26.bpl [2018-10-10 15:47:22,962 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:47:22,977 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:47:22,995 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:47:23,031 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:47:23,032 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:47:23,032 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:47:23,032 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:47:23,032 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:47:23,032 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:47:23,034 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:47:23,034 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:47:23,034 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:47:23,066 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2018-10-10 15:47:23,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-10 15:47:23,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:47:23,089 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:47:23,090 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:47:23,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:47:23,095 INFO L82 PathProgramCache]: Analyzing trace with hash 85626042, now seen corresponding path program 1 times [2018-10-10 15:47:23,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:47:23,210 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-10 15:47:23,211 INFO L285 seRefinementStrategy]: Strategy FixedRefinementStrategy was unsuccessful and could not determine trace feasibility. [2018-10-10 15:47:23,211 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-10 15:47:23,236 WARN L208 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-10-10 15:47:23,237 INFO L202 PluginConnector]: Adding new model test-0220_false-valid-memtrack.i_26.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 03:47:23 BoogieIcfgContainer [2018-10-10 15:47:23,237 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 15:47:23,238 INFO L168 Benchmark]: Toolchain (without parser) took 1323.52 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-10-10 15:47:23,240 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 15:47:23,241 INFO L168 Benchmark]: Boogie Preprocessor took 97.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 15:47:23,242 INFO L168 Benchmark]: RCFGBuilder took 925.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-10 15:47:23,243 INFO L168 Benchmark]: TraceAbstraction took 295.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-10 15:47:23,249 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 97.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 925.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 295.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 262]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L100] #NULL.offset, #NULL.base := 0, 0; [L101] #valid := #valid[0 := 0]; [L102] #Ultimate.alloc_old_#valid, #Ultimate.alloc_old_#length := #valid, #length; [L103] #Ultimate.alloc_~size := 4; [L104] havoc #Ultimate.alloc_#res.offset, #Ultimate.alloc_#res.base; [L105] havoc #valid, #length; [L106] assume 0 == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base]; [L107] assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1] == #valid; [L108] assume #Ultimate.alloc_#res.offset == 0; [L109] assume !(0 == #Ultimate.alloc_#res.base); [L110] assume #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size] == #length; [L111] ~#list~0.base, ~#list~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset; [L112] write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset; [L113] write~$Pointer$_#value.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base := 0, ~#list~0.offset, 4, 0, ~#list~0.base; [L114] assume 1 == #valid[write~$Pointer$_#ptr.base]; [L115] assume write~$Pointer$_#sizeOfWrittenType + write~$Pointer$_#ptr.offset <= #length[write~$Pointer$_#ptr.base] && 0 <= write~$Pointer$_#ptr.offset; [L116] assume #valid[write~$Pointer$_#ptr.base] == 1; [L117] assume write~$Pointer$_#sizeOfWrittenType + write~$Pointer$_#ptr.offset <= #length[write~$Pointer$_#ptr.base] && 0 <= write~$Pointer$_#ptr.offset; [L118] havoc #memory_$Pointer$.base, #memory_$Pointer$.offset; [L119] assume #memory_$Pointer$.offset == write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base := write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base][write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset]] && #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base := write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base][write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base]]; [L120] main_old_#valid := #valid; [L121] havoc main_#res; [L122] havoc main_#t~mem14.offset, main_#t~nondet11, main_#t~mem17.offset, main_#t~mem12.offset, main_#t~mem16.offset, main_~next~1.offset, main_#t~mem17.base, main_#t~mem13.offset, main_#t~mem15.offset, main_#t~mem14.base, main_#t~mem13.base, main_#t~mem15.base, main_~next~1.base, main_#t~mem16.base, main_#t~mem12.base; [L123] l1_insert_#in~list.base, l1_insert_#in~list.offset := ~#list~0.base, ~#list~0.offset; [L124] havoc l1_insert_#t~mem10.base, l1_insert_~item~1.offset, l1_insert_#t~mem10.offset, l1_insert_~item~1.base, l1_insert_~list.offset, l1_insert_~list.base, l1_insert_#t~ret8.offset, l1_insert_#t~nondet9, l1_insert_#t~ret8.base; [L125] l1_insert_~list.offset, l1_insert_~list.base := l1_insert_#in~list.offset, l1_insert_#in~list.base; [L126] calloc_model_#in~size, calloc_model_#in~nmemb := 8, 1; [L127] havoc calloc_model_#res.base, calloc_model_#res.offset; [L128] havoc calloc_model_#t~malloc0.offset, calloc_model_~size, calloc_model_~ptr~0.offset, calloc_model_#t~memset1.base, calloc_model_~nmemb, calloc_model_~ptr~0.base, calloc_model_#t~malloc0.base, calloc_model_#t~memset1.offset; [L129] calloc_model_~nmemb := calloc_model_#in~nmemb; [L130] calloc_model_~size := calloc_model_#in~size; [L131] #Ultimate.alloc_old_#valid, #Ultimate.alloc_old_#length := #valid, #length; [L132] #Ultimate.alloc_~size := calloc_model_~nmemb * calloc_model_~size; [L133] havoc #Ultimate.alloc_#res.offset, #Ultimate.alloc_#res.base; [L134] havoc #valid, #length; [L135] assume 0 == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base]; [L136] assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1]; [L137] assume #Ultimate.alloc_#res.offset == 0; [L138] assume !(0 == #Ultimate.alloc_#res.base); [L139] assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size]; [L140] calloc_model_#t~malloc0.offset, calloc_model_#t~malloc0.base := #Ultimate.alloc_#res.offset, #Ultimate.alloc_#res.base; [L141] calloc_model_~ptr~0.offset, calloc_model_~ptr~0.base := calloc_model_#t~malloc0.offset, calloc_model_#t~malloc0.base; [L142] #Ultimate.C_memset_#ptr.offset, #Ultimate.C_memset_#value, #Ultimate.C_memset_#amount, #Ultimate.C_memset_#ptr.base := calloc_model_~ptr~0.offset, 0, (if calloc_model_~nmemb * calloc_model_~size % 4294967296 <= 2147483647 then calloc_model_~nmemb * calloc_model_~size % 4294967296 else calloc_model_~nmemb * calloc_model_~size % 4294967296 + -4294967296), calloc_model_~ptr~0.base; [L143] assume 1 == #valid[#Ultimate.C_memset_#ptr.base]; [L144] assume 0 <= #Ultimate.C_memset_#ptr.offset && #Ultimate.C_memset_#ptr.offset + #Ultimate.C_memset_#amount <= #length[#Ultimate.C_memset_#ptr.base]; [L145] assume 1 == #valid[#Ultimate.C_memset_#ptr.base]; [L146] assume 0 <= #Ultimate.C_memset_#ptr.offset && #Ultimate.C_memset_#amount + #Ultimate.C_memset_#ptr.offset <= #length[#Ultimate.C_memset_#ptr.base]; [L147] havoc #Ultimate.C_memset_#res.base, #Ultimate.C_memset_#res.offset; [L148] havoc #Ultimate.C_memset_#t~loopctr19; [L149] #Ultimate.C_memset_#t~loopctr19 := 0; [L150] assume !(#Ultimate.C_memset_#t~loopctr19 < #Ultimate.C_memset_#amount); [L151] assume #Ultimate.C_memset_#ptr.offset == #Ultimate.C_memset_#res.offset && #Ultimate.C_memset_#ptr.base == #Ultimate.C_memset_#res.base; [L152] calloc_model_#t~memset1.base, calloc_model_#t~memset1.offset := #Ultimate.C_memset_#res.base, #Ultimate.C_memset_#res.offset; [L153] calloc_model_#res.base, calloc_model_#res.offset := calloc_model_~ptr~0.base, calloc_model_~ptr~0.offset; [L154] havoc calloc_model_#t~memset1.base, calloc_model_#t~memset1.offset; [L155] l1_insert_#t~ret8.offset, l1_insert_#t~ret8.base := calloc_model_#res.offset, calloc_model_#res.base; [L156] l1_insert_~item~1.offset, l1_insert_~item~1.base := l1_insert_#t~ret8.offset, l1_insert_#t~ret8.base; [L157] havoc l1_insert_#t~ret8.offset, l1_insert_#t~ret8.base; [L158] assume !(0 == l1_insert_~item~1.base) || !(0 == l1_insert_~item~1.offset); [L161] l2_insert_#in~list.base, l2_insert_#in~list.offset := l1_insert_~item~1.base, l1_insert_~item~1.offset + 4; [L162] havoc l2_insert_~list.base, l2_insert_#t~ret2.offset, l2_insert_#t~mem5.offset, l2_insert_#t~ret2.base, l2_insert_#t~malloc3.base, l2_insert_#t~malloc3.offset, l2_insert_~item~0.base, l2_insert_~list.offset, l2_insert_~item~0.offset, l2_insert_#t~mem4.offset, l2_insert_#t~mem4.base, l2_insert_#t~mem5.base; [L163] l2_insert_~list.base, l2_insert_~list.offset := l2_insert_#in~list.base, l2_insert_#in~list.offset; [L164] calloc_model_#in~size, calloc_model_#in~nmemb := 8, 1; [L165] havoc calloc_model_#res.base, calloc_model_#res.offset; [L166] havoc calloc_model_#t~malloc0.offset, calloc_model_~size, calloc_model_~ptr~0.offset, calloc_model_#t~memset1.base, calloc_model_~nmemb, calloc_model_~ptr~0.base, calloc_model_#t~malloc0.base, calloc_model_#t~memset1.offset; [L167] calloc_model_~nmemb := calloc_model_#in~nmemb; [L168] calloc_model_~size := calloc_model_#in~size; [L169] #Ultimate.alloc_old_#valid, #Ultimate.alloc_old_#length := #valid, #length; [L170] #Ultimate.alloc_~size := calloc_model_~nmemb * calloc_model_~size; [L171] havoc #Ultimate.alloc_#res.offset, #Ultimate.alloc_#res.base; [L172] havoc #valid, #length; [L173] assume 0 == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base]; [L174] assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1]; [L175] assume #Ultimate.alloc_#res.offset == 0; [L176] assume !(0 == #Ultimate.alloc_#res.base); [L177] assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size]; [L178] calloc_model_#t~malloc0.offset, calloc_model_#t~malloc0.base := #Ultimate.alloc_#res.offset, #Ultimate.alloc_#res.base; [L179] calloc_model_~ptr~0.offset, calloc_model_~ptr~0.base := calloc_model_#t~malloc0.offset, calloc_model_#t~malloc0.base; [L180] #Ultimate.C_memset_#ptr.offset, #Ultimate.C_memset_#value, #Ultimate.C_memset_#amount, #Ultimate.C_memset_#ptr.base := calloc_model_~ptr~0.offset, 0, (if calloc_model_~nmemb * calloc_model_~size % 4294967296 <= 2147483647 then calloc_model_~nmemb * calloc_model_~size % 4294967296 else calloc_model_~nmemb * calloc_model_~size % 4294967296 + -4294967296), calloc_model_~ptr~0.base; [L181] assume 1 == #valid[#Ultimate.C_memset_#ptr.base]; [L182] assume #Ultimate.C_memset_#amount + #Ultimate.C_memset_#ptr.offset <= #length[#Ultimate.C_memset_#ptr.base] && 0 <= #Ultimate.C_memset_#ptr.offset; [L183] assume 1 == #valid[#Ultimate.C_memset_#ptr.base]; [L184] assume #Ultimate.C_memset_#ptr.offset + #Ultimate.C_memset_#amount <= #length[#Ultimate.C_memset_#ptr.base] && 0 <= #Ultimate.C_memset_#ptr.offset; [L185] havoc #Ultimate.C_memset_#res.base, #Ultimate.C_memset_#res.offset; [L186] havoc #Ultimate.C_memset_#t~loopctr19; [L187] #Ultimate.C_memset_#t~loopctr19 := 0; [L188] assume !(#Ultimate.C_memset_#t~loopctr19 < #Ultimate.C_memset_#amount); [L189] assume #Ultimate.C_memset_#ptr.base == #Ultimate.C_memset_#res.base && #Ultimate.C_memset_#ptr.offset == #Ultimate.C_memset_#res.offset; [L190] calloc_model_#t~memset1.base, calloc_model_#t~memset1.offset := #Ultimate.C_memset_#res.base, #Ultimate.C_memset_#res.offset; [L191] calloc_model_#res.base, calloc_model_#res.offset := calloc_model_~ptr~0.base, calloc_model_~ptr~0.offset; [L192] havoc calloc_model_#t~memset1.base, calloc_model_#t~memset1.offset; [L193] l2_insert_#t~ret2.offset, l2_insert_#t~ret2.base := calloc_model_#res.offset, calloc_model_#res.base; [L194] l2_insert_~item~0.base, l2_insert_~item~0.offset := l2_insert_#t~ret2.base, l2_insert_#t~ret2.offset; [L195] havoc l2_insert_#t~ret2.offset, l2_insert_#t~ret2.base; [L196] assume !(l2_insert_~item~0.base == 0) || !(l2_insert_~item~0.offset == 0); [L197] #Ultimate.alloc_old_#valid, #Ultimate.alloc_old_#length := #valid, #length; [L198] #Ultimate.alloc_~size := 119; [L199] havoc #Ultimate.alloc_#res.offset, #Ultimate.alloc_#res.base; [L200] havoc #valid, #length; [L201] assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0; [L202] assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1]; [L203] assume 0 == #Ultimate.alloc_#res.offset; [L204] assume !(0 == #Ultimate.alloc_#res.base); [L205] assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size]; [L206] l2_insert_#t~malloc3.base, l2_insert_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset; [L207] write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset; [L208] write~$Pointer$_#value.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base := l2_insert_#t~malloc3.base, l2_insert_~item~0.offset, 4, l2_insert_#t~malloc3.offset, l2_insert_~item~0.base; [L209] assume 1 == #valid[write~$Pointer$_#ptr.base]; [L210] assume 0 <= write~$Pointer$_#ptr.offset && write~$Pointer$_#ptr.offset + write~$Pointer$_#sizeOfWrittenType <= #length[write~$Pointer$_#ptr.base]; [L211] assume 1 == #valid[write~$Pointer$_#ptr.base]; [L212] assume write~$Pointer$_#ptr.offset + write~$Pointer$_#sizeOfWrittenType <= #length[write~$Pointer$_#ptr.base] && 0 <= write~$Pointer$_#ptr.offset; [L213] havoc #memory_$Pointer$.base, #memory_$Pointer$.offset; [L214] assume write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base := write~$Pointer$_old_#memory_$Pointer$.offset[write~$Pointer$_#ptr.base][write~$Pointer$_#ptr.offset := write~$Pointer$_#value.offset]] == #memory_$Pointer$.offset && #memory_$Pointer$.base == write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base := write~$Pointer$_old_#memory_$Pointer$.base[write~$Pointer$_#ptr.base][write~$Pointer$_#ptr.offset := write~$Pointer$_#value.base]]; [L215] read~$Pointer$_#ptr.base, read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset := l2_insert_~item~0.base, 4, l2_insert_~item~0.offset; [L216] assume #valid[read~$Pointer$_#ptr.base] == 1; [L217] assume 0 <= read~$Pointer$_#ptr.offset && read~$Pointer$_#sizeOfReadType + read~$Pointer$_#ptr.offset <= #length[read~$Pointer$_#ptr.base]; [L218] assume 1 == #valid[read~$Pointer$_#ptr.base]; [L219] assume 0 <= read~$Pointer$_#ptr.offset && read~$Pointer$_#sizeOfReadType + read~$Pointer$_#ptr.offset <= #length[read~$Pointer$_#ptr.base]; [L220] havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset; [L221] assume read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base][read~$Pointer$_#ptr.offset] && #memory_$Pointer$.base[read~$Pointer$_#ptr.base][read~$Pointer$_#ptr.offset] == read~$Pointer$_#value.base; [L222] l2_insert_#t~mem4.offset, l2_insert_#t~mem4.base := read~$Pointer$_#value.offset, read~$Pointer$_#value.base; [L223] assume !(0 == l2_insert_#t~mem4.base) || !(0 == l2_insert_#t~mem4.offset); [L224] havoc l2_insert_#t~mem4.offset, l2_insert_#t~mem4.base; [L225] read~$Pointer$_#ptr.base, read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset := l2_insert_~list.base, 4, l2_insert_~list.offset; [L226] assume 1 == #valid[read~$Pointer$_#ptr.base]; [L231] assume !(read~$Pointer$_#ptr.offset + read~$Pointer$_#sizeOfReadType <= #length[read~$Pointer$_#ptr.base]) || !(0 <= read~$Pointer$_#ptr.offset); [L262] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 155 locations, 1 error locations. UNKNOWN Result, 0.2s 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=155occurred 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: No data available, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/test-0220_false-valid-memtrack.i_26.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-10_15-47-23-262.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/test-0220_false-valid-memtrack.i_26.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-10_15-47-23-262.csv Received shutdown request...