env EmpireAutomatonOG.Timeout=-1 benchexec/../run-test.sh Library-ProofsTest 'de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$EmpireAutomatonOG' NoDataRace.13-privatized_52-refine-protected-loop2-small_true.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 5 ms. ├─ JUnit Vintage │ ├─ EmpireAutomatonOG │ │ ├─ NoDataRace_13-privatized_52-refine-protected-loop2-small_true_ats │ │ │ tags: [] │ │ │ uniqueId: [engine:junit-vintage]/[runner:de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$EmpireAutomatonOG]/[test:NoDataRace_13-privatized_52-refine-protected-loop2-small_true_ats(de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$EmpireAutomatonOG)] │ │ │ parent: [engine:junit-vintage]/[runner:de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$EmpireAutomatonOG] │ │ │ source: ClassSource [className = 'de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$EmpireAutomatonOG', 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]: Start isDeterministic. Operand 3 states and 211 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 216 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 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 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 204 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 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 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Number of proof automata: 3 [INFO]: 63 / 88 letters are loopers in proof 0 [INFO]: 73 / 88 letters are loopers in proof 1 [INFO]: 63 / 88 letters are loopers in proof 2 [INFO]: Loopers in proof automata: min=63, max=73, median=63 [INFO]: Start finitePrefix. Operand will be constructed on-demand [INFO]: 2/86 cut-off events. [INFO]: For 19/19 co-relation queries the response was YES. [INFO]: Finished finitePrefix Result has 143 conditions, 86 events. 2/86 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 41 event pairs, 0 based on Foata normal form. 1/85 useless extension candidates. Maximal degree in co-relation 103. Up to 21 conditions per place. [INFO]: OwickiGriesTestSuite setup time: 696ms [INFO]: Constructing Owicki-Gries proof for Petri program that has 88 places, 88 transitions, 180 flow. [INFO]: Interfering actions: min=0, max=45, median=7 [INFO]: Computed Owicki-Gries annotation with 1 ghost variables, 6 ghost updates, and overall size 2536 Assertions: l50 : 5#(or (= v_g_1 4) (and (= v_g_1 5) (= |#race~g~0| 0))) l52 : 18#(or (= v_g_1 7) (= v_g_1 4) (and (= |workerThread1of1ForFork0_#t~nondet4#1| |#race~g~0|) (= v_g_1 6)) (and (= |workerThread1of1ForFork0_#t~nondet2#1| |#race~g~0|) (= v_g_1 1)) (= v_g_1 2) (and (= v_g_1 5) (= |#race~g~0| 0))) l51 : 21#(= v_g_1 3) l10 : 24#(and (= |workerThread1of1ForFork0_#t~nondet4#1| |#race~g~0|) (= v_g_1 6)) l54 : 27#(and (= v_g_1 5) (= |#race~g~0| 0)) l53 : 30#(= v_g_1 3) l12 : 33#(= v_g_1 3) l56 : 46#(or (= v_g_1 7) (= v_g_1 4) (and (= |workerThread1of1ForFork0_#t~nondet4#1| |#race~g~0|) (= v_g_1 6)) (and (= |workerThread1of1ForFork0_#t~nondet2#1| |#race~g~0|) (= v_g_1 1)) (= v_g_1 2) (and (= v_g_1 5) (= |#race~g~0| 0))) l11 : 59#(or (= v_g_1 7) (= v_g_1 4) (and (= |workerThread1of1ForFork0_#t~nondet4#1| |#race~g~0|) (= v_g_1 6)) (and (= |workerThread1of1ForFork0_#t~nondet2#1| |#race~g~0|) (= v_g_1 1)) (= v_g_1 2) (and (= v_g_1 5) (= |#race~g~0| 0))) l55 : 60#false l14 : 63#(= v_g_1 3) l58 : 66#(= v_g_1 2) l13 : 69#(and (= |workerThread1of1ForFork0_#t~nondet2#1| |#race~g~0|) (= v_g_1 1)) l57 : 72#(and (= v_g_1 5) (= |#race~g~0| 0)) l16 : 75#(and (= v_g_1 5) (= |#race~g~0| 0)) l15 : 78#(and (= v_g_1 5) (= |#race~g~0| 0)) l59 : 81#(and (= v_g_1 5) (= |#race~g~0| 0)) l18 : 84#(= v_g_1 3) l17 : 87#(= v_g_1 3) l19 : 90#(= v_g_1 3) l61 : 93#(= v_g_1 3) l60 : 96#(= v_g_1 3) l63 : 109#(or (= v_g_1 7) (= v_g_1 4) (and (= |workerThread1of1ForFork0_#t~nondet4#1| |#race~g~0|) (= v_g_1 6)) (and (= |workerThread1of1ForFork0_#t~nondet2#1| |#race~g~0|) (= v_g_1 1)) (= v_g_1 2) (and (= v_g_1 5) (= |#race~g~0| 0))) l62 : 112#(and (= v_g_1 5) (= |#race~g~0| 0)) l21 : 115#(and (= |workerThread1of1ForFork0_#t~nondet2#1| |#race~g~0|) (= v_g_1 1)) l65 : 116#false l20 : 117#false l64 : 124#(or (= v_g_1 7) (= v_g_1 4) (and (= v_g_1 5) (= |#race~g~0| 0))) l23 : 127#(and (= v_g_1 5) (= |#race~g~0| 0)) l67 : 128#false l22 : 131#(and (= v_g_1 5) (= |#race~g~0| 0)) l66 : 144#(or (= v_g_1 7) (= v_g_1 4) (and (= |workerThread1of1ForFork0_#t~nondet4#1| |#race~g~0|) (= v_g_1 6)) (and (= |workerThread1of1ForFork0_#t~nondet2#1| |#race~g~0|) (= v_g_1 1)) (= v_g_1 2) (and (= v_g_1 5) (= |#race~g~0| 0))) l25 : 147#(= v_g_1 3) l69 : 150#(= v_g_1 3) l24 : 153#(= v_g_1 3) l68 : 154#false l27 : 157#(and (= v_g_1 5) (= |#race~g~0| 0)) l26 : 162#(or (= v_g_1 4) (and (= v_g_1 5) (= |#race~g~0| 0))) l29 : 165#(= v_g_1 3) l28 : 168#(= v_g_1 3) l0 : 171#(and (= v_g_1 5) (= |#race~g~0| 0)) l70 : 174#(and (= v_g_1 5) (= |#race~g~0| 0)) l1 : 177#(= v_g_1 3) l2 : 180#(= v_g_1 3) l72 : 185#(or (= v_g_1 4) (and (= v_g_1 5) (= |#race~g~0| 0))) l3 : 188#(and (= v_g_1 5) (= |#race~g~0| 0)) l71 : 191#(= v_g_1 7) l4 : 192#false l30 : 195#(= v_g_1 3) l74 : 196#false l5 : 199#(and (= v_g_1 5) (= |#race~g~0| 0)) l73 : 204#(or (= v_g_1 4) (and (= v_g_1 5) (= |#race~g~0| 0))) l6 : 205#false l32 : 208#(= v_g_1 3) l76 : 211#(= v_g_1 3) l7 : 214#(= v_g_1 3) l31 : 217#(= v_g_1 3) l75 : 218#false l8 : 231#(or (= v_g_1 7) (= v_g_1 4) (and (= |workerThread1of1ForFork0_#t~nondet4#1| |#race~g~0|) (= v_g_1 6)) (and (= |workerThread1of1ForFork0_#t~nondet2#1| |#race~g~0|) (= v_g_1 1)) (= v_g_1 2) (and (= v_g_1 5) (= |#race~g~0| 0))) l34 : 234#(and (= v_g_1 5) (= |#race~g~0| 0)) l78 : 237#(= v_g_1 3) l9 : 238#false l33 : 241#(= v_g_1 3) l77 : 246#(or (= v_g_1 4) (and (= v_g_1 5) (= |#race~g~0| 0))) l36 : 249#(= v_g_1 3) l35 : 262#(or (= v_g_1 7) (= v_g_1 4) (and (= |workerThread1of1ForFork0_#t~nondet4#1| |#race~g~0|) (= v_g_1 6)) (and (= |workerThread1of1ForFork0_#t~nondet2#1| |#race~g~0|) (= v_g_1 1)) (= v_g_1 2) (and (= v_g_1 5) (= |#race~g~0| 0))) l79 : 265#(and (= v_g_1 5) (= |#race~g~0| 0)) l38 : 268#(= v_g_1 3) l37 : 275#(or (= v_g_1 7) (= v_g_1 4) (and (= v_g_1 5) (= |#race~g~0| 0))) l39 : 278#(and (= v_g_1 5) (= |#race~g~0| 0)) l81 : 291#(or (= v_g_1 7) (= v_g_1 4) (and (= |workerThread1of1ForFork0_#t~nondet4#1| |#race~g~0|) (= v_g_1 6)) (and (= |workerThread1of1ForFork0_#t~nondet2#1| |#race~g~0|) (= v_g_1 1)) (= v_g_1 2) (and (= v_g_1 5) (= |#race~g~0| 0))) l80 : 294#(= v_g_1 3) l83 : 297#(= v_g_1 3) l82 : 300#(= v_g_1 3) l41 : 303#(= v_g_1 3) l85 : 308#(or (= v_g_1 4) (and (= v_g_1 5) (= |#race~g~0| 0))) l40 : 311#(= v_g_1 3) l84 : 314#(and (= |workerThread1of1ForFork0_#t~nondet4#1| |#race~g~0|) (= v_g_1 6)) l43 : 317#(and (= v_g_1 5) (= |#race~g~0| 0)) l87 : 330#(or (= v_g_1 7) (= v_g_1 4) (and (= |workerThread1of1ForFork0_#t~nondet4#1| |#race~g~0|) (= v_g_1 6)) (and (= |workerThread1of1ForFork0_#t~nondet2#1| |#race~g~0|) (= v_g_1 1)) (= v_g_1 2) (and (= v_g_1 5) (= |#race~g~0| 0))) l42 : 331#false l86 : 338#(or (= v_g_1 7) (= v_g_1 4) (and (= v_g_1 5) (= |#race~g~0| 0))) l45 : 341#(and (= v_g_1 5) (= |#race~g~0| 0)) l44 : 344#(and (= |workerThread1of1ForFork0_#t~nondet4#1| |#race~g~0|) (= v_g_1 6)) l47 : 351#(or (= v_g_1 7) (= v_g_1 4) (and (= v_g_1 5) (= |#race~g~0| 0))) l46 : 354#(and (= v_g_1 5) (= |#race~g~0| 0)) l49 : 361#(or (= v_g_1 7) (= v_g_1 4) (and (= v_g_1 5) (= |#race~g~0| 0))) l48 : 364#(= v_g_1 3) Ghost Variables (and initial values): v_g_1 : 3 Ghost Updates: [3][34] : (v_g_1) := ((ite (= v_g_1 6) 4 v_g_1)) [52][51] : (v_g_1) := ((ite (= v_g_1 2) 5 v_g_1)) [48][20] : (v_g_1) := ((ite (= v_g_1 4) 1 (ite (= v_g_1 5) 1 (ite (= v_g_1 7) 1 v_g_1)))) [5][26] : (v_g_1) := ((ite (= v_g_1 3) 7 v_g_1)) [51][74] : (v_g_1) := ((ite (= v_g_1 1) 2 v_g_1)) [85][75] : (v_g_1) := ((ite (= v_g_1 5) 6 v_g_1)) [INFO]: EmpireComputation time [ms]: 1, EmpireComputation statistics: automaton size: 7, number of unique pairs: 7, empire law size: 37, empire annotation size: 44, number of regions: 10, number of territories: 7, Min number of regions per territory: 2, Max number of regions per territory: 3, Median number of regions per territory: 3, Min number of places per region: 1, Max number of places per region: 30, Median number of places per region: 6, Empire validity check time [ms]: 135, EmpireToOwickiGries time [ms]: 123, Owicki-Gries validity check time [ms]: 567 │ │ │ duration: 1555 ms │ │ │ status: ✔ SUCCESSFUL │ └─ EmpireAutomatonOG finished after 1560 ms. └─ JUnit Vintage finished after 1567 ms. ├─ JUnit Platform Suite └─ JUnit Platform Suite finished after 0 ms. Test plan execution finished. Number of all tests: 1  Test run finished after 1599 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 ] [ 1 tests successful ] [ 0 tests failed ]