env GraphEmpireOG.Timeout=-1 benchexec/../run-test.sh Library-ProofsTest 'de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG' ReachSafety.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 │ │ ├─ ReachSafety_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:ReachSafety_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]: Start isDeterministic. Operand 19 states and 2711 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 19 states, 19 states have (on average 142.68421052631578) internal successors, (2711), 19 states have internal predecessors, (2711), 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 2711 edges. 2711 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 5 states and 801 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 5 states, 5 states have (on average 160.2) internal successors, (801), 5 states have internal predecessors, (801), 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 801 edges. 801 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 14 states and 1966 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 14 states, 14 states have (on average 140.42857142857142) internal successors, (1966), 14 states have internal predecessors, (1966), 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 1966 edges. 1966 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 36 states and 4439 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 36 states, 36 states have (on average 123.30555555555556) internal successors, (4439), 36 states have internal predecessors, (4439), 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 4439 edges. 4439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 19 states and 2582 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 19 states, 19 states have (on average 135.89473684210526) internal successors, (2582), 19 states have internal predecessors, (2582), 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 2582 edges. 2582 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 6 states and 917 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 6 states, 6 states have (on average 152.83333333333334) internal successors, (917), 6 states have internal predecessors, (917), 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 917 edges. 917 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 41 states and 5195 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 41 states, 41 states have (on average 126.70731707317073) internal successors, (5195), 41 states have internal predecessors, (5195), 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 5195 edges. 5195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 19 states and 2570 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 19 states, 19 states have (on average 135.26315789473685) internal successors, (2570), 19 states have internal predecessors, (2570), 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 2570 edges. 2570 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 21 states and 2934 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 21 states, 21 states have (on average 139.71428571428572) internal successors, (2934), 21 states have internal predecessors, (2934), 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 2934 edges. 2934 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 20 states and 2637 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 20 states, 20 states have (on average 131.85) internal successors, (2637), 20 states have internal predecessors, (2637), 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 2637 edges. 2637 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 6 states and 917 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 6 states, 6 states have (on average 152.83333333333334) internal successors, (917), 6 states have internal predecessors, (917), 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 917 edges. 917 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Number of proof automata: 11 [INFO]: 131 / 189 letters are loopers in proof 0 [INFO]: 152 / 189 letters are loopers in proof 1 [INFO]: 131 / 189 letters are loopers in proof 2 [INFO]: 113 / 189 letters are loopers in proof 3 [INFO]: 125 / 189 letters are loopers in proof 4 [INFO]: 146 / 189 letters are loopers in proof 5 [INFO]: 118 / 189 letters are loopers in proof 6 [INFO]: 125 / 189 letters are loopers in proof 7 [INFO]: 130 / 189 letters are loopers in proof 8 [INFO]: 123 / 189 letters are loopers in proof 9 [INFO]: 146 / 189 letters are loopers in proof 10 [INFO]: Loopers in proof automata: min=113, max=152, median=130 [INFO]: Start finitePrefix. Operand will be constructed on-demand [INFO]: 856/3098 cut-off events. [INFO]: For 33205/35228 co-relation queries the response was YES. [INFO]: Finished finitePrefix Result has 16005 conditions, 3098 events. 856/3098 cut-off events. For 33205/35228 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 22236 event pairs, 17 based on Foata normal form. 1183/4146 useless extension candidates. Maximal degree in co-relation 15854. Up to 715 conditions per place. [INFO]: OwickiGriesTestSuite setup time: 13457ms [INFO]: Constructing Owicki-Gries proof for Petri program that has 184 places, 189 transitions, 382 flow.