env GraphEmpireOG.Timeout=-1 benchexec/../run-test.sh Library-ProofsTest 'de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG' NoDataRace.parallel-ticket-3.wvr.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 │ ├─ GraphEmpireOG │ │ ├─ NoDataRace_parallel-ticket-3_wvr_ats │ │ │ tags: [] │ │ │ uniqueId: [engine:junit-vintage]/[runner:de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG]/[test:NoDataRace_parallel-ticket-3_wvr_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]: Start isDeterministic. Operand 3 states and 504 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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 504 edges. 504 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 498 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 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 498 edges. 498 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 498 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 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 498 edges. 498 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 508 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 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 508 edges. 508 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 511 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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 511 edges. 511 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 508 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 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 508 edges. 508 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 511 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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 511 edges. 511 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 508 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 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 508 edges. 508 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 511 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 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 511 edges. 511 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Number of proof automata: 9 [INFO]: 159 / 189 letters are loopers in proof 0 [INFO]: 159 / 189 letters are loopers in proof 1 [INFO]: 159 / 189 letters are loopers in proof 2 [INFO]: 167 / 189 letters are loopers in proof 3 [INFO]: 173 / 189 letters are loopers in proof 4 [INFO]: 167 / 189 letters are loopers in proof 5 [INFO]: 172 / 189 letters are loopers in proof 6 [INFO]: 167 / 189 letters are loopers in proof 7 [INFO]: 171 / 189 letters are loopers in proof 8 [INFO]: Loopers in proof automata: min=159, max=173, median=167 [INFO]: Start finitePrefix. Operand will be constructed on-demand [INFO]: inserting event number 4 for the transition-marking pair ([133][137], [205#true, 193#true, 213#(= |#race~m2~0| 0), l29, 219#(= |#race~m3~0| 0), l142, 214#true, l143, 208#true, l146, l70, l149, 199#true, l48, 196#true, 202#true]) [INFO]: this new event has 110 ancestors and is cut-off event [INFO]: existing Event has 110 ancestors and is cut-off event [INFO]: existing Event has 110 ancestors and is cut-off event [INFO]: existing Event has 110 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([166][150], [205#true, 193#true, 213#(= |#race~m2~0| 0), 219#(= |#race~m3~0| 0), l142, 214#true, l143, 208#true, l146, l70, l118, l87, l149, 199#true, 196#true, 202#true]) [INFO]: this new event has 110 ancestors and is cut-off event [INFO]: existing Event has 110 ancestors and is cut-off event [INFO]: existing Event has 110 ancestors and is cut-off event [INFO]: existing Event has 110 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([133][137], [205#true, 193#true, 213#(= |#race~m2~0| 0), l29, 219#(= |#race~m3~0| 0), l136, 214#true, l143, 208#true, l146, l70, l149, 199#true, l48, 196#true, 204#(= |thread1Thread1of1ForFork1_#t~nondet2#1| |#race~m1~0|)]) [INFO]: this new event has 113 ancestors and is cut-off event [INFO]: existing Event has 113 ancestors and is cut-off event [INFO]: existing Event has 113 ancestors and is cut-off event [INFO]: existing Event has 113 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([166][150], [205#true, 193#true, 213#(= |#race~m2~0| 0), 219#(= |#race~m3~0| 0), l136, 214#true, l143, 208#true, l146, l70, l118, l87, l149, 199#true, 196#true, 204#(= |thread1Thread1of1ForFork1_#t~nondet2#1| |#race~m1~0|)]) [INFO]: this new event has 113 ancestors and is cut-off event [INFO]: existing Event has 113 ancestors and is cut-off event [INFO]: existing Event has 113 ancestors and is cut-off event [INFO]: existing Event has 113 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([133][137], [205#true, 193#true, 213#(= |#race~m2~0| 0), l29, 219#(= |#race~m3~0| 0), 214#true, 208#true, l143, l146, l70, l149, 199#true, l48, l88, 196#true, 204#(= |thread1Thread1of1ForFork1_#t~nondet2#1| |#race~m1~0|)]) [INFO]: this new event has 114 ancestors and is cut-off event [INFO]: existing Event has 114 ancestors and is cut-off event [INFO]: existing Event has 114 ancestors and is cut-off event [INFO]: existing Event has 114 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([166][150], [205#true, 193#true, 213#(= |#race~m2~0| 0), 219#(= |#race~m3~0| 0), 214#true, l143, 208#true, l146, l70, l118, l87, l149, 199#true, l88, 196#true, 204#(= |thread1Thread1of1ForFork1_#t~nondet2#1| |#race~m1~0|)]) [INFO]: this new event has 114 ancestors and is cut-off event [INFO]: existing Event has 114 ancestors and is cut-off event [INFO]: existing Event has 114 ancestors and is cut-off event [INFO]: existing Event has 114 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([133][137], [193#true, l56, 213#(= |#race~m2~0| 0), l29, 219#(= |#race~m3~0| 0), 214#true, l143, 208#true, l146, l70, l149, 199#true, l48, 207#(= |#race~m1~0| 0), 196#true, 202#true]) [INFO]: this new event has 117 ancestors and is cut-off event [INFO]: existing Event has 117 ancestors and is cut-off event [INFO]: existing Event has 117 ancestors and is cut-off event [INFO]: existing Event has 117 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([166][150], [193#true, l56, 213#(= |#race~m2~0| 0), 219#(= |#race~m3~0| 0), 214#true, 208#true, l143, l146, l70, l118, l87, l149, 199#true, 207#(= |#race~m1~0| 0), 196#true, 202#true]) [INFO]: this new event has 117 ancestors and is cut-off event [INFO]: existing Event has 117 ancestors and is cut-off event [INFO]: existing Event has 117 ancestors and is cut-off event [INFO]: existing Event has 117 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([133][137], [193#true, 213#(= |#race~m2~0| 0), l29, 219#(= |#race~m3~0| 0), 214#true, l143, 208#true, l146, l70, l149, 199#true, l48, 207#(= |#race~m1~0| 0), l19, 196#true, 202#true]) [INFO]: this new event has 118 ancestors and is cut-off event [INFO]: existing Event has 118 ancestors and is cut-off event [INFO]: existing Event has 118 ancestors and is cut-off event [INFO]: existing Event has 118 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([166][150], [193#true, 213#(= |#race~m2~0| 0), 219#(= |#race~m3~0| 0), 214#true, 208#true, l143, l146, l70, l118, l87, l149, 199#true, 207#(= |#race~m1~0| 0), l19, 196#true, 202#true]) [INFO]: this new event has 118 ancestors and is cut-off event [INFO]: existing Event has 118 ancestors and is cut-off event [INFO]: existing Event has 118 ancestors and is cut-off event [INFO]: existing Event has 118 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([106][122], [193#true, 213#(= |#race~m2~0| 0), 219#(= |#race~m3~0| 0), l42, 214#true, 208#true, l143, l146, l70, l118, l149, 199#true, l48, 207#(= |#race~m1~0| 0), 196#true, 202#true]) [INFO]: this new event has 119 ancestors and is cut-off event [INFO]: existing Event has 119 ancestors and is cut-off event [INFO]: existing Event has 119 ancestors and is cut-off event [INFO]: existing Event has 119 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([181][154], [l53, 193#true, 213#(= |#race~m2~0| 0), 219#(= |#race~m3~0| 0), 214#true, 208#true, l143, l146, l147, 199#true, l48, 207#(= |#race~m1~0| 0), 196#true, 202#true, l123]) [INFO]: this new event has 124 ancestors and is cut-off event [INFO]: existing Event has 124 ancestors and is cut-off event [INFO]: existing Event has 124 ancestors and is cut-off event [INFO]: existing Event has 124 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([181][154], [193#true, 213#(= |#race~m2~0| 0), 219#(= |#race~m3~0| 0), 214#true, l143, 208#true, l146, l118, l147, 199#true, l48, 207#(= |#race~m1~0| 0), 196#true, l123, 202#true]) [INFO]: this new event has 125 ancestors and is cut-off event [INFO]: existing Event has 125 ancestors and is cut-off event [INFO]: existing Event has 125 ancestors and is cut-off event [INFO]: existing Event has 125 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([166][150], [l53, 193#true, 213#(= |#race~m2~0| 0), 219#(= |#race~m3~0| 0), l42, 214#true, 208#true, l143, l146, l70, l149, l87, 199#true, 207#(= |#race~m1~0| 0), 196#true, 202#true]) [INFO]: this new event has 126 ancestors and is cut-off event [INFO]: existing Event has 126 ancestors and is cut-off event [INFO]: existing Event has 126 ancestors and is cut-off event [INFO]: existing Event has 126 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([133][137], [193#true, 213#(= |#race~m2~0| 0), l29, 219#(= |#race~m3~0| 0), l42, 214#true, l143, 208#true, l146, l70, l149, 199#true, l48, 207#(= |#race~m1~0| 0), 196#true, 202#true]) [INFO]: this new event has 127 ancestors and is cut-off event [INFO]: existing Event has 127 ancestors and is cut-off event [INFO]: existing Event has 127 ancestors and is cut-off event [INFO]: existing Event has 127 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([166][150], [193#true, 213#(= |#race~m2~0| 0), 219#(= |#race~m3~0| 0), l42, 214#true, l143, 208#true, l146, l70, l118, l149, l87, 199#true, 207#(= |#race~m1~0| 0), 196#true, 202#true]) [INFO]: this new event has 127 ancestors and is cut-off event [INFO]: existing Event has 127 ancestors and is cut-off event [INFO]: existing Event has 127 ancestors and is cut-off event [INFO]: existing Event has 127 ancestors and is cut-off event [INFO]: 645/2287 cut-off events. [INFO]: For 5574/5756 co-relation queries the response was YES. [INFO]: Finished finitePrefix Result has 6240 conditions, 2287 events. 645/2287 cut-off events. For 5574/5756 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 18251 event pairs, 577 based on Foata normal form. 41/1888 useless extension candidates. Maximal degree in co-relation 5915. Up to 792 conditions per place. [INFO]: OwickiGriesTestSuite setup time: 1794ms [INFO]: Constructing Owicki-Gries proof for Petri program that has 192 places, 189 transitions, 399 flow.