env GraphEmpireOG.Timeout=-1 benchexec/../run-test.sh Library-ProofsTest 'de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG' NoOverflow.04-mutex_17-ps_add1_nr.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
│  │  ├─ NoOverflow_04-mutex_17-ps_add1_nr_ats
│  │  │       tags: []
│  │  │   uniqueId: [engine:junit-vintage]/[runner:de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG]/[test:NoOverflow_04-mutex_17-ps_add1_nr_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]: Initialized classic predicate unifier
[INFO]: Initialized classic predicate unifier
[INFO]: Start isDeterministic. Operand 5 states and 380 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 5 states, 5 states have (on average 76.0) internal successors, (380), 5 states have internal predecessors, (380), 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 380 edges. 380 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 5 states and 321 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 5 states, 5 states have (on average 64.2) internal successors, (321), 5 states have internal predecessors, (321), 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 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 6 states and 343 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 6 states, 6 states have (on average 57.166666666666664) internal successors, (343), 6 states have internal predecessors, (343), 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 343 edges. 343 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 5 states and 311 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 5 states, 5 states have (on average 62.2) internal successors, (311), 5 states have internal predecessors, (311), 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 311 edges. 311 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 8 states and 451 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 8 states, 8 states have (on average 56.375) internal successors, (451), 8 states have internal predecessors, (451), 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 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 8 states and 450 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 8 states, 8 states have (on average 56.25) internal successors, (450), 8 states have internal predecessors, (450), 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 450 edges. 450 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 5 states and 377 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 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 377 edges. 377 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 5 states and 311 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 5 states, 5 states have (on average 62.2) internal successors, (311), 5 states have internal predecessors, (311), 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 311 edges. 311 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 5 states and 315 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 5 states, 5 states have (on average 63.0) internal successors, (315), 5 states have internal predecessors, (315), 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 315 edges. 315 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 5 states and 306 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 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 306 edges. 306 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 9 states and 629 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 9 states, 9 states have (on average 69.88888888888889) internal successors, (629), 9 states have internal predecessors, (629), 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 629 edges. 629 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 9 states and 625 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 9 states, 9 states have (on average 69.44444444444444) internal successors, (625), 9 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 4 states and 248 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 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 248 edges. 248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 13 states and 885 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 13 states, 13 states have (on average 68.07692307692308) internal successors, (885), 13 states have internal predecessors, (885), 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 885 edges. 885 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Start isDeterministic. Operand 13 states and 881 transitions.
[INFO]: Finished isDeterministic. Operand is deterministic.
[INFO]: Starting Floyd-Hoare check of an automaton with  has 13 states, 13 states have (on average 67.76923076923077) internal successors, (881), 13 states have internal predecessors, (881), 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 881 edges. 881 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[INFO]: Number of proof automata: 15
[INFO]: 71 / 83 letters are loopers in proof 0
[INFO]: 56 / 83 letters are loopers in proof 1
[INFO]: 51 / 83 letters are loopers in proof 2
[INFO]: 56 / 83 letters are loopers in proof 3
[INFO]: 51 / 83 letters are loopers in proof 4
[INFO]: 51 / 83 letters are loopers in proof 5
[INFO]: 69 / 83 letters are loopers in proof 6
[INFO]: 56 / 83 letters are loopers in proof 7
[INFO]: 56 / 83 letters are loopers in proof 8
[INFO]: 56 / 83 letters are loopers in proof 9
[INFO]: 63 / 83 letters are loopers in proof 10
[INFO]: 62 / 83 letters are loopers in proof 11
[INFO]: 56 / 83 letters are loopers in proof 12
[INFO]: 62 / 83 letters are loopers in proof 13
[INFO]: 62 / 83 letters are loopers in proof 14
[INFO]: Loopers in proof automata: min=51, max=71, median=56
[INFO]: Start finitePrefix. Operand will be constructed on-demand
[INFO]: 243/859 cut-off events.
[INFO]: For 33943/101271 co-relation queries the response was YES.
[INFO]: Finished finitePrefix Result has 5896 conditions, 859 events. 243/859 cut-off events. For 33943/101271 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5653 event pairs, 10 based on Foata normal form. 20572/21381 useless extension candidates. Maximal degree in co-relation 5803. Up to 291 conditions per place. 
[INFO]: OwickiGriesTestSuite setup time: 5485ms
[INFO]: Constructing Owicki-Gries proof for Petri program that has 83 places, 83 transitions, 170 flow.