env GraphEmpireOG.Timeout=-1 benchexec/../run-test.sh Library-ProofsTest 'de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG' ReachSafety.char_pc8736x_gpio_pc8736x_gpio_change_pc8736x_gpio_get.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 │ │ ├─ ReachSafety_char_pc8736x_gpio_pc8736x_gpio_change_pc8736x_gpio_get_ats │ │ │ tags: [] │ │ │ uniqueId: [engine:junit-vintage]/[runner:de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG]/[test:ReachSafety_char_pc8736x_gpio_pc8736x_gpio_change_pc8736x_gpio_get_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]: Start isDeterministic. Operand 18 states and 14583 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 18 states, 18 states have (on average 810.1666666666666) internal successors, (14583), 18 states have internal predecessors, (14583), 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 14583 edges. 14583 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 6 states and 4778 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 6 states, 6 states have (on average 796.3333333333334) internal successors, (4778), 6 states have internal predecessors, (4778), 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 4778 edges. 4778 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 5 states and 4122 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 5 states, 5 states have (on average 824.4) internal successors, (4122), 5 states have internal predecessors, (4122), 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 4122 edges. 4122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 12 states and 9852 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 12 states, 12 states have (on average 821.0) internal successors, (9852), 12 states have internal predecessors, (9852), 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 9852 edges. 9852 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 9 states and 7146 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 9 states, 9 states have (on average 794.0) internal successors, (7146), 9 states have internal predecessors, (7146), 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 7146 edges. 7146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 7 states and 5559 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 7 states, 7 states have (on average 794.1428571428571) internal successors, (5559), 7 states have internal predecessors, (5559), 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 5559 edges. 5559 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Number of proof automata: 6 [INFO]: 806 / 884 letters are loopers in proof 0 [INFO]: 782 / 884 letters are loopers in proof 1 [INFO]: 816 / 884 letters are loopers in proof 2 [INFO]: 816 / 884 letters are loopers in proof 3 [INFO]: 787 / 884 letters are loopers in proof 4 [INFO]: 785 / 884 letters are loopers in proof 5 [INFO]: Loopers in proof automata: min=782, max=816, median=806 [INFO]: Start finitePrefix. Operand will be constructed on-demand [INFO]: 88/1537 cut-off events. [INFO]: For 1394/2457 co-relation queries the response was YES. [INFO]: Finished finitePrefix Result has 2409 conditions, 1537 events. 88/1537 cut-off events. For 1394/2457 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5552 event pairs, 2 based on Foata normal form. 33/1492 useless extension candidates. Maximal degree in co-relation 1081. Up to 177 conditions per place. [INFO]: OwickiGriesTestSuite setup time: 18408ms [INFO]: Constructing Owicki-Gries proof for Petri program that has 839 places, 884 transitions, 1782 flow.