java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-0219_true-valid-memsafety.i_34.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:01:26,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:01:26,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:01:26,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:01:26,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:01:26,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:01:26,954 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:01:26,956 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:01:26,958 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:01:26,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:01:26,960 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:01:26,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:01:26,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:01:26,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:01:26,962 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:01:26,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:01:26,964 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:01:26,965 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:01:26,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:01:26,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:01:26,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:01:26,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:01:26,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:01:26,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:01:26,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:01:26,978 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:01:26,978 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:01:26,979 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:01:26,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:01:26,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:01:26,981 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:01:26,982 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:01:26,983 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:01:26,983 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:01:26,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:01:26,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:01:26,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:01:26,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:01:26,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:01:26,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:01:26,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:01:27,017 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:01:27,030 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:01:27,033 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:01:27,035 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:01:27,036 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:01:27,036 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-0219_true-valid-memsafety.i_34.bpl [2019-08-05 11:01:27,037 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-0219_true-valid-memsafety.i_34.bpl' [2019-08-05 11:01:27,125 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:01:27,127 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:01:27,127 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:01:27,128 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:01:27,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:01:27,145 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "test-0219_true-valid-memsafety.i_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:27" (1/1) ... [2019-08-05 11:01:27,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "test-0219_true-valid-memsafety.i_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:27" (1/1) ... [2019-08-05 11:01:27,175 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:01:27,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:01:27,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:01:27,176 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:01:27,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "test-0219_true-valid-memsafety.i_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:27" (1/1) ... [2019-08-05 11:01:27,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "test-0219_true-valid-memsafety.i_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:27" (1/1) ... [2019-08-05 11:01:27,211 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "test-0219_true-valid-memsafety.i_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:27" (1/1) ... [2019-08-05 11:01:27,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "test-0219_true-valid-memsafety.i_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:27" (1/1) ... [2019-08-05 11:01:27,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "test-0219_true-valid-memsafety.i_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:27" (1/1) ... [2019-08-05 11:01:27,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "test-0219_true-valid-memsafety.i_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:27" (1/1) ... [2019-08-05 11:01:27,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "test-0219_true-valid-memsafety.i_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:27" (1/1) ... [2019-08-05 11:01:27,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:01:27,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:01:27,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:01:27,256 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:01:27,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "test-0219_true-valid-memsafety.i_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:27" (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 [2019-08-05 11:01:27,336 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:01:27,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:01:27,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:01:27,891 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:01:27,892 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:01:27,893 INFO L202 PluginConnector]: Adding new model test-0219_true-valid-memsafety.i_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:01:27 BoogieIcfgContainer [2019-08-05 11:01:27,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:01:27,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:01:27,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:01:27,898 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:01:27,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-0219_true-valid-memsafety.i_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:27" (1/2) ... [2019-08-05 11:01:27,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bec8375 and model type test-0219_true-valid-memsafety.i_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:01:27, skipping insertion in model container [2019-08-05 11:01:27,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-0219_true-valid-memsafety.i_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:01:27" (2/2) ... [2019-08-05 11:01:27,902 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0219_true-valid-memsafety.i_34.bpl [2019-08-05 11:01:27,912 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:01:27,922 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:01:27,939 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:01:27,971 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:01:27,972 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:01:27,972 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:01:27,972 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:01:27,973 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:01:27,973 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:01:27,973 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:01:27,973 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:01:27,974 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:01:27,988 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 11:01:27,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:01:27,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:27,998 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:01:28,001 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:28,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:28,008 INFO L82 PathProgramCache]: Analyzing trace with hash 893416333, now seen corresponding path program 1 times [2019-08-05 11:01:28,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:28,123 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-08-05 11:01:28,123 INFO L285 seRefinementStrategy]: Strategy FixedRefinementStrategy was unsuccessful and could not determine trace feasibility. [2019-08-05 11:01:28,123 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 11:01:28,153 WARN L226 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-08-05 11:01:28,153 INFO L202 PluginConnector]: Adding new model test-0219_true-valid-memsafety.i_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:01:28 BoogieIcfgContainer [2019-08-05 11:01:28,153 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:01:28,157 INFO L168 Benchmark]: Toolchain (without parser) took 1028.77 ms. Allocated memory is still 140.0 MB. Free memory was 106.9 MB in the beginning and 63.5 MB in the end (delta: 43.4 MB). Peak memory consumption was 43.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:28,158 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 140.0 MB. Free memory was 109.6 MB in the beginning and 109.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:01:28,160 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.01 ms. Allocated memory is still 140.0 MB. Free memory was 106.9 MB in the beginning and 105.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:28,162 INFO L168 Benchmark]: Boogie Preprocessor took 79.09 ms. Allocated memory is still 140.0 MB. Free memory was 105.0 MB in the beginning and 103.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:28,163 INFO L168 Benchmark]: RCFGBuilder took 637.90 ms. Allocated memory is still 140.0 MB. Free memory was 103.0 MB in the beginning and 76.3 MB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:28,165 INFO L168 Benchmark]: TraceAbstraction took 258.55 ms. Allocated memory is still 140.0 MB. Free memory was 76.1 MB in the beginning and 63.5 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:28,169 INFO L335 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.23 ms. Allocated memory is still 140.0 MB. Free memory was 109.6 MB in the beginning and 109.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.01 ms. Allocated memory is still 140.0 MB. Free memory was 106.9 MB in the beginning and 105.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 79.09 ms. Allocated memory is still 140.0 MB. Free memory was 105.0 MB in the beginning and 103.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 637.90 ms. Allocated memory is still 140.0 MB. Free memory was 103.0 MB in the beginning and 76.3 MB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 258.55 ms. Allocated memory is still 140.0 MB. Free memory was 76.1 MB in the beginning and 63.5 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 392]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L113] #NULL.offset, #NULL.base := 0, 0; [L114] #valid := #valid[0 := 0]; [L115] #Ultimate.alloc_old_#valid, #Ultimate.alloc_old_#length := #valid, #length; [L116] #Ultimate.alloc_~size := 4; [L117] havoc #Ultimate.alloc_#res.offset, #Ultimate.alloc_#res.base; [L118] havoc #valid, #length; [L119] assume 0 == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base]; [L120] assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1] == #valid; [L121] assume #Ultimate.alloc_#res.offset == 0; [L122] assume !(0 == #Ultimate.alloc_#res.base); [L123] assume #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size] == #length; [L124] ~#list~0.base, ~#list~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset; [L125] write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset; [L126] 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; [L127] assume 1 == #valid[write~$Pointer$_#ptr.base]; [L128] assume write~$Pointer$_#sizeOfWrittenType + write~$Pointer$_#ptr.offset <= #length[write~$Pointer$_#ptr.base] && 0 <= write~$Pointer$_#ptr.offset; [L129] assume #valid[write~$Pointer$_#ptr.base] == 1; [L130] assume write~$Pointer$_#sizeOfWrittenType + write~$Pointer$_#ptr.offset <= #length[write~$Pointer$_#ptr.base] && 0 <= write~$Pointer$_#ptr.offset; [L131] havoc #memory_$Pointer$.base, #memory_$Pointer$.offset; [L132] 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]]; [L133] main_old_#valid := #valid; [L134] havoc main_#res; [L135] 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; [L136] l1_insert_#in~list.base, l1_insert_#in~list.offset := ~#list~0.base, ~#list~0.offset; [L137] 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; [L138] l1_insert_~list.offset, l1_insert_~list.base := l1_insert_#in~list.offset, l1_insert_#in~list.base; [L139] calloc_model_#in~size, calloc_model_#in~nmemb := 8, 1; [L140] havoc calloc_model_#res.base, calloc_model_#res.offset; [L141] 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; [L142] calloc_model_~nmemb := calloc_model_#in~nmemb; [L143] calloc_model_~size := calloc_model_#in~size; [L144] #Ultimate.alloc_old_#valid, #Ultimate.alloc_old_#length := #valid, #length; [L145] #Ultimate.alloc_~size := calloc_model_~nmemb * calloc_model_~size; [L146] havoc #Ultimate.alloc_#res.offset, #Ultimate.alloc_#res.base; [L147] havoc #valid, #length; [L148] assume 0 == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base]; [L149] assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1]; [L150] assume #Ultimate.alloc_#res.offset == 0; [L151] assume !(0 == #Ultimate.alloc_#res.base); [L152] assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size]; [L153] calloc_model_#t~malloc0.offset, calloc_model_#t~malloc0.base := #Ultimate.alloc_#res.offset, #Ultimate.alloc_#res.base; [L154] calloc_model_~ptr~0.offset, calloc_model_~ptr~0.base := calloc_model_#t~malloc0.offset, calloc_model_#t~malloc0.base; [L155] #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; [L156] assume 1 == #valid[#Ultimate.C_memset_#ptr.base]; [L157] assume 0 <= #Ultimate.C_memset_#ptr.offset && #Ultimate.C_memset_#ptr.offset + #Ultimate.C_memset_#amount <= #length[#Ultimate.C_memset_#ptr.base]; [L158] assume 1 == #valid[#Ultimate.C_memset_#ptr.base]; [L159] assume 0 <= #Ultimate.C_memset_#ptr.offset && #Ultimate.C_memset_#amount + #Ultimate.C_memset_#ptr.offset <= #length[#Ultimate.C_memset_#ptr.base]; [L160] havoc #Ultimate.C_memset_#res.base, #Ultimate.C_memset_#res.offset; [L161] havoc #Ultimate.C_memset_#t~loopctr19; [L162] #Ultimate.C_memset_#t~loopctr19 := 0; [L172] assume !(#Ultimate.C_memset_#t~loopctr19 < #Ultimate.C_memset_#amount); [L173] assume #Ultimate.C_memset_#ptr.offset == #Ultimate.C_memset_#res.offset && #Ultimate.C_memset_#ptr.base == #Ultimate.C_memset_#res.base; [L174] calloc_model_#t~memset1.base, calloc_model_#t~memset1.offset := #Ultimate.C_memset_#res.base, #Ultimate.C_memset_#res.offset; [L175] calloc_model_#res.base, calloc_model_#res.offset := calloc_model_~ptr~0.base, calloc_model_~ptr~0.offset; [L176] havoc calloc_model_#t~memset1.base, calloc_model_#t~memset1.offset; [L177] l1_insert_#t~ret8.offset, l1_insert_#t~ret8.base := calloc_model_#res.offset, calloc_model_#res.base; [L178] l1_insert_~item~1.offset, l1_insert_~item~1.base := l1_insert_#t~ret8.offset, l1_insert_#t~ret8.base; [L179] havoc l1_insert_#t~ret8.offset, l1_insert_#t~ret8.base; [L180] assume !(0 == l1_insert_~item~1.base) || !(0 == l1_insert_~item~1.offset); [L181] l2_insert_#in~list.base, l2_insert_#in~list.offset := l1_insert_~item~1.base, l1_insert_~item~1.offset + 4; [L182] 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; [L183] l2_insert_~list.base, l2_insert_~list.offset := l2_insert_#in~list.base, l2_insert_#in~list.offset; [L184] calloc_model_#in~size, calloc_model_#in~nmemb := 8, 1; [L185] havoc calloc_model_#res.base, calloc_model_#res.offset; [L186] 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; [L187] calloc_model_~nmemb := calloc_model_#in~nmemb; [L188] calloc_model_~size := calloc_model_#in~size; [L189] #Ultimate.alloc_old_#valid, #Ultimate.alloc_old_#length := #valid, #length; [L190] #Ultimate.alloc_~size := calloc_model_~nmemb * calloc_model_~size; [L191] havoc #Ultimate.alloc_#res.offset, #Ultimate.alloc_#res.base; [L192] havoc #valid, #length; [L193] assume 0 == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base]; [L194] assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1]; [L195] assume #Ultimate.alloc_#res.offset == 0; [L196] assume !(0 == #Ultimate.alloc_#res.base); [L197] assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size]; [L198] calloc_model_#t~malloc0.offset, calloc_model_#t~malloc0.base := #Ultimate.alloc_#res.offset, #Ultimate.alloc_#res.base; [L199] calloc_model_~ptr~0.offset, calloc_model_~ptr~0.base := calloc_model_#t~malloc0.offset, calloc_model_#t~malloc0.base; [L200] #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; [L201] assume 1 == #valid[#Ultimate.C_memset_#ptr.base]; [L202] assume #Ultimate.C_memset_#amount + #Ultimate.C_memset_#ptr.offset <= #length[#Ultimate.C_memset_#ptr.base] && 0 <= #Ultimate.C_memset_#ptr.offset; [L203] assume 1 == #valid[#Ultimate.C_memset_#ptr.base]; [L204] assume #Ultimate.C_memset_#ptr.offset + #Ultimate.C_memset_#amount <= #length[#Ultimate.C_memset_#ptr.base] && 0 <= #Ultimate.C_memset_#ptr.offset; [L205] havoc #Ultimate.C_memset_#res.base, #Ultimate.C_memset_#res.offset; [L206] havoc #Ultimate.C_memset_#t~loopctr19; [L207] #Ultimate.C_memset_#t~loopctr19 := 0; [L217] assume !(#Ultimate.C_memset_#t~loopctr19 < #Ultimate.C_memset_#amount); [L218] assume #Ultimate.C_memset_#ptr.base == #Ultimate.C_memset_#res.base && #Ultimate.C_memset_#ptr.offset == #Ultimate.C_memset_#res.offset; [L219] calloc_model_#t~memset1.base, calloc_model_#t~memset1.offset := #Ultimate.C_memset_#res.base, #Ultimate.C_memset_#res.offset; [L220] calloc_model_#res.base, calloc_model_#res.offset := calloc_model_~ptr~0.base, calloc_model_~ptr~0.offset; [L221] havoc calloc_model_#t~memset1.base, calloc_model_#t~memset1.offset; [L222] l2_insert_#t~ret2.offset, l2_insert_#t~ret2.base := calloc_model_#res.offset, calloc_model_#res.base; [L223] l2_insert_~item~0.base, l2_insert_~item~0.offset := l2_insert_#t~ret2.base, l2_insert_#t~ret2.offset; [L224] havoc l2_insert_#t~ret2.offset, l2_insert_#t~ret2.base; [L225] assume !(l2_insert_~item~0.base == 0) || !(l2_insert_~item~0.offset == 0); [L226] #Ultimate.alloc_old_#valid, #Ultimate.alloc_old_#length := #valid, #length; [L227] #Ultimate.alloc_~size := 119; [L228] havoc #Ultimate.alloc_#res.offset, #Ultimate.alloc_#res.base; [L229] havoc #valid, #length; [L230] assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0; [L231] assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1]; [L232] assume 0 == #Ultimate.alloc_#res.offset; [L233] assume !(0 == #Ultimate.alloc_#res.base); [L234] assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size]; [L235] l2_insert_#t~malloc3.base, l2_insert_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset; [L236] write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset; [L237] 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; [L238] assume 1 == #valid[write~$Pointer$_#ptr.base]; [L239] assume 0 <= write~$Pointer$_#ptr.offset && write~$Pointer$_#ptr.offset + write~$Pointer$_#sizeOfWrittenType <= #length[write~$Pointer$_#ptr.base]; [L240] assume 1 == #valid[write~$Pointer$_#ptr.base]; [L241] assume write~$Pointer$_#ptr.offset + write~$Pointer$_#sizeOfWrittenType <= #length[write~$Pointer$_#ptr.base] && 0 <= write~$Pointer$_#ptr.offset; [L242] havoc #memory_$Pointer$.base, #memory_$Pointer$.offset; [L243] 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]]; [L244] read~$Pointer$_#ptr.base, read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset := l2_insert_~item~0.base, 4, l2_insert_~item~0.offset; [L245] assume #valid[read~$Pointer$_#ptr.base] == 1; [L246] assume 0 <= read~$Pointer$_#ptr.offset && read~$Pointer$_#sizeOfReadType + read~$Pointer$_#ptr.offset <= #length[read~$Pointer$_#ptr.base]; [L247] assume 1 == #valid[read~$Pointer$_#ptr.base]; [L248] assume 0 <= read~$Pointer$_#ptr.offset && read~$Pointer$_#sizeOfReadType + read~$Pointer$_#ptr.offset <= #length[read~$Pointer$_#ptr.base]; [L249] havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset; [L250] 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; [L251] l2_insert_#t~mem4.offset, l2_insert_#t~mem4.base := read~$Pointer$_#value.offset, read~$Pointer$_#value.base; [L252] assume !(0 == l2_insert_#t~mem4.base) || !(0 == l2_insert_#t~mem4.offset); [L253] havoc l2_insert_#t~mem4.offset, l2_insert_#t~mem4.base; [L254] read~$Pointer$_#ptr.base, read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset := l2_insert_~list.base, 4, l2_insert_~list.offset; [L255] assume 1 == #valid[read~$Pointer$_#ptr.base]; [L256] assume 0 <= read~$Pointer$_#ptr.offset && read~$Pointer$_#ptr.offset + read~$Pointer$_#sizeOfReadType <= #length[read~$Pointer$_#ptr.base]; [L257] assume #valid[read~$Pointer$_#ptr.base] == 1; [L258] assume 0 <= read~$Pointer$_#ptr.offset && read~$Pointer$_#ptr.offset + read~$Pointer$_#sizeOfReadType <= #length[read~$Pointer$_#ptr.base]; [L259] havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset; [L260] assume #memory_$Pointer$.base[read~$Pointer$_#ptr.base][read~$Pointer$_#ptr.offset] == read~$Pointer$_#value.base && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base][read~$Pointer$_#ptr.offset]; [L261] l2_insert_#t~mem5.offset, l2_insert_#t~mem5.base := read~$Pointer$_#value.offset, read~$Pointer$_#value.base; [L262] write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset; [L263] write~$Pointer$_#value.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base := l2_insert_#t~mem5.base, l2_insert_~item~0.offset + 4, 4, l2_insert_#t~mem5.offset, l2_insert_~item~0.base; [L264] assume 1 == #valid[write~$Pointer$_#ptr.base]; [L265] assume 0 <= write~$Pointer$_#ptr.offset && write~$Pointer$_#ptr.offset + write~$Pointer$_#sizeOfWrittenType <= #length[write~$Pointer$_#ptr.base]; [L266] assume 1 == #valid[write~$Pointer$_#ptr.base]; [L267] assume write~$Pointer$_#sizeOfWrittenType + write~$Pointer$_#ptr.offset <= #length[write~$Pointer$_#ptr.base] && 0 <= write~$Pointer$_#ptr.offset; [L268] havoc #memory_$Pointer$.base, #memory_$Pointer$.offset; [L269] 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 && 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]] == #memory_$Pointer$.base; [L270] havoc l2_insert_#t~mem5.offset, l2_insert_#t~mem5.base; [L271] write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset; [L272] write~$Pointer$_#value.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base := l2_insert_~item~0.base, l2_insert_~list.offset, 4, l2_insert_~item~0.offset, l2_insert_~list.base; [L273] assume #valid[write~$Pointer$_#ptr.base] == 1; [L274] assume 0 <= write~$Pointer$_#ptr.offset && write~$Pointer$_#sizeOfWrittenType + write~$Pointer$_#ptr.offset <= #length[write~$Pointer$_#ptr.base]; [L275] assume #valid[write~$Pointer$_#ptr.base] == 1; [L276] assume 0 <= write~$Pointer$_#ptr.offset && write~$Pointer$_#sizeOfWrittenType + write~$Pointer$_#ptr.offset <= #length[write~$Pointer$_#ptr.base]; [L277] havoc #memory_$Pointer$.base, #memory_$Pointer$.offset; [L278] 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 && 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]] == #memory_$Pointer$.base; [L279] assume 0 <= l1_insert_#t~nondet9 + 2147483648 && l1_insert_#t~nondet9 <= 2147483647; [L280] assume 0 == l1_insert_#t~nondet9; [L281] havoc l1_insert_#t~nondet9; [L282] read~$Pointer$_#ptr.base, read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset := l1_insert_~list.base, 4, l1_insert_~list.offset; [L283] assume 1 == #valid[read~$Pointer$_#ptr.base]; [L284] assume 0 <= read~$Pointer$_#ptr.offset && read~$Pointer$_#ptr.offset + read~$Pointer$_#sizeOfReadType <= #length[read~$Pointer$_#ptr.base]; [L285] assume 1 == #valid[read~$Pointer$_#ptr.base]; [L286] assume read~$Pointer$_#sizeOfReadType + read~$Pointer$_#ptr.offset <= #length[read~$Pointer$_#ptr.base] && 0 <= read~$Pointer$_#ptr.offset; [L287] havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset; [L288] assume #memory_$Pointer$.base[read~$Pointer$_#ptr.base][read~$Pointer$_#ptr.offset] == read~$Pointer$_#value.base && read~$Pointer$_#value.offset == #memory_$Pointer$.offset[read~$Pointer$_#ptr.base][read~$Pointer$_#ptr.offset]; [L289] l1_insert_#t~mem10.base, l1_insert_#t~mem10.offset := read~$Pointer$_#value.base, read~$Pointer$_#value.offset; [L290] write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset; [L291] write~$Pointer$_#value.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base := l1_insert_#t~mem10.base, l1_insert_~item~1.offset, 4, l1_insert_#t~mem10.offset, l1_insert_~item~1.base; [L292] assume #valid[write~$Pointer$_#ptr.base] == 1; [L293] assume write~$Pointer$_#ptr.offset + write~$Pointer$_#sizeOfWrittenType <= #length[write~$Pointer$_#ptr.base] && 0 <= write~$Pointer$_#ptr.offset; [L294] assume #valid[write~$Pointer$_#ptr.base] == 1; [L295] assume write~$Pointer$_#ptr.offset + write~$Pointer$_#sizeOfWrittenType <= #length[write~$Pointer$_#ptr.base] && 0 <= write~$Pointer$_#ptr.offset; [L296] havoc #memory_$Pointer$.base, #memory_$Pointer$.offset; [L297] 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]]; [L298] havoc l1_insert_#t~mem10.base, l1_insert_#t~mem10.offset; [L299] write~$Pointer$_old_#memory_$Pointer$.base, write~$Pointer$_old_#memory_$Pointer$.offset := #memory_$Pointer$.base, #memory_$Pointer$.offset; [L300] write~$Pointer$_#value.base, write~$Pointer$_#ptr.offset, write~$Pointer$_#sizeOfWrittenType, write~$Pointer$_#value.offset, write~$Pointer$_#ptr.base := l1_insert_~item~1.base, l1_insert_~list.offset, 4, l1_insert_~item~1.offset, l1_insert_~list.base; [L301] assume 1 == #valid[write~$Pointer$_#ptr.base]; [L302] assume 0 <= write~$Pointer$_#ptr.offset && write~$Pointer$_#ptr.offset + write~$Pointer$_#sizeOfWrittenType <= #length[write~$Pointer$_#ptr.base]; [L303] assume #valid[write~$Pointer$_#ptr.base] == 1; [L304] assume write~$Pointer$_#ptr.offset + write~$Pointer$_#sizeOfWrittenType <= #length[write~$Pointer$_#ptr.base] && 0 <= write~$Pointer$_#ptr.offset; [L305] havoc #memory_$Pointer$.base, #memory_$Pointer$.offset; [L306] 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]]; [L307] assume 0 <= main_#t~nondet11 + 2147483648 && main_#t~nondet11 <= 2147483647; [L308] assume main_#t~nondet11 == 0; [L309] havoc main_#t~nondet11; [L310] read~$Pointer$_#ptr.base, read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset := ~#list~0.base, 4, ~#list~0.offset; [L311] assume #valid[read~$Pointer$_#ptr.base] == 1; [L312] assume read~$Pointer$_#sizeOfReadType + read~$Pointer$_#ptr.offset <= #length[read~$Pointer$_#ptr.base] && 0 <= read~$Pointer$_#ptr.offset; [L313] assume #valid[read~$Pointer$_#ptr.base] == 1; [L314] assume 0 <= read~$Pointer$_#ptr.offset && read~$Pointer$_#ptr.offset + read~$Pointer$_#sizeOfReadType <= #length[read~$Pointer$_#ptr.base]; [L315] havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset; [L316] assume #memory_$Pointer$.offset[read~$Pointer$_#ptr.base][read~$Pointer$_#ptr.offset] == read~$Pointer$_#value.offset && read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base][read~$Pointer$_#ptr.offset]; [L317] main_#t~mem12.offset, main_#t~mem12.base := read~$Pointer$_#value.offset, read~$Pointer$_#value.base; [L318] read~$Pointer$_#ptr.base, read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset := main_#t~mem12.base, 4, main_#t~mem12.offset; [L319] assume #valid[read~$Pointer$_#ptr.base] == 1; [L320] assume 0 <= read~$Pointer$_#ptr.offset && read~$Pointer$_#sizeOfReadType + read~$Pointer$_#ptr.offset <= #length[read~$Pointer$_#ptr.base]; [L321] assume 1 == #valid[read~$Pointer$_#ptr.base]; [L322] assume 0 <= read~$Pointer$_#ptr.offset && read~$Pointer$_#ptr.offset + read~$Pointer$_#sizeOfReadType <= #length[read~$Pointer$_#ptr.base]; [L323] havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset; [L324] assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base][read~$Pointer$_#ptr.offset] && #memory_$Pointer$.offset[read~$Pointer$_#ptr.base][read~$Pointer$_#ptr.offset] == read~$Pointer$_#value.offset; [L325] main_#t~mem13.offset, main_#t~mem13.base := read~$Pointer$_#value.offset, read~$Pointer$_#value.base; [L326] main_~next~1.offset, main_~next~1.base := main_#t~mem13.offset, main_#t~mem13.base; [L327] havoc main_#t~mem12.offset, main_#t~mem12.base; [L328] havoc main_#t~mem13.offset, main_#t~mem13.base; [L329] read~$Pointer$_#ptr.base, read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset := ~#list~0.base, 4, ~#list~0.offset; [L330] assume #valid[read~$Pointer$_#ptr.base] == 1; [L331] assume 0 <= read~$Pointer$_#ptr.offset && read~$Pointer$_#sizeOfReadType + read~$Pointer$_#ptr.offset <= #length[read~$Pointer$_#ptr.base]; [L332] assume #valid[read~$Pointer$_#ptr.base] == 1; [L333] assume read~$Pointer$_#sizeOfReadType + read~$Pointer$_#ptr.offset <= #length[read~$Pointer$_#ptr.base] && 0 <= read~$Pointer$_#ptr.offset; [L334] havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset; [L335] assume read~$Pointer$_#value.base == #memory_$Pointer$.base[read~$Pointer$_#ptr.base][read~$Pointer$_#ptr.offset] && #memory_$Pointer$.offset[read~$Pointer$_#ptr.base][read~$Pointer$_#ptr.offset] == read~$Pointer$_#value.offset; [L336] main_#t~mem14.offset, main_#t~mem14.base := read~$Pointer$_#value.offset, read~$Pointer$_#value.base; [L337] read~$Pointer$_#ptr.base, read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset := main_#t~mem14.base, 4, main_#t~mem14.offset + 4; [L338] assume #valid[read~$Pointer$_#ptr.base] == 1; [L339] assume 0 <= read~$Pointer$_#ptr.offset && read~$Pointer$_#sizeOfReadType + read~$Pointer$_#ptr.offset <= #length[read~$Pointer$_#ptr.base]; [L340] assume 1 == #valid[read~$Pointer$_#ptr.base]; [L341] assume 0 <= read~$Pointer$_#ptr.offset && read~$Pointer$_#sizeOfReadType + read~$Pointer$_#ptr.offset <= #length[read~$Pointer$_#ptr.base]; [L342] havoc read~$Pointer$_#value.base, read~$Pointer$_#value.offset; [L343] assume #memory_$Pointer$.offset[read~$Pointer$_#ptr.base][read~$Pointer$_#ptr.offset] == read~$Pointer$_#value.offset && #memory_$Pointer$.base[read~$Pointer$_#ptr.base][read~$Pointer$_#ptr.offset] == read~$Pointer$_#value.base; [L344] main_#t~mem15.offset, main_#t~mem15.base := read~$Pointer$_#value.offset, read~$Pointer$_#value.base; [L345] l2_destroy_#in~list.offset, l2_destroy_#in~list.base := main_#t~mem15.offset, main_#t~mem15.base; [L346] havoc l2_destroy_~next~0.offset, l2_destroy_#t~mem7.offset, l2_destroy_~list.offset, l2_destroy_~next~0.base, l2_destroy_#t~mem6.base, l2_destroy_#t~mem6.offset, l2_destroy_#t~mem7.base, l2_destroy_~list.base; [L347] l2_destroy_~list.offset, l2_destroy_~list.base := l2_destroy_#in~list.offset, l2_destroy_#in~list.base; [L350] read~$Pointer$_#ptr.base, read~$Pointer$_#sizeOfReadType, read~$Pointer$_#ptr.offset := l2_destroy_~list.base, 4, l2_destroy_~list.offset + 4; [L355] assume !(1 == #valid[read~$Pointer$_#ptr.base]); [L392] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. UNKNOWN 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=8occurred 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 Received shutdown request...