env NaiveOG.Timeout=-1 benchexec/../run-test.sh Library-ProofsTest 'de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$NaiveOG' ReachSafety.char_pc8736x_gpio_pc8736x_gpio_open_pc8736x_gpio_current.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 │ ├─ NaiveOG │ │ ├─ ReachSafety_char_pc8736x_gpio_pc8736x_gpio_open_pc8736x_gpio_current_ats │ │ │ tags: [] │ │ │ uniqueId: [engine:junit-vintage]/[runner:de.uni_freiburg.informatik.ultimate.lib.proofs.owickigries.OGProofProducerTest$NaiveOG]/[test:ReachSafety_char_pc8736x_gpio_pc8736x_gpio_open_pc8736x_gpio_current_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]: 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 12970 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 18 states, 18 states have (on average 720.5555555555555) internal successors, (12970), 18 states have internal predecessors, (12970), 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 12970 edges. 12970 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 6 states and 4223 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 6 states, 6 states have (on average 703.8333333333334) internal successors, (4223), 6 states have internal predecessors, (4223), 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 4223 edges. 4223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 6 states and 4252 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 6 states, 6 states have (on average 708.6666666666666) internal successors, (4252), 6 states have internal predecessors, (4252), 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 4252 edges. 4252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 5 states and 3672 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 5 states, 5 states have (on average 734.4) internal successors, (3672), 5 states have internal predecessors, (3672), 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 3672 edges. 3672 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 11 states and 7874 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 11 states, 11 states have (on average 715.8181818181819) internal successors, (7874), 11 states have internal predecessors, (7874), 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 7874 edges. 7874 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 23 states and 15272 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 23 states, 23 states have (on average 664.0) internal successors, (15272), 23 states have internal predecessors, (15272), 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 15272 edges. 15272 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 29 states and 19131 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 29 states, 29 states have (on average 659.6896551724138) internal successors, (19131), 29 states have internal predecessors, (19131), 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 19131 edges. 19131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 33 states and 21741 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 33 states, 33 states have (on average 658.8181818181819) internal successors, (21741), 33 states have internal predecessors, (21741), 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 21741 edges. 21741 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 30 states and 19903 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 30 states, 30 states have (on average 663.4333333333333) internal successors, (19903), 30 states have internal predecessors, (19903), 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 19903 edges. 19903 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 27 states and 17945 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 27 states, 27 states have (on average 664.6296296296297) internal successors, (17945), 27 states have internal predecessors, (17945), 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 17945 edges. 17945 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 27 states and 17815 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 27 states, 27 states have (on average 659.8148148148148) internal successors, (17815), 27 states have internal predecessors, (17815), 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 17815 edges. 17815 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Start isDeterministic. Operand 27 states and 17863 transitions. [INFO]: Finished isDeterministic. Operand is deterministic. [INFO]: Starting Floyd-Hoare check of an automaton with has 27 states, 27 states have (on average 661.5925925925926) internal successors, (17863), 27 states have internal predecessors, (17863), 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 17863 edges. 17863 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [INFO]: Number of proof automata: 12 [INFO]: 717 / 784 letters are loopers in proof 0 [INFO]: 691 / 784 letters are loopers in proof 1 [INFO]: 699 / 784 letters are loopers in proof 2 [INFO]: 727 / 784 letters are loopers in proof 3 [INFO]: 708 / 784 letters are loopers in proof 4 [INFO]: 654 / 784 letters are loopers in proof 5 [INFO]: 650 / 784 letters are loopers in proof 6 [INFO]: 650 / 784 letters are loopers in proof 7 [INFO]: 654 / 784 letters are loopers in proof 8 [INFO]: 654 / 784 letters are loopers in proof 9 [INFO]: 650 / 784 letters are loopers in proof 10 [INFO]: 654 / 784 letters are loopers in proof 11 [INFO]: Loopers in proof automata: min=650, max=727, median=654 [INFO]: Start finitePrefix. Operand will be constructed on-demand │ │ │ caught: java.lang.OutOfMemoryError: Java heap space │ │ │  at java.base/java.util.ArrayList.iterator(ArrayList.java:1029) │ │ │  at de.uni_freiburg.informatik.ultimate.automata.petrinet.netdatastructures.PetriNetUtils.similarPredecessorPlaces(PetriNetUtils.java:72) │ │ │  at de.uni_freiburg.informatik.ultimate.automata.petrinet.netdatastructures.SimpleSuccessorTransitionProvider.(SimpleSuccessorTransitionProvider.java:48) │ │ │  at de.uni_freiburg.informatik.ultimate.automata.petrinet.netdatastructures.SuccessorTransitionProviderSplit.(SuccessorTransitionProviderSplit.java:64) │ │ │  at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet.getSuccessorTransitionProviders(DifferencePetriNet.java:171) │ │ │  at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.computeCandidates(PossibleExtensions.java:281) │ │ │  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) │ │ │  at java.base/java.lang.invoke.DirectMethodHandle$Holder.invokeSpecial(DirectMethodHandle$Holder) │ │ │  at java.base/java.lang.invoke.LambdaForm$MH/0x00007202c0105000.invoke(LambdaForm$MH) │ │ │  at java.base/java.lang.invoke.Invokers$Holder.invokeExact_MT(Invokers$Holder) │ │ │  at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invokeImpl(DirectMethodHandleAccessor.java:153) │ │ │  at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103) │ │ │  at java.base/java.lang.reflect.Method.invoke(Method.java:580) │ │ │  at org.junit.runners.model.FrameworkMethod$1.runReflectiveCall(FrameworkMethod.java:59) │ │ │  at org.junit.internal.runners.model.ReflectiveCallable.run(ReflectiveCallable.java:12) │ │ │  at org.junit.runners.model.FrameworkMethod.invokeExplosively(FrameworkMethod.java:56) │ │ │  at de.uni_freiburg.informatik.ultimate.test.junitextension.testfactory.FrameworkFactoryTest.invokeExplosively(FrameworkFactoryTest.java:72) │ │ │  at org.junit.internal.runners.statements.InvokeMethod.evaluate(InvokeMethod.java:17) │ │ │  at org.junit.internal.runners.statements.RunBefores.evaluate(RunBefores.java:26) │ │ │  at org.junit.runners.ParentRunner$3.evaluate(ParentRunner.java:306) │ │ │  at de.uni_freiburg.informatik.ultimate.test.junitextension.testfactory.FactoryTestRunner.myRunLeaf(FactoryTestRunner.java:213) │ │ │  at de.uni_freiburg.informatik.ultimate.test.junitextension.testfactory.FactoryTestRunner.runChild(FactoryTestRunner.java:205) │ │ │  at org.junit.runners.BlockJUnit4ClassRunner.runChild(BlockJUnit4ClassRunner.java:63) │ │ │  at org.junit.runners.ParentRunner$4.run(ParentRunner.java:331) │ │ │ duration: 70481 ms │ │ │ status: ✘ FAILED │ └─ NaiveOG finished after 70488 ms. └─ JUnit Vintage finished after 70494 ms. ├─ JUnit Platform Suite └─ JUnit Platform Suite finished after 1 ms. Test plan execution finished. Number of all tests: 1  Test run finished after 70528 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 ]