java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --rcfgbuilder.size.of.a.code.block SingleStatement -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1c58c86 [2019-05-15 10:29:33,985 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-05-15 10:29:33,987 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-05-15 10:29:34,005 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-15 10:29:34,006 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-05-15 10:29:34,008 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-15 10:29:34,009 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-05-15 10:29:34,011 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-05-15 10:29:34,014 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-05-15 10:29:34,015 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-05-15 10:29:34,016 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-05-15 10:29:34,018 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-05-15 10:29:34,019 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-05-15 10:29:34,022 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-05-15 10:29:34,029 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-05-15 10:29:34,030 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-15 10:29:34,030 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-05-15 10:29:34,035 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-15 10:29:34,040 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-05-15 10:29:34,041 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-05-15 10:29:34,044 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-05-15 10:29:34,048 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-05-15 10:29:34,051 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-15 10:29:34,051 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-15 10:29:34,052 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-05-15 10:29:34,053 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-05-15 10:29:34,055 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-05-15 10:29:34,056 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-05-15 10:29:34,056 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-05-15 10:29:34,057 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-05-15 10:29:34,057 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-05-15 10:29:34,058 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-05-15 10:29:34,059 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-15 10:29:34,059 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-05-15 10:29:34,060 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-05-15 10:29:34,060 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-05-15 10:29:34,060 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-05-15 10:29:34,061 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-05-15 10:29:34,062 INFO L181 SettingsManager]: Finished resetting all preferences to default values... Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement [2019-05-15 10:29:34,105 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-05-15 10:29:34,116 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-15 10:29:34,120 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-05-15 10:29:34,121 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-05-15 10:29:34,122 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-05-15 10:29:34,122 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-limited.bpl [2019-05-15 10:29:34,123 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-limited.bpl' [2019-05-15 10:29:34,167 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-05-15 10:29:34,169 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-05-15 10:29:34,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-15 10:29:34,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-05-15 10:29:34,170 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-05-15 10:29:34,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:29:34" (1/1) ... [2019-05-15 10:29:34,199 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:29:34" (1/1) ... [2019-05-15 10:29:34,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-15 10:29:34,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-05-15 10:29:34,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-05-15 10:29:34,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-05-15 10:29:34,236 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:29:34" (1/1) ... [2019-05-15 10:29:34,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:29:34" (1/1) ... [2019-05-15 10:29:34,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:29:34" (1/1) ... [2019-05-15 10:29:34,238 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:29:34" (1/1) ... [2019-05-15 10:29:34,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:29:34" (1/1) ... [2019-05-15 10:29:34,246 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:29:34" (1/1) ... [2019-05-15 10:29:34,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:29:34" (1/1) ... [2019-05-15 10:29:34,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-15 10:29:34,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-05-15 10:29:34,250 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-05-15 10:29:34,250 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-05-15 10:29:34,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:29:34" (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-05-15 10:29:34,327 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-05-15 10:29:34,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-05-15 10:29:34,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-05-15 10:29:34,949 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-05-15 10:29:34,949 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-05-15 10:29:34,950 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:29:34 BoogieIcfgContainer [2019-05-15 10:29:34,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-05-15 10:29:34,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-05-15 10:29:34,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-05-15 10:29:34,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-05-15 10:29:34,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:29:34" (1/2) ... [2019-05-15 10:29:34,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694b3b37 and model type speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.05 10:29:34, skipping insertion in model container [2019-05-15 10:29:34,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:29:34" (2/2) ... [2019-05-15 10:29:34,959 INFO L109 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-6-limited.bpl [2019-05-15 10:29:34,969 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-15 10:29:34,977 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-05-15 10:29:34,994 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-05-15 10:29:35,020 INFO L127 ementStrategyFactory]: Using default assertion order modulation [2019-05-15 10:29:35,021 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-05-15 10:29:35,021 INFO L378 AbstractCegarLoop]: Hoare is false [2019-05-15 10:29:35,021 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-05-15 10:29:35,021 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-05-15 10:29:35,021 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-05-15 10:29:35,021 INFO L382 AbstractCegarLoop]: Difference is false [2019-05-15 10:29:35,022 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-05-15 10:29:35,022 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-15 10:29:35,036 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-05-15 10:29:35,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-05-15 10:29:35,045 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:29:35,046 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-05-15 10:29:35,053 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:29:35,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:29:35,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1597552734, now seen corresponding path program 1 times [2019-05-15 10:29:35,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:29:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:35,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 12 conjunts are in the unsatisfiable core [2019-05-15 10:29:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:29:35,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:29:36,007 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-05-15 10:29:36,008 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:36,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:36,043 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-05-15 10:29:36,043 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2019-05-15 10:29:36,047 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:36,047 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_37|]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (store |v_#memory_int_37| ULTIMATE.start_main_p1 0) |#memory_int|) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2019-05-15 10:29:36,048 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ []. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2019-05-15 10:29:36,270 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-05-15 10:29:36,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:36,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-05-15 10:29:36,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:36,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:36,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-05-15 10:29:36,402 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:26 [2019-05-15 10:29:36,419 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:36,420 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_38|, ULTIMATE.start_main_p2]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (store |v_#memory_int_38| ULTIMATE.start_main_p2 0) |#memory_int|) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= 0 (select |v_#memory_int_38| ULTIMATE.start_main_p1)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2019-05-15 10:29:36,420 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2019-05-15 10:29:36,707 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-05-15 10:29:36,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:36,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:36,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:36,892 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2019-05-15 10:29:36,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:36,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:36,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-05-15 10:29:36,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:31 [2019-05-15 10:29:36,931 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:36,931 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_39|, ULTIMATE.start_main_p3, ULTIMATE.start_main_p2]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |v_#memory_int_39| ULTIMATE.start_main_p2) 0) (= (store |v_#memory_int_39| ULTIMATE.start_main_p3 0) |#memory_int|) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= (select |v_#memory_int_39| ULTIMATE.start_main_p1) 0)) [2019-05-15 10:29:36,932 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p2]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2019-05-15 10:29:37,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2019-05-15 10:29:37,190 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:37,220 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-05-15 10:29:37,221 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:36 [2019-05-15 10:29:37,230 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:37,231 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_40|, ULTIMATE.start_main_p4, ULTIMATE.start_main_p3, ULTIMATE.start_main_p2]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |v_#memory_int_40| ULTIMATE.start_main_p3) 0) (= (select |v_#memory_int_40| ULTIMATE.start_main_p2) 0) (= (store |v_#memory_int_40| ULTIMATE.start_main_p4 0) |#memory_int|) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |v_#memory_int_40| ULTIMATE.start_main_p1) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2019-05-15 10:29:37,231 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p2]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2019-05-15 10:29:37,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,392 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-05-15 10:29:37,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:37,491 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-05-15 10:29:37,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:42, output treesize:41 [2019-05-15 10:29:37,507 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:37,507 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_41|, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p2]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |v_#memory_int_41| ULTIMATE.start_main_p2)) (= (select |v_#memory_int_41| ULTIMATE.start_main_p3) 0) (= (select |v_#memory_int_41| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= (store |v_#memory_int_41| ULTIMATE.start_main_p5 0) |#memory_int|) (= (select |v_#memory_int_41| ULTIMATE.start_main_p1) 0)) [2019-05-15 10:29:37,508 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p2]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2019-05-15 10:29:37,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,864 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-05-15 10:29:37,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2019-05-15 10:29:37,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-05-15 10:29:37,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-05-15 10:29:38,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-05-15 10:29:38,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:47, output treesize:46 [2019-05-15 10:29:39,280 WARN L402 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-05-15 10:29:39,280 WARN L403 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_42|, ULTIMATE.start_main_p6, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p2, ULTIMATE.start_main_p5]. (and (= (select |v_#memory_int_42| ULTIMATE.start_main_p1) 0) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |v_#memory_int_42| ULTIMATE.start_main_p3) 0) (= (select |v_#memory_int_42| ULTIMATE.start_main_p2) 0) (= |#memory_int| (store |v_#memory_int_42| ULTIMATE.start_main_p6 0)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= (select |v_#memory_int_42| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= (select |v_#memory_int_42| ULTIMATE.start_main_p5) 0)) [2019-05-15 10:29:39,280 WARN L404 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p2, ULTIMATE.start_main_p6]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-05-15 10:29:39,730 INFO L273 TraceCheckUtils]: 0: Hoare triple {35#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6; {35#true} is VALID [2019-05-15 10:29:39,733 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} SUMMARY for call main_p1 := malloc(); srcloc: L17 {35#true} is VALID [2019-05-15 10:29:39,734 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} SUMMARY for call main_p2 := malloc(); srcloc: L17-1 {35#true} is VALID [2019-05-15 10:29:39,734 INFO L273 TraceCheckUtils]: 3: Hoare triple {35#true} SUMMARY for call main_p3 := malloc(); srcloc: L18 {35#true} is VALID [2019-05-15 10:29:39,735 INFO L273 TraceCheckUtils]: 4: Hoare triple {35#true} SUMMARY for call main_p4 := malloc(); srcloc: L19 {35#true} is VALID [2019-05-15 10:29:39,735 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} SUMMARY for call main_p5 := malloc(); srcloc: L20 {35#true} is VALID [2019-05-15 10:29:39,735 INFO L273 TraceCheckUtils]: 6: Hoare triple {35#true} SUMMARY for call main_p6 := malloc(); srcloc: L21 {35#true} is VALID [2019-05-15 10:29:39,741 INFO L273 TraceCheckUtils]: 7: Hoare triple {35#true} assume main_p1 < main_p2; {61#(< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)} is VALID [2019-05-15 10:29:39,742 INFO L273 TraceCheckUtils]: 8: Hoare triple {61#(< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)} assume main_p2 < main_p3; {65#(and (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} is VALID [2019-05-15 10:29:39,743 INFO L273 TraceCheckUtils]: 9: Hoare triple {65#(and (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} assume main_p3 < main_p4; {69#(and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} is VALID [2019-05-15 10:29:39,743 INFO L273 TraceCheckUtils]: 10: Hoare triple {69#(and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} assume main_p4 < main_p5; {73#(and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} is VALID [2019-05-15 10:29:39,744 INFO L273 TraceCheckUtils]: 11: Hoare triple {73#(and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} assume main_p5 < main_p6; {77#(and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} is VALID [2019-05-15 10:29:39,749 INFO L273 TraceCheckUtils]: 12: Hoare triple {77#(and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} #memory_int := #memory_int[main_p1 := 0]; {81#(and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} is VALID [2019-05-15 10:29:39,766 INFO L273 TraceCheckUtils]: 13: Hoare triple {81#(and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} #memory_int := #memory_int[main_p2 := 0]; {85#(and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (exists ((ULTIMATE.start_main_p2 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5))} is VALID [2019-05-15 10:29:39,768 INFO L273 TraceCheckUtils]: 14: Hoare triple {85#(and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (exists ((ULTIMATE.start_main_p2 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5))} #memory_int := #memory_int[main_p3 := 0]; {89#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5))} is VALID [2019-05-15 10:29:39,772 INFO L273 TraceCheckUtils]: 15: Hoare triple {89#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5))} #memory_int := #memory_int[main_p4 := 0]; {93#(and (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6))} is VALID [2019-05-15 10:29:39,781 INFO L273 TraceCheckUtils]: 16: Hoare triple {93#(and (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6))} #memory_int := #memory_int[main_p5 := 0]; {97#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))))} is VALID [2019-05-15 10:29:39,864 INFO L273 TraceCheckUtils]: 17: Hoare triple {97#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))))} #memory_int := #memory_int[main_p6 := 0]; {101#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} is VALID [2019-05-15 10:29:39,865 INFO L273 TraceCheckUtils]: 18: Hoare triple {101#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} assume !(#memory_int[main_p1] >= 0); {36#false} is VALID [2019-05-15 10:29:39,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:29:39,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:29:39,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-05-15 10:29:39,878 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2019-05-15 10:29:39,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:29:39,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2019-05-15 10:29:40,012 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:29:40,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-05-15 10:29:40,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-05-15 10:29:40,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-05-15 10:29:40,024 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 13 states. [2019-05-15 10:29:50,736 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-05-15 10:30:04,500 WARN L193 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2019-05-15 10:30:04,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-05-15 10:30:04,502 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:207) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:224) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:118) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:178) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:159) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:696) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:625) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:467) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:204) ... 50 more [2019-05-15 10:30:04,507 INFO L168 Benchmark]: Toolchain (without parser) took 30338.98 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 112.7 MB in the beginning and 59.5 MB in the end (delta: 53.1 MB). Peak memory consumption was 116.0 MB. Max. memory is 7.1 GB. [2019-05-15 10:30:04,509 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 135.3 MB. Free memory is still 114.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:30:04,510 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.70 ms. Allocated memory is still 135.3 MB. Free memory was 112.5 MB in the beginning and 110.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-05-15 10:30:04,511 INFO L168 Benchmark]: Boogie Preprocessor took 25.00 ms. Allocated memory is still 135.3 MB. Free memory was 110.2 MB in the beginning and 109.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-05-15 10:30:04,511 INFO L168 Benchmark]: RCFGBuilder took 700.39 ms. Allocated memory is still 135.3 MB. Free memory was 109.1 MB in the beginning and 89.5 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. [2019-05-15 10:30:04,512 INFO L168 Benchmark]: TraceAbstraction took 29553.73 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 89.1 MB in the beginning and 59.5 MB in the end (delta: 29.6 MB). Peak memory consumption was 92.5 MB. Max. memory is 7.1 GB. [2019-05-15 10:30:04,519 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 135.3 MB. Free memory is still 114.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.70 ms. Allocated memory is still 135.3 MB. Free memory was 112.5 MB in the beginning and 110.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.00 ms. Allocated memory is still 135.3 MB. Free memory was 110.2 MB in the beginning and 109.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 700.39 ms. Allocated memory is still 135.3 MB. Free memory was 109.1 MB in the beginning and 89.5 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29553.73 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 89.1 MB in the beginning and 59.5 MB in the end (delta: 29.6 MB). Peak memory consumption was 92.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:207) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...