env GraphEmpireOG.Timeout=-1 benchexec/../run-test.sh Library-ProofsTest 'de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG' NoOverflow.04-mutex_46-escape_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_46-escape_nr_ats │ │ │ tags: [] │ │ │ uniqueId: [engine:junit-vintage]/[runner:de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$GraphEmpireOG]/[test:NoOverflow_04-mutex_46-escape_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]: 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 17 states and 1615 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 17 states, 17 states have (on average 95.0) internal successors, (1615), 17 states have internal predecessors, (1615), 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 1615 edges. 1615 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 11 states and 1083 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 11 states, 11 states have (on average 98.45454545454545) internal successors, (1083), 11 states have internal predecessors, (1083), 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 1083 edges. 1083 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 13 states and 1234 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 13 states, 13 states have (on average 94.92307692307692) internal successors, (1234), 13 states have internal predecessors, (1234), 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 1234 edges. 1234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 10 states and 977 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 10 states, 10 states have (on average 97.7) internal successors, (977), 10 states have internal predecessors, (977), 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 977 edges. 977 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 3 states and 356 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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 356 edges. 356 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 16 states and 1406 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 16 states, 16 states have (on average 87.875) internal successors, (1406), 16 states have internal predecessors, (1406), 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 1406 edges. 1406 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 13 states and 1204 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 13 states, 13 states have (on average 92.61538461538461) internal successors, (1204), 13 states have internal predecessors, (1204), 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 1204 edges. 1204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 13 states and 1195 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 13 states, 13 states have (on average 91.92307692307692) internal successors, (1195), 13 states have internal predecessors, (1195), 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 1195 edges. 1195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 13 states and 1201 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 13 states, 13 states have (on average 92.38461538461539) internal successors, (1201), 13 states have internal predecessors, (1201), 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 1201 edges. 1201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 21 states and 1842 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 21 states, 21 states have (on average 87.71428571428571) internal successors, (1842), 21 states have internal predecessors, (1842), 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 1842 edges. 1842 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 16 states and 1473 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 16 states, 16 states have (on average 92.0625) internal successors, (1473), 16 states have internal predecessors, (1473), 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 1473 edges. 1473 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 15 states and 1377 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 15 states, 15 states have (on average 91.8) internal successors, (1377), 15 states have internal predecessors, (1377), 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 1377 edges. 1377 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 16 states and 1466 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 16 states, 16 states have (on average 91.625) internal successors, (1466), 16 states have internal predecessors, (1466), 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 1466 edges. 1466 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 23 states and 1965 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 23 states, 23 states have (on average 85.43478260869566) internal successors, (1965), 23 states have internal predecessors, (1965), 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 1965 edges. 1965 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 19 states and 1640 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 19 states, 19 states have (on average 86.3157894736842) internal successors, (1640), 19 states have internal predecessors, (1640), 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 1640 edges. 1640 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 28 states and 2395 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 28 states, 28 states have (on average 85.53571428571429) internal successors, (2395), 28 states have internal predecessors, (2395), 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 2395 edges. 2395 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 24 states and 2062 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 24 states, 24 states have (on average 85.91666666666667) internal successors, (2062), 24 states have internal predecessors, (2062), 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 2062 edges. 2062 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 24 states and 2057 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 24 states, 24 states have (on average 85.70833333333333) internal successors, (2057), 24 states have internal predecessors, (2057), 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 2057 edges. 2057 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 36 states and 3061 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 36 states, 36 states have (on average 85.02777777777777) internal successors, (3061), 36 states have internal predecessors, (3061), 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 3061 edges. 3061 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 29 states and 2462 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 29 states, 29 states have (on average 84.89655172413794) internal successors, (2462), 29 states have internal predecessors, (2462), 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 2462 edges. 2462 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Number of proof automata: 20 [INFO]: 90 / 126 letters are loopers in proof 0 [INFO]: 92 / 126 letters are loopers in proof 1 [INFO]: 89 / 126 letters are loopers in proof 2 [INFO]: 91 / 126 letters are loopers in proof 3 [INFO]: 114 / 126 letters are loopers in proof 4 [INFO]: 83 / 126 letters are loopers in proof 5 [INFO]: 87 / 126 letters are loopers in proof 6 [INFO]: 87 / 126 letters are loopers in proof 7 [INFO]: 87 / 126 letters are loopers in proof 8 [INFO]: 83 / 126 letters are loopers in proof 9 [INFO]: 87 / 126 letters are loopers in proof 10 [INFO]: 87 / 126 letters are loopers in proof 11 [INFO]: 87 / 126 letters are loopers in proof 12 [INFO]: 82 / 126 letters are loopers in proof 13 [INFO]: 82 / 126 letters are loopers in proof 14 [INFO]: 82 / 126 letters are loopers in proof 15 [INFO]: 82 / 126 letters are loopers in proof 16 [INFO]: 82 / 126 letters are loopers in proof 17 [INFO]: 82 / 126 letters are loopers in proof 18 [INFO]: 82 / 126 letters are loopers in proof 19 [INFO]: Loopers in proof automata: min=82, max=114, median=87 [INFO]: Start finitePrefix. Operand will be constructed on-demand Exception in thread "TimeoutWatcher for 1" java.lang.OutOfMemoryError: Java heap space at de.uni_freiburg.informatik.ultimate.core.lib.util.MonitoredProcess.waitfor(MonitoredProcess.java:274) at de.uni_freiburg.informatik.ultimate.core.lib.util.MonitoredProcess.impatientWaitUntilTimeout(MonitoredProcess.java:331) at de.uni_freiburg.informatik.ultimate.core.lib.util.MonitoredProcess.lambda$3(MonitoredProcess.java:399) at de.uni_freiburg.informatik.ultimate.core.lib.util.MonitoredProcess$$Lambda/0x00007cd37c112ae8.run(Unknown Source) at java.base/java.lang.Thread.runWith(Thread.java:1596) at java.base/java.lang.Thread.run(Thread.java:1583) │ │ │ caught: java.lang.OutOfMemoryError: Java heap space │ │ │  at java.base/java.util.HashMap.newNode(HashMap.java:1909) │ │ │  at java.base/java.util.HashMap.putVal(HashMap.java:637) │ │ │  at java.base/java.util.HashMap.putIfAbsent(HashMap.java:1152) │ │ │  at java.base/java.util.stream.Collectors.lambda$uniqKeysMapAccumulator$1(Collectors.java:181) │ │ │  at java.base/java.util.stream.Collectors$$Lambda/0x00007cd37c0f1bc0.accept(Unknown Source) │ │ │  at java.base/java.util.stream.ReduceOps$3ReducingSink.accept(ReduceOps.java:169) │ │ │  at java.base/java.util.LinkedList$LLSpliterator.forEachRemaining(LinkedList.java:1249) │ │ │  at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) │ │ │  at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) │ │ │  at java.base/java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:921) │ │ │  at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) │ │ │  at java.base/java.util.stream.ReferencePipeline.collect(ReferencePipeline.java:682) │ │ │  at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.Candidate.(Candidate.java:78) │ │ │  at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.lambda$2(PossibleExtensions.java:284) │ │ │  at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions$$Lambda/0x00007cd37c161250.apply(Unknown Source) │ │ │  at java.base/java.util.stream.ReferencePipeline$3$1.accept(ReferencePipeline.java:197) │ │ │  at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1708) │ │ │  at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:509) │ │ │  at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:499) │ │ │  at java.base/java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:921) │ │ │  at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) │ │ │  at java.base/java.util.stream.ReferencePipeline.collect(ReferencePipeline.java:682) │ │ │  at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.computeCandidates(PossibleExtensions.java:285) │ │ │  at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:126) │ │ │  at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfoldingHelper(PetriNetUnfolderBase.java:226) │ │ │  at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfolding(PetriNetUnfolderBase.java:183) │ │ │  at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.(PetriNetUnfolderBase.java:123) │ │ │  at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:72) │ │ │  at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) │ │ │  at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) │ │ │  at de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OwickiGriesTestSuite.runTestInternal(OwickiGriesTestSuite.java:279) │ │ │  at de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OwickiGriesTestSuite$OwickiGriesTestCase.run(OwickiGriesTestSuite.java:547) │ │ │ duration: 98051 ms │ │ │ status: ✘ FAILED │ └─ GraphEmpireOG finished after 98056 ms. └─ JUnit Vintage finished after 98063 ms. ├─ JUnit Platform Suite └─ JUnit Platform Suite finished after 1 ms. Test plan execution finished. Number of all tests: 1  Test run finished after 98095 ms [ 4 containers found ] [ 0 containers skipped ] [ 4 containers started ] [ 0 containers aborted ] [ 4 containers successful ] [ 0 containers failed ] [ 1 tests found ] [ 0 tests skipped ] [ 1 tests started ] [ 0 tests aborted ] [ 0 tests successful ] [ 1 tests failed ]