About the Execution of LTSMin+red for NeighborGrid-PT-d5n4m1t35
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9110.399 | 1382973.00 | 3166945.00 | 3436.00 | FFF???FTFFFFTFF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r508-tall-171654351600435.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is NeighborGrid-PT-d5n4m1t35, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654351600435
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 59M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 11 17:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Apr 11 17:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 11 17:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 17:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rwxr-xr-x 1 mcc users 59M May 18 16:43 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 NeighborGrid-PT-d5n4m1t35-LTLCardinality-00
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-01
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-02
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-03
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-04
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-05
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-06
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-07
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-08
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-09
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-10
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-11
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-12
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-13
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-14
FORMULA_NAME NeighborGrid-PT-d5n4m1t35-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717237955451
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NeighborGrid-PT-d5n4m1t35
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:32:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 10:32:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:32:38] [INFO ] Load time of PNML (sax parser for PT used): 1705 ms
[2024-06-01 10:32:38] [INFO ] Transformed 1024 places.
[2024-06-01 10:32:38] [INFO ] Transformed 196608 transitions.
[2024-06-01 10:32:38] [INFO ] Parsed PT model containing 1024 places and 196608 transitions and 393216 arcs in 2180 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 7393 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2024-06-01 10:32:49] [INFO ] Computed 1 invariants in 2942 ms
[2024-06-01 10:32:49] [INFO ] Implicit Places using invariants in 3339 ms returned []
Implicit Place search using SMT only with invariants took 3370 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 10833 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Support contains 48 out of 1024 places after structural reductions.
[2024-06-01 10:32:53] [INFO ] Flatten gal took : 2822 ms
[2024-06-01 10:32:55] [INFO ] Flatten gal took : 2050 ms
[2024-06-01 10:33:01] [INFO ] Input system was already deterministic with 196608 transitions.
RANDOM walk for 17561 steps (4 resets) in 120016 ms. (0 steps per ms) remains 0/27 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1))))'
Support contains 4 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 8067 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2024-06-01 10:33:40] [INFO ] Invariant cache hit.
[2024-06-01 10:33:40] [INFO ] Implicit Places using invariants in 228 ms returned []
Implicit Place search using SMT only with invariants took 229 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 8312 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLCardinality-00
Product exploration timeout after 1500 steps with 635 reset in 10080 ms.
Product exploration timeout after 1080 steps with 240 reset in 10046 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1))]
Knowledge based reduction with 1 factoid took 214 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 11621 steps (2 resets) in 84433 ms. (0 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (F (NOT p1)), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 284 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 9329 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2024-06-01 10:34:44] [INFO ] Invariant cache hit.
[2024-06-01 10:34:44] [INFO ] Implicit Places using invariants in 271 ms returned []
Implicit Place search using SMT only with invariants took 273 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 9621 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1))]
Knowledge based reduction with 1 factoid took 199 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 10672 steps (2 resets) in 74510 ms. (0 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (F (NOT p1)), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 280 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration timeout after 1600 steps with 704 reset in 10042 ms.
Product exploration timeout after 1660 steps with 780 reset in 10040 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195076 edges and 1024 vertex of which 1020 / 1024 are part of one of the 1 SCC in 58 ms
Free SCC test removed 1019 places
Ensure Unique test removed 196595 transitions
Reduce isomorphic transitions removed 196595 transitions.
Applied a total of 1 rules in 292 ms. Remains 5 /1024 variables (removed 1019) and now considering 13/196608 (removed 196595) transitions.
[2024-06-01 10:35:32] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/1024 places, 13/196608 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 305 ms. Remains : 5/1024 places, 13/196608 transitions.
Support contains 4 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 6033 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2024-06-01 10:35:38] [INFO ] Invariant cache hit.
[2024-06-01 10:35:38] [INFO ] Implicit Places using invariants in 209 ms returned []
Implicit Place search using SMT only with invariants took 212 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 6258 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLCardinality-00 finished in 130042 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195078 edges and 1024 vertex of which 1020 / 1024 are part of one of the 1 SCC in 33 ms
Free SCC test removed 1019 places
Ensure Unique test removed 196593 transitions
Reduce isomorphic transitions removed 196593 transitions.
Applied a total of 1 rules in 337 ms. Remains 5 /1024 variables (removed 1019) and now considering 15/196608 (removed 196593) transitions.
// Phase 1: matrix 15 rows 5 cols
[2024-06-01 10:35:42] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 10:35:42] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 10:35:42] [INFO ] Invariant cache hit.
[2024-06-01 10:35:42] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-06-01 10:35:42] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/1024 places, 15/196608 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 390 ms. Remains : 5/1024 places, 15/196608 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLCardinality-01
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLCardinality-01 finished in 555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195840 edges and 1024 vertex of which 1022 / 1024 are part of one of the 1 SCC in 40 ms
Free SCC test removed 1021 places
Ensure Unique test removed 196603 transitions
Reduce isomorphic transitions removed 196603 transitions.
Applied a total of 1 rules in 184 ms. Remains 3 /1024 variables (removed 1021) and now considering 5/196608 (removed 196603) transitions.
// Phase 1: matrix 5 rows 3 cols
[2024-06-01 10:35:43] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 10:35:43] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 10:35:43] [INFO ] Invariant cache hit.
[2024-06-01 10:35:43] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-06-01 10:35:43] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/1024 places, 5/196608 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 230 ms. Remains : 3/1024 places, 5/196608 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLCardinality-02 finished in 371 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&F(G((p0 U p1)))) U X((p2&&(p3 U p0)))))'
Support contains 6 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 6133 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2024-06-01 10:35:52] [INFO ] Computed 1 invariants in 3252 ms
[2024-06-01 10:35:53] [INFO ] Implicit Places using invariants in 3445 ms returned []
Implicit Place search using SMT only with invariants took 3446 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 9596 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLCardinality-03
Product exploration timeout after 810 steps with 0 reset in 10143 ms.
Product exploration timeout after 800 steps with 0 reset in 10124 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 p3))), (X (OR (AND (NOT p0) (NOT p3)) (NOT p2)))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1))]
Knowledge based reduction with 4 factoid took 318 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 344 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p0), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 16397 steps (4 resets) in 113552 ms. (0 steps per ms) remains 0/12 properties
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p2 p3))), (X (OR (AND (NOT p0) (NOT p3)) (NOT p2)))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (F (NOT (OR p0 (NOT p3) (NOT p2)))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p3))), (F (NOT (OR (AND (NOT p0) (NOT p3)) (NOT p2)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (AND p0 (NOT p2)))), (F p2), (F p3), (F (NOT (AND (OR p0 p3) (OR p0 p2)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p3))))]
Knowledge based reduction with 4 factoid took 789 ms. Reduced automaton from 7 states, 15 edges and 4 AP (stutter sensitive) to 7 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p0), (NOT p1), (NOT p1)]
[2024-06-01 10:36:50] [INFO ] Invariant cache hit.
Could not prove EG (NOT p2)
Support contains 6 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 6599 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2024-06-01 10:37:11] [INFO ] Invariant cache hit.
[2024-06-01 10:37:11] [INFO ] Implicit Places using invariants in 200 ms returned []
Implicit Place search using SMT only with invariants took 201 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 6814 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p3 p2))), (X (OR (AND (NOT p0) (NOT p3)) (NOT p2)))]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))))), (X p3), (X (NOT p3)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p0))]
Knowledge based reduction with 4 factoid took 322 ms. Reduced automaton from 7 states, 15 edges and 4 AP (stutter sensitive) to 7 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p0), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 13 to 12
RANDOM walk for 16781 steps (4 resets) in 120008 ms. (0 steps per ms) remains 1/12 properties
BEST_FIRST walk for 40004 steps (0 resets) in 649 ms. (61 steps per ms) remains 1/1 properties
[2024-06-01 10:37:46] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1020/1024 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1024 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5363ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1024 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195074 edges and 1024 vertex of which 1020 / 1024 are part of one of the 1 SCC in 59 ms
Free SCC test removed 1019 places
Drop transitions (Empty/Sink Transition effects.) removed 195074 transitions
Ensure Unique test removed 1524 transitions
Reduce isomorphic transitions removed 196598 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 5 transition count 8
Applied a total of 3 rules in 367 ms. Remains 5 /1024 variables (removed 1019) and now considering 8/196608 (removed 196600) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 367 ms. Remains : 5/1024 places, 8/196608 transitions.
RANDOM walk for 41037 steps (8 resets) in 76 ms. (532 steps per ms) remains 1/1 properties
BEST_FIRST walk for 136 steps (0 resets) in 4 ms. (27 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p3 p2))), (X (OR (AND (NOT p0) (NOT p3)) (NOT p2)))]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))))), (X p3), (X (NOT p3)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p0)), (F (NOT (OR p0 (NOT p3) (NOT p2)))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p3))), (F (NOT (OR (AND (NOT p0) (NOT p3)) (NOT p2)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (AND p0 (NOT p2)))), (F p2), (F p3), (F (NOT (AND (OR p0 p3) (OR p0 p2)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p3))))]
Knowledge based reduction with 4 factoid took 683 ms. Reduced automaton from 7 states, 15 edges and 4 AP (stutter sensitive) to 7 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p0), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p0), (NOT p1), (NOT p1)]
[2024-06-01 10:37:53] [INFO ] Invariant cache hit.
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p0), (NOT p1), (NOT p1)]
Product exploration timeout after 760 steps with 0 reset in 10096 ms.
Product exploration timeout after 790 steps with 0 reset in 10045 ms.
Applying partial POR strategy [false, true, false, true, true, true, true]
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p0), (NOT p1), (NOT p1)]
Support contains 6 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 194312 edges and 1024 vertex of which 1018 / 1024 are part of one of the 1 SCC in 36 ms
Free SCC test removed 1017 places
Ensure Unique test removed 196587 transitions
Reduce isomorphic transitions removed 196587 transitions.
Applied a total of 1 rules in 208 ms. Remains 7 /1024 variables (removed 1017) and now considering 21/196608 (removed 196587) transitions.
[2024-06-01 10:38:30] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/1024 places, 21/196608 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 213 ms. Remains : 7/1024 places, 21/196608 transitions.
Support contains 6 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 8340 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2024-06-01 10:38:38] [INFO ] Invariant cache hit.
[2024-06-01 10:38:38] [INFO ] Implicit Places using invariants in 195 ms returned []
Implicit Place search using SMT only with invariants took 196 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 8551 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLCardinality-03 finished in 179179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&(p1||X(p2))))))'
Support contains 4 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 8942 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2024-06-01 10:38:51] [INFO ] Invariant cache hit.
[2024-06-01 10:38:51] [INFO ] Implicit Places using invariants in 192 ms returned []
Implicit Place search using SMT only with invariants took 192 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 9150 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLCardinality-04
Product exploration timeout after 690 steps with 0 reset in 10129 ms.
Product exploration timeout after 690 steps with 0 reset in 10095 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X p1), (X (NOT p1))]
Knowledge based reduction with 1 factoid took 280 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 14090 steps (3 resets) in 106507 ms. (0 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p2)))), (F p2), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 1 factoid took 401 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
[2024-06-01 10:39:48] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 4 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 5971 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2024-06-01 10:40:09] [INFO ] Invariant cache hit.
[2024-06-01 10:40:09] [INFO ] Implicit Places using invariants in 175 ms returned []
Implicit Place search using SMT only with invariants took 176 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 6162 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X p1), (X (NOT p1))]
Knowledge based reduction with 1 factoid took 238 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 9146 steps (2 resets) in 71334 ms. (0 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p2)))), (F p2), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 1 factoid took 453 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
[2024-06-01 10:40:44] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration timeout after 690 steps with 0 reset in 10090 ms.
Product exploration timeout after 660 steps with 0 reset in 10071 ms.
Support contains 4 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 6838 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2024-06-01 10:41:27] [INFO ] Invariant cache hit.
[2024-06-01 10:41:27] [INFO ] Implicit Places using invariants in 250 ms returned []
Implicit Place search using SMT only with invariants took 253 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 7113 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLCardinality-04 finished in 168759 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1||G(F(p2))||F(p3)))))'
Support contains 6 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 5929 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2024-06-01 10:41:37] [INFO ] Invariant cache hit.
[2024-06-01 10:41:37] [INFO ] Implicit Places using invariants in 191 ms returned []
Implicit Place search using SMT only with invariants took 192 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 6136 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLCardinality-05
Product exploration timeout after 1310 steps with 432 reset in 10028 ms.
Product exploration timeout after 1510 steps with 634 reset in 10061 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT p3))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (AND p0 (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (AND p0 (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1))]
Knowledge based reduction with 2 factoid took 591 ms. Reduced automaton from 7 states, 13 edges and 4 AP (stutter sensitive) to 7 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3))]
RANDOM walk for 13087 steps (2 resets) in 120042 ms. (0 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT p3))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (AND (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (AND p0 (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (AND p0 (NOT p1) (NOT p2) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (F (NOT (OR p3 p1))), (F (NOT (OR (NOT p0) p3 p1 p2))), (F (NOT (OR p0 p3 p1))), (F (NOT (OR p3 p1 p2))), (F p2), (F (NOT (AND (NOT p3) (NOT p2)))), (F p3), (F (NOT p0)), (F (NOT (OR (NOT p0) p3 p1))), (F (NOT (OR p0 p3 p1 p2))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 769 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 7 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3))]
Support contains 6 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 6196 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2024-06-01 10:42:39] [INFO ] Invariant cache hit.
[2024-06-01 10:42:39] [INFO ] Implicit Places using invariants in 189 ms returned []
Implicit Place search using SMT only with invariants took 191 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 6400 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) p1 (NOT p2) p0), (X (NOT p3))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p3) (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (AND p0 (NOT p3) (NOT p1))), (X (NOT (AND p0 (NOT p3) (NOT p1))))]
Knowledge based reduction with 2 factoid took 400 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 7 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3))]
RANDOM walk for 11199 steps (2 resets) in 120025 ms. (0 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p3) p1 (NOT p2) p0), (X (NOT p3))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p3) (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (AND p0 (NOT p3) (NOT p1))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (F (NOT (OR p3 p1))), (F (NOT (OR (NOT p0) p3 p1 p2))), (F (NOT (OR p0 p3 p1))), (F (NOT (OR p3 p1 p2))), (F p2), (F (NOT (AND (NOT p3) (NOT p2)))), (F p3), (F (NOT p0)), (F (NOT (OR (NOT p0) p3 p1))), (F (NOT (OR p0 p3 p1 p2))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 684 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 7 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 278 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3))]
Product exploration timeout after 710 steps with 47 reset in 10100 ms.
Product exploration timeout after 1230 steps with 482 reset in 10078 ms.
Applying partial POR strategy [false, true, false, true, true, true, false]
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3))]
Support contains 6 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 194314 edges and 1024 vertex of which 1018 / 1024 are part of one of the 1 SCC in 22 ms
Free SCC test removed 1017 places
Ensure Unique test removed 196585 transitions
Reduce isomorphic transitions removed 196585 transitions.
Applied a total of 1 rules in 148 ms. Remains 7 /1024 variables (removed 1017) and now considering 23/196608 (removed 196585) transitions.
[2024-06-01 10:43:36] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/1024 places, 23/196608 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 157 ms. Remains : 7/1024 places, 23/196608 transitions.
Support contains 6 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 6330 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2024-06-01 10:43:42] [INFO ] Invariant cache hit.
[2024-06-01 10:43:42] [INFO ] Implicit Places using invariants in 177 ms returned []
Implicit Place search using SMT only with invariants took 179 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 6526 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLCardinality-05 finished in 135345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||G(p1))))'
Support contains 3 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 7554 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2024-06-01 10:43:54] [INFO ] Invariant cache hit.
[2024-06-01 10:43:54] [INFO ] Implicit Places using invariants in 180 ms returned []
Implicit Place search using SMT only with invariants took 180 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 7752 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLCardinality-06
Product exploration timeout after 990 steps with 188 reset in 10082 ms.
Product exploration timeout after 1170 steps with 307 reset in 10088 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 5152 steps (0 resets) in 47572 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 101 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)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1024 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 6962 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2024-06-01 10:44:46] [INFO ] Invariant cache hit.
[2024-06-01 10:44:46] [INFO ] Implicit Places using invariants in 189 ms returned []
Implicit Place search using SMT only with invariants took 190 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 7168 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 66 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 89 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 2945 steps (0 resets) in 30241 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 112 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 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 1070 steps with 234 reset in 10071 ms.
Product exploration timeout after 1300 steps with 433 reset in 10054 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195840 edges and 1024 vertex of which 1022 / 1024 are part of one of the 1 SCC in 22 ms
Free SCC test removed 1021 places
Ensure Unique test removed 196603 transitions
Reduce isomorphic transitions removed 196603 transitions.
Applied a total of 1 rules in 145 ms. Remains 3 /1024 variables (removed 1021) and now considering 5/196608 (removed 196603) transitions.
[2024-06-01 10:45:29] [INFO ] Redundant transitions in 1 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/1024 places, 5/196608 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153 ms. Remains : 3/1024 places, 5/196608 transitions.
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 8013 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2024-06-01 10:45:37] [INFO ] Invariant cache hit.
[2024-06-01 10:45:37] [INFO ] Implicit Places using invariants in 205 ms returned []
Implicit Place search using SMT only with invariants took 206 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 8234 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLCardinality-06 finished in 114501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 4 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 6629 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2024-06-01 10:45:48] [INFO ] Invariant cache hit.
[2024-06-01 10:45:48] [INFO ] Implicit Places using invariants in 318 ms returned []
Implicit Place search using SMT only with invariants took 319 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 6965 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 37 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLCardinality-08 finished in 7311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 196224 edges and 1024 vertex of which 1023 / 1024 are part of one of the 1 SCC in 23 ms
Free SCC test removed 1022 places
Ensure Unique test removed 196605 transitions
Reduce isomorphic transitions removed 196605 transitions.
Applied a total of 1 rules in 230 ms. Remains 2 /1024 variables (removed 1022) and now considering 3/196608 (removed 196605) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-06-01 10:45:48] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 10:45:48] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 10:45:48] [INFO ] Invariant cache hit.
[2024-06-01 10:45:48] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-06-01 10:45:48] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/1024 places, 3/196608 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 274 ms. Remains : 2/1024 places, 3/196608 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLCardinality-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLCardinality-10 finished in 360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195072 edges and 1024 vertex of which 1020 / 1024 are part of one of the 1 SCC in 23 ms
Free SCC test removed 1019 places
Ensure Unique test removed 196599 transitions
Reduce isomorphic transitions removed 196599 transitions.
Applied a total of 1 rules in 210 ms. Remains 5 /1024 variables (removed 1019) and now considering 9/196608 (removed 196599) transitions.
// Phase 1: matrix 9 rows 5 cols
[2024-06-01 10:45:49] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 10:45:49] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 10:45:49] [INFO ] Invariant cache hit.
[2024-06-01 10:45:49] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-06-01 10:45:49] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/1024 places, 9/196608 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 251 ms. Remains : 5/1024 places, 9/196608 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLCardinality-11
Stuttering criterion allowed to conclude after 5 steps with 1 reset in 0 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLCardinality-11 finished in 397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||F(p1))))))'
Support contains 3 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 6965 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
// Phase 1: matrix 196608 rows 1024 cols
[2024-06-01 10:45:59] [INFO ] Computed 1 invariants in 3023 ms
[2024-06-01 10:45:59] [INFO ] Implicit Places using invariants in 3267 ms returned []
Implicit Place search using SMT only with invariants took 3269 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 10249 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLCardinality-13
Product exploration timeout after 1080 steps with 211 reset in 10030 ms.
Product exploration timeout after 1020 steps with 165 reset in 10132 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 11583 steps (2 resets) in 96068 ms. (0 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 159 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 6674 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2024-06-01 10:46:58] [INFO ] Invariant cache hit.
[2024-06-01 10:46:58] [INFO ] Implicit Places using invariants in 207 ms returned []
Implicit Place search using SMT only with invariants took 208 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 6897 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 10198 steps (2 resets) in 79965 ms. (0 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 150 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration timeout after 890 steps with 68 reset in 10025 ms.
Product exploration timeout after 1160 steps with 290 reset in 10066 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195460 edges and 1024 vertex of which 1021 / 1024 are part of one of the 1 SCC in 22 ms
Free SCC test removed 1020 places
Ensure Unique test removed 196597 transitions
Reduce isomorphic transitions removed 196597 transitions.
Applied a total of 1 rules in 145 ms. Remains 4 /1024 variables (removed 1020) and now considering 11/196608 (removed 196597) transitions.
[2024-06-01 10:47:50] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/1024 places, 11/196608 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 155 ms. Remains : 4/1024 places, 11/196608 transitions.
Support contains 3 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 7023 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2024-06-01 10:47:57] [INFO ] Invariant cache hit.
[2024-06-01 10:47:57] [INFO ] Implicit Places using invariants in 170 ms returned []
Implicit Place search using SMT only with invariants took 173 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 7209 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLCardinality-13 finished in 132071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 6423 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2024-06-01 10:48:08] [INFO ] Invariant cache hit.
[2024-06-01 10:48:08] [INFO ] Implicit Places using invariants in 184 ms returned []
Implicit Place search using SMT only with invariants took 185 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 6624 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 22 ms.
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLCardinality-14 finished in 7070 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X(X(p1)))))'
Support contains 6 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 5666 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2024-06-01 10:48:14] [INFO ] Invariant cache hit.
[2024-06-01 10:48:14] [INFO ] Implicit Places using invariants in 178 ms returned []
Implicit Place search using SMT only with invariants took 178 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 5858 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLCardinality-15
Product exploration timeout after 900 steps with 2 reset in 10121 ms.
Product exploration timeout after 840 steps with 0 reset in 10039 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 13287 steps (3 resets) in 111603 ms. (0 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 210 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 5987 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2024-06-01 10:49:14] [INFO ] Invariant cache hit.
[2024-06-01 10:49:14] [INFO ] Implicit Places using invariants in 190 ms returned []
Implicit Place search using SMT only with invariants took 191 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 6198 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 11664 steps (2 resets) in 85607 ms. (0 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 196 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 770 steps with 0 reset in 10108 ms.
Product exploration timeout after 770 steps with 0 reset in 10135 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 1024 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 194306 edges and 1024 vertex of which 1018 / 1024 are part of one of the 1 SCC in 70 ms
Free SCC test removed 1017 places
Ensure Unique test removed 196593 transitions
Reduce isomorphic transitions removed 196593 transitions.
Applied a total of 1 rules in 215 ms. Remains 7 /1024 variables (removed 1017) and now considering 15/196608 (removed 196593) transitions.
[2024-06-01 10:50:09] [INFO ] Redundant transitions in 0 ms returned []
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/1024 places, 15/196608 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 224 ms. Remains : 7/1024 places, 15/196608 transitions.
Support contains 6 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Applied a total of 0 rules in 6294 ms. Remains 1024 /1024 variables (removed 0) and now considering 196608/196608 (removed 0) transitions.
[2024-06-01 10:50:15] [INFO ] Invariant cache hit.
[2024-06-01 10:50:16] [INFO ] Implicit Places using invariants in 188 ms returned []
Implicit Place search using SMT only with invariants took 189 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 6505 ms. Remains : 1024/1024 places, 196608/196608 transitions.
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLCardinality-15 finished in 131329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&F(G((p0 U p1)))) U X((p2&&(p3 U p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&(p1||X(p2))))))'
Found a Shortening insensitive property : NeighborGrid-PT-d5n4m1t35-LTLCardinality-04
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 4 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 195072 edges and 1024 vertex of which 1020 / 1024 are part of one of the 1 SCC in 26 ms
Free SCC test removed 1019 places
Ensure Unique test removed 196599 transitions
Reduce isomorphic transitions removed 196599 transitions.
Applied a total of 1 rules in 187 ms. Remains 5 /1024 variables (removed 1019) and now considering 9/196608 (removed 196599) transitions.
// Phase 1: matrix 9 rows 5 cols
[2024-06-01 10:50:20] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 10:50:20] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 10:50:20] [INFO ] Invariant cache hit.
[2024-06-01 10:50:20] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Starting structural reductions in LI_LTL mode, iteration 1 : 5/1024 places, 9/196608 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 227 ms. Remains : 5/1024 places, 9/196608 transitions.
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLCardinality-04 finished in 812 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1||G(F(p2))||F(p3)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||F(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||X(X(p1)))))'
Found a Shortening insensitive property : NeighborGrid-PT-d5n4m1t35-LTLCardinality-15
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 1024 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1024/1024 places, 196608/196608 transitions.
Graph (trivial) has 194306 edges and 1024 vertex of which 1018 / 1024 are part of one of the 1 SCC in 22 ms
Free SCC test removed 1017 places
Ensure Unique test removed 196593 transitions
Reduce isomorphic transitions removed 196593 transitions.
Applied a total of 1 rules in 271 ms. Remains 7 /1024 variables (removed 1017) and now considering 15/196608 (removed 196593) transitions.
// Phase 1: matrix 15 rows 7 cols
[2024-06-01 10:50:21] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 10:50:21] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 10:50:21] [INFO ] Invariant cache hit.
[2024-06-01 10:50:21] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LI_LTL mode, iteration 1 : 7/1024 places, 15/196608 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 315 ms. Remains : 7/1024 places, 15/196608 transitions.
Running random walk in product with property : NeighborGrid-PT-d5n4m1t35-LTLCardinality-15
Stuttering criterion allowed to conclude after 5 steps with 1 reset in 0 ms.
Treatment of property NeighborGrid-PT-d5n4m1t35-LTLCardinality-15 finished in 587 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-06-01 10:50:24] [INFO ] Flatten gal took : 2143 ms
[2024-06-01 10:50:24] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 10:50:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1024 places, 196608 transitions and 393216 arcs took 361 ms.
Total runtime 1067882 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : NeighborGrid-PT-d5n4m1t35-LTLCardinality-03
Could not compute solution for formula : NeighborGrid-PT-d5n4m1t35-LTLCardinality-04
Could not compute solution for formula : NeighborGrid-PT-d5n4m1t35-LTLCardinality-05
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA NeighborGrid-PT-d5n4m1t35-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : NeighborGrid-PT-d5n4m1t35-LTLCardinality-15
BK_STOP 1717239338424
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name NeighborGrid-PT-d5n4m1t35-LTLCardinality-00
ltl formula formula --ltl=/tmp/2632/ltl_0_
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 1024 places, 196608 transitions and 393216 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 18.560 real 5.970 user 6.330 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2632/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2632/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2632/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2632/ltl_0_
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): There are 1026 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1025, there are 196611 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~4!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 198
pnml2lts-mc( 0/ 4): unique states count: 205
pnml2lts-mc( 0/ 4): unique transitions count: 785280
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 208
pnml2lts-mc( 0/ 4): - cum. max stack depth: 10
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 208 states 1375108 transitions, fanout: 6611.096
pnml2lts-mc( 0/ 4): Total exploration time 4.640 sec (4.610 sec minimum, 4.630 sec on average)
pnml2lts-mc( 0/ 4): States per second: 45, Transitions per second: 296360
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 10.0MB, 13.4 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 2.0%/6.0%
pnml2lts-mc( 0/ 4): Stored 200643 string chucks using 2MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 11MB
pnml2lts-mc( 0/ 4): Est. total memory use: 21.0MB (~267.0MB paged-in)
ltl formula name NeighborGrid-PT-d5n4m1t35-LTLCardinality-03
ltl formula formula --ltl=/tmp/2632/ltl_1_
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 1024 places, 196608 transitions and 393216 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 17.810 real 5.870 user 6.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2632/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2632/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2632/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2632/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 1025 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1025, there are 196632 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4), file permute.c, line 159: assertion "perm->nstored < K+TODO_MAX" failed
pnml2lts-mc( 0/ 4), file permute.c, line 159: assertion "perm->nstored < K+TODO_MAX" failed
pnml2lts-mc( 1/ 4), file permute.c, line 159: assertion "perm->nstored < K+TODO_MAX" failed
pnml2lts-mc( 2/ 4), file permute.c, line 159: assertion "perm->nstored < K+TODO_MAX" failed
ltl formula name NeighborGrid-PT-d5n4m1t35-LTLCardinality-04
ltl formula formula --ltl=/tmp/2632/ltl_2_
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 1024 places, 196608 transitions and 393216 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 18.320 real 5.870 user 6.320 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2632/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2632/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2632/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2632/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 1025 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1025, there are 196618 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4), file permute.c, line 159: assertion "perm->nstored < K+TODO_MAX" failed
double free or corruption (fasttop)
pnml2lts-mc( 3/ 4), file permute.c, line 159: assertion "perm->nstored < K+TODO_MAX" failed
double free or corruption (fasttop)
pnml2lts-mc( 2/ 4), file permute.c, line 159: assertion "perm->nstored < K+TODO_MAX" failed
double free or corruption (fasttop)
pnml2lts-mc( 0/ 4), file permute.c, line 159: assertion "perm->nstored < K+TODO_MAX" failed
double free or corruption (fasttop)
ltl formula name NeighborGrid-PT-d5n4m1t35-LTLCardinality-05
ltl formula formula --ltl=/tmp/2632/ltl_3_
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 1024 places, 196608 transitions and 393216 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 17.950 real 5.980 user 5.740 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2632/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2632/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2632/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2632/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1026 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1025, there are 196621 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4), file permute.c, line 159: assertion "perm->nstored < K+TODO_MAX" failed
double free or corruption (fasttop)
ltl formula name NeighborGrid-PT-d5n4m1t35-LTLCardinality-06
ltl formula formula --ltl=/tmp/2632/ltl_4_
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 1024 places, 196608 transitions and 393216 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 18.290 real 6.260 user 6.780 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2632/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2632/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2632/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2632/ltl_4_
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): There are 1026 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1025, there are 196614 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~4!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 172
pnml2lts-mc( 0/ 4): unique states count: 182
pnml2lts-mc( 0/ 4): unique transitions count: 1374528
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 185
pnml2lts-mc( 0/ 4): - cum. max stack depth: 13
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 185 states 1964356 transitions, fanout: 10618.141
pnml2lts-mc( 0/ 4): Total exploration time 4.870 sec (4.850 sec minimum, 4.865 sec on average)
pnml2lts-mc( 0/ 4): States per second: 38, Transitions per second: 403359
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 17.4MB, 13.3 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 4.0%/10.0%
pnml2lts-mc( 0/ 4): Stored 200643 string chucks using 2MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 11MB
pnml2lts-mc( 0/ 4): Est. total memory use: 28.4MB (~267.0MB paged-in)
ltl formula name NeighborGrid-PT-d5n4m1t35-LTLCardinality-13
ltl formula formula --ltl=/tmp/2632/ltl_5_
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 1024 places, 196608 transitions and 393216 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 18.050 real 6.240 user 6.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2632/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2632/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2632/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2632/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1026 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1025, there are 196613 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~6!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1003
pnml2lts-mc( 0/ 4): unique states count: 1018
pnml2lts-mc( 0/ 4): unique transitions count: 2354688
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 1021
pnml2lts-mc( 0/ 4): - cum. max stack depth: 18
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1021 states 2944516 transitions, fanout: 2883.953
pnml2lts-mc( 0/ 4): Total exploration time 17.380 sec (17.340 sec minimum, 17.355 sec on average)
pnml2lts-mc( 0/ 4): States per second: 59, Transitions per second: 169420
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 29.6MB, 13.2 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 7.0%/18.0%
pnml2lts-mc( 0/ 4): Stored 200643 string chucks using 2MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 11MB
pnml2lts-mc( 0/ 4): Est. total memory use: 40.6MB (~267.0MB paged-in)
ltl formula name NeighborGrid-PT-d5n4m1t35-LTLCardinality-15
ltl formula formula --ltl=/tmp/2632/ltl_6_
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 1024 places, 196608 transitions and 393216 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 17.850 real 5.890 user 6.120 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2632/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2632/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2632/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2632/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 1025 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1025, there are 196618 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4), file permute.c, line 159: assertion "perm->nstored < K+TODO_MAX" failed
pnml2lts-mc( 0/ 4), file permute.c, line 159: assertion "perm->nstored < K+TODO_MAX" failed
double free or corruption (fasttop)
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="NeighborGrid-PT-d5n4m1t35"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is NeighborGrid-PT-d5n4m1t35, 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 r508-tall-171654351600435"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NeighborGrid-PT-d5n4m1t35.tgz
mv NeighborGrid-PT-d5n4m1t35 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 ;