About the Execution of LTSMin+red for TokenRing-PT-020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2505.184 | 464714.00 | 566260.00 | 9491.60 | FTTFTTTTFTFFT??? | 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.r489-tall-167912707100675.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 ltsminxred
Input is TokenRing-PT-020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912707100675
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 130M
-rw-r--r-- 1 mcc users 700K Feb 25 15:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.5M Feb 25 15:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4M Feb 25 15:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 20M Feb 25 15:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 246K Feb 25 17:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 823K Feb 25 17:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3M Feb 25 17:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3M Feb 25 17:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 725K Feb 25 16:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Feb 25 16:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17M Feb 25 16:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62M Feb 25 16:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 47K Feb 25 17:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 121K Feb 25 17:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 4.0M 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 TokenRing-PT-020-LTLCardinality-00
FORMULA_NAME TokenRing-PT-020-LTLCardinality-01
FORMULA_NAME TokenRing-PT-020-LTLCardinality-02
FORMULA_NAME TokenRing-PT-020-LTLCardinality-03
FORMULA_NAME TokenRing-PT-020-LTLCardinality-04
FORMULA_NAME TokenRing-PT-020-LTLCardinality-05
FORMULA_NAME TokenRing-PT-020-LTLCardinality-06
FORMULA_NAME TokenRing-PT-020-LTLCardinality-07
FORMULA_NAME TokenRing-PT-020-LTLCardinality-08
FORMULA_NAME TokenRing-PT-020-LTLCardinality-09
FORMULA_NAME TokenRing-PT-020-LTLCardinality-10
FORMULA_NAME TokenRing-PT-020-LTLCardinality-11
FORMULA_NAME TokenRing-PT-020-LTLCardinality-12
FORMULA_NAME TokenRing-PT-020-LTLCardinality-13
FORMULA_NAME TokenRing-PT-020-LTLCardinality-14
FORMULA_NAME TokenRing-PT-020-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679298391633
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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TokenRing-PT-020
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 07:46:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 07:46:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 07:46:33] [INFO ] Load time of PNML (sax parser for PT used): 279 ms
[2023-03-20 07:46:33] [INFO ] Transformed 441 places.
[2023-03-20 07:46:33] [INFO ] Transformed 8421 transitions.
[2023-03-20 07:46:33] [INFO ] Parsed PT model containing 441 places and 8421 transitions and 33684 arcs in 403 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 58 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA TokenRing-PT-020-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-020-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 443 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
// Phase 1: matrix 8421 rows 441 cols
[2023-03-20 07:46:34] [INFO ] Computed 21 place invariants in 55 ms
[2023-03-20 07:46:35] [INFO ] Implicit Places using invariants in 799 ms returned []
[2023-03-20 07:46:35] [INFO ] Invariant cache hit.
[2023-03-20 07:46:36] [INFO ] Implicit Places using invariants and state equation in 1523 ms returned []
Implicit Place search using SMT with State Equation took 2374 ms to find 0 implicit places.
[2023-03-20 07:46:36] [INFO ] Invariant cache hit.
[2023-03-20 07:46:38] [INFO ] Dead Transitions using invariants and state equation in 2354 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5178 ms. Remains : 441/441 places, 8421/8421 transitions.
Support contains 25 out of 441 places after structural reductions.
[2023-03-20 07:46:39] [INFO ] Flatten gal took : 401 ms
[2023-03-20 07:46:39] [INFO ] Flatten gal took : 239 ms
[2023-03-20 07:46:40] [INFO ] Input system was already deterministic with 8421 transitions.
Finished random walk after 413 steps, including 0 resets, run visited all 13 properties in 77 ms. (steps per millisecond=5 )
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(p0)))'
Support contains 2 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 211 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 07:46:40] [INFO ] Invariant cache hit.
[2023-03-20 07:46:41] [INFO ] Implicit Places using invariants in 655 ms returned []
[2023-03-20 07:46:41] [INFO ] Invariant cache hit.
[2023-03-20 07:46:43] [INFO ] Implicit Places using invariants and state equation in 1680 ms returned []
Implicit Place search using SMT with State Equation took 2338 ms to find 0 implicit places.
[2023-03-20 07:46:43] [INFO ] Invariant cache hit.
[2023-03-20 07:46:45] [INFO ] Dead Transitions using invariants and state equation in 2465 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5041 ms. Remains : 441/441 places, 8421/8421 transitions.
Stuttering acceptance computed with spot in 293 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : TokenRing-PT-020-LTLCardinality-08 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:(LEQ s269 s274)], 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 243 steps with 0 reset in 9 ms.
FORMULA TokenRing-PT-020-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TokenRing-PT-020-LTLCardinality-08 finished in 5416 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(p0)))'
Support contains 2 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 136 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 07:46:46] [INFO ] Invariant cache hit.
[2023-03-20 07:46:46] [INFO ] Implicit Places using invariants in 637 ms returned []
[2023-03-20 07:46:46] [INFO ] Invariant cache hit.
[2023-03-20 07:46:48] [INFO ] Implicit Places using invariants and state equation in 1560 ms returned []
Implicit Place search using SMT with State Equation took 2229 ms to find 0 implicit places.
[2023-03-20 07:46:48] [INFO ] Invariant cache hit.
[2023-03-20 07:46:51] [INFO ] Dead Transitions using invariants and state equation in 2611 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4983 ms. Remains : 441/441 places, 8421/8421 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TokenRing-PT-020-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s244 s95)], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1167 ms.
Product exploration explored 100000 steps with 50000 reset in 898 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TokenRing-PT-020-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TokenRing-PT-020-LTLCardinality-09 finished in 7284 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)))'
Support contains 2 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 367 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 07:46:53] [INFO ] Invariant cache hit.
[2023-03-20 07:46:54] [INFO ] Implicit Places using invariants in 619 ms returned []
[2023-03-20 07:46:54] [INFO ] Invariant cache hit.
[2023-03-20 07:46:55] [INFO ] Implicit Places using invariants and state equation in 1491 ms returned []
Implicit Place search using SMT with State Equation took 2124 ms to find 0 implicit places.
[2023-03-20 07:46:57] [INFO ] Redundant transitions in 1391 ms returned []
[2023-03-20 07:46:57] [INFO ] Invariant cache hit.
[2023-03-20 07:46:59] [INFO ] Dead Transitions using invariants and state equation in 2688 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6579 ms. Remains : 441/441 places, 8421/8421 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : TokenRing-PT-020-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s327 s123)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 730 ms.
Stack based approach found an accepted trace after 514 steps with 0 reset with depth 515 and stack size 515 in 12 ms.
FORMULA TokenRing-PT-020-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property TokenRing-PT-020-LTLCardinality-10 finished in 7392 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((X(X(p0))&&G(p1))))'
Support contains 4 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 103 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 07:47:00] [INFO ] Invariant cache hit.
[2023-03-20 07:47:01] [INFO ] Implicit Places using invariants in 580 ms returned []
[2023-03-20 07:47:01] [INFO ] Invariant cache hit.
[2023-03-20 07:47:02] [INFO ] Implicit Places using invariants and state equation in 1501 ms returned []
Implicit Place search using SMT with State Equation took 2110 ms to find 0 implicit places.
[2023-03-20 07:47:02] [INFO ] Invariant cache hit.
[2023-03-20 07:47:05] [INFO ] Dead Transitions using invariants and state equation in 2561 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4795 ms. Remains : 441/441 places, 8421/8421 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TokenRing-PT-020-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 3}, { cond=p1, acceptance={0} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 2}]], initial=0, aps=[p1:(LEQ s182 s334), p0:(LEQ s384 s210)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 346 reset in 695 ms.
Stack based approach found an accepted trace after 501 steps with 2 reset with depth 496 and stack size 496 in 4 ms.
FORMULA TokenRing-PT-020-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property TokenRing-PT-020-LTLCardinality-11 finished in 5792 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((p0 U p1))||X(X(X(X(G(p2)))))))'
Support contains 5 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 101 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 07:47:06] [INFO ] Invariant cache hit.
[2023-03-20 07:47:07] [INFO ] Implicit Places using invariants in 574 ms returned []
[2023-03-20 07:47:07] [INFO ] Invariant cache hit.
[2023-03-20 07:47:08] [INFO ] Implicit Places using invariants and state equation in 1604 ms returned []
Implicit Place search using SMT with State Equation took 2198 ms to find 0 implicit places.
[2023-03-20 07:47:08] [INFO ] Invariant cache hit.
[2023-03-20 07:47:11] [INFO ] Dead Transitions using invariants and state equation in 2541 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4868 ms. Remains : 441/441 places, 8421/8421 transitions.
Stuttering acceptance computed with spot in 416 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : TokenRing-PT-020-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(OR p1 p0), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(OR p1 p0), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(OR p1 p0), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=9 dest: 10}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=10 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=11 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=11 dest: 10}, { cond=(OR p1 p0), acceptance={} source=11 dest: 11}]], initial=0, aps=[p1:(GT 1 s302), p0:(LEQ s62 s74), p2:(LEQ s317 s348)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 322 reset in 683 ms.
Product exploration explored 100000 steps with 321 reset in 685 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 p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 379 ms. Reduced automaton from 12 states, 24 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 425 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-20 07:47:15] [INFO ] Invariant cache hit.
[2023-03-20 07:47:16] [INFO ] After 1442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 07:47:16] [INFO ] [Nat]Absence check using 21 positive place invariants in 29 ms returned sat
[2023-03-20 07:47:19] [INFO ] After 2056ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 07:47:19] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 07:47:26] [INFO ] After 7756ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 07:47:28] [INFO ] After 9696ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1404 ms.
[2023-03-20 07:47:30] [INFO ] After 13603ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 132 ms.
Support contains 5 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 519 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 519 ms. Remains : 441/441 places, 8421/8421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 33736 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 33736 steps, saw 8383 distinct states, run finished after 3005 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-20 07:47:35] [INFO ] Invariant cache hit.
[2023-03-20 07:47:35] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 07:47:35] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-20 07:47:37] [INFO ] After 1848ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 07:47:37] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 07:47:45] [INFO ] After 8229ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 07:47:47] [INFO ] After 9921ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1360 ms.
[2023-03-20 07:47:48] [INFO ] After 13389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 136 ms.
Support contains 5 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 199 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 441/441 places, 8421/8421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 197 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 07:47:49] [INFO ] Invariant cache hit.
[2023-03-20 07:47:49] [INFO ] Implicit Places using invariants in 783 ms returned []
[2023-03-20 07:47:49] [INFO ] Invariant cache hit.
[2023-03-20 07:47:51] [INFO ] Implicit Places using invariants and state equation in 1428 ms returned []
Implicit Place search using SMT with State Equation took 2238 ms to find 0 implicit places.
[2023-03-20 07:47:52] [INFO ] Redundant transitions in 1403 ms returned []
[2023-03-20 07:47:52] [INFO ] Invariant cache hit.
[2023-03-20 07:47:55] [INFO ] Dead Transitions using invariants and state equation in 2699 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6562 ms. Remains : 441/441 places, 8421/8421 transitions.
Graph (trivial) has 8221 edges and 441 vertex of which 436 / 441 are part of one of the 21 SCC in 5 ms
Free SCC test removed 415 places
Drop transitions removed 8221 transitions
Ensure Unique test removed 190 transitions
Reduce isomorphic transitions removed 8411 transitions.
Graph (complete) has 10 edges and 26 vertex of which 10 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 16 ms. Remains 10 /441 variables (removed 431) and now considering 10/8421 (removed 8411) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 10 rows 10 cols
[2023-03-20 07:47:55] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 07:47:55] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 07:47:55] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-20 07:47:55] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 07:47:55] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-20 07:47:55] [INFO ] After 76ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0)))]
False Knowledge obtained : [(F (NOT (OR (AND p2 p0) (AND p2 p1)))), (F (NOT p2)), (F (AND p0 (NOT p1))), (F (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))]
Knowledge based reduction with 6 factoid took 382 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 433 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 377 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Support contains 5 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 101 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
// Phase 1: matrix 8421 rows 441 cols
[2023-03-20 07:47:57] [INFO ] Computed 21 place invariants in 39 ms
[2023-03-20 07:47:57] [INFO ] Implicit Places using invariants in 686 ms returned []
[2023-03-20 07:47:57] [INFO ] Invariant cache hit.
[2023-03-20 07:47:59] [INFO ] Implicit Places using invariants and state equation in 1455 ms returned []
Implicit Place search using SMT with State Equation took 2149 ms to find 0 implicit places.
[2023-03-20 07:47:59] [INFO ] Invariant cache hit.
[2023-03-20 07:48:01] [INFO ] Dead Transitions using invariants and state equation in 2514 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4766 ms. Remains : 441/441 places, 8421/8421 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 p2 p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 178 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-20 07:48:03] [INFO ] Invariant cache hit.
[2023-03-20 07:48:03] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 07:48:03] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 07:48:05] [INFO ] After 1695ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 07:48:05] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 07:48:13] [INFO ] After 7498ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 07:48:14] [INFO ] After 9182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1328 ms.
[2023-03-20 07:48:16] [INFO ] After 12577ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 116 ms.
Support contains 5 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 216 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 441/441 places, 8421/8421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 34106 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 34106 steps, saw 8468 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-20 07:48:20] [INFO ] Invariant cache hit.
[2023-03-20 07:48:21] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 07:48:21] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 07:48:22] [INFO ] After 1736ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 07:48:23] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 07:48:30] [INFO ] After 7272ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 07:48:32] [INFO ] After 9069ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1429 ms.
[2023-03-20 07:48:33] [INFO ] After 12484ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 115 ms.
Support contains 5 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 207 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 441/441 places, 8421/8421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 222 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 07:48:34] [INFO ] Invariant cache hit.
[2023-03-20 07:48:34] [INFO ] Implicit Places using invariants in 784 ms returned []
[2023-03-20 07:48:34] [INFO ] Invariant cache hit.
[2023-03-20 07:48:36] [INFO ] Implicit Places using invariants and state equation in 1458 ms returned []
Implicit Place search using SMT with State Equation took 2261 ms to find 0 implicit places.
[2023-03-20 07:48:37] [INFO ] Redundant transitions in 1036 ms returned []
[2023-03-20 07:48:37] [INFO ] Invariant cache hit.
[2023-03-20 07:48:39] [INFO ] Dead Transitions using invariants and state equation in 2521 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6061 ms. Remains : 441/441 places, 8421/8421 transitions.
Graph (trivial) has 8221 edges and 441 vertex of which 436 / 441 are part of one of the 21 SCC in 2 ms
Free SCC test removed 415 places
Drop transitions removed 8221 transitions
Ensure Unique test removed 190 transitions
Reduce isomorphic transitions removed 8411 transitions.
Graph (complete) has 10 edges and 26 vertex of which 10 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 9 ms. Remains 10 /441 variables (removed 431) and now considering 10/8421 (removed 8411) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 10 rows 10 cols
[2023-03-20 07:48:39] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-20 07:48:39] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 07:48:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-20 07:48:39] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 07:48:40] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-20 07:48:40] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p2 p0 p1), true]
False Knowledge obtained : [(F (NOT (OR (AND p2 p0) (AND p2 p1)))), (F (NOT p2)), (F (AND p0 (NOT p1))), (F (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))]
Knowledge based reduction with 2 factoid took 233 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 321 reset in 706 ms.
Product exploration explored 100000 steps with 321 reset in 702 ms.
Applying partial POR strategy [false, false, true, true, false, false, true, true, true]
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Support contains 5 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 362 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 07:48:44] [INFO ] Redundant transitions in 1320 ms returned []
// Phase 1: matrix 8421 rows 441 cols
[2023-03-20 07:48:44] [INFO ] Computed 21 place invariants in 38 ms
[2023-03-20 07:48:47] [INFO ] Dead Transitions using invariants and state equation in 2536 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4256 ms. Remains : 441/441 places, 8421/8421 transitions.
Support contains 5 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 145 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 07:48:47] [INFO ] Invariant cache hit.
[2023-03-20 07:48:47] [INFO ] Implicit Places using invariants in 604 ms returned []
[2023-03-20 07:48:48] [INFO ] Invariant cache hit.
[2023-03-20 07:48:49] [INFO ] Implicit Places using invariants and state equation in 1435 ms returned []
Implicit Place search using SMT with State Equation took 2083 ms to find 0 implicit places.
[2023-03-20 07:48:49] [INFO ] Invariant cache hit.
[2023-03-20 07:48:51] [INFO ] Dead Transitions using invariants and state equation in 2500 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4755 ms. Remains : 441/441 places, 8421/8421 transitions.
Treatment of property TokenRing-PT-020-LTLCardinality-13 finished in 106188 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(p0)||G(p1))))'
Support contains 4 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 103 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 07:48:52] [INFO ] Invariant cache hit.
[2023-03-20 07:48:53] [INFO ] Implicit Places using invariants in 604 ms returned []
[2023-03-20 07:48:53] [INFO ] Invariant cache hit.
[2023-03-20 07:48:54] [INFO ] Implicit Places using invariants and state equation in 1530 ms returned []
Implicit Place search using SMT with State Equation took 2146 ms to find 0 implicit places.
[2023-03-20 07:48:54] [INFO ] Invariant cache hit.
[2023-03-20 07:48:57] [INFO ] Dead Transitions using invariants and state equation in 2443 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4703 ms. Remains : 441/441 places, 8421/8421 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TokenRing-PT-020-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s233 s88), p1:(GT s97 s429)], 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 1110 reset in 654 ms.
Product exploration explored 100000 steps with 1157 reset in 697 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 p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 240 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 6 factoid took 209 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 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2023-03-20 07:48:59] [INFO ] Invariant cache hit.
[2023-03-20 07:49:03] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-03-20 07:49:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 07:49:04] [INFO ] [Real]Absence check using state equation in 1173 ms returned sat
[2023-03-20 07:49:04] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 07:49:05] [INFO ] [Real]Added 8020 Read/Feed constraints in 797 ms returned sat
[2023-03-20 07:49:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 07:49:09] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-03-20 07:49:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 07:49:10] [INFO ] [Nat]Absence check using state equation in 1077 ms returned sat
[2023-03-20 07:49:12] [INFO ] [Nat]Added 8020 Read/Feed constraints in 2342 ms returned sat
[2023-03-20 07:49:13] [INFO ] Computed and/alt/rep : 20/20/20 causal constraints (skipped 8381 transitions) in 534 ms.
[2023-03-20 07:49:14] [INFO ] Added : 1 causal constraints over 1 iterations in 1443 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 441 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 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 208 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 07:49:14] [INFO ] Invariant cache hit.
[2023-03-20 07:49:15] [INFO ] Implicit Places using invariants in 527 ms returned []
[2023-03-20 07:49:15] [INFO ] Invariant cache hit.
[2023-03-20 07:49:16] [INFO ] Implicit Places using invariants and state equation in 1416 ms returned []
Implicit Place search using SMT with State Equation took 1960 ms to find 0 implicit places.
[2023-03-20 07:49:17] [INFO ] Redundant transitions in 1407 ms returned []
[2023-03-20 07:49:17] [INFO ] Invariant cache hit.
[2023-03-20 07:49:20] [INFO ] Dead Transitions using invariants and state equation in 2427 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6026 ms. Remains : 441/441 places, 8421/8421 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 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 30 ms :[(NOT p0)]
Finished random walk after 110 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=55 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 94 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
[2023-03-20 07:49:20] [INFO ] Invariant cache hit.
[2023-03-20 07:49:24] [INFO ] [Real]Absence check using 21 positive place invariants in 36 ms returned sat
[2023-03-20 07:49:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 07:49:25] [INFO ] [Real]Absence check using state equation in 1071 ms returned sat
[2023-03-20 07:49:25] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 07:49:26] [INFO ] [Real]Added 8020 Read/Feed constraints in 890 ms returned sat
[2023-03-20 07:49:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 07:49:30] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-03-20 07:49:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 07:49:31] [INFO ] [Nat]Absence check using state equation in 1214 ms returned sat
[2023-03-20 07:49:34] [INFO ] [Nat]Added 8020 Read/Feed constraints in 3030 ms returned sat
[2023-03-20 07:49:34] [INFO ] Computed and/alt/rep : 20/20/20 causal constraints (skipped 8381 transitions) in 492 ms.
[2023-03-20 07:49:35] [INFO ] Added : 1 causal constraints over 1 iterations in 1428 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1147 reset in 663 ms.
Product exploration explored 100000 steps with 1141 reset in 673 ms.
Support contains 2 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 204 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 07:49:37] [INFO ] Invariant cache hit.
[2023-03-20 07:49:38] [INFO ] Implicit Places using invariants in 544 ms returned []
[2023-03-20 07:49:38] [INFO ] Invariant cache hit.
[2023-03-20 07:49:39] [INFO ] Implicit Places using invariants and state equation in 1482 ms returned []
Implicit Place search using SMT with State Equation took 2046 ms to find 0 implicit places.
[2023-03-20 07:49:40] [INFO ] Redundant transitions in 1424 ms returned []
[2023-03-20 07:49:41] [INFO ] Invariant cache hit.
[2023-03-20 07:49:43] [INFO ] Dead Transitions using invariants and state equation in 2438 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6135 ms. Remains : 441/441 places, 8421/8421 transitions.
Treatment of property TokenRing-PT-020-LTLCardinality-14 finished in 50990 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 X(X(G((p1 U p2))))))'
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 91 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 07:49:43] [INFO ] Invariant cache hit.
[2023-03-20 07:49:44] [INFO ] Implicit Places using invariants in 558 ms returned []
[2023-03-20 07:49:44] [INFO ] Invariant cache hit.
[2023-03-20 07:49:45] [INFO ] Implicit Places using invariants and state equation in 1486 ms returned []
Implicit Place search using SMT with State Equation took 2083 ms to find 0 implicit places.
[2023-03-20 07:49:45] [INFO ] Invariant cache hit.
[2023-03-20 07:49:48] [INFO ] Dead Transitions using invariants and state equation in 2379 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4564 ms. Remains : 441/441 places, 8421/8421 transitions.
Stuttering acceptance computed with spot in 686 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : TokenRing-PT-020-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=6 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=8 dest: 6}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=8 dest: 7}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(LEQ s44 s137), p2:(LEQ s132 s185), p1:(LEQ s432 s374)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 228 reset in 669 ms.
Product exploration explored 100000 steps with 228 reset in 678 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 p2 p1), (X p0), (X (OR (AND p0 p2) (AND p0 p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (OR p2 p1))), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (OR (AND p0 p2) (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 670 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-20 07:49:52] [INFO ] Invariant cache hit.
[2023-03-20 07:49:52] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 07:49:52] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 07:49:53] [INFO ] After 1540ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-20 07:49:54] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 07:49:59] [INFO ] After 5399ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-20 07:50:00] [INFO ] After 6874ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 940 ms.
[2023-03-20 07:50:01] [INFO ] After 9555ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 87 ms.
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 197 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 441/441 places, 8421/8421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 34308 steps, run timeout after 3031 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 34308 steps, saw 8501 distinct states, run finished after 3031 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 07:50:06] [INFO ] Invariant cache hit.
[2023-03-20 07:50:06] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 07:50:06] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 07:50:07] [INFO ] After 1596ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 07:50:08] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 07:50:11] [INFO ] After 3403ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 07:50:12] [INFO ] After 4784ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 904 ms.
[2023-03-20 07:50:13] [INFO ] After 7466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 107 ms.
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 190 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 441/441 places, 8421/8421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 198 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 07:50:14] [INFO ] Invariant cache hit.
[2023-03-20 07:50:14] [INFO ] Implicit Places using invariants in 558 ms returned []
[2023-03-20 07:50:14] [INFO ] Invariant cache hit.
[2023-03-20 07:50:16] [INFO ] Implicit Places using invariants and state equation in 1521 ms returned []
Implicit Place search using SMT with State Equation took 2110 ms to find 0 implicit places.
[2023-03-20 07:50:17] [INFO ] Redundant transitions in 1429 ms returned []
[2023-03-20 07:50:17] [INFO ] Invariant cache hit.
[2023-03-20 07:50:20] [INFO ] Dead Transitions using invariants and state equation in 2389 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6144 ms. Remains : 441/441 places, 8421/8421 transitions.
Graph (trivial) has 8187 edges and 441 vertex of which 435 / 441 are part of one of the 21 SCC in 1 ms
Free SCC test removed 414 places
Drop transitions removed 8187 transitions
Ensure Unique test removed 216 transitions
Reduce isomorphic transitions removed 8403 transitions.
Graph (complete) has 18 edges and 27 vertex of which 10 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 0 output transitions
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 10 transition count 11
Applied a total of 9 rules in 9 ms. Remains 10 /441 variables (removed 431) and now considering 11/8421 (removed 8410) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 11 rows 10 cols
[2023-03-20 07:50:20] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-20 07:50:20] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 07:50:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 07:50:20] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 07:50:20] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-20 07:50:20] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (OR (AND p0 p2) (AND p0 p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (OR p2 p1))), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (OR (AND p0 p2) (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (AND p0 p1) (AND p0 p2)))), (F (NOT p0)), (F (AND p0 p1 (NOT p2))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 16 factoid took 1804 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 276 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 95 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
// Phase 1: matrix 8421 rows 441 cols
[2023-03-20 07:50:22] [INFO ] Computed 21 place invariants in 16 ms
[2023-03-20 07:50:23] [INFO ] Implicit Places using invariants in 566 ms returned []
[2023-03-20 07:50:23] [INFO ] Invariant cache hit.
[2023-03-20 07:50:24] [INFO ] Implicit Places using invariants and state equation in 1444 ms returned []
Implicit Place search using SMT with State Equation took 2038 ms to find 0 implicit places.
[2023-03-20 07:50:24] [INFO ] Invariant cache hit.
[2023-03-20 07:50:27] [INFO ] Dead Transitions using invariants and state equation in 2367 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4519 ms. Remains : 441/441 places, 8421/8421 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 p1 p2 p0), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (OR (AND p0 p1) (AND p0 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 668 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 07:50:28] [INFO ] Invariant cache hit.
[2023-03-20 07:50:28] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 07:50:28] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 07:50:30] [INFO ] After 1426ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 07:50:30] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 07:50:33] [INFO ] After 3272ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 07:50:34] [INFO ] After 4306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 668 ms.
[2023-03-20 07:50:35] [INFO ] After 6578ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 72 ms.
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 196 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 441/441 places, 8421/8421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 35614 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 35614 steps, saw 8752 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-20 07:50:38] [INFO ] Invariant cache hit.
[2023-03-20 07:50:39] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 07:50:39] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 07:50:40] [INFO ] After 1386ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 07:50:40] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 07:50:43] [INFO ] After 3010ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 07:50:44] [INFO ] After 3995ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 673 ms.
[2023-03-20 07:50:45] [INFO ] After 6217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 161 ms.
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 190 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 441/441 places, 8421/8421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 189 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 07:50:45] [INFO ] Invariant cache hit.
[2023-03-20 07:50:46] [INFO ] Implicit Places using invariants in 532 ms returned []
[2023-03-20 07:50:46] [INFO ] Invariant cache hit.
[2023-03-20 07:50:47] [INFO ] Implicit Places using invariants and state equation in 1422 ms returned []
Implicit Place search using SMT with State Equation took 1979 ms to find 0 implicit places.
[2023-03-20 07:50:49] [INFO ] Redundant transitions in 1380 ms returned []
[2023-03-20 07:50:49] [INFO ] Invariant cache hit.
[2023-03-20 07:50:51] [INFO ] Dead Transitions using invariants and state equation in 2535 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6105 ms. Remains : 441/441 places, 8421/8421 transitions.
Graph (trivial) has 8187 edges and 441 vertex of which 435 / 441 are part of one of the 21 SCC in 1 ms
Free SCC test removed 414 places
Drop transitions removed 8187 transitions
Ensure Unique test removed 216 transitions
Reduce isomorphic transitions removed 8403 transitions.
Graph (complete) has 18 edges and 27 vertex of which 10 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 0 output transitions
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 10 transition count 11
Applied a total of 9 rules in 8 ms. Remains 10 /441 variables (removed 431) and now considering 11/8421 (removed 8410) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 11 rows 10 cols
[2023-03-20 07:50:51] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-20 07:50:51] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 07:50:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 07:50:51] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 07:50:51] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-20 07:50:51] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p2 p0), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (OR (AND p0 p1) (AND p0 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (OR (AND p0 p1) (AND p0 p2)))), (F (NOT p0)), (F (AND p0 p1 (NOT p2))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 12 factoid took 1806 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 274 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 287 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 227 reset in 655 ms.
Product exploration explored 100000 steps with 227 reset in 674 ms.
Applying partial POR strategy [false, true, true, true, false, false, false, false]
Stuttering acceptance computed with spot in 256 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 199 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 07:50:57] [INFO ] Redundant transitions in 1376 ms returned []
// Phase 1: matrix 8421 rows 441 cols
[2023-03-20 07:50:57] [INFO ] Computed 21 place invariants in 18 ms
[2023-03-20 07:51:00] [INFO ] Dead Transitions using invariants and state equation in 2358 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3956 ms. Remains : 441/441 places, 8421/8421 transitions.
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 93 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 07:51:00] [INFO ] Invariant cache hit.
[2023-03-20 07:51:00] [INFO ] Implicit Places using invariants in 613 ms returned []
[2023-03-20 07:51:00] [INFO ] Invariant cache hit.
[2023-03-20 07:51:02] [INFO ] Implicit Places using invariants and state equation in 1409 ms returned []
Implicit Place search using SMT with State Equation took 2035 ms to find 0 implicit places.
[2023-03-20 07:51:02] [INFO ] Invariant cache hit.
[2023-03-20 07:51:04] [INFO ] Dead Transitions using invariants and state equation in 2369 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4512 ms. Remains : 441/441 places, 8421/8421 transitions.
Treatment of property TokenRing-PT-020-LTLCardinality-15 finished in 81208 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((p0 U p1))||X(X(X(X(G(p2)))))))'
Found a Lengthening insensitive property : TokenRing-PT-020-LTLCardinality-13
Stuttering acceptance computed with spot in 378 ms :[(AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Support contains 5 out of 441 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 119 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 07:51:05] [INFO ] Invariant cache hit.
[2023-03-20 07:51:06] [INFO ] Implicit Places using invariants in 566 ms returned []
[2023-03-20 07:51:06] [INFO ] Invariant cache hit.
[2023-03-20 07:51:07] [INFO ] Implicit Places using invariants and state equation in 1462 ms returned []
Implicit Place search using SMT with State Equation took 2040 ms to find 0 implicit places.
[2023-03-20 07:51:07] [INFO ] Invariant cache hit.
[2023-03-20 07:51:09] [INFO ] Dead Transitions using invariants and state equation in 2469 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4657 ms. Remains : 441/441 places, 8421/8421 transitions.
Running random walk in product with property : TokenRing-PT-020-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(OR p1 p0), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(OR p1 p0), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(OR p1 p0), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=9 dest: 9}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=9 dest: 10}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=10 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=11 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=11 dest: 10}, { cond=(OR p1 p0), acceptance={} source=11 dest: 11}]], initial=0, aps=[p1:(GT 1 s302), p0:(LEQ s62 s74), p2:(LEQ s317 s348)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 323 reset in 710 ms.
Product exploration explored 100000 steps with 322 reset in 723 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 p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 303 ms. Reduced automaton from 12 states, 24 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-20 07:51:13] [INFO ] Invariant cache hit.
[2023-03-20 07:51:13] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 07:51:13] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 07:51:15] [INFO ] After 1739ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 07:51:15] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 07:51:22] [INFO ] After 7329ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 07:51:24] [INFO ] After 9069ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1407 ms.
[2023-03-20 07:51:25] [INFO ] After 12442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 108 ms.
Support contains 5 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 193 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 441/441 places, 8421/8421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 34743 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 34743 steps, saw 8579 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-20 07:51:29] [INFO ] Invariant cache hit.
[2023-03-20 07:51:29] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 07:51:29] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 07:51:31] [INFO ] After 1660ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 07:51:31] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 07:51:39] [INFO ] After 7773ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 07:51:41] [INFO ] After 9525ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1384 ms.
[2023-03-20 07:51:42] [INFO ] After 12759ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 210 ms.
Support contains 5 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 184 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 441/441 places, 8421/8421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 184 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 07:51:43] [INFO ] Invariant cache hit.
[2023-03-20 07:51:43] [INFO ] Implicit Places using invariants in 573 ms returned []
[2023-03-20 07:51:43] [INFO ] Invariant cache hit.
[2023-03-20 07:51:45] [INFO ] Implicit Places using invariants and state equation in 1433 ms returned []
Implicit Place search using SMT with State Equation took 2043 ms to find 0 implicit places.
[2023-03-20 07:51:46] [INFO ] Redundant transitions in 1036 ms returned []
[2023-03-20 07:51:46] [INFO ] Invariant cache hit.
[2023-03-20 07:51:48] [INFO ] Dead Transitions using invariants and state equation in 2400 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5684 ms. Remains : 441/441 places, 8421/8421 transitions.
Graph (trivial) has 8221 edges and 441 vertex of which 436 / 441 are part of one of the 21 SCC in 1 ms
Free SCC test removed 415 places
Drop transitions removed 8221 transitions
Ensure Unique test removed 190 transitions
Reduce isomorphic transitions removed 8411 transitions.
Graph (complete) has 10 edges and 26 vertex of which 10 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 8 ms. Remains 10 /441 variables (removed 431) and now considering 10/8421 (removed 8411) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 10 rows 10 cols
[2023-03-20 07:51:48] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 07:51:48] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 07:51:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-20 07:51:48] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 07:51:48] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-20 07:51:48] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0)))]
False Knowledge obtained : [(F (NOT (OR (AND p2 p0) (AND p2 p1)))), (F (NOT p2)), (F (AND p0 (NOT p1))), (F (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))]
Knowledge based reduction with 6 factoid took 349 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 296 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Support contains 5 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 93 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
// Phase 1: matrix 8421 rows 441 cols
[2023-03-20 07:51:49] [INFO ] Computed 21 place invariants in 17 ms
[2023-03-20 07:51:50] [INFO ] Implicit Places using invariants in 571 ms returned []
[2023-03-20 07:51:50] [INFO ] Invariant cache hit.
[2023-03-20 07:51:51] [INFO ] Implicit Places using invariants and state equation in 1446 ms returned []
Implicit Place search using SMT with State Equation took 2049 ms to find 0 implicit places.
[2023-03-20 07:51:51] [INFO ] Invariant cache hit.
[2023-03-20 07:51:54] [INFO ] Dead Transitions using invariants and state equation in 2642 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4785 ms. Remains : 441/441 places, 8421/8421 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 p2 p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-20 07:51:56] [INFO ] Invariant cache hit.
[2023-03-20 07:51:56] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 07:51:56] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 07:51:58] [INFO ] After 1741ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 07:51:58] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 07:52:06] [INFO ] After 7906ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 07:52:07] [INFO ] After 9620ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1350 ms.
[2023-03-20 07:52:09] [INFO ] After 12888ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 79 ms.
Support contains 5 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 188 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 441/441 places, 8421/8421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 33793 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 33793 steps, saw 8405 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-20 07:52:13] [INFO ] Invariant cache hit.
[2023-03-20 07:52:13] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 07:52:13] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-20 07:52:15] [INFO ] After 1764ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 07:52:15] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 07:52:22] [INFO ] After 7502ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 07:52:24] [INFO ] After 9223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1400 ms.
[2023-03-20 07:52:26] [INFO ] After 12604ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 73 ms.
Support contains 5 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 189 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 441/441 places, 8421/8421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 190 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 07:52:26] [INFO ] Invariant cache hit.
[2023-03-20 07:52:27] [INFO ] Implicit Places using invariants in 550 ms returned []
[2023-03-20 07:52:27] [INFO ] Invariant cache hit.
[2023-03-20 07:52:28] [INFO ] Implicit Places using invariants and state equation in 1493 ms returned []
Implicit Place search using SMT with State Equation took 2084 ms to find 0 implicit places.
[2023-03-20 07:52:29] [INFO ] Redundant transitions in 1055 ms returned []
[2023-03-20 07:52:29] [INFO ] Invariant cache hit.
[2023-03-20 07:52:32] [INFO ] Dead Transitions using invariants and state equation in 2393 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5737 ms. Remains : 441/441 places, 8421/8421 transitions.
Graph (trivial) has 8221 edges and 441 vertex of which 436 / 441 are part of one of the 21 SCC in 2 ms
Free SCC test removed 415 places
Drop transitions removed 8221 transitions
Ensure Unique test removed 190 transitions
Reduce isomorphic transitions removed 8411 transitions.
Graph (complete) has 10 edges and 26 vertex of which 10 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 8 ms. Remains 10 /441 variables (removed 431) and now considering 10/8421 (removed 8411) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 10 rows 10 cols
[2023-03-20 07:52:32] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-20 07:52:32] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 07:52:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-20 07:52:32] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 07:52:32] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-20 07:52:32] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Knowledge obtained : [(AND p2 p0 p1), true]
False Knowledge obtained : [(F (NOT (OR (AND p2 p0) (AND p2 p1)))), (F (NOT p2)), (F (AND p0 (NOT p1))), (F (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))]
Knowledge based reduction with 2 factoid took 678 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 321 reset in 702 ms.
Product exploration explored 100000 steps with 323 reset in 710 ms.
Applying partial POR strategy [false, false, true, true, false, false, true, true, true]
Stuttering acceptance computed with spot in 424 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Support contains 5 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 201 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 07:52:36] [INFO ] Redundant transitions in 1008 ms returned []
// Phase 1: matrix 8421 rows 441 cols
[2023-03-20 07:52:36] [INFO ] Computed 21 place invariants in 18 ms
[2023-03-20 07:52:39] [INFO ] Dead Transitions using invariants and state equation in 2492 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3723 ms. Remains : 441/441 places, 8421/8421 transitions.
Support contains 5 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 94 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 07:52:39] [INFO ] Invariant cache hit.
[2023-03-20 07:52:40] [INFO ] Implicit Places using invariants in 555 ms returned []
[2023-03-20 07:52:40] [INFO ] Invariant cache hit.
[2023-03-20 07:52:41] [INFO ] Implicit Places using invariants and state equation in 1496 ms returned []
Implicit Place search using SMT with State Equation took 2076 ms to find 0 implicit places.
[2023-03-20 07:52:41] [INFO ] Invariant cache hit.
[2023-03-20 07:52:44] [INFO ] Dead Transitions using invariants and state equation in 2480 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4663 ms. Remains : 441/441 places, 8421/8421 transitions.
Treatment of property TokenRing-PT-020-LTLCardinality-13 finished in 99348 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(p0)||G(p1))))'
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 X(X(G((p1 U p2))))))'
Found a Lengthening insensitive property : TokenRing-PT-020-LTLCardinality-15
Stuttering acceptance computed with spot in 244 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 117 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 07:52:44] [INFO ] Invariant cache hit.
[2023-03-20 07:52:45] [INFO ] Implicit Places using invariants in 541 ms returned []
[2023-03-20 07:52:45] [INFO ] Invariant cache hit.
[2023-03-20 07:52:46] [INFO ] Implicit Places using invariants and state equation in 1442 ms returned []
Implicit Place search using SMT with State Equation took 2024 ms to find 0 implicit places.
[2023-03-20 07:52:46] [INFO ] Invariant cache hit.
[2023-03-20 07:52:49] [INFO ] Dead Transitions using invariants and state equation in 2370 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 4528 ms. Remains : 441/441 places, 8421/8421 transitions.
Running random walk in product with property : TokenRing-PT-020-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=6 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=8 dest: 6}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=8 dest: 7}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(LEQ s44 s137), p2:(LEQ s132 s185), p1:(LEQ s432 s374)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 228 reset in 667 ms.
Product exploration explored 100000 steps with 228 reset in 691 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 p2 p1), (X p0), (X (OR (AND p0 p2) (AND p0 p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (OR p2 p1))), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (OR (AND p0 p2) (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 695 ms. Reduced automaton from 9 states, 21 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 615 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 395 ms. (steps per millisecond=25 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-20 07:52:53] [INFO ] Invariant cache hit.
[2023-03-20 07:52:53] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 07:52:54] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 07:52:55] [INFO ] After 1579ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-20 07:52:55] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 07:53:01] [INFO ] After 5509ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-20 07:53:02] [INFO ] After 7028ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 957 ms.
[2023-03-20 07:53:03] [INFO ] After 9739ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 84 ms.
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 192 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 441/441 places, 8421/8421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 34210 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 34210 steps, saw 8486 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 07:53:07] [INFO ] Invariant cache hit.
[2023-03-20 07:53:07] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 07:53:07] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 07:53:09] [INFO ] After 1532ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 07:53:09] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 07:53:12] [INFO ] After 3351ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 07:53:14] [INFO ] After 4682ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 921 ms.
[2023-03-20 07:53:15] [INFO ] After 7317ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 171 ms.
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 185 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 441/441 places, 8421/8421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 202 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 07:53:15] [INFO ] Invariant cache hit.
[2023-03-20 07:53:16] [INFO ] Implicit Places using invariants in 560 ms returned []
[2023-03-20 07:53:16] [INFO ] Invariant cache hit.
[2023-03-20 07:53:17] [INFO ] Implicit Places using invariants and state equation in 1486 ms returned []
Implicit Place search using SMT with State Equation took 2090 ms to find 0 implicit places.
[2023-03-20 07:53:18] [INFO ] Redundant transitions in 1036 ms returned []
[2023-03-20 07:53:18] [INFO ] Invariant cache hit.
[2023-03-20 07:53:21] [INFO ] Dead Transitions using invariants and state equation in 2390 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5751 ms. Remains : 441/441 places, 8421/8421 transitions.
Graph (trivial) has 8187 edges and 441 vertex of which 435 / 441 are part of one of the 21 SCC in 1 ms
Free SCC test removed 414 places
Drop transitions removed 8187 transitions
Ensure Unique test removed 216 transitions
Reduce isomorphic transitions removed 8403 transitions.
Graph (complete) has 18 edges and 27 vertex of which 10 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 0 output transitions
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 10 transition count 11
Applied a total of 9 rules in 9 ms. Remains 10 /441 variables (removed 431) and now considering 11/8421 (removed 8410) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 11 rows 10 cols
[2023-03-20 07:53:21] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-20 07:53:21] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 07:53:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-20 07:53:21] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 07:53:21] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-20 07:53:21] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (OR (AND p0 p2) (AND p0 p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (OR p2 p1))), true, (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X (OR (AND p0 p2) (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (AND p0 p1) (AND p0 p2)))), (F (NOT p0)), (F (AND p0 p1 (NOT p2))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 16 factoid took 887 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 274 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 94 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
// Phase 1: matrix 8421 rows 441 cols
[2023-03-20 07:53:23] [INFO ] Computed 21 place invariants in 17 ms
[2023-03-20 07:53:23] [INFO ] Implicit Places using invariants in 634 ms returned []
[2023-03-20 07:53:23] [INFO ] Invariant cache hit.
[2023-03-20 07:53:25] [INFO ] Implicit Places using invariants and state equation in 1446 ms returned []
Implicit Place search using SMT with State Equation took 2122 ms to find 0 implicit places.
[2023-03-20 07:53:25] [INFO ] Invariant cache hit.
[2023-03-20 07:53:27] [INFO ] Dead Transitions using invariants and state equation in 2423 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4664 ms. Remains : 441/441 places, 8421/8421 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 p1 p2 p0), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (OR (AND p0 p1) (AND p0 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 555 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 07:53:29] [INFO ] Invariant cache hit.
[2023-03-20 07:53:29] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 07:53:29] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 07:53:31] [INFO ] After 1469ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 07:53:31] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 07:53:34] [INFO ] After 3082ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 07:53:35] [INFO ] After 4050ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 667 ms.
[2023-03-20 07:53:35] [INFO ] After 6374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 151 ms.
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 185 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 441/441 places, 8421/8421 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 34905 steps, run timeout after 3001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 34905 steps, saw 8608 distinct states, run finished after 3001 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-20 07:53:40] [INFO ] Invariant cache hit.
[2023-03-20 07:53:40] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 07:53:40] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-20 07:53:41] [INFO ] After 1413ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 07:53:41] [INFO ] State equation strengthened by 8020 read => feed constraints.
[2023-03-20 07:53:44] [INFO ] After 3079ms SMT Verify possible using 8020 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 07:53:45] [INFO ] After 4069ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 681 ms.
[2023-03-20 07:53:46] [INFO ] After 6323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 105 ms.
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 195 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 441/441 places, 8421/8421 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 206 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 07:53:46] [INFO ] Invariant cache hit.
[2023-03-20 07:53:47] [INFO ] Implicit Places using invariants in 558 ms returned []
[2023-03-20 07:53:47] [INFO ] Invariant cache hit.
[2023-03-20 07:53:49] [INFO ] Implicit Places using invariants and state equation in 1521 ms returned []
Implicit Place search using SMT with State Equation took 2118 ms to find 0 implicit places.
[2023-03-20 07:53:50] [INFO ] Redundant transitions in 1125 ms returned []
[2023-03-20 07:53:50] [INFO ] Invariant cache hit.
[2023-03-20 07:53:52] [INFO ] Dead Transitions using invariants and state equation in 2403 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5871 ms. Remains : 441/441 places, 8421/8421 transitions.
Graph (trivial) has 8187 edges and 441 vertex of which 435 / 441 are part of one of the 21 SCC in 2 ms
Free SCC test removed 414 places
Drop transitions removed 8187 transitions
Ensure Unique test removed 216 transitions
Reduce isomorphic transitions removed 8403 transitions.
Graph (complete) has 18 edges and 27 vertex of which 10 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 0 output transitions
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 10 transition count 11
Applied a total of 9 rules in 8 ms. Remains 10 /441 variables (removed 431) and now considering 11/8421 (removed 8410) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 11 rows 10 cols
[2023-03-20 07:53:52] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-20 07:53:52] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 07:53:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-20 07:53:52] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 07:53:52] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-20 07:53:52] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p2 p0), (X p0), (X (NOT (AND p0 p1 (NOT p2)))), (X (OR (AND p0 p1) (AND p0 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p0)), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (OR (AND p0 p1) (AND p0 p2)))), (F (NOT p0)), (F (AND p0 p1 (NOT p2))), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 12 factoid took 613 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 241 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 286 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 227 reset in 671 ms.
Product exploration explored 100000 steps with 228 reset in 693 ms.
Applying partial POR strategy [false, true, true, true, false, false, false, false]
Stuttering acceptance computed with spot in 309 ms :[(NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 194 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 07:53:57] [INFO ] Redundant transitions in 964 ms returned []
// Phase 1: matrix 8421 rows 441 cols
[2023-03-20 07:53:57] [INFO ] Computed 21 place invariants in 19 ms
[2023-03-20 07:53:59] [INFO ] Dead Transitions using invariants and state equation in 2642 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3830 ms. Remains : 441/441 places, 8421/8421 transitions.
Support contains 6 out of 441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 441/441 places, 8421/8421 transitions.
Applied a total of 0 rules in 92 ms. Remains 441 /441 variables (removed 0) and now considering 8421/8421 (removed 0) transitions.
[2023-03-20 07:53:59] [INFO ] Invariant cache hit.
[2023-03-20 07:54:00] [INFO ] Implicit Places using invariants in 549 ms returned []
[2023-03-20 07:54:00] [INFO ] Invariant cache hit.
[2023-03-20 07:54:01] [INFO ] Implicit Places using invariants and state equation in 1471 ms returned []
Implicit Place search using SMT with State Equation took 2050 ms to find 0 implicit places.
[2023-03-20 07:54:01] [INFO ] Invariant cache hit.
[2023-03-20 07:54:04] [INFO ] Dead Transitions using invariants and state equation in 2474 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4617 ms. Remains : 441/441 places, 8421/8421 transitions.
Treatment of property TokenRing-PT-020-LTLCardinality-15 finished in 80185 ms.
[2023-03-20 07:54:04] [INFO ] Flatten gal took : 223 ms
[2023-03-20 07:54:04] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-20 07:54:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 441 places, 8421 transitions and 33684 arcs took 64 ms.
Total runtime 451738 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2972/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2972/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2972/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : TokenRing-PT-020-LTLCardinality-13
Could not compute solution for formula : TokenRing-PT-020-LTLCardinality-14
Could not compute solution for formula : TokenRing-PT-020-LTLCardinality-15
BK_STOP 1679298856347
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name TokenRing-PT-020-LTLCardinality-13
ltl formula formula --ltl=/tmp/2972/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 441 places, 8421 transitions and 33684 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.070 real 0.240 user 0.190 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2972/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2972/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2972/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2972/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 12 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name TokenRing-PT-020-LTLCardinality-14
ltl formula formula --ltl=/tmp/2972/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 441 places, 8421 transitions and 33684 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.050 real 0.190 user 0.210 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2972/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2972/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2972/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2972/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name TokenRing-PT-020-LTLCardinality-15
ltl formula formula --ltl=/tmp/2972/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 441 places, 8421 transitions and 33684 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 1.200 real 0.250 user 0.230 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2972/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2972/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2972/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2972/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 10 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
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="TokenRing-PT-020"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is TokenRing-PT-020, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r489-tall-167912707100675"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TokenRing-PT-020.tgz
mv TokenRing-PT-020 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;