env NaiveOG.Timeout=-1 benchexec/../run-test.sh Library-ProofsTest 'de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$NaiveOG' NoDataRace.parallel-misc-4.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 4 ms. ├─ JUnit Vintage │ ├─ NaiveOG │ │ ├─ NoDataRace_parallel-misc-4_wvr_ats │ │ │ tags: [] │ │ │ uniqueId: [engine:junit-vintage]/[runner:de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$NaiveOG]/[test:NoDataRace_parallel-misc-4_wvr_ats(de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$NaiveOG)] │ │ │ parent: [engine:junit-vintage]/[runner:de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$NaiveOG] │ │ │ source: ClassSource [className = 'de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$NaiveOG', 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]: Start isDeterministic. Operand 3 states and 379 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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 379 edges. 379 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 383 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 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 383 edges. 383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 392 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 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 392 edges. 392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 400 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 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 400 edges. 400 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 379 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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 379 edges. 379 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 388 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Number of proof automata: 6 [INFO]: 117 / 148 letters are loopers in proof 0 [INFO]: 120 / 148 letters are loopers in proof 1 [INFO]: 134 / 148 letters are loopers in proof 2 [INFO]: 135 / 148 letters are loopers in proof 3 [INFO]: 121 / 148 letters are loopers in proof 4 [INFO]: 126 / 148 letters are loopers in proof 5 [INFO]: Loopers in proof automata: min=117, max=135, median=126 [INFO]: Start finitePrefix. Operand will be constructed on-demand [INFO]: inserting event number 4 for the transition-marking pair ([54][80], [l96, l11, 164#true, 152#true, l87, 155#true, 167#true, l86, l89, l115, 160#(= |#race~d1~0| 0), 163#(= |#race~d2~0| 0), l93]) [INFO]: this new event has 82 ancestors and is cut-off event [INFO]: existing Event has 75 ancestors and is cut-off event [INFO]: existing Event has 75 ancestors and is cut-off event [INFO]: existing Event has 75 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([55][81], [l132, l96, l11, 164#true, 152#true, l87, 155#true, 167#true, l89, l115, 160#(= |#race~d1~0| 0), 163#(= |#race~d2~0| 0), l93]) [INFO]: this new event has 82 ancestors and is cut-off event [INFO]: existing Event has 75 ancestors and is cut-off event [INFO]: existing Event has 75 ancestors and is cut-off event [INFO]: existing Event has 75 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([55][81], [l132, l11, 164#true, 152#true, l87, 155#true, 167#true, l89, l115, 160#(= |#race~d1~0| 0), l94, 163#(= |#race~d2~0| 0), l93]) [INFO]: this new event has 85 ancestors and is cut-off event [INFO]: existing Event has 78 ancestors and is cut-off event [INFO]: existing Event has 78 ancestors and is cut-off event [INFO]: existing Event has 78 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([54][80], [l11, 164#true, 152#true, l87, 155#true, l86, 167#true, l89, l115, 160#(= |#race~d1~0| 0), l94, 163#(= |#race~d2~0| 0), l93]) [INFO]: this new event has 85 ancestors and is cut-off event [INFO]: existing Event has 78 ancestors and is cut-off event [INFO]: existing Event has 78 ancestors and is cut-off event [INFO]: existing Event has 78 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([55][81], [l132, l11, 164#true, 152#true, l87, 155#true, 167#true, l89, l115, 160#(= |#race~d1~0| 0), l29, 163#(= |#race~d2~0| 0), l93]) [INFO]: this new event has 86 ancestors and is cut-off event [INFO]: existing Event has 79 ancestors and is cut-off event [INFO]: existing Event has 79 ancestors and is cut-off event [INFO]: existing Event has 79 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([54][80], [l11, 164#true, 152#true, l87, 155#true, l86, 167#true, l89, l115, 160#(= |#race~d1~0| 0), l29, 163#(= |#race~d2~0| 0), l93]) [INFO]: this new event has 86 ancestors and is cut-off event [INFO]: existing Event has 79 ancestors and is cut-off event [INFO]: existing Event has 79 ancestors and is cut-off event [INFO]: existing Event has 79 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([55][81], [l132, 161#true, l139, l11, 164#true, 152#true, l87, 155#true, l89, l115, 160#(= |#race~d1~0| 0), 169#(= |thread2Thread1of1ForFork2_#t~nondet4| |#race~d2~0|), l93]) [INFO]: this new event has 89 ancestors and is cut-off event [INFO]: existing Event has 82 ancestors and is cut-off event [INFO]: existing Event has 82 ancestors and is cut-off event [INFO]: existing Event has 82 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([54][80], [161#true, l139, l11, 164#true, 152#true, 155#true, l87, l86, l89, l115, 160#(= |#race~d1~0| 0), 169#(= |thread2Thread1of1ForFork2_#t~nondet4| |#race~d2~0|), l93]) [INFO]: this new event has 89 ancestors and is cut-off event [INFO]: existing Event has 82 ancestors and is cut-off event [INFO]: existing Event has 82 ancestors and is cut-off event [INFO]: existing Event has 82 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([55][81], [l132, 161#true, l11, 164#true, 152#true, l87, 155#true, l89, l115, l46, 160#(= |#race~d1~0| 0), 169#(= |thread2Thread1of1ForFork2_#t~nondet4| |#race~d2~0|), l93]) [INFO]: this new event has 90 ancestors and is cut-off event [INFO]: existing Event has 83 ancestors and is cut-off event [INFO]: existing Event has 83 ancestors and is cut-off event [INFO]: existing Event has 83 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([54][80], [161#true, l11, 164#true, 152#true, l87, 155#true, l86, l89, l115, l46, 160#(= |#race~d1~0| 0), 169#(= |thread2Thread1of1ForFork2_#t~nondet4| |#race~d2~0|), l93]) [INFO]: this new event has 90 ancestors and is cut-off event [INFO]: existing Event has 83 ancestors and is cut-off event [INFO]: existing Event has 83 ancestors and is cut-off event [INFO]: existing Event has 83 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([98][118], [l96, l106, l11, 164#true, 152#true, l91, l87, 155#true, 167#true, 163#(= |#race~d2~0| 0), l89, 158#true]) [INFO]: this new event has 89 ancestors and is cut-off event [INFO]: existing Event has 89 ancestors and is cut-off event [INFO]: existing Event has 76 ancestors and is cut-off event [INFO]: existing Event has 89 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([98][118], [l106, l11, 164#true, 152#true, 155#true, l87, l91, 167#true, 163#(= |#race~d2~0| 0), l94, l89, 158#true]) [INFO]: this new event has 92 ancestors and is cut-off event [INFO]: existing Event has 92 ancestors and is cut-off event [INFO]: existing Event has 92 ancestors and is cut-off event [INFO]: existing Event has 79 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([98][118], [l106, l11, 164#true, l29, 152#true, 155#true, l87, l91, 167#true, 163#(= |#race~d2~0| 0), l89, 158#true]) [INFO]: this new event has 93 ancestors and is cut-off event [INFO]: existing Event has 93 ancestors and is cut-off event [INFO]: existing Event has 80 ancestors and is cut-off event [INFO]: existing Event has 93 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([98][118], [161#true, l106, l139, l11, 164#true, 169#(= |thread2Thread1of1ForFork2_#t~nondet4| |#race~d2~0|), 152#true, 155#true, l91, l87, l89, 158#true]) [INFO]: this new event has 96 ancestors and is cut-off event [INFO]: existing Event has 96 ancestors and is cut-off event [INFO]: existing Event has 83 ancestors and is cut-off event [INFO]: existing Event has 96 ancestors and is cut-off event [INFO]: inserting event number 4 for the transition-marking pair ([98][118], [l106, 161#true, l46, l11, 164#true, 169#(= |thread2Thread1of1ForFork2_#t~nondet4| |#race~d2~0|), 152#true, l91, l87, 155#true, l89, 158#true]) [INFO]: this new event has 97 ancestors and is cut-off event [INFO]: existing Event has 97 ancestors and is cut-off event [INFO]: existing Event has 84 ancestors and is cut-off event [INFO]: existing Event has 97 ancestors and is cut-off event [INFO]: 251/797 cut-off events. [INFO]: For 1523/1963 co-relation queries the response was YES. [INFO]: Finished finitePrefix Result has 2143 conditions, 797 events. 251/797 cut-off events. For 1523/1963 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4952 event pairs, 146 based on Foata normal form. 27/690 useless extension candidates. Maximal degree in co-relation 1241. Up to 348 conditions per place. [INFO]: OwickiGriesTestSuite setup time: 1114ms [INFO]: Constructing Owicki-Gries proof for Petri program that has 151 places, 148 transitions, 317 flow. [INFO]: Floyd-Hoare annotation has 32327 edges. 32327 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Computed Owicki-Gries annotation with 151 ghost variables, 148 ghost updates, and overall size 930835