env GraphEmpireOG.Timeout=-1 benchexec/../run-test.sh Library-ProofsTest 'de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG' NoDataRace.36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.ats true -------------------------------------------------------------------------------- Thanks for using JUnit! Support its development at https://junit.org/sponsoring Test plan execution started. Number of static tests: 1 ╷ ├─ JUnit Jupiter └─ JUnit Jupiter finished after 6 ms. ├─ JUnit Vintage │ ├─ GraphEmpireOG │ │ ├─ NoDataRace_36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow_ats │ │ │ tags: [] │ │ │ uniqueId: [engine:junit-vintage]/[runner:de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG]/[test:NoDataRace_36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow_ats(de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG)] │ │ │ parent: [engine:junit-vintage]/[runner:de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG] │ │ │ source: ClassSource [className = 'de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG', filePosition = null] [WARN]: Using environment timeout: -1ms [INFO]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/adds/z3 [INFO]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/adds/z3 SMTLIB2_COMPLIANT=true -t:1000 -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) [INFO]: [MP /storage/repos/ultimate/releaseScripts/default/adds/z3 SMTLIB2_COMPLIANT=true -t:1000 -memory:2024 -smt2 -in (1)] Waiting until timeout for monitored process [INFO]: Initialized classic predicate unifier [INFO]: Initialized classic predicate unifier [INFO]: Initialized classic predicate unifier [INFO]: Initialized classic predicate unifier [INFO]: Initialized classic predicate unifier [INFO]: Initialized classic predicate unifier [INFO]: Initialized classic predicate unifier [INFO]: Initialized classic predicate unifier [INFO]: Initialized classic predicate unifier [INFO]: Initialized classic predicate unifier [INFO]: Initialized classic predicate unifier [INFO]: Initialized classic predicate unifier [INFO]: Initialized classic predicate unifier [INFO]: Start isDeterministic. Operand 3 states and 643 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [INFO]: Floyd-Hoare annotation has 643 edges. 643 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 634 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [INFO]: Floyd-Hoare annotation has 634 edges. 634 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 646 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [INFO]: Floyd-Hoare annotation has 646 edges. 646 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 644 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [INFO]: Floyd-Hoare annotation has 644 edges. 644 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 5 states and 1026 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 5 states, 5 states have (on average 205.2) internal successors, (1026), 5 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [INFO]: Floyd-Hoare annotation has 1026 edges. 1026 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 618 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [INFO]: Floyd-Hoare annotation has 618 edges. 618 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 617 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 205.66666666666666) internal successors, (617), 3 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [INFO]: Floyd-Hoare annotation has 617 edges. 617 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 625 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [INFO]: Floyd-Hoare annotation has 625 edges. 625 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 631 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [INFO]: Floyd-Hoare annotation has 631 edges. 631 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 636 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [INFO]: Floyd-Hoare annotation has 636 edges. 636 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 5 states and 1026 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 5 states, 5 states have (on average 205.2) internal successors, (1026), 5 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [INFO]: Floyd-Hoare annotation has 1026 edges. 1026 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 5 states and 1024 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 5 states, 5 states have (on average 204.8) internal successors, (1024), 5 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [INFO]: Floyd-Hoare annotation has 1024 edges. 1024 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 6 states and 1187 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 6 states, 6 states have (on average 197.83333333333334) internal successors, (1187), 6 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [INFO]: Floyd-Hoare annotation has 1187 edges. 1187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Number of proof automata: 13 [INFO]: 203 / 237 letters are loopers in proof 0 [INFO]: 207 / 237 letters are loopers in proof 1 [INFO]: 217 / 237 letters are loopers in proof 2 [INFO]: 216 / 237 letters are loopers in proof 3 [INFO]: 197 / 237 letters are loopers in proof 4 [INFO]: 200 / 237 letters are loopers in proof 5 [INFO]: 200 / 237 letters are loopers in proof 6 [INFO]: 203 / 237 letters are loopers in proof 7 [INFO]: 207 / 237 letters are loopers in proof 8 [INFO]: 211 / 237 letters are loopers in proof 9 [INFO]: 197 / 237 letters are loopers in proof 10 [INFO]: 197 / 237 letters are loopers in proof 11 [INFO]: 191 / 237 letters are loopers in proof 12 [INFO]: Loopers in proof automata: min=191, max=217, median=203 [INFO]: Start finitePrefix. Operand will be constructed on-demand [INFO]: 36/835 cut-off events. [INFO]: For 3008/3106 co-relation queries the response was YES. [INFO]: Finished finitePrefix Result has 2029 conditions, 835 events. 36/835 cut-off events. For 3008/3106 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3461 event pairs, 17 based on Foata normal form. 36/830 useless extension candidates. Maximal degree in co-relation 1888. Up to 116 conditions per place. [INFO]: OwickiGriesTestSuite setup time: 3324ms [INFO]: Constructing Owicki-Gries proof for Petri program that has 229 places, 237 transitions, 478 flow. [INFO]: Computed Owicki-Gries annotation with 38 ghost variables, 56 ghost updates, and overall size 122503 [WARN]: Non-inductive transition [153][27]. Invalid Hoare triple: precondition (and (not |v_[l134, l158]_1|) (not |v_[l171, l57, l5]_1|) (not |v_[l71, l30, l195, l225]_1|) (not |v_[l156]_1|) (not |v_[l145, l63, l147]_1|) (not |v_[l224, l189]_1|) (not |v_[l18, l4, l61, l68]_1|) (not |v_[l35, l70]_1|) (not |v_[l107]_1|) (not |v_[l85, l42, l112, l169]_1|) (not (= 3 |~#C~0.base|)) (not |v_[l142, l117, l207, l116, l178, l3, l191, l81, l37, l181, l16]_1|) (not |v_[l10, l2]_1|) (= 3 |~#A~0.base|) (not |v_[l1, l150]_1|) (not |v_[l121, l51]_1|) (not |v_[l164]_1|) (not |v_[l60, l36]_1|) (not |v_[l31, l114, l217, l190, l6, l152, l214, l26, l48, l84, l32]_1|) (not |v_[l184, l39]_1|) (not |v_[l109]_1|) |v_[l204, l102, l222, l103, l163, l111, l110, l87, l108, l13, l218, l196, l40, l119, l143, l123, l198, l75, l24, l46, l172, l175]_1| (not |v_[l95, l72, l151, l161, l64, l165, l132]_1|) (not |v_[l224, l52, l159, l189]_1|) (not |v_[l159, l52]_1|) (not (= |~#C~0.base| 4)) (not |v_[l221, l50, l209, l126, l192, l82, l129, l180, l9, l154, l90, l92]_1|) (not |v_[l197, l219, l176, l223, l208, l74, l22, l58, l83, l11, l89, l133]_1|) (= |~#B~0.base| 4) |v_[l105]_1| (not |v_[l135, l34, l33, l212, l166, l216, l120, l194, l122, l41, l124, l118, l127, l183, l49, l66, l94, l205, l220, l99, l101, l104, l7, l12, l146, l76, l25, l149]_1|) (not |v_[l67, l91, l139, l113]_1|) (not |v_[l137, l136, l139, l162, l8, l227, l157, l113, l17, l21, l125, l148, l45, l62, l77, l67, l173, l69]_1|) (not |v_[l213, l115]_1|) (not |v_[l185, l106, l153]_1|) (not |v_[l97]_1|) (not |v_[l177, l179, l170, l38, l56, l80, l55, l210, l59, l211, l168, l193, l47, l186, l203, l93, l187, l202, l0, l98, l206, l160, l155, l140, l144, l73, l29]_1|) (not |v_[l23, l44]_1|) (not |v_[l131, l43, l79]_1|) (not |v_[l167, l53, l88]_1|) (not |v_[l19, l54, l138, l20, l128, l130, l200]_1|)) transition Formula: (and (not |v_v_[l105]_1_2|) (= v_t_funThread1of1ForFork0_thidvar1_1 0) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_1| 0) (= |v_t_funThread1of1ForFork0_#in~arg#1.offset_1| 0) (= v_t_funThread1of1ForFork0_thidvar0_1 |v_ULTIMATE.start_main_#t~pre13#1_1|) |v_v_[l107]_1_4| |v_v_[l137, l136, l139, l162, l8, l227, l157, l113, l17, l21, l125, l148, l45, l62, l77, l67, l173, l69]_1_2| (not |v_v_[l204, l102, l222, l103, l163, l111, l110, l87, l108, l13, l218, l196, l40, l119, l143, l123, l198, l75, l24, l46, l172, l175]_1_6|) |v_v_[l167, l53, l88]_1_2|) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|} OutVars{t_funThread1of1ForFork0_reach_error_#t~nondet0#1.base=|v_t_funThread1of1ForFork0_reach_error_#t~nondet0#1.base_1|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_1|, t_funThread1of1ForFork0_plus_#in~b#1=|v_t_funThread1of1ForFork0_plus_#in~b#1_1|, t_funThread1of1ForFork0_#t~ret10#1=|v_t_funThread1of1ForFork0_#t~ret10#1_1|, t_funThread1of1ForFork0_~z~0#1=|v_t_funThread1of1ForFork0_~z~0#1_1|, v_[l137, l136, l139, l162, l8, l227, l157, l113, l17, l21, l125, l148, l45, l62, l77, l67, l173, l69]_1=|v_v_[l137, l136, l139, l162, l8, l227, l157, l113, l17, l21, l125, l148, l45, l62, l77, l67, l173, l69]_1_2|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_1, t_funThread1of1ForFork0_plus_~b#1=|v_t_funThread1of1ForFork0_plus_~b#1_1|, v_[l204, l102, l222, l103, l163, l111, l110, l87, l108, l13, l218, l196, l40, l119, l143, l123, l198, l75, l24, l46, l172, l175]_1=|v_v_[l204, l102, l222, l103, l163, l111, l110, l87, l108, l13, l218, l196, l40, l119, l143, l123, l198, l75, l24, l46, l172, l175]_1_6|, v_[l167, l53, l88]_1=|v_v_[l167, l53, l88]_1_2|, t_funThread1of1ForFork0_~y~0#1=|v_t_funThread1of1ForFork0_~y~0#1_1|, t_funThread1of1ForFork0_#res#1.base=|v_t_funThread1of1ForFork0_#res#1.base_1|, t_funThread1of1ForFork0_#t~ret5#1=|v_t_funThread1of1ForFork0_#t~ret5#1_1|, v_[l107]_1=|v_v_[l107]_1_4|, t_funThread1of1ForFork0_#t~nondet9#1=|v_t_funThread1of1ForFork0_#t~nondet9#1_1|, t_funThread1of1ForFork0_#t~ret7#1=|v_t_funThread1of1ForFork0_#t~ret7#1_1|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_1|, t_funThread1of1ForFork0_#t~nondet3#1=|v_t_funThread1of1ForFork0_#t~nondet3#1_1|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_1|, v_[l105]_1=|v_v_[l105]_1_2|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, t_funThread1of1ForFork0_plus_#in~a#1=|v_t_funThread1of1ForFork0_plus_#in~a#1_1|, t_funThread1of1ForFork0_reach_error_#t~nondet0#1.offset=|v_t_funThread1of1ForFork0_reach_error_#t~nondet0#1.offset_1|, t_funThread1of1ForFork0_#t~ret11#1=|v_t_funThread1of1ForFork0_#t~ret11#1_1|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_1, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_1|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_1|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_1|, t_funThread1of1ForFork0_plus_#res#1=|v_t_funThread1of1ForFork0_plus_#res#1_1|, t_funThread1of1ForFork0_#res#1.offset=|v_t_funThread1of1ForFork0_#res#1.offset_1|, t_funThread1of1ForFork0_plus_~a#1=|v_t_funThread1of1ForFork0_plus_~a#1_1|, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, t_funThread1of1ForFork0_#t~ret6#1=|v_t_funThread1of1ForFork0_#t~ret6#1_1|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_1|, t_funThread1of1ForFork0_#t~ret4#1=|v_t_funThread1of1ForFork0_#t~ret4#1_1|, t_funThread1of1ForFork0_#t~nondet2#1=|v_t_funThread1of1ForFork0_#t~nondet2#1_1|, t_funThread1of1ForFork0_#t~ret8#1=|v_t_funThread1of1ForFork0_#t~ret8#1_1|, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1=|v_t_funThread1of1ForFork0_assume_abort_if_not_~cond#1_1|, t_funThread1of1ForFork0_~x~0#1=|v_t_funThread1of1ForFork0_~x~0#1_1|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_reach_error_#t~nondet0#1.base, t_funThread1of1ForFork0_#in~arg#1.offset, t_funThread1of1ForFork0_plus_#in~b#1, t_funThread1of1ForFork0_#t~ret10#1, t_funThread1of1ForFork0_~z~0#1, v_[l137, l136, l139, l162, l8, l227, l157, l113, l17, l21, l125, l148, l45, l62, l77, l67, l173, l69]_1, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_plus_~b#1, v_[l204, l102, l222, l103, l163, l111, l110, l87, l108, l13, l218, l196, l40, l119, l143, l123, l198, l75, l24, l46, l172, l175]_1, v_[l167, l53, l88]_1, t_funThread1of1ForFork0_~y~0#1, t_funThread1of1ForFork0_#res#1.base, t_funThread1of1ForFork0_#t~ret5#1, v_[l107]_1, t_funThread1of1ForFork0_#t~nondet9#1, t_funThread1of1ForFork0_#t~ret7#1, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_#t~nondet3#1, t_funThread1of1ForFork0_#t~nondet1#1, v_[l105]_1, t_funThread1of1ForFork0_plus_#in~a#1, t_funThread1of1ForFork0_reach_error_#t~nondet0#1.offset, t_funThread1of1ForFork0_#t~ret11#1, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#in~arg#1.base, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t_funThread1of1ForFork0_plus_#res#1, t_funThread1of1ForFork0_#res#1.offset, t_funThread1of1ForFork0_plus_~a#1, t_funThread1of1ForFork0_assume_abort_if_not_#in~cond#1, t_funThread1of1ForFork0_#t~ret6#1, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_#t~ret4#1, t_funThread1of1ForFork0_#t~nondet2#1, t_funThread1of1ForFork0_#t~ret8#1, t_funThread1of1ForFork0_assume_abort_if_not_~cond#1, t_funThread1of1ForFork0_~x~0#1] postcondition (and (not |v_[l134, l158]_1|) (not |v_[l171, l57, l5]_1|) (not |v_[l71, l30, l195, l225]_1|) (not |v_[l156]_1|) (not |v_[l145, l63, l147]_1|) (not |v_[l224, l189]_1|) (not |v_[l222, l65, l46, l87, l172, l215, l13]_1|) (not |v_[l18, l4, l61, l68]_1|) |v_[l167, l53, l88]_1| (not |v_[l35, l70]_1|) (not |v_[l85, l42, l112, l169]_1|) (not (= 3 |~#C~0.base|)) (not |v_[l142, l117, l207, l116, l178, l3, l191, l81, l37, l181, l16]_1|) (not |v_[l10, l2]_1|) (or (not |v_[l67, l91, l139, l113]_1|) (= |#race~g~0| 0)) (= 3 |~#A~0.base|) (not |v_[l1, l150]_1|) (not |v_[l121, l51]_1|) (not |v_[l164]_1|) (not |v_[l60, l36]_1|) (not |v_[l31, l114, l217, l190, l6, l152, l214, l26, l48, l84, l32]_1|) (not |v_[l184, l39]_1|) (not |v_[l109]_1|) (not |v_[l95, l72, l151, l161, l64, l165, l132]_1|) (or (= |#race~i~0| 0) (not |v_[l67, l91, l139, l113]_1|)) (not |v_[l224, l52, l159, l189]_1|) (not |v_[l159, l52]_1|) (not (= |~#C~0.base| 4)) (not |v_[l221, l50, l209, l126, l192, l82, l129, l180, l9, l154, l90, l92]_1|) (not |v_[l197, l219, l176, l223, l208, l74, l22, l58, l83, l11, l89, l133]_1|) (or (= |#race~h~0| 0) (not |v_[l67, l91, l139, l113]_1|)) (= |~#B~0.base| 4) |v_[l107]_1| (not |v_[l135, l34, l33, l212, l166, l216, l120, l194, l122, l41, l124, l118, l127, l183, l49, l66, l94, l205, l220, l99, l101, l104, l7, l12, l146, l76, l25, l149]_1|) |v_[l137, l136, l139, l162, l8, l227, l157, l113, l17, l21, l125, l148, l45, l62, l77, l67, l173, l69]_1| (not |v_[l213, l115]_1|) (not |v_[l185, l106, l153]_1|) (not |v_[l97]_1|) (not |v_[l177, l179, l170, l38, l56, l80, l55, l210, l59, l211, l168, l193, l47, l186, l203, l93, l187, l202, l0, l98, l206, l160, l155, l140, l144, l73, l29]_1|) (not |v_[l105]_1|) (not |v_[l23, l44]_1|) (not |v_[l131, l43, l79]_1|) (not |v_[l204, l102, l222, l103, l163, l111, l110, l87, l108, l13, l218, l196, l40, l119, l143, l123, l198, l75, l24, l46, l172, l175]_1|) (not |v_[l19, l54, l138, l20, l128, l130, l200]_1|)) │ │ │ caught: java.lang.AssertionError: Owicki-Gries annotation is invalid │ │ │  at de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.GraphEmpireOwickiGries.checkOwickiGriesValidity(GraphEmpireOwickiGries.java:210) │ │ │  at de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.GraphEmpireOwickiGries.getOrComputeProof(GraphEmpireOwickiGries.java:159) │ │ │  at de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.GraphEmpireOwickiGries.getOrComputeProof(GraphEmpireOwickiGries.java:1) │ │ │  at de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest.runTest(OGProofProducerTest.java:66) │ │ │  at de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OwickiGriesTestSuite.runTestInternal(OwickiGriesTestSuite.java:293) │ │ │  at de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OwickiGriesTestSuite$OwickiGriesTestCase.run(OwickiGriesTestSuite.java:547) │ │ │  at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103) │ │ │  at java.base/java.lang.reflect.Method.invoke(Method.java:580) │ │ │  at org.junit.runners.model.FrameworkMethod$1.runReflectiveCall(FrameworkMethod.java:59) │ │ │  at org.junit.internal.runners.model.ReflectiveCallable.run(ReflectiveCallable.java:12) │ │ │  at org.junit.runners.model.FrameworkMethod.invokeExplosively(FrameworkMethod.java:56) │ │ │  at de.uni_freiburg.informatik.ultimate.test.junitextension.testfactory.FrameworkFactoryTest.invokeExplosively(FrameworkFactoryTest.java:72) │ │ │  at org.junit.internal.runners.statements.InvokeMethod.evaluate(InvokeMethod.java:17) │ │ │  at org.junit.internal.runners.statements.RunBefores.evaluate(RunBefores.java:26) │ │ │  at org.junit.runners.ParentRunner$3.evaluate(ParentRunner.java:306) │ │ │  at de.uni_freiburg.informatik.ultimate.test.junitextension.testfactory.FactoryTestRunner.myRunLeaf(FactoryTestRunner.java:213) │ │ │  at de.uni_freiburg.informatik.ultimate.test.junitextension.testfactory.FactoryTestRunner.runChild(FactoryTestRunner.java:205) │ │ │  at org.junit.runners.BlockJUnit4ClassRunner.runChild(BlockJUnit4ClassRunner.java:63) │ │ │  at org.junit.runners.ParentRunner$4.run(ParentRunner.java:331) │ │ │  at org.junit.runners.ParentRunner$1.schedule(ParentRunner.java:79) │ │ │  at org.junit.runners.ParentRunner.runChildren(ParentRunner.java:329) │ │ │  at org.junit.runners.ParentRunner.access$100(ParentRunner.java:66) │ │ │  at org.junit.runners.ParentRunner$2.evaluate(ParentRunner.java:293) │ │ │  at org.junit.runners.ParentRunner$3.evaluate(ParentRunner.java:306) │ │ │  at org.junit.runners.ParentRunner.run(ParentRunner.java:413) │ │ │  at org.junit.runner.JUnitCore.run(JUnitCore.java:137) │ │ │  at org.junit.runner.JUnitCore.run(JUnitCore.java:115) │ │ │  at org.junit.vintage.engine.execution.RunnerExecutor.execute(RunnerExecutor.java:42) │ │ │  at org.junit.vintage.engine.VintageTestEngine.executeAllChildren(VintageTestEngine.java:80) │ │ │  at org.junit.vintage.engine.VintageTestEngine.execute(VintageTestEngine.java:72) │ │ │  at org.junit.platform.launcher.core.EngineExecutionOrchestrator.execute(EngineExecutionOrchestrator.java:147) │ │ │  at org.junit.platform.launcher.core.EngineExecutionOrchestrator.execute(EngineExecutionOrchestrator.java:127) │ │ │  at org.junit.platform.launcher.core.EngineExecutionOrchestrator.execute(EngineExecutionOrchestrator.java:90) │ │ │  at org.junit.platform.launcher.core.EngineExecutionOrchestrator.lambda$execute$0(EngineExecutionOrchestrator.java:55) │ │ │  at org.junit.platform.launcher.core.EngineExecutionOrchestrator.withInterceptedStreams(EngineExecutionOrchestrator.java:102) │ │ │  at org.junit.platform.launcher.core.EngineExecutionOrchestrator.execute(EngineExecutionOrchestrator.java:54) │ │ │  at org.junit.platform.launcher.core.DefaultLauncher.execute(DefaultLauncher.java:114) │ │ │  at org.junit.platform.launcher.core.DefaultLauncher.execute(DefaultLauncher.java:86) │ │ │  at org.junit.platform.launcher.core.DefaultLauncherSession$DelegatingLauncher.execute(DefaultLauncherSession.java:86) │ │ │  at org.junit.platform.launcher.core.SessionPerRequestLauncher.execute(SessionPerRequestLauncher.java:53) │ │ │  at org.junit.platform.console.tasks.ConsoleTestExecutor.executeTests(ConsoleTestExecutor.java:66) │ │ │  at org.junit.platform.console.tasks.ConsoleTestExecutor.lambda$execute$0(ConsoleTestExecutor.java:58) │ │ │  at org.junit.platform.console.tasks.CustomContextClassLoaderExecutor.replaceThreadContextClassLoaderAndInvoke(CustomContextClassLoaderExecutor.java:41) │ │ │  at org.junit.platform.console.tasks.CustomContextClassLoaderExecutor.invoke(CustomContextClassLoaderExecutor.java:31) │ │ │  at org.junit.platform.console.tasks.ConsoleTestExecutor.execute(ConsoleTestExecutor.java:58) │ │ │  at org.junit.platform.console.ConsoleLauncher.executeTests(ConsoleLauncher.java:120) │ │ │  at org.junit.platform.console.ConsoleLauncher.execute(ConsoleLauncher.java:82) │ │ │  at org.junit.platform.console.ConsoleLauncher.execute(ConsoleLauncher.java:55) │ │ │  at org.junit.platform.console.ConsoleLauncher.execute(ConsoleLauncher.java:48) │ │ │  at org.junit.platform.console.ConsoleLauncher.main(ConsoleLauncher.java:42) │ │ │ duration: 191384 ms │ │ │ status: ✘ FAILED │ └─ GraphEmpireOG finished after 191389 ms. └─ JUnit Vintage finished after 191395 ms. ├─ JUnit Platform Suite └─ JUnit Platform Suite finished after 1 ms. Test plan execution finished. Number of all tests: 1  Test run finished after 191429 ms [ 4 containers found ] [ 0 containers skipped ] [ 4 containers started ] [ 0 containers aborted ] [ 4 containers successful ] [ 0 containers failed ] [ 1 tests found ] [ 0 tests skipped ] [ 1 tests started ] [ 0 tests aborted ] [ 0 tests successful ] [ 1 tests failed ]