About the Execution of LTSMin+red for DES-PT-50a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 486.500 | 79818.00 | 109072.00 | 853.70 | FFTFTF?FTTFFF?FF | 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.r105-tall-167814481300475.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 DES-PT-50a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481300475
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.4K Feb 26 15:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 15:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 15:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 15:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 97K Mar 5 18:22 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 DES-PT-50a-LTLCardinality-00
FORMULA_NAME DES-PT-50a-LTLCardinality-01
FORMULA_NAME DES-PT-50a-LTLCardinality-02
FORMULA_NAME DES-PT-50a-LTLCardinality-03
FORMULA_NAME DES-PT-50a-LTLCardinality-04
FORMULA_NAME DES-PT-50a-LTLCardinality-05
FORMULA_NAME DES-PT-50a-LTLCardinality-06
FORMULA_NAME DES-PT-50a-LTLCardinality-07
FORMULA_NAME DES-PT-50a-LTLCardinality-08
FORMULA_NAME DES-PT-50a-LTLCardinality-09
FORMULA_NAME DES-PT-50a-LTLCardinality-10
FORMULA_NAME DES-PT-50a-LTLCardinality-11
FORMULA_NAME DES-PT-50a-LTLCardinality-12
FORMULA_NAME DES-PT-50a-LTLCardinality-13
FORMULA_NAME DES-PT-50a-LTLCardinality-14
FORMULA_NAME DES-PT-50a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678308022166
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=DES-PT-50a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 20:40:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 20:40:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 20:40:23] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2023-03-08 20:40:23] [INFO ] Transformed 314 places.
[2023-03-08 20:40:23] [INFO ] Transformed 271 transitions.
[2023-03-08 20:40:23] [INFO ] Found NUPN structural information;
[2023-03-08 20:40:23] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 316 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-50a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 313 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 313 transition count 256
Applied a total of 2 rules in 56 ms. Remains 313 /314 variables (removed 1) and now considering 256/257 (removed 1) transitions.
// Phase 1: matrix 256 rows 313 cols
[2023-03-08 20:40:24] [INFO ] Computed 59 place invariants in 34 ms
[2023-03-08 20:40:24] [INFO ] Implicit Places using invariants in 370 ms returned [211]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 396 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 312/314 places, 256/257 transitions.
Applied a total of 0 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 463 ms. Remains : 312/314 places, 256/257 transitions.
Support contains 32 out of 312 places after structural reductions.
[2023-03-08 20:40:24] [INFO ] Flatten gal took : 60 ms
[2023-03-08 20:40:24] [INFO ] Flatten gal took : 32 ms
[2023-03-08 20:40:24] [INFO ] Input system was already deterministic with 256 transitions.
Support contains 24 out of 312 places (down from 32) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 212 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 20:40:25] [INFO ] Computed 58 place invariants in 9 ms
[2023-03-08 20:40:26] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-08 20:40:26] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 39 ms returned sat
[2023-03-08 20:40:26] [INFO ] After 419ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-08 20:40:26] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 20:40:26] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 144 ms returned sat
[2023-03-08 20:40:27] [INFO ] After 617ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-08 20:40:27] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 19 ms to minimize.
[2023-03-08 20:40:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-03-08 20:40:27] [INFO ] After 1146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 321 ms.
[2023-03-08 20:40:28] [INFO ] After 1929ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 417 ms.
Support contains 13 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 254
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 312 transition count 254
Applied a total of 6 rules in 40 ms. Remains 312 /312 variables (removed 0) and now considering 254/256 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 312/312 places, 254/256 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 20:40:29] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-08 20:40:29] [INFO ] [Real]Absence check using 36 positive place invariants in 79 ms returned sat
[2023-03-08 20:40:29] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 48 ms returned sat
[2023-03-08 20:40:29] [INFO ] After 292ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 20:40:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 20:40:29] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 76 ms returned sat
[2023-03-08 20:40:30] [INFO ] After 555ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-08 20:40:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 20:40:30] [INFO ] After 241ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-08 20:40:30] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
[2023-03-08 20:40:31] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2023-03-08 20:40:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 174 ms
[2023-03-08 20:40:31] [INFO ] After 760ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 241 ms.
[2023-03-08 20:40:31] [INFO ] After 1925ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 269 ms.
Support contains 11 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 312 transition count 254
Applied a total of 1 rules in 30 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 312/312 places, 254/254 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 599056 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :{}
Probabilistic random walk after 599056 steps, saw 86188 distinct states, run finished after 3002 ms. (steps per millisecond=199 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 20:40:35] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-08 20:40:35] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 20:40:35] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 24 ms returned sat
[2023-03-08 20:40:35] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 20:40:35] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 20:40:35] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 66 ms returned sat
[2023-03-08 20:40:36] [INFO ] After 512ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-08 20:40:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 20:40:36] [INFO ] After 255ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-08 20:40:36] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2023-03-08 20:40:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-08 20:40:36] [INFO ] After 617ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 247 ms.
[2023-03-08 20:40:36] [INFO ] After 1648ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 388 ms.
Support contains 11 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 11 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 312/312 places, 254/254 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 254/254 transitions.
Applied a total of 0 rules in 11 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2023-03-08 20:40:37] [INFO ] Invariant cache hit.
[2023-03-08 20:40:37] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-08 20:40:37] [INFO ] Invariant cache hit.
[2023-03-08 20:40:37] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 20:40:37] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
[2023-03-08 20:40:37] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-08 20:40:37] [INFO ] Invariant cache hit.
[2023-03-08 20:40:38] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 753 ms. Remains : 312/312 places, 254/254 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 312 transition count 254
Applied a total of 1 rules in 20 ms. Remains 312 /312 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 254 rows 312 cols
[2023-03-08 20:40:38] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-08 20:40:38] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 20:40:38] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 17 ms returned sat
[2023-03-08 20:40:38] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 20:40:38] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 20:40:38] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 66 ms returned sat
[2023-03-08 20:40:39] [INFO ] After 486ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-08 20:40:39] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2023-03-08 20:40:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-08 20:40:39] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2023-03-08 20:40:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-08 20:40:39] [INFO ] After 936ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 309 ms.
[2023-03-08 20:40:39] [INFO ] After 1519ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Computed a total of 215 stabilizing places and 210 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' '!(G(F((X(p1)&&p0))))'
Support contains 4 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 4 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 20:40:39] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 20:40:40] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-08 20:40:40] [INFO ] Invariant cache hit.
[2023-03-08 20:40:40] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2023-03-08 20:40:40] [INFO ] Invariant cache hit.
[2023-03-08 20:40:40] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 679 ms. Remains : 312/312 places, 256/256 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DES-PT-50a-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s226 0) (EQ s81 1)), p1:(AND (EQ s228 0) (EQ s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 3 ms.
FORMULA DES-PT-50a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLCardinality-00 finished in 968 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U G(((p1 U p0)&&!F(p2)))))'
Support contains 5 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 18 ms. Remains 311 /312 variables (removed 1) and now considering 255/256 (removed 1) transitions.
// Phase 1: matrix 255 rows 311 cols
[2023-03-08 20:40:40] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 20:40:41] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-08 20:40:41] [INFO ] Invariant cache hit.
[2023-03-08 20:40:41] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2023-03-08 20:40:41] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-08 20:40:41] [INFO ] Invariant cache hit.
[2023-03-08 20:40:41] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 732 ms. Remains : 311/312 places, 255/256 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : DES-PT-50a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s108 0) (EQ s35 1)), p2:(OR (EQ s303 0) (EQ s66 1)), p1:(OR (EQ s35 0) (EQ s191 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1250 steps with 35 reset in 17 ms.
FORMULA DES-PT-50a-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLCardinality-01 finished in 857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p1))||p0)))'
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 7 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 20:40:41] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 20:40:41] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-08 20:40:41] [INFO ] Invariant cache hit.
[2023-03-08 20:40:42] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
[2023-03-08 20:40:42] [INFO ] Invariant cache hit.
[2023-03-08 20:40:42] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 684 ms. Remains : 312/312 places, 256/256 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DES-PT-50a-LTLCardinality-02 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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s88 0) (EQ s64 1)), p1:(OR (EQ s88 0) (EQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 551 ms.
Product exploration explored 100000 steps with 50000 reset in 510 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-50a-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-50a-LTLCardinality-02 finished in 1979 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 18 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 20:40:43] [INFO ] Invariant cache hit.
[2023-03-08 20:40:43] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-08 20:40:43] [INFO ] Invariant cache hit.
[2023-03-08 20:40:44] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
[2023-03-08 20:40:44] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 20:40:44] [INFO ] Invariant cache hit.
[2023-03-08 20:40:44] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 712 ms. Remains : 312/312 places, 256/256 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-50a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s311 0), p1:(AND (EQ s157 0) (EQ s209 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 141 steps with 2 reset in 2 ms.
FORMULA DES-PT-50a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLCardinality-03 finished in 839 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 20:40:44] [INFO ] Invariant cache hit.
[2023-03-08 20:40:44] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-08 20:40:44] [INFO ] Invariant cache hit.
[2023-03-08 20:40:45] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2023-03-08 20:40:45] [INFO ] Invariant cache hit.
[2023-03-08 20:40:45] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 674 ms. Remains : 312/312 places, 256/256 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s295 0) (EQ s175 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3055 steps with 65 reset in 15 ms.
FORMULA DES-PT-50a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLCardinality-05 finished in 833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 8 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 20:40:45] [INFO ] Invariant cache hit.
[2023-03-08 20:40:45] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-08 20:40:45] [INFO ] Invariant cache hit.
[2023-03-08 20:40:45] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
[2023-03-08 20:40:45] [INFO ] Invariant cache hit.
[2023-03-08 20:40:46] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 665 ms. Remains : 312/312 places, 256/256 transitions.
Stuttering acceptance computed with spot in 403 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s151 0) (EQ s144 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2227 reset in 265 ms.
Product exploration explored 100000 steps with 2224 reset in 253 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 179 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 226 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1525778 steps, run timeout after 3001 ms. (steps per millisecond=508 ) properties seen :{}
Probabilistic random walk after 1525778 steps, saw 212298 distinct states, run finished after 3001 ms. (steps per millisecond=508 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 20:40:50] [INFO ] Invariant cache hit.
[2023-03-08 20:40:50] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:40:50] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 20:40:50] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 39 ms returned sat
[2023-03-08 20:40:50] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 20:40:50] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-08 20:40:50] [INFO ] After 330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 254
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 312 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 311 transition count 253
Applied a total of 8 rules in 26 ms. Remains 311 /312 variables (removed 1) and now considering 253/256 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 311/312 places, 253/256 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1491449 steps, run timeout after 3001 ms. (steps per millisecond=496 ) properties seen :{}
Probabilistic random walk after 1491449 steps, saw 208000 distinct states, run finished after 3001 ms. (steps per millisecond=496 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 253 rows 311 cols
[2023-03-08 20:40:53] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-08 20:40:53] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:40:53] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 20:40:54] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 35 ms returned sat
[2023-03-08 20:40:54] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 20:40:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 20:40:54] [INFO ] After 53ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 20:40:54] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 20:40:54] [INFO ] After 333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 9 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 8 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-08 20:40:54] [INFO ] Invariant cache hit.
[2023-03-08 20:40:54] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-08 20:40:54] [INFO ] Invariant cache hit.
[2023-03-08 20:40:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 20:40:54] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
[2023-03-08 20:40:54] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 20:40:54] [INFO ] Invariant cache hit.
[2023-03-08 20:40:54] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 723 ms. Remains : 311/311 places, 253/253 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 311 transition count 253
Applied a total of 1 rules in 15 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 253 rows 311 cols
[2023-03-08 20:40:55] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 20:40:55] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:40:55] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 20:40:55] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 28 ms returned sat
[2023-03-08 20:40:55] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 20:40:55] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 20:40:55] [INFO ] After 250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 20:40:55] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-08 20:40:55] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-08 20:40:55] [INFO ] Invariant cache hit.
[2023-03-08 20:40:56] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
[2023-03-08 20:40:56] [INFO ] Invariant cache hit.
[2023-03-08 20:40:56] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 694 ms. Remains : 312/312 places, 256/256 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Detected a total of 215/312 stabilizing places and 210/256 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 225 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1446122 steps, run timeout after 3001 ms. (steps per millisecond=481 ) properties seen :{}
Probabilistic random walk after 1446122 steps, saw 202460 distinct states, run finished after 3001 ms. (steps per millisecond=481 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 20:40:59] [INFO ] Invariant cache hit.
[2023-03-08 20:40:59] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:40:59] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 20:40:59] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 39 ms returned sat
[2023-03-08 20:41:00] [INFO ] After 181ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 20:41:00] [INFO ] After 207ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-08 20:41:00] [INFO ] After 323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 256/256 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 312 transition count 254
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 312 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 311 transition count 253
Applied a total of 8 rules in 25 ms. Remains 311 /312 variables (removed 1) and now considering 253/256 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 311/312 places, 253/256 transitions.
Incomplete random walk after 10000 steps, including 128 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1509665 steps, run timeout after 3001 ms. (steps per millisecond=503 ) properties seen :{}
Probabilistic random walk after 1509665 steps, saw 210943 distinct states, run finished after 3001 ms. (steps per millisecond=503 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 253 rows 311 cols
[2023-03-08 20:41:03] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 20:41:03] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:41:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 20:41:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 28 ms returned sat
[2023-03-08 20:41:03] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 20:41:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 20:41:03] [INFO ] After 49ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 20:41:03] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 20:41:03] [INFO ] After 313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 7 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 7 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-08 20:41:03] [INFO ] Invariant cache hit.
[2023-03-08 20:41:03] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-08 20:41:03] [INFO ] Invariant cache hit.
[2023-03-08 20:41:03] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 20:41:04] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2023-03-08 20:41:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 20:41:04] [INFO ] Invariant cache hit.
[2023-03-08 20:41:04] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 705 ms. Remains : 311/311 places, 253/253 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 311 transition count 253
Applied a total of 1 rules in 13 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 253 rows 311 cols
[2023-03-08 20:41:04] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-08 20:41:04] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:41:04] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 20:41:04] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 29 ms returned sat
[2023-03-08 20:41:04] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 20:41:04] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-08 20:41:04] [INFO ] After 249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2211 reset in 223 ms.
Product exploration explored 100000 steps with 2224 reset in 238 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 23 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 20:41:05] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 256 rows 312 cols
[2023-03-08 20:41:05] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 20:41:06] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 312/312 places, 256/256 transitions.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 10 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 20:41:06] [INFO ] Invariant cache hit.
[2023-03-08 20:41:06] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-08 20:41:06] [INFO ] Invariant cache hit.
[2023-03-08 20:41:06] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
[2023-03-08 20:41:06] [INFO ] Invariant cache hit.
[2023-03-08 20:41:06] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 681 ms. Remains : 312/312 places, 256/256 transitions.
Treatment of property DES-PT-50a-LTLCardinality-06 finished in 21354 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 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 13 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 20:41:06] [INFO ] Invariant cache hit.
[2023-03-08 20:41:06] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-08 20:41:06] [INFO ] Invariant cache hit.
[2023-03-08 20:41:07] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2023-03-08 20:41:07] [INFO ] Invariant cache hit.
[2023-03-08 20:41:07] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 684 ms. Remains : 312/312 places, 256/256 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s244 0) (EQ s96 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA DES-PT-50a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLCardinality-07 finished in 783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 11 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 20:41:07] [INFO ] Invariant cache hit.
[2023-03-08 20:41:07] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-08 20:41:07] [INFO ] Invariant cache hit.
[2023-03-08 20:41:08] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2023-03-08 20:41:08] [INFO ] Invariant cache hit.
[2023-03-08 20:41:08] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 708 ms. Remains : 312/312 places, 256/256 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s206 0) (EQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 27343 reset in 343 ms.
Product exploration explored 100000 steps with 27190 reset in 398 ms.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 7 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 20:41:09] [INFO ] Invariant cache hit.
[2023-03-08 20:41:09] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-08 20:41:09] [INFO ] Invariant cache hit.
[2023-03-08 20:41:10] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
[2023-03-08 20:41:10] [INFO ] Invariant cache hit.
[2023-03-08 20:41:10] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 694 ms. Remains : 312/312 places, 256/256 transitions.
Computed a total of 215 stabilizing places and 210 stable transitions
Computed a total of 215 stabilizing places and 210 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 99 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 27288 reset in 340 ms.
Product exploration explored 100000 steps with 27229 reset in 349 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 13 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 20:41:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 20:41:12] [INFO ] Invariant cache hit.
[2023-03-08 20:41:12] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 162 ms. Remains : 312/312 places, 256/256 transitions.
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 3 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 20:41:12] [INFO ] Invariant cache hit.
[2023-03-08 20:41:12] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-08 20:41:12] [INFO ] Invariant cache hit.
[2023-03-08 20:41:12] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
[2023-03-08 20:41:12] [INFO ] Invariant cache hit.
[2023-03-08 20:41:12] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 658 ms. Remains : 312/312 places, 256/256 transitions.
Treatment of property DES-PT-50a-LTLCardinality-13 finished in 5301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))&&F(p1))))'
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Applied a total of 0 rules in 5 ms. Remains 312 /312 variables (removed 0) and now considering 256/256 (removed 0) transitions.
[2023-03-08 20:41:12] [INFO ] Invariant cache hit.
[2023-03-08 20:41:13] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-08 20:41:13] [INFO ] Invariant cache hit.
[2023-03-08 20:41:13] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2023-03-08 20:41:13] [INFO ] Invariant cache hit.
[2023-03-08 20:41:13] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 684 ms. Remains : 312/312 places, 256/256 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-50a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s83 0) (EQ s80 1)), p0:(OR (EQ s80 0) (EQ s83 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 1 ms.
FORMULA DES-PT-50a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50a-LTLCardinality-14 finished in 846 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : DES-PT-50a-LTLCardinality-06
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 14 ms. Remains 311 /312 variables (removed 1) and now considering 255/256 (removed 1) transitions.
// Phase 1: matrix 255 rows 311 cols
[2023-03-08 20:41:13] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 20:41:14] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-08 20:41:14] [INFO ] Invariant cache hit.
[2023-03-08 20:41:14] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
[2023-03-08 20:41:14] [INFO ] Invariant cache hit.
[2023-03-08 20:41:14] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 716 ms. Remains : 311/312 places, 255/256 transitions.
Running random walk in product with property : DES-PT-50a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s150 0) (EQ s143 1))], 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2282 reset in 200 ms.
Product exploration explored 100000 steps with 2275 reset in 225 ms.
Computed a total of 214 stabilizing places and 209 stable transitions
Computed a total of 214 stabilizing places and 209 stable transitions
Detected a total of 214/311 stabilizing places and 209/255 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 219 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1560784 steps, run timeout after 3001 ms. (steps per millisecond=520 ) properties seen :{}
Probabilistic random walk after 1560784 steps, saw 216379 distinct states, run finished after 3001 ms. (steps per millisecond=520 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 20:41:18] [INFO ] Invariant cache hit.
[2023-03-08 20:41:18] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:41:18] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 20:41:18] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 46 ms returned sat
[2023-03-08 20:41:18] [INFO ] After 450ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 20:41:19] [INFO ] After 475ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 20:41:19] [INFO ] After 645ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 255/255 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 311 transition count 253
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 311 transition count 253
Applied a total of 3 rules in 13 ms. Remains 311 /311 variables (removed 0) and now considering 253/255 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 311/311 places, 253/255 transitions.
Incomplete random walk after 10000 steps, including 163 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1552701 steps, run timeout after 3001 ms. (steps per millisecond=517 ) properties seen :{}
Probabilistic random walk after 1552701 steps, saw 218159 distinct states, run finished after 3002 ms. (steps per millisecond=517 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 253 rows 311 cols
[2023-03-08 20:41:22] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-08 20:41:22] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:41:22] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 20:41:22] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 139 ms returned sat
[2023-03-08 20:41:22] [INFO ] After 198ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 20:41:22] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-08 20:41:22] [INFO ] After 457ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 9 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 5 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-08 20:41:22] [INFO ] Invariant cache hit.
[2023-03-08 20:41:22] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-08 20:41:22] [INFO ] Invariant cache hit.
[2023-03-08 20:41:23] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
[2023-03-08 20:41:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 20:41:23] [INFO ] Invariant cache hit.
[2023-03-08 20:41:23] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 731 ms. Remains : 311/311 places, 253/253 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 311 transition count 253
Applied a total of 1 rules in 11 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 253 rows 311 cols
[2023-03-08 20:41:23] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 20:41:23] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:41:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 20:41:23] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 141 ms returned sat
[2023-03-08 20:41:23] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 20:41:23] [INFO ] After 248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 20:41:23] [INFO ] After 505ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 255/255 transitions.
Applied a total of 0 rules in 7 ms. Remains 311 /311 variables (removed 0) and now considering 255/255 (removed 0) transitions.
// Phase 1: matrix 255 rows 311 cols
[2023-03-08 20:41:24] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-08 20:41:24] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-08 20:41:24] [INFO ] Invariant cache hit.
[2023-03-08 20:41:24] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2023-03-08 20:41:24] [INFO ] Invariant cache hit.
[2023-03-08 20:41:25] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 737 ms. Remains : 311/311 places, 255/255 transitions.
Computed a total of 214 stabilizing places and 209 stable transitions
Computed a total of 214 stabilizing places and 209 stable transitions
Detected a total of 214/311 stabilizing places and 209/255 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 222 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1558706 steps, run timeout after 3001 ms. (steps per millisecond=519 ) properties seen :{}
Probabilistic random walk after 1558706 steps, saw 216164 distinct states, run finished after 3001 ms. (steps per millisecond=519 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 20:41:28] [INFO ] Invariant cache hit.
[2023-03-08 20:41:28] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:41:28] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 20:41:28] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 46 ms returned sat
[2023-03-08 20:41:28] [INFO ] After 432ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 20:41:28] [INFO ] After 468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-08 20:41:29] [INFO ] After 623ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 255/255 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 311 transition count 253
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 311 transition count 253
Applied a total of 3 rules in 15 ms. Remains 311 /311 variables (removed 0) and now considering 253/255 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 311/311 places, 253/255 transitions.
Incomplete random walk after 10000 steps, including 156 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1533085 steps, run timeout after 3001 ms. (steps per millisecond=510 ) properties seen :{}
Probabilistic random walk after 1533085 steps, saw 215504 distinct states, run finished after 3001 ms. (steps per millisecond=510 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 253 rows 311 cols
[2023-03-08 20:41:32] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-08 20:41:32] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:41:32] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 20:41:32] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 153 ms returned sat
[2023-03-08 20:41:32] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 20:41:32] [INFO ] After 227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-08 20:41:32] [INFO ] After 499ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 6 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 5 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-08 20:41:32] [INFO ] Invariant cache hit.
[2023-03-08 20:41:32] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-08 20:41:32] [INFO ] Invariant cache hit.
[2023-03-08 20:41:33] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2023-03-08 20:41:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 20:41:33] [INFO ] Invariant cache hit.
[2023-03-08 20:41:33] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 707 ms. Remains : 311/311 places, 253/253 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 311 transition count 253
Applied a total of 1 rules in 11 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 253 rows 311 cols
[2023-03-08 20:41:33] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 20:41:33] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 20:41:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 20:41:33] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 142 ms returned sat
[2023-03-08 20:41:33] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 20:41:33] [INFO ] After 264ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-08 20:41:33] [INFO ] After 513ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2301 reset in 202 ms.
Product exploration explored 100000 steps with 2271 reset in 216 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 255/255 transitions.
Applied a total of 0 rules in 12 ms. Remains 311 /311 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-08 20:41:35] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 255 rows 311 cols
[2023-03-08 20:41:35] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 20:41:35] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 311/311 places, 255/255 transitions.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 255/255 transitions.
Applied a total of 0 rules in 3 ms. Remains 311 /311 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-08 20:41:35] [INFO ] Invariant cache hit.
[2023-03-08 20:41:35] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-08 20:41:35] [INFO ] Invariant cache hit.
[2023-03-08 20:41:35] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2023-03-08 20:41:35] [INFO ] Invariant cache hit.
[2023-03-08 20:41:35] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 669 ms. Remains : 311/311 places, 255/255 transitions.
Treatment of property DES-PT-50a-LTLCardinality-06 finished in 22238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Found a Shortening insensitive property : DES-PT-50a-LTLCardinality-13
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 312 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 312/312 places, 256/256 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 13 ms. Remains 311 /312 variables (removed 1) and now considering 255/256 (removed 1) transitions.
[2023-03-08 20:41:36] [INFO ] Invariant cache hit.
[2023-03-08 20:41:36] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-08 20:41:36] [INFO ] Invariant cache hit.
[2023-03-08 20:41:36] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2023-03-08 20:41:36] [INFO ] Invariant cache hit.
[2023-03-08 20:41:36] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 668 ms. Remains : 311/312 places, 255/256 transitions.
Running random walk in product with property : DES-PT-50a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s205 0) (EQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 26110 reset in 214 ms.
Product exploration explored 100000 steps with 26100 reset in 233 ms.
Computed a total of 214 stabilizing places and 209 stable transitions
Computed a total of 214 stabilizing places and 209 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 131 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 255/255 transitions.
Applied a total of 0 rules in 4 ms. Remains 311 /311 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-08 20:41:37] [INFO ] Invariant cache hit.
[2023-03-08 20:41:37] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-08 20:41:37] [INFO ] Invariant cache hit.
[2023-03-08 20:41:38] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2023-03-08 20:41:38] [INFO ] Invariant cache hit.
[2023-03-08 20:41:38] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 668 ms. Remains : 311/311 places, 255/255 transitions.
Computed a total of 214 stabilizing places and 209 stable transitions
Computed a total of 214 stabilizing places and 209 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 26119 reset in 219 ms.
Product exploration explored 100000 steps with 26124 reset in 231 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 255/255 transitions.
Applied a total of 0 rules in 10 ms. Remains 311 /311 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-08 20:41:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 20:41:39] [INFO ] Invariant cache hit.
[2023-03-08 20:41:39] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 149 ms. Remains : 311/311 places, 255/255 transitions.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 255/255 transitions.
Applied a total of 0 rules in 3 ms. Remains 311 /311 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-08 20:41:39] [INFO ] Invariant cache hit.
[2023-03-08 20:41:40] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-08 20:41:40] [INFO ] Invariant cache hit.
[2023-03-08 20:41:40] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2023-03-08 20:41:40] [INFO ] Invariant cache hit.
[2023-03-08 20:41:40] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 693 ms. Remains : 311/311 places, 255/255 transitions.
Treatment of property DES-PT-50a-LTLCardinality-13 finished in 4670 ms.
[2023-03-08 20:41:40] [INFO ] Flatten gal took : 21 ms
[2023-03-08 20:41:40] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-08 20:41:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 312 places, 256 transitions and 1235 arcs took 3 ms.
Total runtime 76978 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1653/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1653/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DES-PT-50a-LTLCardinality-06
Could not compute solution for formula : DES-PT-50a-LTLCardinality-13
BK_STOP 1678308101984
--------------------
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 DES-PT-50a-LTLCardinality-06
ltl formula formula --ltl=/tmp/1653/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 312 places, 256 transitions and 1235 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 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1653/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1653/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1653/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1653/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 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 DES-PT-50a-LTLCardinality-13
ltl formula formula --ltl=/tmp/1653/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: =============================================================================
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 312 places, 256 transitions and 1235 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 0.030 real 0.020 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1653/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1653/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1653/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1653/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)
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="DES-PT-50a"
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 DES-PT-50a, 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 r105-tall-167814481300475"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50a.tgz
mv DES-PT-50a 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 ;