About the Execution of LoLa+red for Peterson-COL-6
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3270.075 | 914156.00 | 990627.00 | 3268.10 | FFFFTFFFTFFFFF?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r263-smll-167863538400588.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Peterson-COL-6, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538400588
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 8.3K Feb 25 22:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 22:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 22:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 22:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 22:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 22:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 22:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 22:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 46K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-COL-6-LTLFireability-00
FORMULA_NAME Peterson-COL-6-LTLFireability-01
FORMULA_NAME Peterson-COL-6-LTLFireability-02
FORMULA_NAME Peterson-COL-6-LTLFireability-03
FORMULA_NAME Peterson-COL-6-LTLFireability-04
FORMULA_NAME Peterson-COL-6-LTLFireability-05
FORMULA_NAME Peterson-COL-6-LTLFireability-06
FORMULA_NAME Peterson-COL-6-LTLFireability-07
FORMULA_NAME Peterson-COL-6-LTLFireability-08
FORMULA_NAME Peterson-COL-6-LTLFireability-09
FORMULA_NAME Peterson-COL-6-LTLFireability-10
FORMULA_NAME Peterson-COL-6-LTLFireability-11
FORMULA_NAME Peterson-COL-6-LTLFireability-12
FORMULA_NAME Peterson-COL-6-LTLFireability-13
FORMULA_NAME Peterson-COL-6-LTLFireability-14
FORMULA_NAME Peterson-COL-6-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678848673781
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-6
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 02:51:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 02:51:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 02:51:16] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-15 02:51:17] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-15 02:51:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 809 ms
[2023-03-15 02:51:17] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 1372 PT places and 2247.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-15 02:51:17] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 5 ms.
[2023-03-15 02:51:17] [INFO ] Skeletonized 13 HLPN properties in 2 ms. Removed 3 properties that had guard overlaps.
Initial state reduction rules removed 2 formulas.
FORMULA Peterson-COL-6-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-6-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2 stabilizing places and 0 stable transitions
Remains 8 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 121 steps, including 0 resets, run visited all 10 properties in 15 ms. (steps per millisecond=8 )
[2023-03-15 02:51:17] [INFO ] Flatten gal took : 17 ms
[2023-03-15 02:51:17] [INFO ] Flatten gal took : 4 ms
Domain [Process(7), Tour(6), Process(7)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 6)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-15 02:51:18] [INFO ] Unfolded HLPN to a Petri net with 1372 places and 2114 transitions 6608 arcs in 91 ms.
[2023-03-15 02:51:18] [INFO ] Unfolded 14 HLPN properties in 2 ms.
Deduced a syphon composed of 42 places in 20 ms
Reduce places removed 42 places and 84 transitions.
Support contains 1330 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 46 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 02:51:18] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2023-03-15 02:51:18] [INFO ] Computed 27 place invariants in 61 ms
[2023-03-15 02:51:18] [INFO ] Implicit Places using invariants in 618 ms returned []
[2023-03-15 02:51:18] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 02:51:18] [INFO ] Invariant cache hit.
[2023-03-15 02:51:20] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 02:51:20] [INFO ] Implicit Places using invariants and state equation in 1848 ms returned []
Implicit Place search using SMT with State Equation took 2510 ms to find 0 implicit places.
[2023-03-15 02:51:20] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 02:51:20] [INFO ] Invariant cache hit.
[2023-03-15 02:51:22] [INFO ] Dead Transitions using invariants and state equation in 1951 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4512 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Support contains 1330 out of 1330 places after structural reductions.
[2023-03-15 02:51:23] [INFO ] Flatten gal took : 303 ms
[2023-03-15 02:51:23] [INFO ] Flatten gal took : 185 ms
[2023-03-15 02:51:24] [INFO ] Input system was already deterministic with 2030 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 654 ms. (steps per millisecond=15 ) properties (out of 24) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-15 02:51:25] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 02:51:25] [INFO ] Invariant cache hit.
[2023-03-15 02:51:25] [INFO ] [Real]Absence check using 20 positive place invariants in 30 ms returned sat
[2023-03-15 02:51:25] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 16 ms returned sat
[2023-03-15 02:51:26] [INFO ] After 1543ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-15 02:51:27] [INFO ] [Nat]Absence check using 20 positive place invariants in 28 ms returned sat
[2023-03-15 02:51:27] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-15 02:51:28] [INFO ] After 1257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-15 02:51:28] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 02:51:29] [INFO ] After 523ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-15 02:51:30] [INFO ] Deduced a trap composed of 208 places in 1191 ms of which 9 ms to minimize.
[2023-03-15 02:51:31] [INFO ] Deduced a trap composed of 12 places in 1097 ms of which 3 ms to minimize.
[2023-03-15 02:51:32] [INFO ] Deduced a trap composed of 31 places in 961 ms of which 15 ms to minimize.
[2023-03-15 02:51:33] [INFO ] Deduced a trap composed of 22 places in 1056 ms of which 4 ms to minimize.
[2023-03-15 02:51:34] [INFO ] Deduced a trap composed of 32 places in 991 ms of which 2 ms to minimize.
[2023-03-15 02:51:36] [INFO ] Deduced a trap composed of 46 places in 1327 ms of which 2 ms to minimize.
[2023-03-15 02:51:37] [INFO ] Deduced a trap composed of 31 places in 1278 ms of which 2 ms to minimize.
[2023-03-15 02:51:38] [INFO ] Deduced a trap composed of 116 places in 994 ms of which 3 ms to minimize.
[2023-03-15 02:51:40] [INFO ] Deduced a trap composed of 42 places in 1140 ms of which 1 ms to minimize.
[2023-03-15 02:51:40] [INFO ] Deduced a trap composed of 52 places in 820 ms of which 2 ms to minimize.
[2023-03-15 02:51:41] [INFO ] Deduced a trap composed of 52 places in 909 ms of which 3 ms to minimize.
[2023-03-15 02:51:42] [INFO ] Deduced a trap composed of 52 places in 880 ms of which 1 ms to minimize.
[2023-03-15 02:51:43] [INFO ] Deduced a trap composed of 42 places in 918 ms of which 1 ms to minimize.
[2023-03-15 02:51:45] [INFO ] Deduced a trap composed of 52 places in 1100 ms of which 1 ms to minimize.
[2023-03-15 02:51:46] [INFO ] Deduced a trap composed of 170 places in 949 ms of which 1 ms to minimize.
[2023-03-15 02:51:47] [INFO ] Deduced a trap composed of 91 places in 944 ms of which 1 ms to minimize.
[2023-03-15 02:51:48] [INFO ] Deduced a trap composed of 74 places in 993 ms of which 1 ms to minimize.
[2023-03-15 02:51:49] [INFO ] Deduced a trap composed of 134 places in 1084 ms of which 2 ms to minimize.
[2023-03-15 02:51:50] [INFO ] Deduced a trap composed of 57 places in 1008 ms of which 1 ms to minimize.
[2023-03-15 02:51:51] [INFO ] Deduced a trap composed of 151 places in 851 ms of which 2 ms to minimize.
[2023-03-15 02:51:52] [INFO ] Deduced a trap composed of 52 places in 985 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 02:51:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 02:51:52] [INFO ] After 25840ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 32 ms.
Support contains 56 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 576 transitions
Trivial Post-agglo rules discarded 576 transitions
Performed 576 trivial Post agglomeration. Transition count delta: 576
Iterating post reduction 0 with 576 rules applied. Total rules applied 576 place count 1330 transition count 1454
Reduce places removed 576 places and 0 transitions.
Iterating post reduction 1 with 576 rules applied. Total rules applied 1152 place count 754 transition count 1454
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 300 Pre rules applied. Total rules applied 1152 place count 754 transition count 1154
Deduced a syphon composed of 300 places in 3 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 2 with 600 rules applied. Total rules applied 1752 place count 454 transition count 1154
Applied a total of 1752 rules in 190 ms. Remains 454 /1330 variables (removed 876) and now considering 1154/2030 (removed 876) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 454/1330 places, 1154/2030 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 481 ms. (steps per millisecond=20 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :0
Finished probabilistic random walk after 78 steps, run visited all 3 properties in 14 ms. (steps per millisecond=5 )
Probabilistic random walk after 78 steps, saw 71 distinct states, run finished after 15 ms. (steps per millisecond=5 ) properties seen :3
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&p0))))'
Support contains 336 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 113 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 02:51:54] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 02:51:54] [INFO ] Invariant cache hit.
[2023-03-15 02:51:54] [INFO ] Implicit Places using invariants in 651 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 655 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 63 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 832 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 356 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Peterson-COL-6-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LT s514 1) (LT s644 1) (LT s579 1) (LT s709 1) (LT s506 1) (LT s774 1) (LT s571 1) (LT s636 1) (LT s701 1) (LT s766 1) (LT s530 1) (LT s660 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 238 steps with 17 reset in 27 ms.
FORMULA Peterson-COL-6-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-6-LTLFireability-00 finished in 1316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p1)&&F(G(p2))))||p0)))'
Support contains 392 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 30 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 02:51:55] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 02:51:55] [INFO ] Invariant cache hit.
[2023-03-15 02:51:56] [INFO ] Implicit Places using invariants in 670 ms returned []
[2023-03-15 02:51:56] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 02:51:56] [INFO ] Invariant cache hit.
[2023-03-15 02:51:57] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 02:52:02] [INFO ] Implicit Places using invariants and state equation in 6066 ms returned []
Implicit Place search using SMT with State Equation took 6744 ms to find 0 implicit places.
[2023-03-15 02:52:02] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 02:52:02] [INFO ] Invariant cache hit.
[2023-03-15 02:52:04] [INFO ] Dead Transitions using invariants and state equation in 2072 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8849 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : Peterson-COL-6-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s70 1) (GEQ s106 1)) (AND (GEQ s82 1) (GEQ s137 1)) (AND (GEQ s67 1) (GEQ s129 1)) (AND (GEQ s85 1) (GEQ s114 1)) (AND (GEQ s101 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1565 ms.
Stack based approach found an accepted trace after 2733 steps with 3 reset with depth 2672 and stack size 2672 in 75 ms.
FORMULA Peterson-COL-6-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-6-LTLFireability-01 finished in 10811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F(p1)))))'
Support contains 112 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 69 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 02:52:06] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 02:52:06] [INFO ] Invariant cache hit.
[2023-03-15 02:52:06] [INFO ] Implicit Places using invariants in 584 ms returned []
[2023-03-15 02:52:06] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 02:52:06] [INFO ] Invariant cache hit.
[2023-03-15 02:52:08] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 02:52:12] [INFO ] Implicit Places using invariants and state equation in 5343 ms returned []
Implicit Place search using SMT with State Equation took 5933 ms to find 0 implicit places.
[2023-03-15 02:52:12] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 02:52:12] [INFO ] Invariant cache hit.
[2023-03-15 02:52:14] [INFO ] Dead Transitions using invariants and state equation in 2419 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8424 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-COL-6-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p1:(AND (OR (LT s70 1) (LT s106 1)) (OR (LT s82 1) (LT s137 1)) (OR (LT s67 1) (LT s129 1)) (OR (LT s85 1) (LT s114 1)) (OR (LT s101 1) (LT s128 1)) (OR (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Peterson-COL-6-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-6-LTLFireability-02 finished in 8697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0))||(G(p2)&&p1))))'
Support contains 630 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 26 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 02:52:14] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 02:52:14] [INFO ] Invariant cache hit.
[2023-03-15 02:52:15] [INFO ] Implicit Places using invariants in 831 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 834 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 25 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 886 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 309 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : Peterson-COL-6-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (LT s1122 1) (LT s1057 1) (LT s1317 1) (LT s1187 1) (LT s1130 1) (LT s1065 1) (LT s1260 1) (LT s1195 1) (LT s1041 1) (LT s1106 1) (LT s1171 1) (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Peterson-COL-6-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-6-LTLFireability-03 finished in 1233 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)||(X(G(p1))&&G(p2))))'
Support contains 378 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 48 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 02:52:16] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 02:52:16] [INFO ] Invariant cache hit.
[2023-03-15 02:52:17] [INFO ] Implicit Places using invariants in 945 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 948 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 36 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1034 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), p0]
Running random walk in product with property : Peterson-COL-6-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2 p1), acceptance={} source=1 dest: 1}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s63 1) (LT s99 1)) (OR (LT s75 1) (LT s130 1)) (OR (LT s60 1) (LT s122 1)) (OR (LT s78 1) (LT s107 1)) (OR (LT s94 1) (LT s121 1)) (OR (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 19912 reset in 2161 ms.
Product exploration explored 100000 steps with 19926 reset in 1911 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 p2 p1))), (X p0), (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p2 p1))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))))]
Knowledge based reduction with 5 factoid took 290 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[p0, p0]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 p2 p1))), (X p0), (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p2 p1))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))))), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 366 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[p0]
Stuttering acceptance computed with spot in 50 ms :[p0]
[2023-03-15 02:52:22] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2023-03-15 02:52:22] [INFO ] Computed 20 place invariants in 35 ms
[2023-03-15 02:52:24] [INFO ] [Real]Absence check using 20 positive place invariants in 35 ms returned sat
[2023-03-15 02:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:52:28] [INFO ] [Real]Absence check using state equation in 3123 ms returned sat
[2023-03-15 02:52:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 02:52:30] [INFO ] [Nat]Absence check using 20 positive place invariants in 30 ms returned sat
[2023-03-15 02:52:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 02:52:33] [INFO ] [Nat]Absence check using state equation in 3005 ms returned sat
[2023-03-15 02:52:33] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 02:52:34] [INFO ] [Nat]Added 330 Read/Feed constraints in 384 ms returned sat
[2023-03-15 02:52:35] [INFO ] Deduced a trap composed of 35 places in 1262 ms of which 2 ms to minimize.
[2023-03-15 02:52:36] [INFO ] Deduced a trap composed of 12 places in 1093 ms of which 2 ms to minimize.
[2023-03-15 02:52:37] [INFO ] Deduced a trap composed of 35 places in 1063 ms of which 2 ms to minimize.
[2023-03-15 02:52:39] [INFO ] Deduced a trap composed of 50 places in 944 ms of which 2 ms to minimize.
[2023-03-15 02:52:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 5086 ms
[2023-03-15 02:52:39] [INFO ] Computed and/alt/rep : 1729/3542/1729 causal constraints (skipped 84 transitions) in 186 ms.
[2023-03-15 02:52:44] [INFO ] Deduced a trap composed of 2 places in 1205 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 02:52:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG p0
Could not prove EG p0
Support contains 84 out of 1323 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1323 transition count 2024
Reduce places removed 6 places and 0 transitions.
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 294
Iterating post reduction 1 with 300 rules applied. Total rules applied 306 place count 1317 transition count 1730
Reduce places removed 294 places and 0 transitions.
Iterating post reduction 2 with 294 rules applied. Total rules applied 600 place count 1023 transition count 1730
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 600 place count 1023 transition count 1688
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 684 place count 981 transition count 1688
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 756 place count 945 transition count 1652
Applied a total of 756 rules in 173 ms. Remains 945 /1323 variables (removed 378) and now considering 1652/2030 (removed 378) transitions.
[2023-03-15 02:52:44] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
// Phase 1: matrix 1442 rows 945 cols
[2023-03-15 02:52:44] [INFO ] Computed 20 place invariants in 7 ms
[2023-03-15 02:52:45] [INFO ] Implicit Places using invariants in 383 ms returned []
[2023-03-15 02:52:45] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
[2023-03-15 02:52:45] [INFO ] Invariant cache hit.
[2023-03-15 02:52:45] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 02:52:48] [INFO ] Implicit Places using invariants and state equation in 3928 ms returned []
Implicit Place search using SMT with State Equation took 4314 ms to find 0 implicit places.
[2023-03-15 02:52:49] [INFO ] Redundant transitions in 227 ms returned []
[2023-03-15 02:52:49] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
[2023-03-15 02:52:49] [INFO ] Invariant cache hit.
[2023-03-15 02:52:50] [INFO ] Dead Transitions using invariants and state equation in 1771 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 945/1323 places, 1652/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6495 ms. Remains : 945/1323 places, 1652/2030 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[p0]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[p0]
Stuttering acceptance computed with spot in 46 ms :[p0]
[2023-03-15 02:52:51] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
[2023-03-15 02:52:51] [INFO ] Invariant cache hit.
[2023-03-15 02:52:53] [INFO ] [Real]Absence check using 20 positive place invariants in 29 ms returned sat
[2023-03-15 02:52:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:52:55] [INFO ] [Real]Absence check using state equation in 1972 ms returned sat
[2023-03-15 02:52:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 02:52:58] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2023-03-15 02:52:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 02:53:00] [INFO ] [Nat]Absence check using state equation in 1993 ms returned sat
[2023-03-15 02:53:00] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 02:53:00] [INFO ] [Nat]Added 330 Read/Feed constraints in 219 ms returned sat
[2023-03-15 02:53:01] [INFO ] Deduced a trap composed of 54 places in 743 ms of which 2 ms to minimize.
[2023-03-15 02:53:02] [INFO ] Deduced a trap composed of 17 places in 846 ms of which 1 ms to minimize.
[2023-03-15 02:53:03] [INFO ] Deduced a trap composed of 35 places in 725 ms of which 2 ms to minimize.
[2023-03-15 02:53:04] [INFO ] Deduced a trap composed of 41 places in 868 ms of which 1 ms to minimize.
[2023-03-15 02:53:04] [INFO ] Deduced a trap composed of 58 places in 518 ms of which 1 ms to minimize.
[2023-03-15 02:53:05] [INFO ] Deduced a trap composed of 56 places in 537 ms of which 1 ms to minimize.
[2023-03-15 02:53:06] [INFO ] Deduced a trap composed of 64 places in 444 ms of which 1 ms to minimize.
[2023-03-15 02:53:06] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5512 ms
[2023-03-15 02:53:06] [INFO ] Computed and/alt/rep : 1351/3374/1351 causal constraints (skipped 84 transitions) in 166 ms.
[2023-03-15 02:53:10] [INFO ] Added : 180 causal constraints over 36 iterations in 4767 ms. Result :unknown
Could not prove EG p0
Stuttering acceptance computed with spot in 39 ms :[p0]
Product exploration explored 100000 steps with 19943 reset in 1301 ms.
Product exploration explored 100000 steps with 19939 reset in 1012 ms.
Support contains 84 out of 945 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 945/945 places, 1652/1652 transitions.
Drop transitions removed 288 transitions
Trivial Post-agglo rules discarded 288 transitions
Performed 288 trivial Post agglomeration. Transition count delta: 288
Iterating post reduction 0 with 288 rules applied. Total rules applied 288 place count 945 transition count 1364
Reduce places removed 288 places and 0 transitions.
Iterating post reduction 1 with 288 rules applied. Total rules applied 576 place count 657 transition count 1364
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 576 place count 657 transition count 1112
Deduced a syphon composed of 252 places in 1 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 1080 place count 405 transition count 1112
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1092 place count 399 transition count 1106
Applied a total of 1092 rules in 125 ms. Remains 399 /945 variables (removed 546) and now considering 1106/1652 (removed 546) transitions.
[2023-03-15 02:53:13] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 02:53:13] [INFO ] Computed 20 place invariants in 7 ms
[2023-03-15 02:53:13] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-15 02:53:13] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 02:53:13] [INFO ] Invariant cache hit.
[2023-03-15 02:53:14] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 02:53:15] [INFO ] Implicit Places using invariants and state equation in 1594 ms returned []
Implicit Place search using SMT with State Equation took 1994 ms to find 0 implicit places.
[2023-03-15 02:53:15] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-15 02:53:15] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 02:53:15] [INFO ] Invariant cache hit.
[2023-03-15 02:53:16] [INFO ] Dead Transitions using invariants and state equation in 844 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 399/945 places, 1106/1652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3035 ms. Remains : 399/945 places, 1106/1652 transitions.
Treatment of property Peterson-COL-6-LTLFireability-04 finished in 60654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(F((p1&&F(p2))))||p0))))'
Support contains 301 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 35 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 02:53:16] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2023-03-15 02:53:16] [INFO ] Computed 27 place invariants in 10 ms
[2023-03-15 02:53:17] [INFO ] Implicit Places using invariants in 536 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 539 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 31 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 608 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Peterson-COL-6-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s1315 1) (GEQ s1119 1) (GEQ s1056 1) (GEQ s1189 1) (GEQ s1126 1) (GEQ s1252 1) (GEQ s1063 1) (GEQ s1133 1) (GEQ s1259 1) (GEQ s1070 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1112 ms.
Stack based approach found an accepted trace after 1581 steps with 0 reset with depth 1582 and stack size 1582 in 15 ms.
FORMULA Peterson-COL-6-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-6-LTLFireability-05 finished in 1994 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(F(p1)))))'
Support contains 42 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 36 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 02:53:18] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 02:53:18] [INFO ] Invariant cache hit.
[2023-03-15 02:53:19] [INFO ] Implicit Places using invariants in 667 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 670 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 56 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 764 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Peterson-COL-6-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (LT s463 1) (LT s445 1) (LT s475 1) (LT s457 1) (LT s439 1) (LT s469 1) (LT s451 1)), p0:(OR (GEQ s448 1) (GEQ s447 1) (GEQ s446 1) (GEQ s444 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Peterson-COL-6-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-6-LTLFireability-06 finished in 952 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p1 U X(G(!p2)))&&p0)))'
Support contains 350 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 33 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 02:53:19] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 02:53:19] [INFO ] Invariant cache hit.
[2023-03-15 02:53:20] [INFO ] Implicit Places using invariants in 1030 ms returned []
[2023-03-15 02:53:20] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 02:53:20] [INFO ] Invariant cache hit.
[2023-03-15 02:53:22] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 02:53:29] [INFO ] Implicit Places using invariants and state equation in 8869 ms returned []
Implicit Place search using SMT with State Equation took 9908 ms to find 0 implicit places.
[2023-03-15 02:53:29] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 02:53:29] [INFO ] Invariant cache hit.
[2023-03-15 02:53:31] [INFO ] Dead Transitions using invariants and state equation in 2012 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11957 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, p2]
Running random walk in product with property : Peterson-COL-6-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (GEQ s1322 1) (GEQ s1126 1) (GEQ s1063 1) (GEQ s1196 1) (GEQ s1133 1) (GEQ s1259 1) (GEQ s1070 1) (GEQ s1140 1) (GEQ s1266 1) (GEQ s1077 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-6-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-6-LTLFireability-07 finished in 12168 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||(p1&&F(!p0)&&(G(p3)||p2)))))'
Support contains 161 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 576 transitions
Trivial Post-agglo rules discarded 576 transitions
Performed 576 trivial Post agglomeration. Transition count delta: 576
Iterating post reduction 0 with 576 rules applied. Total rules applied 576 place count 1330 transition count 1454
Reduce places removed 576 places and 0 transitions.
Iterating post reduction 1 with 576 rules applied. Total rules applied 1152 place count 754 transition count 1454
Performed 265 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 265 Pre rules applied. Total rules applied 1152 place count 754 transition count 1189
Deduced a syphon composed of 265 places in 1 ms
Reduce places removed 265 places and 0 transitions.
Iterating global reduction 2 with 530 rules applied. Total rules applied 1682 place count 489 transition count 1189
Applied a total of 1682 rules in 64 ms. Remains 489 /1330 variables (removed 841) and now considering 1189/2030 (removed 841) transitions.
[2023-03-15 02:53:31] [INFO ] Flow matrix only has 979 transitions (discarded 210 similar events)
// Phase 1: matrix 979 rows 489 cols
[2023-03-15 02:53:31] [INFO ] Computed 27 place invariants in 6 ms
[2023-03-15 02:53:32] [INFO ] Implicit Places using invariants in 491 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 493 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 482/1330 places, 1189/2030 transitions.
Applied a total of 0 rules in 26 ms. Remains 482 /482 variables (removed 0) and now considering 1189/1189 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 586 ms. Remains : 482/1330 places, 1189/2030 transitions.
Stuttering acceptance computed with spot in 202 ms :[p0, (AND p0 (NOT p3)), p0, (AND p0 (NOT p3))]
Running random walk in product with property : Peterson-COL-6-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p1) p0) (AND p0 (NOT p2) (NOT p3))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2) p3), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0 (NOT p2) p3), acceptance={1} source=0 dest: 1}, { cond=(OR (AND p1 p0 p2) (AND p1 p0 p3)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p1) p0 (NOT p3)) (AND p0 (NOT p2) (NOT p3))), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p0) (NOT p2) p3)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) p0 p3) (AND p0 (NOT p2) p3)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 p0 p2 (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0 p2 p3), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p3), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s196 1) (GEQ s195 1) (GEQ s194 1) (GEQ s192 1) (GEQ s191 1) (GEQ s190 1) (GEQ s189 1) (GEQ s204 1) (GEQ s203 1) (GEQ s202 1) (GEQ s201 1) (GEQ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 19982 reset in 4027 ms.
Product exploration explored 100000 steps with 19923 reset in 3602 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) (NOT p3)), (X (OR (AND (NOT p1) p0) (AND p0 (NOT p2) (NOT p3)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (NOT (AND p1 p0 (NOT p2) p3))), (X (NOT (AND p1 (NOT p0) (NOT p2) p3))), (X (NOT (OR (AND p1 p0 p2) (AND p1 p0 p3)))), (X (NOT (AND p1 p0 p2 (NOT p3)))), (X (OR (AND (NOT p1) p0 (NOT p3)) (AND p0 (NOT p2) (NOT p3)))), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (NOT (AND p1 p0 p2 p3))), (X (NOT (OR (AND (NOT p1) p0 p3) (AND p0 (NOT p2) p3)))), (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p0) (NOT p2) p3)))), (X p0), (X (X (NOT (AND p1 (NOT p0) (NOT p2) p3)))), (X (X (NOT (OR (AND p1 p0 p2) (AND p1 p0 p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p1 p0 (NOT p2) p3)))), (X (X (NOT (AND p1 p0 p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (NOT (AND p1 p0 p2 p3)))), (X (X (NOT (OR (AND (NOT p1) p0 p3) (AND p0 (NOT p2) p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p0) (NOT p2) p3)))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) p0) (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p0) (AND p0 (NOT p2) (NOT p3)))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (OR (AND (NOT p1) p0 (NOT p3)) (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p0 (NOT p3)) (AND p0 (NOT p2) (NOT p3)))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 23 factoid took 1929 ms. Reduced automaton from 4 states, 14 edges and 4 AP (stutter insensitive) to 4 states, 14 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[p0, (AND p0 (NOT p3)), p0, (AND p0 (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 995 ms. (steps per millisecond=10 ) properties (out of 14) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 324 ms. (steps per millisecond=30 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-15 02:53:46] [INFO ] Flow matrix only has 979 transitions (discarded 210 similar events)
// Phase 1: matrix 979 rows 482 cols
[2023-03-15 02:53:46] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-15 02:53:48] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-15 02:53:48] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0 real:4
[2023-03-15 02:53:48] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-15 02:53:53] [INFO ] After 4607ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :4
[2023-03-15 02:53:53] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 02:53:58] [INFO ] After 4781ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :6 sat :4
[2023-03-15 02:53:59] [INFO ] Deduced a trap composed of 12 places in 309 ms of which 2 ms to minimize.
[2023-03-15 02:53:59] [INFO ] Deduced a trap composed of 50 places in 256 ms of which 4 ms to minimize.
[2023-03-15 02:54:00] [INFO ] Deduced a trap composed of 52 places in 259 ms of which 1 ms to minimize.
[2023-03-15 02:54:00] [INFO ] Deduced a trap composed of 13 places in 285 ms of which 1 ms to minimize.
[2023-03-15 02:54:00] [INFO ] Deduced a trap composed of 41 places in 277 ms of which 1 ms to minimize.
[2023-03-15 02:54:01] [INFO ] Deduced a trap composed of 11 places in 329 ms of which 1 ms to minimize.
[2023-03-15 02:54:01] [INFO ] Deduced a trap composed of 31 places in 428 ms of which 1 ms to minimize.
[2023-03-15 02:54:02] [INFO ] Deduced a trap composed of 15 places in 366 ms of which 1 ms to minimize.
[2023-03-15 02:54:02] [INFO ] Deduced a trap composed of 42 places in 361 ms of which 1 ms to minimize.
[2023-03-15 02:54:03] [INFO ] Deduced a trap composed of 52 places in 287 ms of which 1 ms to minimize.
[2023-03-15 02:54:03] [INFO ] Deduced a trap composed of 42 places in 296 ms of which 0 ms to minimize.
[2023-03-15 02:54:03] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4264 ms
[2023-03-15 02:54:05] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 1 ms to minimize.
[2023-03-15 02:54:06] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 0 ms to minimize.
[2023-03-15 02:54:06] [INFO ] Deduced a trap composed of 67 places in 306 ms of which 0 ms to minimize.
[2023-03-15 02:54:06] [INFO ] Deduced a trap composed of 43 places in 450 ms of which 1 ms to minimize.
[2023-03-15 02:54:07] [INFO ] Deduced a trap composed of 39 places in 358 ms of which 0 ms to minimize.
[2023-03-15 02:54:07] [INFO ] Deduced a trap composed of 20 places in 303 ms of which 0 ms to minimize.
[2023-03-15 02:54:08] [INFO ] Deduced a trap composed of 18 places in 349 ms of which 2 ms to minimize.
[2023-03-15 02:54:08] [INFO ] Deduced a trap composed of 66 places in 404 ms of which 1 ms to minimize.
[2023-03-15 02:54:09] [INFO ] Deduced a trap composed of 72 places in 488 ms of which 1 ms to minimize.
[2023-03-15 02:54:09] [INFO ] Deduced a trap composed of 31 places in 367 ms of which 1 ms to minimize.
[2023-03-15 02:54:10] [INFO ] Deduced a trap composed of 42 places in 415 ms of which 1 ms to minimize.
[2023-03-15 02:54:10] [INFO ] Deduced a trap composed of 38 places in 388 ms of which 1 ms to minimize.
[2023-03-15 02:54:11] [INFO ] Deduced a trap composed of 32 places in 389 ms of which 30 ms to minimize.
[2023-03-15 02:54:11] [INFO ] Deduced a trap composed of 33 places in 458 ms of which 1 ms to minimize.
[2023-03-15 02:54:12] [INFO ] Deduced a trap composed of 43 places in 377 ms of which 1 ms to minimize.
[2023-03-15 02:54:12] [INFO ] Deduced a trap composed of 71 places in 368 ms of which 1 ms to minimize.
[2023-03-15 02:54:13] [INFO ] Deduced a trap composed of 41 places in 322 ms of which 1 ms to minimize.
[2023-03-15 02:54:13] [INFO ] Deduced a trap composed of 36 places in 317 ms of which 0 ms to minimize.
[2023-03-15 02:54:13] [INFO ] Deduced a trap composed of 43 places in 324 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 02:54:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 02:54:13] [INFO ] After 25138ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0 real:4
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 64 ms.
Support contains 161 out of 482 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 482/482 places, 1189/1189 transitions.
Applied a total of 0 rules in 29 ms. Remains 482 /482 variables (removed 0) and now considering 1189/1189 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 482/482 places, 1189/1189 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 470 ms. (steps per millisecond=21 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 261848 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{2=1, 3=1}
Probabilistic random walk after 261848 steps, saw 47687 distinct states, run finished after 3004 ms. (steps per millisecond=87 ) properties seen :2
Running SMT prover for 2 properties.
[2023-03-15 02:54:18] [INFO ] Flow matrix only has 979 transitions (discarded 210 similar events)
[2023-03-15 02:54:18] [INFO ] Invariant cache hit.
[2023-03-15 02:54:18] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2023-03-15 02:54:18] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 02:54:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2023-03-15 02:54:22] [INFO ] After 3918ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 02:54:22] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 02:54:26] [INFO ] After 3252ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 02:54:27] [INFO ] Deduced a trap composed of 72 places in 221 ms of which 1 ms to minimize.
[2023-03-15 02:54:28] [INFO ] Deduced a trap composed of 68 places in 279 ms of which 0 ms to minimize.
[2023-03-15 02:54:28] [INFO ] Deduced a trap composed of 26 places in 276 ms of which 1 ms to minimize.
[2023-03-15 02:54:29] [INFO ] Deduced a trap composed of 36 places in 410 ms of which 3 ms to minimize.
[2023-03-15 02:54:29] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 1 ms to minimize.
[2023-03-15 02:54:30] [INFO ] Deduced a trap composed of 22 places in 228 ms of which 1 ms to minimize.
[2023-03-15 02:54:30] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 1 ms to minimize.
[2023-03-15 02:54:30] [INFO ] Deduced a trap composed of 20 places in 414 ms of which 1 ms to minimize.
[2023-03-15 02:54:31] [INFO ] Deduced a trap composed of 36 places in 406 ms of which 1 ms to minimize.
[2023-03-15 02:54:32] [INFO ] Deduced a trap composed of 19 places in 351 ms of which 1 ms to minimize.
[2023-03-15 02:54:32] [INFO ] Deduced a trap composed of 29 places in 420 ms of which 0 ms to minimize.
[2023-03-15 02:54:33] [INFO ] Deduced a trap composed of 12 places in 336 ms of which 1 ms to minimize.
[2023-03-15 02:54:33] [INFO ] Deduced a trap composed of 12 places in 325 ms of which 0 ms to minimize.
[2023-03-15 02:54:34] [INFO ] Deduced a trap composed of 15 places in 304 ms of which 0 ms to minimize.
[2023-03-15 02:54:34] [INFO ] Deduced a trap composed of 48 places in 330 ms of which 1 ms to minimize.
[2023-03-15 02:54:35] [INFO ] Deduced a trap composed of 11 places in 325 ms of which 1 ms to minimize.
[2023-03-15 02:54:35] [INFO ] Deduced a trap composed of 37 places in 683 ms of which 1 ms to minimize.
[2023-03-15 02:54:36] [INFO ] Deduced a trap composed of 15 places in 471 ms of which 1 ms to minimize.
[2023-03-15 02:54:36] [INFO ] Deduced a trap composed of 74 places in 330 ms of which 1 ms to minimize.
[2023-03-15 02:54:37] [INFO ] Deduced a trap composed of 22 places in 233 ms of which 0 ms to minimize.
[2023-03-15 02:54:37] [INFO ] Deduced a trap composed of 11 places in 353 ms of which 1 ms to minimize.
[2023-03-15 02:54:38] [INFO ] Deduced a trap composed of 32 places in 280 ms of which 1 ms to minimize.
[2023-03-15 02:54:38] [INFO ] Deduced a trap composed of 23 places in 294 ms of which 1 ms to minimize.
[2023-03-15 02:54:39] [INFO ] Deduced a trap composed of 23 places in 288 ms of which 1 ms to minimize.
[2023-03-15 02:54:39] [INFO ] Deduced a trap composed of 36 places in 436 ms of which 1 ms to minimize.
[2023-03-15 02:54:40] [INFO ] Deduced a trap composed of 48 places in 371 ms of which 1 ms to minimize.
[2023-03-15 02:54:40] [INFO ] Deduced a trap composed of 37 places in 360 ms of which 1 ms to minimize.
[2023-03-15 02:54:41] [INFO ] Deduced a trap composed of 22 places in 409 ms of which 1 ms to minimize.
[2023-03-15 02:54:41] [INFO ] Deduced a trap composed of 36 places in 335 ms of which 1 ms to minimize.
[2023-03-15 02:54:42] [INFO ] Deduced a trap composed of 61 places in 417 ms of which 1 ms to minimize.
[2023-03-15 02:54:42] [INFO ] Deduced a trap composed of 32 places in 461 ms of which 1 ms to minimize.
[2023-03-15 02:54:43] [INFO ] Deduced a trap composed of 64 places in 336 ms of which 1 ms to minimize.
[2023-03-15 02:54:43] [INFO ] Deduced a trap composed of 47 places in 447 ms of which 1 ms to minimize.
[2023-03-15 02:54:44] [INFO ] Deduced a trap composed of 2 places in 489 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 02:54:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 02:54:44] [INFO ] After 25519ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 56 ms.
Support contains 161 out of 482 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 482/482 places, 1189/1189 transitions.
Applied a total of 0 rules in 23 ms. Remains 482 /482 variables (removed 0) and now considering 1189/1189 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 482/482 places, 1189/1189 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 263264 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 263264 steps, saw 47753 distinct states, run finished after 3004 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-15 02:54:48] [INFO ] Flow matrix only has 979 transitions (discarded 210 similar events)
[2023-03-15 02:54:48] [INFO ] Invariant cache hit.
[2023-03-15 02:54:48] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-15 02:54:48] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 02:54:48] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2023-03-15 02:54:52] [INFO ] After 3268ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 02:54:52] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 02:54:55] [INFO ] After 3063ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 02:54:56] [INFO ] Deduced a trap composed of 72 places in 320 ms of which 1 ms to minimize.
[2023-03-15 02:54:57] [INFO ] Deduced a trap composed of 68 places in 415 ms of which 1 ms to minimize.
[2023-03-15 02:54:58] [INFO ] Deduced a trap composed of 26 places in 285 ms of which 1 ms to minimize.
[2023-03-15 02:54:58] [INFO ] Deduced a trap composed of 36 places in 444 ms of which 2 ms to minimize.
[2023-03-15 02:54:59] [INFO ] Deduced a trap composed of 23 places in 441 ms of which 1 ms to minimize.
[2023-03-15 02:54:59] [INFO ] Deduced a trap composed of 22 places in 382 ms of which 1 ms to minimize.
[2023-03-15 02:55:00] [INFO ] Deduced a trap composed of 32 places in 304 ms of which 1 ms to minimize.
[2023-03-15 02:55:00] [INFO ] Deduced a trap composed of 20 places in 382 ms of which 1 ms to minimize.
[2023-03-15 02:55:00] [INFO ] Deduced a trap composed of 36 places in 311 ms of which 0 ms to minimize.
[2023-03-15 02:55:01] [INFO ] Deduced a trap composed of 19 places in 365 ms of which 1 ms to minimize.
[2023-03-15 02:55:01] [INFO ] Deduced a trap composed of 29 places in 247 ms of which 0 ms to minimize.
[2023-03-15 02:55:02] [INFO ] Deduced a trap composed of 12 places in 387 ms of which 1 ms to minimize.
[2023-03-15 02:55:02] [INFO ] Deduced a trap composed of 12 places in 387 ms of which 1 ms to minimize.
[2023-03-15 02:55:03] [INFO ] Deduced a trap composed of 15 places in 308 ms of which 1 ms to minimize.
[2023-03-15 02:55:03] [INFO ] Deduced a trap composed of 48 places in 385 ms of which 1 ms to minimize.
[2023-03-15 02:55:04] [INFO ] Deduced a trap composed of 11 places in 383 ms of which 1 ms to minimize.
[2023-03-15 02:55:04] [INFO ] Deduced a trap composed of 37 places in 382 ms of which 1 ms to minimize.
[2023-03-15 02:55:04] [INFO ] Deduced a trap composed of 15 places in 395 ms of which 1 ms to minimize.
[2023-03-15 02:55:05] [INFO ] Deduced a trap composed of 74 places in 372 ms of which 1 ms to minimize.
[2023-03-15 02:55:05] [INFO ] Deduced a trap composed of 22 places in 361 ms of which 1 ms to minimize.
[2023-03-15 02:55:06] [INFO ] Deduced a trap composed of 11 places in 400 ms of which 1 ms to minimize.
[2023-03-15 02:55:06] [INFO ] Deduced a trap composed of 32 places in 374 ms of which 1 ms to minimize.
[2023-03-15 02:55:07] [INFO ] Deduced a trap composed of 23 places in 373 ms of which 1 ms to minimize.
[2023-03-15 02:55:07] [INFO ] Deduced a trap composed of 23 places in 404 ms of which 1 ms to minimize.
[2023-03-15 02:55:08] [INFO ] Deduced a trap composed of 36 places in 402 ms of which 1 ms to minimize.
[2023-03-15 02:55:08] [INFO ] Deduced a trap composed of 48 places in 388 ms of which 1 ms to minimize.
[2023-03-15 02:55:09] [INFO ] Deduced a trap composed of 37 places in 413 ms of which 1 ms to minimize.
[2023-03-15 02:55:09] [INFO ] Deduced a trap composed of 22 places in 347 ms of which 0 ms to minimize.
[2023-03-15 02:55:10] [INFO ] Deduced a trap composed of 36 places in 411 ms of which 1 ms to minimize.
[2023-03-15 02:55:10] [INFO ] Deduced a trap composed of 61 places in 361 ms of which 1 ms to minimize.
[2023-03-15 02:55:11] [INFO ] Deduced a trap composed of 32 places in 415 ms of which 1 ms to minimize.
[2023-03-15 02:55:12] [INFO ] Deduced a trap composed of 64 places in 344 ms of which 1 ms to minimize.
[2023-03-15 02:55:12] [INFO ] Deduced a trap composed of 47 places in 390 ms of which 1 ms to minimize.
[2023-03-15 02:55:12] [INFO ] Deduced a trap composed of 68 places in 291 ms of which 1 ms to minimize.
[2023-03-15 02:55:13] [INFO ] Deduced a trap composed of 51 places in 355 ms of which 1 ms to minimize.
[2023-03-15 02:55:13] [INFO ] Deduced a trap composed of 50 places in 257 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 02:55:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 02:55:13] [INFO ] After 25141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 92 ms.
Support contains 161 out of 482 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 482/482 places, 1189/1189 transitions.
Applied a total of 0 rules in 32 ms. Remains 482 /482 variables (removed 0) and now considering 1189/1189 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 482/482 places, 1189/1189 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 482/482 places, 1189/1189 transitions.
Applied a total of 0 rules in 32 ms. Remains 482 /482 variables (removed 0) and now considering 1189/1189 (removed 0) transitions.
[2023-03-15 02:55:13] [INFO ] Flow matrix only has 979 transitions (discarded 210 similar events)
[2023-03-15 02:55:13] [INFO ] Invariant cache hit.
[2023-03-15 02:55:14] [INFO ] Implicit Places using invariants in 644 ms returned []
[2023-03-15 02:55:14] [INFO ] Flow matrix only has 979 transitions (discarded 210 similar events)
[2023-03-15 02:55:14] [INFO ] Invariant cache hit.
[2023-03-15 02:55:15] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 02:55:16] [INFO ] Implicit Places using invariants and state equation in 1954 ms returned []
Implicit Place search using SMT with State Equation took 2601 ms to find 0 implicit places.
[2023-03-15 02:55:16] [INFO ] Redundant transitions in 106 ms returned []
[2023-03-15 02:55:16] [INFO ] Flow matrix only has 979 transitions (discarded 210 similar events)
[2023-03-15 02:55:16] [INFO ] Invariant cache hit.
[2023-03-15 02:55:17] [INFO ] Dead Transitions using invariants and state equation in 1178 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3928 ms. Remains : 482/482 places, 1189/1189 transitions.
Ensure Unique test removed 210 transitions
Reduce isomorphic transitions removed 210 transitions.
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 482 transition count 979
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 231 place count 468 transition count 972
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 14 rules applied. Total rules applied 245 place count 461 transition count 965
Drop transitions removed 210 transitions
Redundant transition composition rules discarded 210 transitions
Iterating global reduction 1 with 210 rules applied. Total rules applied 455 place count 461 transition count 755
Drop transitions removed 168 transitions
Trivial Post-agglo rules discarded 168 transitions
Performed 168 trivial Post agglomeration. Transition count delta: 168
Iterating post reduction 1 with 168 rules applied. Total rules applied 623 place count 461 transition count 587
Reduce places removed 168 places and 0 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 2 with 210 rules applied. Total rules applied 833 place count 293 transition count 545
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 875 place count 251 transition count 545
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 881 place count 251 transition count 539
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 887 place count 245 transition count 539
Applied a total of 887 rules in 435 ms. Remains 245 /482 variables (removed 237) and now considering 539/1189 (removed 650) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 539 rows 245 cols
[2023-03-15 02:55:18] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-15 02:55:18] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-15 02:55:18] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 02:55:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-15 02:55:21] [INFO ] After 2308ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 02:55:22] [INFO ] After 4178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1953 ms.
[2023-03-15 02:55:24] [INFO ] After 6247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2) (NOT p3)), (X (OR (AND (NOT p1) p0) (AND p0 (NOT p2) (NOT p3)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (NOT (AND p1 p0 (NOT p2) p3))), (X (NOT (AND p1 (NOT p0) (NOT p2) p3))), (X (NOT (OR (AND p1 p0 p2) (AND p1 p0 p3)))), (X (NOT (AND p1 p0 p2 (NOT p3)))), (X (OR (AND (NOT p1) p0 (NOT p3)) (AND p0 (NOT p2) (NOT p3)))), (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (NOT (AND p1 p0 p2 p3))), (X (NOT (OR (AND (NOT p1) p0 p3) (AND p0 (NOT p2) p3)))), (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p0) (NOT p2) p3)))), (X p0), (X (X (NOT (AND p1 (NOT p0) (NOT p2) p3)))), (X (X (NOT (OR (AND p1 p0 p2) (AND p1 p0 p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p1 p0 (NOT p2) p3)))), (X (X (NOT (AND p1 p0 p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (NOT (AND p1 p0 p2 p3)))), (X (X (NOT (OR (AND (NOT p1) p0 p3) (AND p0 (NOT p2) p3))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p0) (NOT p2) p3))))), (G (NOT (OR (AND (NOT p1) p3 (NOT p0)) (AND p3 (NOT p0) (NOT p2))))), (G (NOT (AND p1 (NOT p3) p0 p2))), (G (NOT (OR (AND (NOT p1) (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p0) (NOT p2))))), (G (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p0) (NOT p2))))), (G (NOT (AND p1 p3 (NOT p0) (NOT p2)))), (G (NOT (AND p1 p3 p0 p2)))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) p0) (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p0) (AND p0 (NOT p2) (NOT p3)))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (OR (AND (NOT p1) p0 (NOT p3)) (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p0 (NOT p3)) (AND p0 (NOT p2) (NOT p3)))))), (X (X p0)), (X (X (NOT p0))), (F (OR (AND (NOT p1) p3 p0) (AND p3 p0 (NOT p2)))), (F (NOT (OR (AND (NOT p1) (NOT p3) p0) (AND (NOT p3) p0 (NOT p2))))), (F (AND p3 p0)), (F (NOT (AND (NOT p3) p0))), (F (NOT (OR (AND (NOT p1) p0) (AND (NOT p3) p0 (NOT p2))))), (F (NOT p0))]
Knowledge based reduction with 29 factoid took 2182 ms. Reduced automaton from 4 states, 14 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p1) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p1) (AND p0 (NOT p2)))]
[2023-03-15 02:55:27] [INFO ] Flow matrix only has 979 transitions (discarded 210 similar events)
// Phase 1: matrix 979 rows 482 cols
[2023-03-15 02:55:27] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-15 02:55:29] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned sat
[2023-03-15 02:55:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:55:30] [INFO ] [Real]Absence check using state equation in 1034 ms returned sat
[2023-03-15 02:55:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 02:55:32] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2023-03-15 02:55:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 02:55:33] [INFO ] [Nat]Absence check using state equation in 998 ms returned sat
[2023-03-15 02:55:33] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 02:55:33] [INFO ] [Nat]Added 330 Read/Feed constraints in 93 ms returned sat
[2023-03-15 02:55:33] [INFO ] Deduced a trap composed of 31 places in 413 ms of which 1 ms to minimize.
[2023-03-15 02:55:34] [INFO ] Deduced a trap composed of 28 places in 416 ms of which 1 ms to minimize.
[2023-03-15 02:55:34] [INFO ] Deduced a trap composed of 14 places in 435 ms of which 1 ms to minimize.
[2023-03-15 02:55:35] [INFO ] Deduced a trap composed of 15 places in 390 ms of which 0 ms to minimize.
[2023-03-15 02:55:35] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2008 ms
[2023-03-15 02:55:35] [INFO ] Computed and/alt/rep : 888/2701/888 causal constraints (skipped 84 transitions) in 124 ms.
[2023-03-15 02:55:39] [INFO ] Deduced a trap composed of 44 places in 433 ms of which 1 ms to minimize.
[2023-03-15 02:55:39] [INFO ] Deduced a trap composed of 49 places in 289 ms of which 1 ms to minimize.
[2023-03-15 02:55:40] [INFO ] Deduced a trap composed of 14 places in 412 ms of which 1 ms to minimize.
[2023-03-15 02:55:40] [INFO ] Deduced a trap composed of 10 places in 400 ms of which 1 ms to minimize.
[2023-03-15 02:55:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2082 ms
[2023-03-15 02:55:41] [INFO ] Added : 145 causal constraints over 30 iterations in 5871 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-15 02:55:41] [INFO ] Flow matrix only has 979 transitions (discarded 210 similar events)
[2023-03-15 02:55:41] [INFO ] Invariant cache hit.
[2023-03-15 02:55:44] [INFO ] [Real]Absence check using 20 positive place invariants in 27 ms returned sat
[2023-03-15 02:55:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:55:45] [INFO ] [Real]Absence check using state equation in 826 ms returned sat
[2023-03-15 02:55:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 02:55:48] [INFO ] [Nat]Absence check using 20 positive place invariants in 29 ms returned sat
[2023-03-15 02:55:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 02:55:49] [INFO ] [Nat]Absence check using state equation in 891 ms returned sat
[2023-03-15 02:55:49] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 02:55:49] [INFO ] [Nat]Added 330 Read/Feed constraints in 146 ms returned sat
[2023-03-15 02:55:50] [INFO ] Deduced a trap composed of 66 places in 403 ms of which 3 ms to minimize.
[2023-03-15 02:55:50] [INFO ] Deduced a trap composed of 36 places in 242 ms of which 1 ms to minimize.
[2023-03-15 02:55:50] [INFO ] Deduced a trap composed of 20 places in 280 ms of which 1 ms to minimize.
[2023-03-15 02:55:51] [INFO ] Deduced a trap composed of 22 places in 432 ms of which 1 ms to minimize.
[2023-03-15 02:55:51] [INFO ] Deduced a trap composed of 42 places in 339 ms of which 0 ms to minimize.
[2023-03-15 02:55:52] [INFO ] Deduced a trap composed of 48 places in 421 ms of which 1 ms to minimize.
[2023-03-15 02:55:52] [INFO ] Deduced a trap composed of 69 places in 440 ms of which 1 ms to minimize.
[2023-03-15 02:55:53] [INFO ] Deduced a trap composed of 30 places in 391 ms of which 1 ms to minimize.
[2023-03-15 02:55:53] [INFO ] Deduced a trap composed of 11 places in 420 ms of which 0 ms to minimize.
[2023-03-15 02:55:54] [INFO ] Deduced a trap composed of 29 places in 314 ms of which 0 ms to minimize.
[2023-03-15 02:55:54] [INFO ] Deduced a trap composed of 29 places in 307 ms of which 1 ms to minimize.
[2023-03-15 02:55:54] [INFO ] Deduced a trap composed of 60 places in 283 ms of which 1 ms to minimize.
[2023-03-15 02:55:55] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 5195 ms
[2023-03-15 02:55:55] [INFO ] Computed and/alt/rep : 888/2701/888 causal constraints (skipped 84 transitions) in 114 ms.
[2023-03-15 02:55:59] [INFO ] Added : 191 causal constraints over 39 iterations in 4380 ms. Result :sat
Could not prove EG (AND p0 (NOT p2))
Support contains 119 out of 482 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 482/482 places, 1189/1189 transitions.
Applied a total of 0 rules in 26 ms. Remains 482 /482 variables (removed 0) and now considering 1189/1189 (removed 0) transitions.
[2023-03-15 02:55:59] [INFO ] Flow matrix only has 979 transitions (discarded 210 similar events)
[2023-03-15 02:55:59] [INFO ] Invariant cache hit.
[2023-03-15 02:56:00] [INFO ] Implicit Places using invariants in 800 ms returned []
[2023-03-15 02:56:00] [INFO ] Flow matrix only has 979 transitions (discarded 210 similar events)
[2023-03-15 02:56:00] [INFO ] Invariant cache hit.
[2023-03-15 02:56:00] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 02:56:02] [INFO ] Implicit Places using invariants and state equation in 2010 ms returned []
Implicit Place search using SMT with State Equation took 2816 ms to find 0 implicit places.
[2023-03-15 02:56:02] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-15 02:56:02] [INFO ] Flow matrix only has 979 transitions (discarded 210 similar events)
[2023-03-15 02:56:02] [INFO ] Invariant cache hit.
[2023-03-15 02:56:03] [INFO ] Dead Transitions using invariants and state equation in 1046 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3944 ms. Remains : 482/482 places, 1189/1189 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (OR (NOT p1) (AND p0 (NOT p2))))]
False Knowledge obtained : [(X (X (OR (NOT p1) (AND p0 (NOT p2))))), (X (X (NOT (OR (NOT p1) (AND p0 (NOT p2))))))]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 1 states, 1 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(OR (NOT p1) (AND p0 (NOT p2)))]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (OR (NOT p1) (AND p0 (NOT p2))))]
False Knowledge obtained : [(X (X (OR (NOT p1) (AND p0 (NOT p2))))), (X (X (NOT (OR (NOT p1) (AND p0 (NOT p2)))))), (F (NOT (OR (AND p0 (NOT p2)) (NOT p1))))]
Knowledge based reduction with 2 factoid took 188 ms. Reduced automaton from 1 states, 1 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(OR (NOT p1) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 51 ms :[(OR (NOT p1) (AND p0 (NOT p2)))]
[2023-03-15 02:56:03] [INFO ] Flow matrix only has 979 transitions (discarded 210 similar events)
[2023-03-15 02:56:04] [INFO ] Invariant cache hit.
[2023-03-15 02:56:06] [INFO ] [Real]Absence check using 20 positive place invariants in 31 ms returned sat
[2023-03-15 02:56:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:56:08] [INFO ] [Real]Absence check using state equation in 1649 ms returned sat
[2023-03-15 02:56:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 02:56:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 19 ms returned sat
[2023-03-15 02:56:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 02:56:11] [INFO ] [Nat]Absence check using state equation in 1005 ms returned sat
[2023-03-15 02:56:11] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 02:56:11] [INFO ] [Nat]Added 330 Read/Feed constraints in 109 ms returned sat
[2023-03-15 02:56:11] [INFO ] Deduced a trap composed of 43 places in 243 ms of which 1 ms to minimize.
[2023-03-15 02:56:12] [INFO ] Deduced a trap composed of 66 places in 269 ms of which 1 ms to minimize.
[2023-03-15 02:56:12] [INFO ] Deduced a trap composed of 10 places in 277 ms of which 1 ms to minimize.
[2023-03-15 02:56:12] [INFO ] Deduced a trap composed of 30 places in 230 ms of which 1 ms to minimize.
[2023-03-15 02:56:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1259 ms
[2023-03-15 02:56:12] [INFO ] Computed and/alt/rep : 888/2701/888 causal constraints (skipped 84 transitions) in 79 ms.
[2023-03-15 02:56:14] [INFO ] Added : 96 causal constraints over 20 iterations in 2027 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-15 02:56:14] [INFO ] Flow matrix only has 979 transitions (discarded 210 similar events)
[2023-03-15 02:56:14] [INFO ] Invariant cache hit.
[2023-03-15 02:56:18] [INFO ] [Real]Absence check using 20 positive place invariants in 28 ms returned sat
[2023-03-15 02:56:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:56:19] [INFO ] [Real]Absence check using state equation in 905 ms returned sat
[2023-03-15 02:56:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 02:56:22] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2023-03-15 02:56:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 02:56:23] [INFO ] [Nat]Absence check using state equation in 823 ms returned sat
[2023-03-15 02:56:23] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 02:56:23] [INFO ] [Nat]Added 330 Read/Feed constraints in 105 ms returned sat
[2023-03-15 02:56:23] [INFO ] Deduced a trap composed of 66 places in 242 ms of which 1 ms to minimize.
[2023-03-15 02:56:24] [INFO ] Deduced a trap composed of 36 places in 422 ms of which 1 ms to minimize.
[2023-03-15 02:56:24] [INFO ] Deduced a trap composed of 20 places in 425 ms of which 1 ms to minimize.
[2023-03-15 02:56:25] [INFO ] Deduced a trap composed of 22 places in 412 ms of which 1 ms to minimize.
[2023-03-15 02:56:25] [INFO ] Deduced a trap composed of 42 places in 428 ms of which 1 ms to minimize.
[2023-03-15 02:56:26] [INFO ] Deduced a trap composed of 48 places in 420 ms of which 1 ms to minimize.
[2023-03-15 02:56:26] [INFO ] Deduced a trap composed of 69 places in 432 ms of which 1 ms to minimize.
[2023-03-15 02:56:27] [INFO ] Deduced a trap composed of 30 places in 408 ms of which 0 ms to minimize.
[2023-03-15 02:56:27] [INFO ] Deduced a trap composed of 11 places in 453 ms of which 1 ms to minimize.
[2023-03-15 02:56:28] [INFO ] Deduced a trap composed of 29 places in 427 ms of which 1 ms to minimize.
[2023-03-15 02:56:28] [INFO ] Deduced a trap composed of 29 places in 439 ms of which 1 ms to minimize.
[2023-03-15 02:56:29] [INFO ] Deduced a trap composed of 60 places in 278 ms of which 1 ms to minimize.
[2023-03-15 02:56:29] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 5659 ms
[2023-03-15 02:56:29] [INFO ] Computed and/alt/rep : 888/2701/888 causal constraints (skipped 84 transitions) in 109 ms.
[2023-03-15 02:56:33] [INFO ] Added : 191 causal constraints over 39 iterations in 3912 ms. Result :sat
Could not prove EG (AND p0 (NOT p2))
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p1) (AND p0 (NOT p2)))]
Product exploration explored 100000 steps with 19936 reset in 1318 ms.
Product exploration explored 100000 steps with 19889 reset in 1125 ms.
Support contains 119 out of 482 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 482/482 places, 1189/1189 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 482 transition count 1188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 481 transition count 1188
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 481 transition count 1183
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 476 transition count 1183
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 26 place count 469 transition count 1176
Applied a total of 26 rules in 51 ms. Remains 469 /482 variables (removed 13) and now considering 1176/1189 (removed 13) transitions.
[2023-03-15 02:56:35] [INFO ] Flow matrix only has 966 transitions (discarded 210 similar events)
// Phase 1: matrix 966 rows 469 cols
[2023-03-15 02:56:35] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-15 02:56:36] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-15 02:56:36] [INFO ] Flow matrix only has 966 transitions (discarded 210 similar events)
[2023-03-15 02:56:36] [INFO ] Invariant cache hit.
[2023-03-15 02:56:36] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 02:56:38] [INFO ] Implicit Places using invariants and state equation in 2002 ms returned []
Implicit Place search using SMT with State Equation took 2393 ms to find 0 implicit places.
[2023-03-15 02:56:38] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-15 02:56:38] [INFO ] Flow matrix only has 966 transitions (discarded 210 similar events)
[2023-03-15 02:56:38] [INFO ] Invariant cache hit.
[2023-03-15 02:56:38] [INFO ] Dead Transitions using invariants and state equation in 764 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 469/482 places, 1176/1189 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3257 ms. Remains : 469/482 places, 1176/1189 transitions.
Treatment of property Peterson-COL-6-LTLFireability-08 finished in 187183 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 553 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 19 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 02:56:39] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2023-03-15 02:56:39] [INFO ] Computed 27 place invariants in 8 ms
[2023-03-15 02:56:39] [INFO ] Implicit Places using invariants in 653 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 670 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 39 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 729 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-6-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LT s254 1) (LT s384 1) (LT s319 1) (LT s189 1) (LT s392 1) (LT s262 1) (LT s327 1) (LT s197 1) (LT s140 1) (LT s270 1) (LT s400 1) (LT s335 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 3 ms.
FORMULA Peterson-COL-6-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-6-LTLFireability-09 finished in 940 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!p0 U (G(p2)||p1)))))'
Support contains 63 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 49 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 02:56:40] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 02:56:40] [INFO ] Invariant cache hit.
[2023-03-15 02:56:41] [INFO ] Implicit Places using invariants in 977 ms returned []
[2023-03-15 02:56:41] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 02:56:41] [INFO ] Invariant cache hit.
[2023-03-15 02:56:42] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 02:56:50] [INFO ] Implicit Places using invariants and state equation in 9383 ms returned []
Implicit Place search using SMT with State Equation took 10372 ms to find 0 implicit places.
[2023-03-15 02:56:50] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 02:56:50] [INFO ] Invariant cache hit.
[2023-03-15 02:56:51] [INFO ] Dead Transitions using invariants and state equation in 1313 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11747 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Peterson-COL-6-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s470 1) (GEQ s452 1) (GEQ s482 1) (GEQ s464 1) (GEQ s446 1) (GEQ s476 1) (GEQ s458 1)), p0:(AND (OR (LT s0 1) (LT s7 1)) (OR (LT s6 1) (LT s19...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 2 ms.
FORMULA Peterson-COL-6-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-6-LTLFireability-10 finished in 12033 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 84 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 588 transitions
Trivial Post-agglo rules discarded 588 transitions
Performed 588 trivial Post agglomeration. Transition count delta: 588
Iterating post reduction 0 with 588 rules applied. Total rules applied 588 place count 1330 transition count 1442
Reduce places removed 588 places and 0 transitions.
Iterating post reduction 1 with 588 rules applied. Total rules applied 1176 place count 742 transition count 1442
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1176 place count 742 transition count 1148
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1764 place count 448 transition count 1148
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1848 place count 406 transition count 1106
Applied a total of 1848 rules in 116 ms. Remains 406 /1330 variables (removed 924) and now considering 1106/2030 (removed 924) transitions.
[2023-03-15 02:56:52] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 406 cols
[2023-03-15 02:56:52] [INFO ] Computed 27 place invariants in 3 ms
[2023-03-15 02:56:52] [INFO ] Implicit Places using invariants in 590 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 593 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 399/1330 places, 1106/2030 transitions.
Applied a total of 0 rules in 24 ms. Remains 399 /399 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 734 ms. Remains : 399/1330 places, 1106/2030 transitions.
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
Running random walk in product with property : Peterson-COL-6-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s31 1) (GEQ s100 1)) (AND (GEQ s54 1) (GEQ s73 1)) (AND (GEQ s24 1) (GEQ s75 1)) (AND (GEQ s29 1) (GEQ s64 1)) (AND (GEQ s26 1) (GEQ s87 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3420 reset in 1469 ms.
Stack based approach found an accepted trace after 128 steps with 5 reset with depth 51 and stack size 51 in 2 ms.
FORMULA Peterson-COL-6-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-COL-6-LTLFireability-12 finished in 2319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(F(p2)&&p1))))'
Support contains 308 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 216 place count 1330 transition count 1814
Reduce places removed 216 places and 0 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 1 with 258 rules applied. Total rules applied 474 place count 1114 transition count 1772
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 516 place count 1072 transition count 1772
Performed 287 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 287 Pre rules applied. Total rules applied 516 place count 1072 transition count 1485
Deduced a syphon composed of 287 places in 0 ms
Reduce places removed 287 places and 0 transitions.
Iterating global reduction 3 with 574 rules applied. Total rules applied 1090 place count 785 transition count 1485
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 1162 place count 749 transition count 1449
Applied a total of 1162 rules in 163 ms. Remains 749 /1330 variables (removed 581) and now considering 1449/2030 (removed 581) transitions.
[2023-03-15 02:56:54] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
// Phase 1: matrix 1239 rows 749 cols
[2023-03-15 02:56:54] [INFO ] Computed 27 place invariants in 8 ms
[2023-03-15 02:56:54] [INFO ] Implicit Places using invariants in 383 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 387 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 742/1330 places, 1449/2030 transitions.
Applied a total of 0 rules in 38 ms. Remains 742 /742 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 589 ms. Remains : 742/1330 places, 1449/2030 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p2), (AND (NOT p2) p0), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Running random walk in product with property : Peterson-COL-6-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}]], initial=3, aps=[p2:(OR (AND (GEQ s13 1) (GEQ s459 1)) (AND (GEQ s5 1) (GEQ s426 1)) (AND (GEQ s1 1) (GEQ s322 1)) (AND (GEQ s11 1) (GEQ s386 1)) (AND (GEQ s3 1) (GEQ s395...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 5512 reset in 5259 ms.
Product exploration explored 100000 steps with 5452 reset in 4955 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (AND (NOT p2) (NOT p0))), (X (AND p1 (NOT p2) (NOT p0))), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND p1 (NOT p2) (NOT p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 957 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Finished random walk after 210 steps, including 0 resets, run visited all 3 properties in 11 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (AND (NOT p2) (NOT p0))), (X (AND p1 (NOT p2) (NOT p0))), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND p1 (NOT p2) (NOT p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) (NOT p0)))), (F (AND (NOT p2) p0))]
Knowledge based reduction with 16 factoid took 686 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Support contains 266 out of 742 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 742/742 places, 1449/1449 transitions.
Applied a total of 0 rules in 10 ms. Remains 742 /742 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
[2023-03-15 02:57:07] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
// Phase 1: matrix 1239 rows 742 cols
[2023-03-15 02:57:07] [INFO ] Computed 20 place invariants in 9 ms
[2023-03-15 02:57:07] [INFO ] Implicit Places using invariants in 338 ms returned []
[2023-03-15 02:57:07] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2023-03-15 02:57:07] [INFO ] Invariant cache hit.
[2023-03-15 02:57:08] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 02:57:09] [INFO ] Implicit Places using invariants and state equation in 1630 ms returned []
Implicit Place search using SMT with State Equation took 1971 ms to find 0 implicit places.
[2023-03-15 02:57:09] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2023-03-15 02:57:09] [INFO ] Invariant cache hit.
[2023-03-15 02:57:10] [INFO ] Dead Transitions using invariants and state equation in 1472 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3454 ms. Remains : 742/742 places, 1449/1449 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 259 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Finished random walk after 348 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=87 )
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 6 factoid took 388 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 131 ms :[(NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Product exploration explored 100000 steps with 5464 reset in 2855 ms.
Product exploration explored 100000 steps with 5496 reset in 2552 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 103 ms :[(NOT p2), (AND (NOT p2) p0), (AND (NOT p2) p0)]
Support contains 266 out of 742 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 742/742 places, 1449/1449 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 742 transition count 1449
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 36 Pre rules applied. Total rules applied 42 place count 742 transition count 1449
Deduced a syphon composed of 78 places in 1 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 78 place count 742 transition count 1449
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 114 place count 706 transition count 1413
Deduced a syphon composed of 42 places in 1 ms
Iterating global reduction 1 with 36 rules applied. Total rules applied 150 place count 706 transition count 1413
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 48 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 156 place count 706 transition count 1413
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 162 place count 700 transition count 1407
Deduced a syphon composed of 42 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 168 place count 700 transition count 1407
Deduced a syphon composed of 42 places in 1 ms
Applied a total of 168 rules in 193 ms. Remains 700 /742 variables (removed 42) and now considering 1407/1449 (removed 42) transitions.
[2023-03-15 02:57:18] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-15 02:57:18] [INFO ] Flow matrix only has 1197 transitions (discarded 210 similar events)
// Phase 1: matrix 1197 rows 700 cols
[2023-03-15 02:57:18] [INFO ] Computed 20 place invariants in 6 ms
[2023-03-15 02:57:19] [INFO ] Dead Transitions using invariants and state equation in 1484 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 700/742 places, 1407/1449 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1778 ms. Remains : 700/742 places, 1407/1449 transitions.
Support contains 266 out of 742 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 742/742 places, 1449/1449 transitions.
Applied a total of 0 rules in 32 ms. Remains 742 /742 variables (removed 0) and now considering 1449/1449 (removed 0) transitions.
[2023-03-15 02:57:19] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
// Phase 1: matrix 1239 rows 742 cols
[2023-03-15 02:57:19] [INFO ] Computed 20 place invariants in 6 ms
[2023-03-15 02:57:19] [INFO ] Implicit Places using invariants in 357 ms returned []
[2023-03-15 02:57:19] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2023-03-15 02:57:19] [INFO ] Invariant cache hit.
[2023-03-15 02:57:20] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 02:57:22] [INFO ] Implicit Places using invariants and state equation in 2203 ms returned []
Implicit Place search using SMT with State Equation took 2592 ms to find 0 implicit places.
[2023-03-15 02:57:22] [INFO ] Flow matrix only has 1239 transitions (discarded 210 similar events)
[2023-03-15 02:57:22] [INFO ] Invariant cache hit.
[2023-03-15 02:57:23] [INFO ] Dead Transitions using invariants and state equation in 1237 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3900 ms. Remains : 742/742 places, 1449/1449 transitions.
Treatment of property Peterson-COL-6-LTLFireability-14 finished in 29284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 84 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 66 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 02:57:23] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2023-03-15 02:57:23] [INFO ] Computed 27 place invariants in 9 ms
[2023-03-15 02:57:24] [INFO ] Implicit Places using invariants in 647 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 663 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 51 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 780 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-COL-6-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s63 1) (LT s99 1)) (OR (LT s75 1) (LT s130 1)) (OR (LT s60 1) (LT s122 1)) (OR (LT s78 1) (LT s107 1)) (OR (LT s94 1) (LT s121 1)) (OR (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Peterson-COL-6-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-COL-6-LTLFireability-15 finished in 882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0)||(X(G(p1))&&G(p2))))'
Found a Lengthening insensitive property : Peterson-COL-6-LTLFireability-04
Stuttering acceptance computed with spot in 112 ms :[(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), p0]
Support contains 378 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1330 transition count 2024
Reduce places removed 6 places and 0 transitions.
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 294
Iterating post reduction 1 with 300 rules applied. Total rules applied 306 place count 1324 transition count 1730
Reduce places removed 294 places and 0 transitions.
Iterating post reduction 2 with 294 rules applied. Total rules applied 600 place count 1030 transition count 1730
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 600 place count 1030 transition count 1688
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 684 place count 988 transition count 1688
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 4 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 756 place count 952 transition count 1652
Applied a total of 756 rules in 199 ms. Remains 952 /1330 variables (removed 378) and now considering 1652/2030 (removed 378) transitions.
[2023-03-15 02:57:24] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
// Phase 1: matrix 1442 rows 952 cols
[2023-03-15 02:57:24] [INFO ] Computed 27 place invariants in 16 ms
[2023-03-15 02:57:25] [INFO ] Implicit Places using invariants in 811 ms returned [0, 1, 2, 3, 4, 5, 6]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 813 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 945/1330 places, 1652/2030 transitions.
Applied a total of 0 rules in 37 ms. Remains 945 /945 variables (removed 0) and now considering 1652/1652 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1049 ms. Remains : 945/1330 places, 1652/2030 transitions.
Running random walk in product with property : Peterson-COL-6-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2 p1), acceptance={} source=1 dest: 1}, { cond=(OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s28 1) (LT s64 1)) (OR (LT s40 1) (LT s95 1)) (OR (LT s25 1) (LT s87 1)) (OR (LT s43 1) (LT s72 1)) (OR (LT s59 1) (LT s86 1)) (OR (LT s24...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 19908 reset in 1992 ms.
Product exploration explored 100000 steps with 19941 reset in 1846 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 p2 p1))), (X p0), (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p2 p1))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))))]
Knowledge based reduction with 5 factoid took 415 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[p0, p0]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p0 p2 p1))), (X p0), (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p2 p1))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))))), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 298 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[p0]
Stuttering acceptance computed with spot in 34 ms :[p0]
[2023-03-15 02:57:30] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
// Phase 1: matrix 1442 rows 945 cols
[2023-03-15 02:57:30] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-15 02:57:32] [INFO ] [Real]Absence check using 20 positive place invariants in 24 ms returned sat
[2023-03-15 02:57:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:57:34] [INFO ] [Real]Absence check using state equation in 2184 ms returned sat
[2023-03-15 02:57:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 02:57:37] [INFO ] [Nat]Absence check using 20 positive place invariants in 23 ms returned sat
[2023-03-15 02:57:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 02:57:39] [INFO ] [Nat]Absence check using state equation in 2201 ms returned sat
[2023-03-15 02:57:39] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 02:57:39] [INFO ] [Nat]Added 330 Read/Feed constraints in 170 ms returned sat
[2023-03-15 02:57:40] [INFO ] Deduced a trap composed of 95 places in 678 ms of which 1 ms to minimize.
[2023-03-15 02:57:41] [INFO ] Deduced a trap composed of 39 places in 710 ms of which 1 ms to minimize.
[2023-03-15 02:57:42] [INFO ] Deduced a trap composed of 19 places in 879 ms of which 1 ms to minimize.
[2023-03-15 02:57:42] [INFO ] Deduced a trap composed of 35 places in 774 ms of which 1 ms to minimize.
[2023-03-15 02:57:43] [INFO ] Deduced a trap composed of 14 places in 640 ms of which 1 ms to minimize.
[2023-03-15 02:57:44] [INFO ] Deduced a trap composed of 34 places in 723 ms of which 1 ms to minimize.
[2023-03-15 02:57:45] [INFO ] Deduced a trap composed of 15 places in 855 ms of which 2 ms to minimize.
[2023-03-15 02:57:46] [INFO ] Deduced a trap composed of 58 places in 556 ms of which 1 ms to minimize.
[2023-03-15 02:57:47] [INFO ] Deduced a trap composed of 37 places in 608 ms of which 1 ms to minimize.
[2023-03-15 02:57:47] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 7811 ms
[2023-03-15 02:57:47] [INFO ] Computed and/alt/rep : 1351/3374/1351 causal constraints (skipped 84 transitions) in 157 ms.
[2023-03-15 02:57:50] [INFO ] Added : 75 causal constraints over 15 iterations in 2726 ms. Result :unknown
Could not prove EG p0
Support contains 84 out of 945 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 945/945 places, 1652/1652 transitions.
Applied a total of 0 rules in 56 ms. Remains 945 /945 variables (removed 0) and now considering 1652/1652 (removed 0) transitions.
[2023-03-15 02:57:50] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
[2023-03-15 02:57:50] [INFO ] Invariant cache hit.
[2023-03-15 02:57:50] [INFO ] Implicit Places using invariants in 648 ms returned []
[2023-03-15 02:57:50] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
[2023-03-15 02:57:50] [INFO ] Invariant cache hit.
[2023-03-15 02:57:51] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 02:57:54] [INFO ] Implicit Places using invariants and state equation in 3916 ms returned []
Implicit Place search using SMT with State Equation took 4567 ms to find 0 implicit places.
[2023-03-15 02:57:54] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-15 02:57:54] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
[2023-03-15 02:57:54] [INFO ] Invariant cache hit.
[2023-03-15 02:57:55] [INFO ] Dead Transitions using invariants and state equation in 1255 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5929 ms. Remains : 945/945 places, 1652/1652 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[p0]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[p0]
Stuttering acceptance computed with spot in 34 ms :[p0]
[2023-03-15 02:57:56] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
[2023-03-15 02:57:56] [INFO ] Invariant cache hit.
[2023-03-15 02:57:59] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2023-03-15 02:57:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 02:58:01] [INFO ] [Real]Absence check using state equation in 1957 ms returned sat
[2023-03-15 02:58:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 02:58:03] [INFO ] [Nat]Absence check using 20 positive place invariants in 25 ms returned sat
[2023-03-15 02:58:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 02:58:05] [INFO ] [Nat]Absence check using state equation in 1964 ms returned sat
[2023-03-15 02:58:05] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 02:58:05] [INFO ] [Nat]Added 330 Read/Feed constraints in 222 ms returned sat
[2023-03-15 02:58:06] [INFO ] Deduced a trap composed of 54 places in 888 ms of which 2 ms to minimize.
[2023-03-15 02:58:07] [INFO ] Deduced a trap composed of 17 places in 906 ms of which 1 ms to minimize.
[2023-03-15 02:58:08] [INFO ] Deduced a trap composed of 35 places in 708 ms of which 2 ms to minimize.
[2023-03-15 02:58:09] [INFO ] Deduced a trap composed of 41 places in 832 ms of which 1 ms to minimize.
[2023-03-15 02:58:10] [INFO ] Deduced a trap composed of 58 places in 761 ms of which 3 ms to minimize.
[2023-03-15 02:58:10] [INFO ] Deduced a trap composed of 56 places in 624 ms of which 1 ms to minimize.
[2023-03-15 02:58:11] [INFO ] Deduced a trap composed of 64 places in 695 ms of which 1 ms to minimize.
[2023-03-15 02:58:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 6124 ms
[2023-03-15 02:58:11] [INFO ] Computed and/alt/rep : 1351/3374/1351 causal constraints (skipped 84 transitions) in 139 ms.
[2023-03-15 02:58:16] [INFO ] Added : 170 causal constraints over 34 iterations in 4460 ms. Result :unknown
Could not prove EG p0
Stuttering acceptance computed with spot in 40 ms :[p0]
Product exploration explored 100000 steps with 19887 reset in 1006 ms.
Product exploration explored 100000 steps with 19860 reset in 1283 ms.
Support contains 84 out of 945 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 945/945 places, 1652/1652 transitions.
Drop transitions removed 288 transitions
Trivial Post-agglo rules discarded 288 transitions
Performed 288 trivial Post agglomeration. Transition count delta: 288
Iterating post reduction 0 with 288 rules applied. Total rules applied 288 place count 945 transition count 1364
Reduce places removed 288 places and 0 transitions.
Iterating post reduction 1 with 288 rules applied. Total rules applied 576 place count 657 transition count 1364
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 576 place count 657 transition count 1112
Deduced a syphon composed of 252 places in 1 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 1080 place count 405 transition count 1112
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1092 place count 399 transition count 1106
Applied a total of 1092 rules in 57 ms. Remains 399 /945 variables (removed 546) and now considering 1106/1652 (removed 546) transitions.
[2023-03-15 02:58:18] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 02:58:18] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-15 02:58:19] [INFO ] Implicit Places using invariants in 493 ms returned []
[2023-03-15 02:58:19] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 02:58:19] [INFO ] Invariant cache hit.
[2023-03-15 02:58:19] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 02:58:20] [INFO ] Implicit Places using invariants and state equation in 1997 ms returned []
Implicit Place search using SMT with State Equation took 2494 ms to find 0 implicit places.
[2023-03-15 02:58:21] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-15 02:58:21] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 02:58:21] [INFO ] Invariant cache hit.
[2023-03-15 02:58:21] [INFO ] Dead Transitions using invariants and state equation in 859 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 399/945 places, 1106/1652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3436 ms. Remains : 399/945 places, 1106/1652 transitions.
Treatment of property Peterson-COL-6-LTLFireability-04 finished in 57534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(!p0)||(p1&&F(!p0)&&(G(p3)||p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(F(p2)&&p1))))'
[2023-03-15 02:58:22] [INFO ] Flatten gal took : 102 ms
[2023-03-15 02:58:22] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 12 ms.
[2023-03-15 02:58:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1330 places, 2030 transitions and 6272 arcs took 11 ms.
Total runtime 425848 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Peterson-COL-6
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLFireability
FORMULA Peterson-COL-6-LTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Peterson-COL-6-LTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678849587937
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 Peterson-COL-6-LTLFireability-08
lola: time limit : 1181 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for Peterson-COL-6-LTLFireability-08
lola: result : true
lola: markings : 4580
lola: fired transitions : 29771
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 Peterson-COL-6-LTLFireability-04
lola: time limit : 1772 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Peterson-COL-6-LTLFireability-04
lola: result : true
lola: markings : 1726
lola: fired transitions : 4466
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 Peterson-COL-6-LTLFireability-14
lola: time limit : 3545 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 4/3545 1/32 Peterson-COL-6-LTLFireability-14 34758 m, 6951 m/sec, 42111 t fired, .
Time elapsed: 59 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 9/3545 1/32 Peterson-COL-6-LTLFireability-14 79671 m, 8982 m/sec, 99029 t fired, .
Time elapsed: 64 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 14/3545 2/32 Peterson-COL-6-LTLFireability-14 120884 m, 8242 m/sec, 154322 t fired, .
Time elapsed: 69 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 19/3545 2/32 Peterson-COL-6-LTLFireability-14 162099 m, 8243 m/sec, 208946 t fired, .
Time elapsed: 74 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 24/3545 3/32 Peterson-COL-6-LTLFireability-14 205194 m, 8619 m/sec, 267492 t fired, .
Time elapsed: 79 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 29/3545 3/32 Peterson-COL-6-LTLFireability-14 249314 m, 8824 m/sec, 326348 t fired, .
Time elapsed: 84 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 34/3545 3/32 Peterson-COL-6-LTLFireability-14 292879 m, 8713 m/sec, 383680 t fired, .
Time elapsed: 89 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 39/3545 4/32 Peterson-COL-6-LTLFireability-14 334932 m, 8410 m/sec, 441219 t fired, .
Time elapsed: 94 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 44/3545 4/32 Peterson-COL-6-LTLFireability-14 377241 m, 8461 m/sec, 498656 t fired, .
Time elapsed: 99 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 49/3545 4/32 Peterson-COL-6-LTLFireability-14 420605 m, 8672 m/sec, 556904 t fired, .
Time elapsed: 104 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 54/3545 5/32 Peterson-COL-6-LTLFireability-14 464226 m, 8724 m/sec, 610667 t fired, .
Time elapsed: 109 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 59/3545 5/32 Peterson-COL-6-LTLFireability-14 506684 m, 8491 m/sec, 667081 t fired, .
Time elapsed: 114 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 64/3545 6/32 Peterson-COL-6-LTLFireability-14 549451 m, 8553 m/sec, 724393 t fired, .
Time elapsed: 119 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 69/3545 6/32 Peterson-COL-6-LTLFireability-14 590041 m, 8118 m/sec, 779032 t fired, .
Time elapsed: 124 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 74/3545 7/32 Peterson-COL-6-LTLFireability-14 632347 m, 8461 m/sec, 835113 t fired, .
Time elapsed: 129 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 79/3545 7/32 Peterson-COL-6-LTLFireability-14 673454 m, 8221 m/sec, 891056 t fired, .
Time elapsed: 134 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 84/3545 7/32 Peterson-COL-6-LTLFireability-14 715325 m, 8374 m/sec, 950022 t fired, .
Time elapsed: 139 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 89/3545 8/32 Peterson-COL-6-LTLFireability-14 756762 m, 8287 m/sec, 1003496 t fired, .
Time elapsed: 144 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 94/3545 8/32 Peterson-COL-6-LTLFireability-14 797379 m, 8123 m/sec, 1059080 t fired, .
Time elapsed: 149 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 99/3545 8/32 Peterson-COL-6-LTLFireability-14 839875 m, 8499 m/sec, 1118751 t fired, .
Time elapsed: 154 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 104/3545 9/32 Peterson-COL-6-LTLFireability-14 881869 m, 8398 m/sec, 1173503 t fired, .
Time elapsed: 159 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 109/3545 9/32 Peterson-COL-6-LTLFireability-14 922510 m, 8128 m/sec, 1228320 t fired, .
Time elapsed: 164 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 114/3545 10/32 Peterson-COL-6-LTLFireability-14 963940 m, 8286 m/sec, 1283240 t fired, .
Time elapsed: 169 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 119/3545 10/32 Peterson-COL-6-LTLFireability-14 1006756 m, 8563 m/sec, 1338304 t fired, .
Time elapsed: 174 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 124/3545 10/32 Peterson-COL-6-LTLFireability-14 1049084 m, 8465 m/sec, 1394632 t fired, .
Time elapsed: 179 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 129/3545 11/32 Peterson-COL-6-LTLFireability-14 1090957 m, 8374 m/sec, 1450471 t fired, .
Time elapsed: 184 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 134/3545 11/32 Peterson-COL-6-LTLFireability-14 1132653 m, 8339 m/sec, 1506085 t fired, .
Time elapsed: 189 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 139/3545 12/32 Peterson-COL-6-LTLFireability-14 1174726 m, 8414 m/sec, 1561104 t fired, .
Time elapsed: 194 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 144/3545 12/32 Peterson-COL-6-LTLFireability-14 1216866 m, 8428 m/sec, 1617500 t fired, .
Time elapsed: 199 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 149/3545 12/32 Peterson-COL-6-LTLFireability-14 1257243 m, 8075 m/sec, 1671595 t fired, .
Time elapsed: 204 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 154/3545 13/32 Peterson-COL-6-LTLFireability-14 1298702 m, 8291 m/sec, 1727577 t fired, .
Time elapsed: 209 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 159/3545 13/32 Peterson-COL-6-LTLFireability-14 1339945 m, 8248 m/sec, 1782253 t fired, .
Time elapsed: 214 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 164/3545 14/32 Peterson-COL-6-LTLFireability-14 1380010 m, 8013 m/sec, 1836013 t fired, .
Time elapsed: 219 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 169/3545 14/32 Peterson-COL-6-LTLFireability-14 1419158 m, 7829 m/sec, 1893077 t fired, .
Time elapsed: 224 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 174/3545 15/32 Peterson-COL-6-LTLFireability-14 1457167 m, 7601 m/sec, 1947685 t fired, .
Time elapsed: 229 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 179/3545 15/32 Peterson-COL-6-LTLFireability-14 1493994 m, 7365 m/sec, 2001259 t fired, .
Time elapsed: 234 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 184/3545 15/32 Peterson-COL-6-LTLFireability-14 1529217 m, 7044 m/sec, 2052853 t fired, .
Time elapsed: 239 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 189/3545 16/32 Peterson-COL-6-LTLFireability-14 1568247 m, 7806 m/sec, 2110215 t fired, .
Time elapsed: 244 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 194/3545 16/32 Peterson-COL-6-LTLFireability-14 1608426 m, 8035 m/sec, 2168051 t fired, .
Time elapsed: 249 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 199/3545 17/32 Peterson-COL-6-LTLFireability-14 1647741 m, 7863 m/sec, 2226194 t fired, .
Time elapsed: 254 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 204/3545 17/32 Peterson-COL-6-LTLFireability-14 1685995 m, 7650 m/sec, 2280997 t fired, .
Time elapsed: 259 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 209/3545 17/32 Peterson-COL-6-LTLFireability-14 1723270 m, 7455 m/sec, 2339396 t fired, .
Time elapsed: 264 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 214/3545 18/32 Peterson-COL-6-LTLFireability-14 1762165 m, 7779 m/sec, 2392196 t fired, .
Time elapsed: 269 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 219/3545 18/32 Peterson-COL-6-LTLFireability-14 1802065 m, 7980 m/sec, 2450718 t fired, .
Time elapsed: 274 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 224/3545 19/32 Peterson-COL-6-LTLFireability-14 1842435 m, 8074 m/sec, 2512896 t fired, .
Time elapsed: 279 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 229/3545 19/32 Peterson-COL-6-LTLFireability-14 1881739 m, 7860 m/sec, 2568250 t fired, .
Time elapsed: 284 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 234/3545 19/32 Peterson-COL-6-LTLFireability-14 1917828 m, 7217 m/sec, 2621595 t fired, .
Time elapsed: 289 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 239/3545 20/32 Peterson-COL-6-LTLFireability-14 1954837 m, 7401 m/sec, 2679572 t fired, .
Time elapsed: 294 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 244/3545 20/32 Peterson-COL-6-LTLFireability-14 1994490 m, 7930 m/sec, 2737810 t fired, .
Time elapsed: 299 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 249/3545 20/32 Peterson-COL-6-LTLFireability-14 2032327 m, 7567 m/sec, 2789439 t fired, .
Time elapsed: 304 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 254/3545 21/32 Peterson-COL-6-LTLFireability-14 2067673 m, 7069 m/sec, 2840868 t fired, .
Time elapsed: 309 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 259/3545 21/32 Peterson-COL-6-LTLFireability-14 2101299 m, 6725 m/sec, 2890572 t fired, .
Time elapsed: 314 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 264/3545 22/32 Peterson-COL-6-LTLFireability-14 2138380 m, 7416 m/sec, 2944438 t fired, .
Time elapsed: 319 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 269/3545 22/32 Peterson-COL-6-LTLFireability-14 2175518 m, 7427 m/sec, 2999057 t fired, .
Time elapsed: 324 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 274/3545 22/32 Peterson-COL-6-LTLFireability-14 2212843 m, 7465 m/sec, 3054914 t fired, .
Time elapsed: 329 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 279/3545 23/32 Peterson-COL-6-LTLFireability-14 2249217 m, 7274 m/sec, 3107723 t fired, .
Time elapsed: 334 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 284/3545 23/32 Peterson-COL-6-LTLFireability-14 2286540 m, 7464 m/sec, 3163353 t fired, .
Time elapsed: 339 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 289/3545 23/32 Peterson-COL-6-LTLFireability-14 2323230 m, 7338 m/sec, 3223216 t fired, .
Time elapsed: 344 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 294/3545 24/32 Peterson-COL-6-LTLFireability-14 2362109 m, 7775 m/sec, 3278665 t fired, .
Time elapsed: 349 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 299/3545 24/32 Peterson-COL-6-LTLFireability-14 2401606 m, 7899 m/sec, 3331934 t fired, .
Time elapsed: 354 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 304/3545 24/32 Peterson-COL-6-LTLFireability-14 2439004 m, 7479 m/sec, 3385436 t fired, .
Time elapsed: 359 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 309/3545 25/32 Peterson-COL-6-LTLFireability-14 2477853 m, 7769 m/sec, 3442959 t fired, .
Time elapsed: 364 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 314/3545 25/32 Peterson-COL-6-LTLFireability-14 2515012 m, 7431 m/sec, 3496907 t fired, .
Time elapsed: 369 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 319/3545 25/32 Peterson-COL-6-LTLFireability-14 2552966 m, 7590 m/sec, 3552981 t fired, .
Time elapsed: 374 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 324/3545 26/32 Peterson-COL-6-LTLFireability-14 2590764 m, 7559 m/sec, 3613111 t fired, .
Time elapsed: 379 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 329/3545 26/32 Peterson-COL-6-LTLFireability-14 2629005 m, 7648 m/sec, 3668509 t fired, .
Time elapsed: 384 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 334/3545 26/32 Peterson-COL-6-LTLFireability-14 2667264 m, 7651 m/sec, 3725238 t fired, .
Time elapsed: 389 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 339/3545 27/32 Peterson-COL-6-LTLFireability-14 2705296 m, 7606 m/sec, 3783289 t fired, .
Time elapsed: 394 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 344/3545 27/32 Peterson-COL-6-LTLFireability-14 2739312 m, 6803 m/sec, 3834314 t fired, .
Time elapsed: 399 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 349/3545 27/32 Peterson-COL-6-LTLFireability-14 2776024 m, 7342 m/sec, 3893626 t fired, .
Time elapsed: 404 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 354/3545 28/32 Peterson-COL-6-LTLFireability-14 2813633 m, 7521 m/sec, 3946848 t fired, .
Time elapsed: 409 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 359/3545 28/32 Peterson-COL-6-LTLFireability-14 2849033 m, 7080 m/sec, 3997831 t fired, .
Time elapsed: 414 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 364/3545 28/32 Peterson-COL-6-LTLFireability-14 2882278 m, 6649 m/sec, 4046903 t fired, .
Time elapsed: 419 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 369/3545 28/32 Peterson-COL-6-LTLFireability-14 2918055 m, 7155 m/sec, 4103521 t fired, .
Time elapsed: 424 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 374/3545 29/32 Peterson-COL-6-LTLFireability-14 2953865 m, 7162 m/sec, 4154888 t fired, .
Time elapsed: 429 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 379/3545 29/32 Peterson-COL-6-LTLFireability-14 2985995 m, 6426 m/sec, 4208084 t fired, .
Time elapsed: 434 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 384/3545 29/32 Peterson-COL-6-LTLFireability-14 3023379 m, 7476 m/sec, 4266916 t fired, .
Time elapsed: 439 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 389/3545 30/32 Peterson-COL-6-LTLFireability-14 3063113 m, 7946 m/sec, 4327091 t fired, .
Time elapsed: 444 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 394/3545 30/32 Peterson-COL-6-LTLFireability-14 3102457 m, 7868 m/sec, 4390325 t fired, .
Time elapsed: 449 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 399/3545 31/32 Peterson-COL-6-LTLFireability-14 3139727 m, 7454 m/sec, 4451369 t fired, .
Time elapsed: 454 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 404/3545 31/32 Peterson-COL-6-LTLFireability-14 3180136 m, 8081 m/sec, 4511856 t fired, .
Time elapsed: 459 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 409/3545 31/32 Peterson-COL-6-LTLFireability-14 3220913 m, 8155 m/sec, 4566531 t fired, .
Time elapsed: 464 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 414/3545 32/32 Peterson-COL-6-LTLFireability-14 3261570 m, 8131 m/sec, 4620863 t fired, .
Time elapsed: 469 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 419/3545 32/32 Peterson-COL-6-LTLFireability-14 3300019 m, 7689 m/sec, 4674251 t fired, .
Time elapsed: 474 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 424/3545 32/32 Peterson-COL-6-LTLFireability-14 3338532 m, 7702 m/sec, 4728996 t fired, .
Time elapsed: 479 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 7 (type EXCL) for Peterson-COL-6-LTLFireability-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-COL-6-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 484 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-COL-6-LTLFireability-04: LTL true LTL model checker
Peterson-COL-6-LTLFireability-08: LTL true LTL model checker
Peterson-COL-6-LTLFireability-14: LTL unknown AGGR
Time elapsed: 484 secs. Pages in use: 32
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-COL-6"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Peterson-COL-6, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-smll-167863538400588"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-6.tgz
mv Peterson-COL-6 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;