About the Execution of ITS-Tools for FireWire-PT-15
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1557.955 | 521435.00 | 609178.00 | 1228.90 | FTTTFTTFFFTTTTFF | 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.r550-tall-171734899000282.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 itstools
Input is FireWire-PT-15, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r550-tall-171734899000282
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 90K Jun 2 16:33 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 FireWire-PT-15-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-15-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717367670134
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-02 22:34:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 22:34:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:34:31] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-06-02 22:34:31] [INFO ] Transformed 248 places.
[2024-06-02 22:34:31] [INFO ] Transformed 383 transitions.
[2024-06-02 22:34:31] [INFO ] Found NUPN structural information;
[2024-06-02 22:34:31] [INFO ] Parsed PT model containing 248 places and 383 transitions and 1144 arcs in 172 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 88 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 383/383 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 243 transition count 383
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 50 place count 198 transition count 338
Iterating global reduction 1 with 45 rules applied. Total rules applied 95 place count 198 transition count 338
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 96 place count 198 transition count 337
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 102 place count 192 transition count 329
Iterating global reduction 2 with 6 rules applied. Total rules applied 108 place count 192 transition count 329
Applied a total of 108 rules in 45 ms. Remains 192 /248 variables (removed 56) and now considering 329/383 (removed 54) transitions.
// Phase 1: matrix 329 rows 192 cols
[2024-06-02 22:34:31] [INFO ] Computed 4 invariants in 28 ms
[2024-06-02 22:34:31] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-06-02 22:34:31] [INFO ] Invariant cache hit.
[2024-06-02 22:34:32] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-06-02 22:34:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-02 22:34:34] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 14 ms to minimize.
[2024-06-02 22:34:34] [INFO ] Deduced a trap composed of 111 places in 82 ms of which 2 ms to minimize.
[2024-06-02 22:34:34] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:34:35] [INFO ] Deduced a trap composed of 128 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:34:35] [INFO ] Deduced a trap composed of 107 places in 67 ms of which 2 ms to minimize.
[2024-06-02 22:34:35] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 2 ms to minimize.
[2024-06-02 22:34:35] [INFO ] Deduced a trap composed of 113 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:34:35] [INFO ] Deduced a trap composed of 129 places in 63 ms of which 2 ms to minimize.
[2024-06-02 22:34:35] [INFO ] Deduced a trap composed of 108 places in 61 ms of which 2 ms to minimize.
[2024-06-02 22:34:35] [INFO ] Deduced a trap composed of 106 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:34:35] [INFO ] Deduced a trap composed of 89 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:34:35] [INFO ] Deduced a trap composed of 108 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:34:35] [INFO ] Deduced a trap composed of 103 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:34:36] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:34:36] [INFO ] Deduced a trap composed of 75 places in 64 ms of which 2 ms to minimize.
[2024-06-02 22:34:36] [INFO ] Deduced a trap composed of 106 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:34:36] [INFO ] Deduced a trap composed of 92 places in 58 ms of which 2 ms to minimize.
[2024-06-02 22:34:36] [INFO ] Deduced a trap composed of 118 places in 60 ms of which 1 ms to minimize.
Problem TDEAD149 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD305 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 18/22 constraints. Problems are: Problem set: 18 solved, 310 unsolved
[2024-06-02 22:34:37] [INFO ] Deduced a trap composed of 109 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:34:37] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 2 ms to minimize.
[2024-06-02 22:34:37] [INFO ] Deduced a trap composed of 93 places in 76 ms of which 2 ms to minimize.
[2024-06-02 22:34:37] [INFO ] Deduced a trap composed of 99 places in 66 ms of which 2 ms to minimize.
[2024-06-02 22:34:38] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 5/27 constraints. Problems are: Problem set: 18 solved, 310 unsolved
[2024-06-02 22:34:40] [INFO ] Deduced a trap composed of 109 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 1/28 constraints. Problems are: Problem set: 18 solved, 310 unsolved
[2024-06-02 22:34:42] [INFO ] Deduced a trap composed of 103 places in 75 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 1/29 constraints. Problems are: Problem set: 18 solved, 310 unsolved
[2024-06-02 22:34:44] [INFO ] Deduced a trap composed of 93 places in 72 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 1/30 constraints. Problems are: Problem set: 18 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/30 constraints. Problems are: Problem set: 18 solved, 310 unsolved
At refinement iteration 8 (OVERLAPS) 329/521 variables, 192/222 constraints. Problems are: Problem set: 18 solved, 310 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 0/222 constraints. Problems are: Problem set: 18 solved, 310 unsolved
At refinement iteration 10 (OVERLAPS) 0/521 variables, 0/222 constraints. Problems are: Problem set: 18 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 521/521 variables, and 222 constraints, problems are : Problem set: 18 solved, 310 unsolved in 22829 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 18 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/192 variables, 4/4 constraints. Problems are: Problem set: 18 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 26/30 constraints. Problems are: Problem set: 18 solved, 310 unsolved
[2024-06-02 22:34:56] [INFO ] Deduced a trap composed of 114 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:34:56] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 2/32 constraints. Problems are: Problem set: 18 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/32 constraints. Problems are: Problem set: 18 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 329/521 variables, 192/224 constraints. Problems are: Problem set: 18 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/521 variables, 310/534 constraints. Problems are: Problem set: 18 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/521 variables, 0/534 constraints. Problems are: Problem set: 18 solved, 310 unsolved
At refinement iteration 8 (OVERLAPS) 0/521 variables, 0/534 constraints. Problems are: Problem set: 18 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Int declared 521/521 variables, and 534 constraints, problems are : Problem set: 18 solved, 310 unsolved in 27874 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 310/328 constraints, Known Traps: 28/28 constraints]
After SMT, in 50921ms problems are : Problem set: 18 solved, 310 unsolved
Search for dead transitions found 18 dead transitions in 50945ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 192/248 places, 311/383 transitions.
Applied a total of 0 rules in 8 ms. Remains 192 /192 variables (removed 0) and now considering 311/311 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51580 ms. Remains : 192/248 places, 311/383 transitions.
Support contains 88 out of 192 places after structural reductions.
[2024-06-02 22:35:23] [INFO ] Flatten gal took : 90 ms
[2024-06-02 22:35:23] [INFO ] Flatten gal took : 52 ms
[2024-06-02 22:35:23] [INFO ] Input system was already deterministic with 311 transitions.
RANDOM walk for 40000 steps (11 resets) in 2197 ms. (18 steps per ms) remains 67/73 properties
BEST_FIRST walk for 4000 steps (11 resets) in 55 ms. (71 steps per ms) remains 66/67 properties
BEST_FIRST walk for 4000 steps (11 resets) in 127 ms. (31 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (12 resets) in 47 ms. (83 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (9 resets) in 161 ms. (24 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (11 resets) in 64 ms. (61 steps per ms) remains 64/66 properties
BEST_FIRST walk for 4001 steps (12 resets) in 99 ms. (40 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (11 resets) in 52 ms. (75 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (10 resets) in 62 ms. (63 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (10 resets) in 33 ms. (117 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (11 resets) in 47 ms. (83 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (9 resets) in 65 ms. (60 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (12 resets) in 33 ms. (117 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (10 resets) in 31 ms. (125 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (10 resets) in 17 ms. (222 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (10 resets) in 18 ms. (210 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (13 resets) in 16 ms. (235 steps per ms) remains 63/64 properties
BEST_FIRST walk for 4000 steps (10 resets) in 29 ms. (133 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (9 resets) in 48 ms. (81 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (11 resets) in 16 ms. (235 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (9 resets) in 23 ms. (166 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (9 resets) in 38 ms. (102 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (10 resets) in 22 ms. (173 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (12 resets) in 19 ms. (200 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (8 resets) in 28 ms. (137 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (10 resets) in 18 ms. (210 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (9 resets) in 78 ms. (50 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (9 resets) in 18 ms. (210 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (11 resets) in 27 ms. (142 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (12 resets) in 82 ms. (48 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (11 resets) in 31 ms. (125 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (9 resets) in 25 ms. (153 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (9 resets) in 24 ms. (160 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (12 resets) in 22 ms. (173 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (9 resets) in 15 ms. (250 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (9 resets) in 28 ms. (137 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (11 resets) in 24 ms. (160 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (11 resets) in 41 ms. (95 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (8 resets) in 37 ms. (105 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (9 resets) in 17 ms. (222 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (10 resets) in 21 ms. (181 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (11 resets) in 10 ms. (364 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (12 resets) in 16 ms. (235 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (11 resets) in 20 ms. (190 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (8 resets) in 17 ms. (222 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (13 resets) in 17 ms. (222 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (10 resets) in 10 ms. (363 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (9 resets) in 13 ms. (285 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (11 resets) in 16 ms. (235 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (12 resets) in 15 ms. (250 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (10 resets) in 17 ms. (222 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (12 resets) in 15 ms. (250 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (12 resets) in 28 ms. (137 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (9 resets) in 35 ms. (111 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (11 resets) in 28 ms. (137 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4000 steps (10 resets) in 18 ms. (210 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (10 resets) in 18 ms. (210 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4001 steps (11 resets) in 18 ms. (210 steps per ms) remains 63/63 properties
// Phase 1: matrix 311 rows 192 cols
[2024-06-02 22:35:25] [INFO ] Computed 4 invariants in 19 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 1 (OVERLAPS) 103/181 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 58 unsolved
Problem AtomicPropp46 is UNSAT
At refinement iteration 3 (OVERLAPS) 302/483 variables, 181/185 constraints. Problems are: Problem set: 6 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 0/185 constraints. Problems are: Problem set: 6 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 15/498 variables, 8/193 constraints. Problems are: Problem set: 6 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/498 variables, 0/193 constraints. Problems are: Problem set: 6 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 5/503 variables, 3/196 constraints. Problems are: Problem set: 6 solved, 57 unsolved
[2024-06-02 22:35:27] [INFO ] Deduced a trap composed of 106 places in 105 ms of which 1 ms to minimize.
Problem AtomicPropp59 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 1/197 constraints. Problems are: Problem set: 7 solved, 56 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 0/197 constraints. Problems are: Problem set: 7 solved, 56 unsolved
At refinement iteration 10 (OVERLAPS) 0/503 variables, 0/197 constraints. Problems are: Problem set: 7 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 197 constraints, problems are : Problem set: 7 solved, 56 unsolved in 3398 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 7 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 56 unsolved
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp61 is UNSAT
At refinement iteration 1 (OVERLAPS) 113/180 variables, 4/4 constraints. Problems are: Problem set: 9 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 1/5 constraints. Problems are: Problem set: 9 solved, 54 unsolved
[2024-06-02 22:35:29] [INFO ] Deduced a trap composed of 101 places in 148 ms of which 20 ms to minimize.
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp11 is UNSAT
[2024-06-02 22:35:30] [INFO ] Deduced a trap composed of 103 places in 394 ms of which 2 ms to minimize.
[2024-06-02 22:35:30] [INFO ] Deduced a trap composed of 115 places in 88 ms of which 1 ms to minimize.
Problem AtomicPropp14 is UNSAT
[2024-06-02 22:35:30] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp19 is UNSAT
[2024-06-02 22:35:30] [INFO ] Deduced a trap composed of 107 places in 81 ms of which 15 ms to minimize.
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
[2024-06-02 22:35:30] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 6 ms to minimize.
[2024-06-02 22:35:31] [INFO ] Deduced a trap composed of 107 places in 407 ms of which 1 ms to minimize.
[2024-06-02 22:35:31] [INFO ] Deduced a trap composed of 110 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:35:31] [INFO ] Deduced a trap composed of 102 places in 69 ms of which 3 ms to minimize.
[2024-06-02 22:35:31] [INFO ] Deduced a trap composed of 108 places in 95 ms of which 1 ms to minimize.
[2024-06-02 22:35:31] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 3 ms to minimize.
[2024-06-02 22:35:31] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 1 ms to minimize.
[2024-06-02 22:35:31] [INFO ] Deduced a trap composed of 89 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:35:31] [INFO ] Deduced a trap composed of 103 places in 70 ms of which 1 ms to minimize.
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 14/19 constraints. Problems are: Problem set: 20 solved, 43 unsolved
[2024-06-02 22:35:31] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 1/20 constraints. Problems are: Problem set: 20 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/20 constraints. Problems are: Problem set: 20 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 301/481 variables, 180/200 constraints. Problems are: Problem set: 20 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 42/242 constraints. Problems are: Problem set: 20 solved, 43 unsolved
[2024-06-02 22:35:33] [INFO ] Deduced a trap composed of 100 places in 71 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/481 variables, 1/243 constraints. Problems are: Problem set: 20 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/481 variables, 0/243 constraints. Problems are: Problem set: 20 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 15/496 variables, 8/251 constraints. Problems are: Problem set: 20 solved, 43 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/503 variables, and 252 constraints, problems are : Problem set: 20 solved, 43 unsolved in 5037 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 188/192 constraints, PredecessorRefiner: 43/63 constraints, Known Traps: 17/17 constraints]
After SMT, in 8518ms problems are : Problem set: 20 solved, 43 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 311/311 transitions.
Graph (trivial) has 83 edges and 192 vertex of which 12 / 192 are part of one of the 3 SCC in 5 ms
Free SCC test removed 9 places
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 183 transition count 288
Reduce places removed 9 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 174 transition count 286
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 172 transition count 286
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 23 place count 172 transition count 277
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 41 place count 163 transition count 277
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 44 place count 160 transition count 273
Iterating global reduction 3 with 3 rules applied. Total rules applied 47 place count 160 transition count 273
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 77 place count 145 transition count 258
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 93 place count 137 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 137 transition count 292
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 97 place count 137 transition count 289
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 100 place count 134 transition count 289
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 105 place count 134 transition count 289
Applied a total of 105 rules in 117 ms. Remains 134 /192 variables (removed 58) and now considering 289/311 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 134/192 places, 289/311 transitions.
RANDOM walk for 40000 steps (2660 resets) in 605 ms. (66 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (87 resets) in 12 ms. (308 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (90 resets) in 12 ms. (308 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (96 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (92 resets) in 12 ms. (307 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (89 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (83 resets) in 26 ms. (148 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (90 resets) in 24 ms. (160 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (93 resets) in 32 ms. (121 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (80 resets) in 12 ms. (308 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (87 resets) in 13 ms. (285 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (80 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (86 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (83 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (90 resets) in 26 ms. (148 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (83 resets) in 13 ms. (285 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (94 resets) in 25 ms. (153 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (85 resets) in 13 ms. (286 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (97 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (85 resets) in 13 ms. (285 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (89 resets) in 13 ms. (285 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (84 resets) in 13 ms. (286 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (88 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (92 resets) in 13 ms. (285 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (86 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (87 resets) in 10 ms. (363 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (79 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (91 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (88 resets) in 10 ms. (363 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (91 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (92 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (89 resets) in 12 ms. (307 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (91 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (90 resets) in 13 ms. (285 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (74 resets) in 12 ms. (308 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (88 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (89 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (90 resets) in 13 ms. (285 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (93 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (91 resets) in 12 ms. (307 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (87 resets) in 10 ms. (363 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (88 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (86 resets) in 12 ms. (307 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (87 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
Finished probabilistic random walk after 89841 steps, run visited all 43 properties in 457 ms. (steps per millisecond=196 )
Probabilistic random walk after 89841 steps, saw 24130 distinct states, run finished after 461 ms. (steps per millisecond=194 ) properties seen :43
Successfully simplified 20 atomic propositions for a total of 16 simplifications.
[2024-06-02 22:35:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 22:35:35] [INFO ] Flatten gal took : 16 ms
FORMULA FireWire-PT-15-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 22:35:35] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:35:35] [INFO ] Input system was already deterministic with 311 transitions.
Support contains 50 out of 192 places (down from 62) after GAL structural reductions.
Computed a total of 48 stabilizing places and 70 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 192/192 places, 311/311 transitions.
Graph (trivial) has 142 edges and 192 vertex of which 9 / 192 are part of one of the 2 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 184 transition count 276
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 55 place count 158 transition count 274
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 157 transition count 273
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 156 transition count 273
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 58 place count 156 transition count 263
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 78 place count 146 transition count 263
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 88 place count 136 transition count 234
Iterating global reduction 4 with 10 rules applied. Total rules applied 98 place count 136 transition count 234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 100 place count 136 transition count 232
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 100 place count 136 transition count 230
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 104 place count 134 transition count 230
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 108 place count 130 transition count 225
Iterating global reduction 5 with 4 rules applied. Total rules applied 112 place count 130 transition count 225
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 114 place count 128 transition count 222
Iterating global reduction 5 with 2 rules applied. Total rules applied 116 place count 128 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 118 place count 128 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 119 place count 127 transition count 220
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 141 place count 116 transition count 209
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 144 place count 113 transition count 195
Iterating global reduction 7 with 3 rules applied. Total rules applied 147 place count 113 transition count 195
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 148 place count 112 transition count 192
Iterating global reduction 7 with 1 rules applied. Total rules applied 149 place count 112 transition count 192
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 150 place count 111 transition count 191
Iterating global reduction 7 with 1 rules applied. Total rules applied 151 place count 111 transition count 191
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 152 place count 110 transition count 188
Iterating global reduction 7 with 1 rules applied. Total rules applied 153 place count 110 transition count 188
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 154 place count 109 transition count 187
Iterating global reduction 7 with 1 rules applied. Total rules applied 155 place count 109 transition count 187
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 156 place count 108 transition count 184
Iterating global reduction 7 with 1 rules applied. Total rules applied 157 place count 108 transition count 184
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 158 place count 107 transition count 183
Iterating global reduction 7 with 1 rules applied. Total rules applied 159 place count 107 transition count 183
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 160 place count 106 transition count 180
Iterating global reduction 7 with 1 rules applied. Total rules applied 161 place count 106 transition count 180
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 162 place count 105 transition count 179
Iterating global reduction 7 with 1 rules applied. Total rules applied 163 place count 105 transition count 179
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 164 place count 104 transition count 176
Iterating global reduction 7 with 1 rules applied. Total rules applied 165 place count 104 transition count 176
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 166 place count 103 transition count 175
Iterating global reduction 7 with 1 rules applied. Total rules applied 167 place count 103 transition count 175
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 168 place count 102 transition count 173
Iterating global reduction 7 with 1 rules applied. Total rules applied 169 place count 102 transition count 173
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 170 place count 101 transition count 172
Applied a total of 170 rules in 76 ms. Remains 101 /192 variables (removed 91) and now considering 172/311 (removed 139) transitions.
[2024-06-02 22:35:35] [INFO ] Flow matrix only has 170 transitions (discarded 2 similar events)
// Phase 1: matrix 170 rows 101 cols
[2024-06-02 22:35:35] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:35:35] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-06-02 22:35:35] [INFO ] Flow matrix only has 170 transitions (discarded 2 similar events)
[2024-06-02 22:35:35] [INFO ] Invariant cache hit.
[2024-06-02 22:35:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:35:35] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2024-06-02 22:35:35] [INFO ] Redundant transitions in 5 ms returned []
Running 167 sub problems to find dead transitions.
[2024-06-02 22:35:35] [INFO ] Flow matrix only has 170 transitions (discarded 2 similar events)
[2024-06-02 22:35:35] [INFO ] Invariant cache hit.
[2024-06-02 22:35:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-06-02 22:35:36] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:35:36] [INFO ] Deduced a trap composed of 38 places in 106 ms of which 1 ms to minimize.
[2024-06-02 22:35:36] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 2 ms to minimize.
[2024-06-02 22:35:36] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 1 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD90 is UNSAT
[2024-06-02 22:35:37] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:35:37] [INFO ] Deduced a trap composed of 59 places in 48 ms of which 2 ms to minimize.
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD130 is UNSAT
[2024-06-02 22:35:37] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 7/11 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/11 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 169/269 variables, 100/111 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 1/112 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/112 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 1/270 variables, 1/113 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/113 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 0/270 variables, 0/113 constraints. Problems are: Problem set: 15 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/271 variables, and 113 constraints, problems are : Problem set: 15 solved, 152 unsolved in 4943 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 15 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 7/11 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/11 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 3 (OVERLAPS) 169/269 variables, 100/111 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 1/112 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 152/264 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/264 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 7 (OVERLAPS) 1/270 variables, 1/265 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/265 constraints. Problems are: Problem set: 15 solved, 152 unsolved
At refinement iteration 9 (OVERLAPS) 0/270 variables, 0/265 constraints. Problems are: Problem set: 15 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/271 variables, and 265 constraints, problems are : Problem set: 15 solved, 152 unsolved in 6239 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 101/101 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 152/167 constraints, Known Traps: 7/7 constraints]
After SMT, in 11220ms problems are : Problem set: 15 solved, 152 unsolved
Search for dead transitions found 15 dead transitions in 11222ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 101/192 places, 157/311 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 156
Applied a total of 2 rules in 7 ms. Remains 100 /101 variables (removed 1) and now considering 156/157 (removed 1) transitions.
[2024-06-02 22:35:46] [INFO ] Flow matrix only has 154 transitions (discarded 2 similar events)
// Phase 1: matrix 154 rows 100 cols
[2024-06-02 22:35:47] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:35:47] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 22:35:47] [INFO ] Flow matrix only has 154 transitions (discarded 2 similar events)
[2024-06-02 22:35:47] [INFO ] Invariant cache hit.
[2024-06-02 22:35:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:35:47] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 100/192 places, 156/311 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 11892 ms. Remains : 100/192 places, 156/311 transitions.
[2024-06-02 22:35:47] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:35:47] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:35:47] [INFO ] Input system was already deterministic with 156 transitions.
[2024-06-02 22:35:47] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:35:47] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:35:47] [INFO ] Time to serialize gal into /tmp/CTLFireability3821200199616904143.gal : 14 ms
[2024-06-02 22:35:47] [INFO ] Time to serialize properties into /tmp/CTLFireability2205293051211412327.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3821200199616904143.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2205293051211412327.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,88089,0.219857,12788,2,1939,5,32755,6,0,555,37229,0
Converting to forward existential form...Done !
original formula: AF((p21==1))
=> equivalent forward existential formula: [FwdG(Init,!((p21==1)))] = FALSE
Hit Full ! (commute/partial/dont) 153/0/3
(forward)formula 0,0,0.64143,24956,1,0,10,96787,20,4,2921,68668,8
FORMULA FireWire-PT-15-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 311/311 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 175 transition count 275
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 175 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 175 transition count 274
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 42 place count 168 transition count 255
Iterating global reduction 1 with 7 rules applied. Total rules applied 49 place count 168 transition count 255
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 165 transition count 249
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 165 transition count 249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 165 transition count 248
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 164 transition count 247
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 164 transition count 247
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 163 transition count 244
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 163 transition count 244
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 162 transition count 243
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 162 transition count 243
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 161 transition count 240
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 161 transition count 240
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 160 transition count 239
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 160 transition count 239
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 159 transition count 236
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 159 transition count 236
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 158 transition count 235
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 158 transition count 235
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 157 transition count 232
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 157 transition count 232
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 156 transition count 231
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 156 transition count 231
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 155 transition count 229
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 155 transition count 229
Applied a total of 76 rules in 28 ms. Remains 155 /192 variables (removed 37) and now considering 229/311 (removed 82) transitions.
// Phase 1: matrix 229 rows 155 cols
[2024-06-02 22:35:48] [INFO ] Computed 4 invariants in 16 ms
[2024-06-02 22:35:48] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-02 22:35:48] [INFO ] Invariant cache hit.
[2024-06-02 22:35:48] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Running 228 sub problems to find dead transitions.
[2024-06-02 22:35:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-06-02 22:35:50] [INFO ] Deduced a trap composed of 97 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:35:50] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 2 ms to minimize.
[2024-06-02 22:35:50] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:35:50] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 10 ms to minimize.
[2024-06-02 22:35:50] [INFO ] Deduced a trap composed of 80 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:35:50] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 2 ms to minimize.
[2024-06-02 22:35:50] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 1 ms to minimize.
[2024-06-02 22:35:50] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:35:50] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:35:50] [INFO ] Deduced a trap composed of 77 places in 48 ms of which 2 ms to minimize.
[2024-06-02 22:35:51] [INFO ] Deduced a trap composed of 92 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:35:51] [INFO ] Deduced a trap composed of 82 places in 49 ms of which 2 ms to minimize.
[2024-06-02 22:35:51] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:35:51] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:35:51] [INFO ] Deduced a trap composed of 79 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:35:51] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 1 ms to minimize.
[2024-06-02 22:35:51] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 1 ms to minimize.
Problem TDEAD128 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 17/21 constraints. Problems are: Problem set: 15 solved, 213 unsolved
[2024-06-02 22:35:52] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 5 ms to minimize.
[2024-06-02 22:35:52] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 2/23 constraints. Problems are: Problem set: 15 solved, 213 unsolved
[2024-06-02 22:35:54] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 1/24 constraints. Problems are: Problem set: 15 solved, 213 unsolved
[2024-06-02 22:35:54] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 1/25 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 0/25 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 229/384 variables, 155/180 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 0/180 constraints. Problems are: Problem set: 15 solved, 213 unsolved
[2024-06-02 22:35:59] [INFO ] Deduced a trap composed of 84 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/384 variables, 1/181 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 0/181 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 11 (OVERLAPS) 0/384 variables, 0/181 constraints. Problems are: Problem set: 15 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 181 constraints, problems are : Problem set: 15 solved, 213 unsolved in 13503 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 15 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 22/26 constraints. Problems are: Problem set: 15 solved, 213 unsolved
[2024-06-02 22:36:03] [INFO ] Deduced a trap composed of 79 places in 70 ms of which 2 ms to minimize.
[2024-06-02 22:36:03] [INFO ] Deduced a trap composed of 94 places in 69 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 2/28 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/28 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 229/384 variables, 155/183 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/384 variables, 213/396 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 0/396 constraints. Problems are: Problem set: 15 solved, 213 unsolved
At refinement iteration 8 (OVERLAPS) 0/384 variables, 0/396 constraints. Problems are: Problem set: 15 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 396 constraints, problems are : Problem set: 15 solved, 213 unsolved in 11507 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 213/228 constraints, Known Traps: 24/24 constraints]
After SMT, in 25101ms problems are : Problem set: 15 solved, 213 unsolved
Search for dead transitions found 15 dead transitions in 25105ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 155/192 places, 214/311 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 154 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 154 transition count 213
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 153 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 153 transition count 212
Applied a total of 4 rules in 10 ms. Remains 153 /155 variables (removed 2) and now considering 212/214 (removed 2) transitions.
// Phase 1: matrix 212 rows 153 cols
[2024-06-02 22:36:13] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:36:13] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 22:36:13] [INFO ] Invariant cache hit.
[2024-06-02 22:36:14] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 153/192 places, 212/311 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25892 ms. Remains : 153/192 places, 212/311 transitions.
[2024-06-02 22:36:14] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:36:14] [INFO ] Flatten gal took : 17 ms
[2024-06-02 22:36:14] [INFO ] Input system was already deterministic with 212 transitions.
[2024-06-02 22:36:14] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:36:14] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:36:14] [INFO ] Time to serialize gal into /tmp/CTLFireability16481962623266050336.gal : 5 ms
[2024-06-02 22:36:14] [INFO ] Time to serialize properties into /tmp/CTLFireability10221607431440124058.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16481962623266050336.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10221607431440124058.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,496504,1.1556,43432,2,5052,5,122517,6,0,825,178192,0
Converting to forward existential form...Done !
original formula: (EX(EX(EG(E((p16==1) U (p29==1))))) + (AF(EG(EX(TRUE))) * (A(((p82==1)||(p172!=1)) U AF((p122==1))) + EF((p119==1)))))
=> equivalent forward existential formula: ([FwdG((Init * !(EX(EX(EG(E((p16==1) U (p29==1))))))),!(EG(EX(TRUE))))] = FALSE * ([FwdG((FwdU(((Init * !(EX(EX(...403
Reverse transition relation is NOT exact ! Due to transitions t3, t35, t47, t48, t53, t57, t60, t64, t72, t81, t85, t86, t101, t104, t106, t114, t116, t118...305
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,29.4687,874816,1,0,885,6.27679e+06,484,494,5700,4.00903e+06,1055
FORMULA FireWire-PT-15-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 311/311 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 173 transition count 291
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 173 transition count 291
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 166 transition count 272
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 166 transition count 272
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 163 transition count 266
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 163 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 163 transition count 265
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 162 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 162 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 161 transition count 261
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 161 transition count 261
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 160 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 160 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 159 transition count 257
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 159 transition count 257
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 158 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 158 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 157 transition count 253
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 157 transition count 253
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 156 transition count 252
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 156 transition count 252
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 155 transition count 249
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 155 transition count 249
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 154 transition count 248
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 154 transition count 248
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 153 transition count 246
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 153 transition count 246
Applied a total of 79 rules in 24 ms. Remains 153 /192 variables (removed 39) and now considering 246/311 (removed 65) transitions.
// Phase 1: matrix 246 rows 153 cols
[2024-06-02 22:36:43] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:36:44] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 22:36:44] [INFO ] Invariant cache hit.
[2024-06-02 22:36:44] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 245 sub problems to find dead transitions.
[2024-06-02 22:36:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-06-02 22:36:45] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:36:45] [INFO ] Deduced a trap composed of 87 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:36:45] [INFO ] Deduced a trap composed of 87 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:36:45] [INFO ] Deduced a trap composed of 78 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:36:45] [INFO ] Deduced a trap composed of 85 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:36:45] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:36:46] [INFO ] Deduced a trap composed of 78 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:36:46] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:36:46] [INFO ] Deduced a trap composed of 87 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:36:46] [INFO ] Deduced a trap composed of 93 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:36:46] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 1 ms to minimize.
Problem TDEAD125 is UNSAT
[2024-06-02 22:36:46] [INFO ] Deduced a trap composed of 80 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:36:46] [INFO ] Deduced a trap composed of 92 places in 51 ms of which 1 ms to minimize.
Problem TDEAD144 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 13/17 constraints. Problems are: Problem set: 15 solved, 230 unsolved
[2024-06-02 22:36:47] [INFO ] Deduced a trap composed of 90 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:36:47] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:36:47] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 3/20 constraints. Problems are: Problem set: 15 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/20 constraints. Problems are: Problem set: 15 solved, 230 unsolved
At refinement iteration 5 (OVERLAPS) 246/399 variables, 153/173 constraints. Problems are: Problem set: 15 solved, 230 unsolved
[2024-06-02 22:36:51] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 1/174 constraints. Problems are: Problem set: 15 solved, 230 unsolved
[2024-06-02 22:36:52] [INFO ] Deduced a trap composed of 76 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:36:53] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 2/176 constraints. Problems are: Problem set: 15 solved, 230 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 0/176 constraints. Problems are: Problem set: 15 solved, 230 unsolved
At refinement iteration 9 (OVERLAPS) 0/399 variables, 0/176 constraints. Problems are: Problem set: 15 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 176 constraints, problems are : Problem set: 15 solved, 230 unsolved in 13388 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 15 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 230 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 19/23 constraints. Problems are: Problem set: 15 solved, 230 unsolved
[2024-06-02 22:36:58] [INFO ] Deduced a trap composed of 88 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/24 constraints. Problems are: Problem set: 15 solved, 230 unsolved
[2024-06-02 22:36:59] [INFO ] Deduced a trap composed of 85 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:36:59] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 2/26 constraints. Problems are: Problem set: 15 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/26 constraints. Problems are: Problem set: 15 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 246/399 variables, 153/179 constraints. Problems are: Problem set: 15 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 230/409 constraints. Problems are: Problem set: 15 solved, 230 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 0/409 constraints. Problems are: Problem set: 15 solved, 230 unsolved
At refinement iteration 9 (OVERLAPS) 0/399 variables, 0/409 constraints. Problems are: Problem set: 15 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 409 constraints, problems are : Problem set: 15 solved, 230 unsolved in 13513 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 230/245 constraints, Known Traps: 22/22 constraints]
After SMT, in 26961ms problems are : Problem set: 15 solved, 230 unsolved
Search for dead transitions found 15 dead transitions in 26963ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 153/192 places, 231/311 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 152 transition count 230
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 152 transition count 230
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 151 transition count 229
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 151 transition count 229
Applied a total of 4 rules in 4 ms. Remains 151 /153 variables (removed 2) and now considering 229/231 (removed 2) transitions.
// Phase 1: matrix 229 rows 151 cols
[2024-06-02 22:37:11] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:37:11] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 22:37:11] [INFO ] Invariant cache hit.
[2024-06-02 22:37:11] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 151/192 places, 229/311 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 27409 ms. Remains : 151/192 places, 229/311 transitions.
[2024-06-02 22:37:11] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:37:11] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:37:11] [INFO ] Input system was already deterministic with 229 transitions.
[2024-06-02 22:37:11] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:37:11] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:37:11] [INFO ] Time to serialize gal into /tmp/CTLFireability16530186023381392499.gal : 13 ms
[2024-06-02 22:37:11] [INFO ] Time to serialize properties into /tmp/CTLFireability5534802140901334321.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16530186023381392499.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5534802140901334321.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,510798,1.10801,44844,2,5127,5,123768,6,0,834,179164,0
Converting to forward existential form...Done !
original formula: EF(((AX((((p43==0)||(p246==0)) * EF(((p46==0)||(p181==0))))) * (p12==1)) * (p130==1)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (p130==1)) * (p12==1)) * !(EX(!((((p43==0)||(p246==0)) * E(TRUE U ((p46==0)||(p181==0)))))...168
Reverse transition relation is NOT exact ! Due to transitions t3, t35, t47, t51, t55, t58, t62, t70, t78, t82, t83, t99, t102, t104, t113, t115, t190, t213...299
(forward)formula 0,1,3.6603,106932,1,0,373,524971,481,209,5526,339957,474
FORMULA FireWire-PT-15-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 192/192 places, 311/311 transitions.
Graph (trivial) has 144 edges and 192 vertex of which 12 / 192 are part of one of the 3 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 182 transition count 274
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 55 place count 156 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 155 transition count 272
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 56 place count 155 transition count 262
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 76 place count 145 transition count 262
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 85 place count 136 transition count 234
Iterating global reduction 3 with 9 rules applied. Total rules applied 94 place count 136 transition count 234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 96 place count 136 transition count 232
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 96 place count 136 transition count 230
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 100 place count 134 transition count 230
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 103 place count 131 transition count 226
Iterating global reduction 4 with 3 rules applied. Total rules applied 106 place count 131 transition count 226
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 107 place count 130 transition count 225
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 130 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 110 place count 130 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 111 place count 129 transition count 223
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 133 place count 118 transition count 212
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 136 place count 115 transition count 198
Iterating global reduction 6 with 3 rules applied. Total rules applied 139 place count 115 transition count 198
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 140 place count 114 transition count 195
Iterating global reduction 6 with 1 rules applied. Total rules applied 141 place count 114 transition count 195
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 142 place count 113 transition count 194
Iterating global reduction 6 with 1 rules applied. Total rules applied 143 place count 113 transition count 194
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 144 place count 112 transition count 191
Iterating global reduction 6 with 1 rules applied. Total rules applied 145 place count 112 transition count 191
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 146 place count 111 transition count 190
Iterating global reduction 6 with 1 rules applied. Total rules applied 147 place count 111 transition count 190
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 148 place count 110 transition count 187
Iterating global reduction 6 with 1 rules applied. Total rules applied 149 place count 110 transition count 187
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 150 place count 109 transition count 186
Iterating global reduction 6 with 1 rules applied. Total rules applied 151 place count 109 transition count 186
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 152 place count 108 transition count 183
Iterating global reduction 6 with 1 rules applied. Total rules applied 153 place count 108 transition count 183
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 154 place count 107 transition count 182
Iterating global reduction 6 with 1 rules applied. Total rules applied 155 place count 107 transition count 182
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 156 place count 106 transition count 179
Iterating global reduction 6 with 1 rules applied. Total rules applied 157 place count 106 transition count 179
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 158 place count 105 transition count 178
Iterating global reduction 6 with 1 rules applied. Total rules applied 159 place count 105 transition count 178
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 160 place count 104 transition count 176
Iterating global reduction 6 with 1 rules applied. Total rules applied 161 place count 104 transition count 176
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 162 place count 103 transition count 175
Applied a total of 162 rules in 47 ms. Remains 103 /192 variables (removed 89) and now considering 175/311 (removed 136) transitions.
[2024-06-02 22:37:15] [INFO ] Flow matrix only has 172 transitions (discarded 3 similar events)
// Phase 1: matrix 172 rows 103 cols
[2024-06-02 22:37:15] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:37:15] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 22:37:15] [INFO ] Flow matrix only has 172 transitions (discarded 3 similar events)
[2024-06-02 22:37:15] [INFO ] Invariant cache hit.
[2024-06-02 22:37:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:37:15] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-06-02 22:37:15] [INFO ] Redundant transitions in 5 ms returned []
Running 170 sub problems to find dead transitions.
[2024-06-02 22:37:15] [INFO ] Flow matrix only has 172 transitions (discarded 3 similar events)
[2024-06-02 22:37:15] [INFO ] Invariant cache hit.
[2024-06-02 22:37:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-06-02 22:37:15] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:37:15] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2024-06-02 22:37:15] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-02 22:37:16] [INFO ] Deduced a trap composed of 61 places in 43 ms of which 0 ms to minimize.
[2024-06-02 22:37:16] [INFO ] Deduced a trap composed of 48 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:37:16] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:37:16] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 1 ms to minimize.
Problem TDEAD61 is UNSAT
[2024-06-02 22:37:16] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:37:16] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
Problem TDEAD73 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD93 is UNSAT
[2024-06-02 22:37:16] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 0 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD133 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 10/14 constraints. Problems are: Problem set: 15 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 171/273 variables, 102/116 constraints. Problems are: Problem set: 15 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 1/117 constraints. Problems are: Problem set: 15 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/117 constraints. Problems are: Problem set: 15 solved, 155 unsolved
At refinement iteration 6 (OVERLAPS) 1/274 variables, 1/118 constraints. Problems are: Problem set: 15 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/118 constraints. Problems are: Problem set: 15 solved, 155 unsolved
At refinement iteration 8 (OVERLAPS) 0/274 variables, 0/118 constraints. Problems are: Problem set: 15 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/275 variables, and 118 constraints, problems are : Problem set: 15 solved, 155 unsolved in 4888 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 15 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 155 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 10/14 constraints. Problems are: Problem set: 15 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 155 unsolved
At refinement iteration 3 (OVERLAPS) 171/273 variables, 102/116 constraints. Problems are: Problem set: 15 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 1/117 constraints. Problems are: Problem set: 15 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 155/272 constraints. Problems are: Problem set: 15 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/272 constraints. Problems are: Problem set: 15 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 1/274 variables, 1/273 constraints. Problems are: Problem set: 15 solved, 155 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/273 constraints. Problems are: Problem set: 15 solved, 155 unsolved
[2024-06-02 22:37:25] [INFO ] Deduced a trap composed of 66 places in 42 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/274 variables, 1/274 constraints. Problems are: Problem set: 15 solved, 155 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/274 constraints. Problems are: Problem set: 15 solved, 155 unsolved
At refinement iteration 11 (OVERLAPS) 0/274 variables, 0/274 constraints. Problems are: Problem set: 15 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/275 variables, and 274 constraints, problems are : Problem set: 15 solved, 155 unsolved in 9472 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 103/103 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 155/170 constraints, Known Traps: 11/11 constraints]
After SMT, in 14411ms problems are : Problem set: 15 solved, 155 unsolved
Search for dead transitions found 15 dead transitions in 14413ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 103/192 places, 160/311 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 102 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 102 transition count 159
Applied a total of 2 rules in 4 ms. Remains 102 /103 variables (removed 1) and now considering 159/160 (removed 1) transitions.
[2024-06-02 22:37:29] [INFO ] Flow matrix only has 156 transitions (discarded 3 similar events)
// Phase 1: matrix 156 rows 102 cols
[2024-06-02 22:37:29] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:37:29] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 22:37:29] [INFO ] Flow matrix only has 156 transitions (discarded 3 similar events)
[2024-06-02 22:37:29] [INFO ] Invariant cache hit.
[2024-06-02 22:37:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:37:29] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 102/192 places, 159/311 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 14818 ms. Remains : 102/192 places, 159/311 transitions.
[2024-06-02 22:37:29] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:37:29] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:37:30] [INFO ] Input system was already deterministic with 159 transitions.
[2024-06-02 22:37:30] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:37:30] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:37:30] [INFO ] Time to serialize gal into /tmp/CTLFireability5501747060655675087.gal : 2 ms
[2024-06-02 22:37:30] [INFO ] Time to serialize properties into /tmp/CTLFireability15340810341111776351.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5501747060655675087.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15340810341111776351.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,86539,0.228042,13144,2,2055,5,33261,6,0,565,38183,0
Converting to forward existential form...Done !
original formula: EF(EG((p215==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p215==1))] != FALSE
Hit Full ! (commute/partial/dont) 157/0/2
(forward)formula 0,1,0.446736,17956,1,0,8,73800,19,2,2968,38183,8
FORMULA FireWire-PT-15-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 192/192 places, 311/311 transitions.
Graph (trivial) has 132 edges and 192 vertex of which 12 / 192 are part of one of the 3 SCC in 1 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 182 transition count 277
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 159 transition count 275
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 158 transition count 275
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 50 place count 158 transition count 265
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 70 place count 148 transition count 265
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 80 place count 138 transition count 245
Iterating global reduction 3 with 10 rules applied. Total rules applied 90 place count 138 transition count 245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 91 place count 138 transition count 244
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 91 place count 138 transition count 242
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 95 place count 136 transition count 242
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 99 place count 132 transition count 237
Iterating global reduction 4 with 4 rules applied. Total rules applied 103 place count 132 transition count 237
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 105 place count 130 transition count 234
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 130 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 108 place count 130 transition count 233
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 128 place count 120 transition count 223
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 130 place count 118 transition count 219
Iterating global reduction 5 with 2 rules applied. Total rules applied 132 place count 118 transition count 219
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 133 place count 117 transition count 216
Iterating global reduction 5 with 1 rules applied. Total rules applied 134 place count 117 transition count 216
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 135 place count 116 transition count 215
Iterating global reduction 5 with 1 rules applied. Total rules applied 136 place count 116 transition count 215
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 137 place count 115 transition count 212
Iterating global reduction 5 with 1 rules applied. Total rules applied 138 place count 115 transition count 212
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 139 place count 114 transition count 211
Iterating global reduction 5 with 1 rules applied. Total rules applied 140 place count 114 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 141 place count 113 transition count 210
Applied a total of 141 rules in 26 ms. Remains 113 /192 variables (removed 79) and now considering 210/311 (removed 101) transitions.
[2024-06-02 22:37:30] [INFO ] Flow matrix only has 207 transitions (discarded 3 similar events)
// Phase 1: matrix 207 rows 113 cols
[2024-06-02 22:37:30] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:37:30] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 22:37:30] [INFO ] Flow matrix only has 207 transitions (discarded 3 similar events)
[2024-06-02 22:37:30] [INFO ] Invariant cache hit.
[2024-06-02 22:37:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:37:30] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2024-06-02 22:37:30] [INFO ] Redundant transitions in 1 ms returned []
Running 206 sub problems to find dead transitions.
[2024-06-02 22:37:30] [INFO ] Flow matrix only has 207 transitions (discarded 3 similar events)
[2024-06-02 22:37:30] [INFO ] Invariant cache hit.
[2024-06-02 22:37:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 1/112 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
[2024-06-02 22:37:31] [INFO ] Deduced a trap composed of 63 places in 46 ms of which 1 ms to minimize.
[2024-06-02 22:37:31] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:37:32] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:37:32] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:37:32] [INFO ] Deduced a trap composed of 62 places in 88 ms of which 1 ms to minimize.
[2024-06-02 22:37:32] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:37:32] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD70 is UNSAT
[2024-06-02 22:37:32] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:37:32] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
[2024-06-02 22:37:32] [INFO ] Deduced a trap composed of 69 places in 51 ms of which 1 ms to minimize.
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
[2024-06-02 22:37:32] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
[2024-06-02 22:37:33] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
Problem TDEAD179 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 12/16 constraints. Problems are: Problem set: 22 solved, 184 unsolved
[2024-06-02 22:37:33] [INFO ] Deduced a trap composed of 57 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/17 constraints. Problems are: Problem set: 22 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/17 constraints. Problems are: Problem set: 22 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 206/318 variables, 112/129 constraints. Problems are: Problem set: 22 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 1/130 constraints. Problems are: Problem set: 22 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/130 constraints. Problems are: Problem set: 22 solved, 184 unsolved
At refinement iteration 9 (OVERLAPS) 1/319 variables, 1/131 constraints. Problems are: Problem set: 22 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 0/131 constraints. Problems are: Problem set: 22 solved, 184 unsolved
At refinement iteration 11 (OVERLAPS) 0/319 variables, 0/131 constraints. Problems are: Problem set: 22 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/320 variables, and 131 constraints, problems are : Problem set: 22 solved, 184 unsolved in 7868 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 113/113 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 22 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 3/3 constraints. Problems are: Problem set: 22 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 2/5 constraints. Problems are: Problem set: 22 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 22 solved, 184 unsolved
At refinement iteration 3 (OVERLAPS) 1/112 variables, 1/6 constraints. Problems are: Problem set: 22 solved, 184 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 11/17 constraints. Problems are: Problem set: 22 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/17 constraints. Problems are: Problem set: 22 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 206/318 variables, 112/129 constraints. Problems are: Problem set: 22 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 1/130 constraints. Problems are: Problem set: 22 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 184/314 constraints. Problems are: Problem set: 22 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/318 variables, 0/314 constraints. Problems are: Problem set: 22 solved, 184 unsolved
At refinement iteration 10 (OVERLAPS) 1/319 variables, 1/315 constraints. Problems are: Problem set: 22 solved, 184 unsolved
[2024-06-02 22:37:43] [INFO ] Deduced a trap composed of 68 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 1/316 constraints. Problems are: Problem set: 22 solved, 184 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 0/316 constraints. Problems are: Problem set: 22 solved, 184 unsolved
At refinement iteration 13 (OVERLAPS) 0/319 variables, 0/316 constraints. Problems are: Problem set: 22 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/320 variables, and 316 constraints, problems are : Problem set: 22 solved, 184 unsolved in 11695 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 113/113 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 184/206 constraints, Known Traps: 14/14 constraints]
After SMT, in 19623ms problems are : Problem set: 22 solved, 184 unsolved
Search for dead transitions found 22 dead transitions in 19625ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 113/192 places, 188/311 transitions.
Applied a total of 0 rules in 12 ms. Remains 113 /113 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-06-02 22:37:50] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 19909 ms. Remains : 113/192 places, 188/311 transitions.
[2024-06-02 22:37:50] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:37:50] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:37:50] [INFO ] Input system was already deterministic with 188 transitions.
[2024-06-02 22:37:50] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:37:50] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:37:50] [INFO ] Time to serialize gal into /tmp/CTLFireability10371183142193396672.gal : 1 ms
[2024-06-02 22:37:50] [INFO ] Time to serialize properties into /tmp/CTLFireability15325305661480511277.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10371183142193396672.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15325305661480511277.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,100978,0.277012,15220,2,2135,5,33078,6,0,638,44703,0
Converting to forward existential form...Done !
original formula: AF(AG((AF(((p36!=1)||(p246!=1))) * (AG((((p12==1)&&(p232==1))||(p166==1))) + EF(((p46==1)&&(p219==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((!(EG(!(((p36!=1)||(p246!=1))))) * (!(E(TRUE U !((((p12==1)&&(p232==1))||(p166==1)))))...205
Reverse transition relation is NOT exact ! Due to transitions t23, t26, t30, t32, t34, t35, t41, t43, t49, t50, t57, t58, t105, t113, t123, t124, t133, t13...282
(forward)formula 0,0,3.0502,103496,1,0,409,577507,405,218,4860,343887,517
FORMULA FireWire-PT-15-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 311/311 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 173 transition count 282
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 173 transition count 282
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 166 transition count 263
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 166 transition count 263
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 164 transition count 258
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 164 transition count 258
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 163 transition count 257
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 163 transition count 257
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 162 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 162 transition count 254
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 161 transition count 253
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 161 transition count 253
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 160 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 160 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 159 transition count 249
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 159 transition count 249
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 158 transition count 246
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 158 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 157 transition count 245
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 157 transition count 245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 156 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 156 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 155 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 155 transition count 241
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 154 transition count 239
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 154 transition count 239
Applied a total of 76 rules in 18 ms. Remains 154 /192 variables (removed 38) and now considering 239/311 (removed 72) transitions.
// Phase 1: matrix 239 rows 154 cols
[2024-06-02 22:37:53] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:37:53] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 22:37:53] [INFO ] Invariant cache hit.
[2024-06-02 22:37:53] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2024-06-02 22:37:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 238 unsolved
[2024-06-02 22:37:55] [INFO ] Deduced a trap composed of 91 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:37:55] [INFO ] Deduced a trap composed of 83 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:37:55] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:37:55] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:37:55] [INFO ] Deduced a trap composed of 86 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:37:55] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:37:55] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:37:55] [INFO ] Deduced a trap composed of 79 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:37:56] [INFO ] Deduced a trap composed of 71 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:37:56] [INFO ] Deduced a trap composed of 91 places in 58 ms of which 1 ms to minimize.
Problem TDEAD127 is UNSAT
[2024-06-02 22:37:56] [INFO ] Deduced a trap composed of 82 places in 58 ms of which 1 ms to minimize.
Problem TDEAD143 is UNSAT
[2024-06-02 22:37:56] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:37:56] [INFO ] Deduced a trap composed of 84 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:37:56] [INFO ] Deduced a trap composed of 78 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:37:56] [INFO ] Deduced a trap composed of 76 places in 51 ms of which 1 ms to minimize.
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 15/19 constraints. Problems are: Problem set: 15 solved, 223 unsolved
[2024-06-02 22:37:56] [INFO ] Deduced a trap composed of 87 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:37:57] [INFO ] Deduced a trap composed of 86 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:37:57] [INFO ] Deduced a trap composed of 84 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:37:57] [INFO ] Deduced a trap composed of 76 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:37:57] [INFO ] Deduced a trap composed of 78 places in 64 ms of which 2 ms to minimize.
[2024-06-02 22:37:57] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 6/25 constraints. Problems are: Problem set: 15 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/25 constraints. Problems are: Problem set: 15 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 239/393 variables, 154/179 constraints. Problems are: Problem set: 15 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 0/179 constraints. Problems are: Problem set: 15 solved, 223 unsolved
[2024-06-02 22:38:02] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:38:02] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/393 variables, 2/181 constraints. Problems are: Problem set: 15 solved, 223 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 0/181 constraints. Problems are: Problem set: 15 solved, 223 unsolved
At refinement iteration 9 (OVERLAPS) 0/393 variables, 0/181 constraints. Problems are: Problem set: 15 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 181 constraints, problems are : Problem set: 15 solved, 223 unsolved in 13121 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 15 solved, 223 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 223 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 223 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 23/27 constraints. Problems are: Problem set: 15 solved, 223 unsolved
[2024-06-02 22:38:07] [INFO ] Deduced a trap composed of 102 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/28 constraints. Problems are: Problem set: 15 solved, 223 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/28 constraints. Problems are: Problem set: 15 solved, 223 unsolved
At refinement iteration 5 (OVERLAPS) 239/393 variables, 154/182 constraints. Problems are: Problem set: 15 solved, 223 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 223/405 constraints. Problems are: Problem set: 15 solved, 223 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 0/405 constraints. Problems are: Problem set: 15 solved, 223 unsolved
At refinement iteration 8 (OVERLAPS) 0/393 variables, 0/405 constraints. Problems are: Problem set: 15 solved, 223 unsolved
No progress, stopping.
After SMT solving in domain Int declared 393/393 variables, and 405 constraints, problems are : Problem set: 15 solved, 223 unsolved in 12350 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 223/238 constraints, Known Traps: 24/24 constraints]
After SMT, in 25521ms problems are : Problem set: 15 solved, 223 unsolved
Search for dead transitions found 15 dead transitions in 25524ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 154/192 places, 224/311 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 223
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 223
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 152 transition count 222
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 152 transition count 222
Applied a total of 4 rules in 4 ms. Remains 152 /154 variables (removed 2) and now considering 222/224 (removed 2) transitions.
// Phase 1: matrix 222 rows 152 cols
[2024-06-02 22:38:19] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:38:19] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 22:38:19] [INFO ] Invariant cache hit.
[2024-06-02 22:38:19] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 152/192 places, 222/311 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25928 ms. Remains : 152/192 places, 222/311 transitions.
[2024-06-02 22:38:19] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:38:19] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:38:19] [INFO ] Input system was already deterministic with 222 transitions.
[2024-06-02 22:38:19] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:38:19] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:38:19] [INFO ] Time to serialize gal into /tmp/CTLFireability10493640698851695124.gal : 2 ms
[2024-06-02 22:38:19] [INFO ] Time to serialize properties into /tmp/CTLFireability15456608174732261270.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10493640698851695124.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15456608174732261270.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,519714,1.18316,45460,2,5119,5,125972,6,0,831,181805,0
Converting to forward existential form...Done !
original formula: EF(((!(E(((((p155!=1)&&(p98==1))&&(p165==1))||(((p246==1)&&(p41==1))&&(p181==1))) U !(EX((p182==1))))) + (p167==1)) + (p17==1)))
=> equivalent forward existential formula: (([(FwdU(Init,TRUE) * !(E(((((p155!=1)&&(p98==1))&&(p165==1))||(((p246==1)&&(p41==1))&&(p181==1))) U !(EX((p182=...260
Reverse transition relation is NOT exact ! Due to transitions t3, t36, t48, t52, t56, t59, t63, t71, t79, t83, t84, t100, t103, t105, t115, t117, t182, t20...300
(forward)formula 0,1,3.11443,84928,1,0,363,356701,463,199,5248,287925,458
FORMULA FireWire-PT-15-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 192/192 places, 311/311 transitions.
Graph (trivial) has 136 edges and 192 vertex of which 12 / 192 are part of one of the 3 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 182 transition count 276
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 158 transition count 274
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 157 transition count 274
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 52 place count 157 transition count 264
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 72 place count 147 transition count 264
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 82 place count 137 transition count 244
Iterating global reduction 3 with 10 rules applied. Total rules applied 92 place count 137 transition count 244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 93 place count 137 transition count 243
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 93 place count 137 transition count 241
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 97 place count 135 transition count 241
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 101 place count 131 transition count 236
Iterating global reduction 4 with 4 rules applied. Total rules applied 105 place count 131 transition count 236
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 107 place count 129 transition count 233
Iterating global reduction 4 with 2 rules applied. Total rules applied 109 place count 129 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 111 place count 129 transition count 231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 112 place count 128 transition count 231
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 132 place count 118 transition count 221
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 134 place count 116 transition count 217
Iterating global reduction 6 with 2 rules applied. Total rules applied 136 place count 116 transition count 217
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 137 place count 115 transition count 216
Applied a total of 137 rules in 25 ms. Remains 115 /192 variables (removed 77) and now considering 216/311 (removed 95) transitions.
[2024-06-02 22:38:22] [INFO ] Flow matrix only has 213 transitions (discarded 3 similar events)
// Phase 1: matrix 213 rows 115 cols
[2024-06-02 22:38:22] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:38:22] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 22:38:22] [INFO ] Flow matrix only has 213 transitions (discarded 3 similar events)
[2024-06-02 22:38:22] [INFO ] Invariant cache hit.
[2024-06-02 22:38:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:38:22] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-06-02 22:38:22] [INFO ] Redundant transitions in 1 ms returned []
Running 212 sub problems to find dead transitions.
[2024-06-02 22:38:22] [INFO ] Flow matrix only has 213 transitions (discarded 3 similar events)
[2024-06-02 22:38:22] [INFO ] Invariant cache hit.
[2024-06-02 22:38:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (OVERLAPS) 1/114 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-02 22:38:24] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 1 ms to minimize.
[2024-06-02 22:38:24] [INFO ] Deduced a trap composed of 56 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:38:24] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 1 ms to minimize.
[2024-06-02 22:38:24] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
[2024-06-02 22:38:24] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:38:24] [INFO ] Deduced a trap composed of 76 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:38:24] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
Problem TDEAD86 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
[2024-06-02 22:38:24] [INFO ] Deduced a trap composed of 69 places in 48 ms of which 0 ms to minimize.
[2024-06-02 22:38:24] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
[2024-06-02 22:38:25] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:38:25] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:38:25] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
Problem TDEAD185 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 12/16 constraints. Problems are: Problem set: 26 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/16 constraints. Problems are: Problem set: 26 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 212/326 variables, 114/130 constraints. Problems are: Problem set: 26 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 1/131 constraints. Problems are: Problem set: 26 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 0/131 constraints. Problems are: Problem set: 26 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 1/327 variables, 1/132 constraints. Problems are: Problem set: 26 solved, 186 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/327 variables, 0/132 constraints. Problems are: Problem set: 26 solved, 186 unsolved
At refinement iteration 10 (OVERLAPS) 0/327 variables, 0/132 constraints. Problems are: Problem set: 26 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 327/328 variables, and 132 constraints, problems are : Problem set: 26 solved, 186 unsolved in 7312 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 115/115 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 26 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 3/3 constraints. Problems are: Problem set: 26 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 2/5 constraints. Problems are: Problem set: 26 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 26 solved, 186 unsolved
At refinement iteration 3 (OVERLAPS) 1/114 variables, 1/6 constraints. Problems are: Problem set: 26 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 10/16 constraints. Problems are: Problem set: 26 solved, 186 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/16 constraints. Problems are: Problem set: 26 solved, 186 unsolved
At refinement iteration 6 (OVERLAPS) 212/326 variables, 114/130 constraints. Problems are: Problem set: 26 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/326 variables, 1/131 constraints. Problems are: Problem set: 26 solved, 186 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 186/317 constraints. Problems are: Problem set: 26 solved, 186 unsolved
[2024-06-02 22:38:32] [INFO ] Deduced a trap composed of 66 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/326 variables, 1/318 constraints. Problems are: Problem set: 26 solved, 186 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 0/318 constraints. Problems are: Problem set: 26 solved, 186 unsolved
At refinement iteration 11 (OVERLAPS) 1/327 variables, 1/319 constraints. Problems are: Problem set: 26 solved, 186 unsolved
[2024-06-02 22:38:37] [INFO ] Deduced a trap composed of 68 places in 56 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/327 variables, 1/320 constraints. Problems are: Problem set: 26 solved, 186 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/327 variables, 0/320 constraints. Problems are: Problem set: 26 solved, 186 unsolved
At refinement iteration 14 (OVERLAPS) 0/327 variables, 0/320 constraints. Problems are: Problem set: 26 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 327/328 variables, and 320 constraints, problems are : Problem set: 26 solved, 186 unsolved in 14946 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 115/115 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 186/212 constraints, Known Traps: 14/14 constraints]
After SMT, in 22314ms problems are : Problem set: 26 solved, 186 unsolved
Search for dead transitions found 26 dead transitions in 22322ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 115/192 places, 190/311 transitions.
Applied a total of 0 rules in 4 ms. Remains 115 /115 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2024-06-02 22:38:45] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 22590 ms. Remains : 115/192 places, 190/311 transitions.
[2024-06-02 22:38:45] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:38:45] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:38:45] [INFO ] Input system was already deterministic with 190 transitions.
[2024-06-02 22:38:45] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:38:45] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:38:45] [INFO ] Time to serialize gal into /tmp/CTLFireability10524201213697433256.gal : 2 ms
[2024-06-02 22:38:45] [INFO ] Time to serialize properties into /tmp/CTLFireability4876831465920649024.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10524201213697433256.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4876831465920649024.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,97250,0.407178,18160,2,2249,5,41836,6,0,648,59994,0
Converting to forward existential form...Done !
original formula: E(EF(!((AG(((p36==1)&&(p170==1))) + !(((p51==1)&&(p228==1)))))) U ((p46==1)&&(p246==1)))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U !((!(E(TRUE U !(((p36==1)&&(p170==1))))) + !(((p51==1)&&(p228==1))))))) * ((p46==1)&&(p246=...170
Reverse transition relation is NOT exact ! Due to transitions t22, t25, t28, t30, t32, t33, t39, t41, t47, t48, t55, t56, t107, t119, t125, t126, t134, t13...282
(forward)formula 0,1,5.62338,181764,1,0,646,897952,405,470,4691,965933,877
FORMULA FireWire-PT-15-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 192/192 places, 311/311 transitions.
Graph (trivial) has 137 edges and 192 vertex of which 12 / 192 are part of one of the 3 SCC in 1 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 182 transition count 279
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 45 place count 161 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 160 transition count 277
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 46 place count 160 transition count 267
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 66 place count 150 transition count 267
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 75 place count 141 transition count 257
Iterating global reduction 3 with 9 rules applied. Total rules applied 84 place count 141 transition count 257
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 84 place count 141 transition count 255
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 139 transition count 255
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 93 place count 134 transition count 248
Iterating global reduction 3 with 5 rules applied. Total rules applied 98 place count 134 transition count 248
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 101 place count 131 transition count 242
Iterating global reduction 3 with 3 rules applied. Total rules applied 104 place count 131 transition count 242
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 106 place count 131 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 107 place count 130 transition count 240
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 108 place count 129 transition count 239
Iterating global reduction 5 with 1 rules applied. Total rules applied 109 place count 129 transition count 239
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 110 place count 128 transition count 236
Iterating global reduction 5 with 1 rules applied. Total rules applied 111 place count 128 transition count 236
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 112 place count 127 transition count 235
Iterating global reduction 5 with 1 rules applied. Total rules applied 113 place count 127 transition count 235
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 114 place count 126 transition count 232
Iterating global reduction 5 with 1 rules applied. Total rules applied 115 place count 126 transition count 232
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 116 place count 125 transition count 231
Iterating global reduction 5 with 1 rules applied. Total rules applied 117 place count 125 transition count 231
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 118 place count 124 transition count 228
Iterating global reduction 5 with 1 rules applied. Total rules applied 119 place count 124 transition count 228
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 120 place count 123 transition count 227
Iterating global reduction 5 with 1 rules applied. Total rules applied 121 place count 123 transition count 227
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 122 place count 122 transition count 224
Iterating global reduction 5 with 1 rules applied. Total rules applied 123 place count 122 transition count 224
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 124 place count 121 transition count 223
Iterating global reduction 5 with 1 rules applied. Total rules applied 125 place count 121 transition count 223
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 126 place count 120 transition count 221
Iterating global reduction 5 with 1 rules applied. Total rules applied 127 place count 120 transition count 221
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 147 place count 110 transition count 211
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 149 place count 108 transition count 199
Iterating global reduction 5 with 2 rules applied. Total rules applied 151 place count 108 transition count 199
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 152 place count 107 transition count 198
Applied a total of 152 rules in 63 ms. Remains 107 /192 variables (removed 85) and now considering 198/311 (removed 113) transitions.
[2024-06-02 22:38:51] [INFO ] Flow matrix only has 195 transitions (discarded 3 similar events)
// Phase 1: matrix 195 rows 107 cols
[2024-06-02 22:38:51] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:38:51] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 22:38:51] [INFO ] Flow matrix only has 195 transitions (discarded 3 similar events)
[2024-06-02 22:38:51] [INFO ] Invariant cache hit.
[2024-06-02 22:38:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:38:51] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-06-02 22:38:51] [INFO ] Redundant transitions in 0 ms returned []
Running 193 sub problems to find dead transitions.
[2024-06-02 22:38:51] [INFO ] Flow matrix only has 195 transitions (discarded 3 similar events)
[2024-06-02 22:38:51] [INFO ] Invariant cache hit.
[2024-06-02 22:38:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 193 unsolved
[2024-06-02 22:38:52] [INFO ] Deduced a trap composed of 61 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:38:52] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:38:52] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 0 ms to minimize.
[2024-06-02 22:38:52] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:38:52] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 2 ms to minimize.
Problem TDEAD72 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD116 is UNSAT
[2024-06-02 22:38:52] [INFO ] Deduced a trap composed of 64 places in 54 ms of which 1 ms to minimize.
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
[2024-06-02 22:38:52] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
Problem TDEAD157 is UNSAT
[2024-06-02 22:38:52] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 178 unsolved
At refinement iteration 3 (OVERLAPS) 194/300 variables, 106/118 constraints. Problems are: Problem set: 15 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 1/119 constraints. Problems are: Problem set: 15 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/119 constraints. Problems are: Problem set: 15 solved, 178 unsolved
At refinement iteration 6 (OVERLAPS) 1/301 variables, 1/120 constraints. Problems are: Problem set: 15 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/120 constraints. Problems are: Problem set: 15 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 0/301 variables, 0/120 constraints. Problems are: Problem set: 15 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/302 variables, and 120 constraints, problems are : Problem set: 15 solved, 178 unsolved in 5835 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 193/193 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 15 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 8/12 constraints. Problems are: Problem set: 15 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/12 constraints. Problems are: Problem set: 15 solved, 178 unsolved
At refinement iteration 3 (OVERLAPS) 194/300 variables, 106/118 constraints. Problems are: Problem set: 15 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 1/119 constraints. Problems are: Problem set: 15 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 178/297 constraints. Problems are: Problem set: 15 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/297 constraints. Problems are: Problem set: 15 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 1/301 variables, 1/298 constraints. Problems are: Problem set: 15 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/298 constraints. Problems are: Problem set: 15 solved, 178 unsolved
At refinement iteration 9 (OVERLAPS) 0/301 variables, 0/298 constraints. Problems are: Problem set: 15 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/302 variables, and 298 constraints, problems are : Problem set: 15 solved, 178 unsolved in 7780 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 178/193 constraints, Known Traps: 8/8 constraints]
After SMT, in 13654ms problems are : Problem set: 15 solved, 178 unsolved
Search for dead transitions found 15 dead transitions in 13656ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 107/192 places, 183/311 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 106 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 106 transition count 182
Applied a total of 2 rules in 12 ms. Remains 106 /107 variables (removed 1) and now considering 182/183 (removed 1) transitions.
[2024-06-02 22:39:04] [INFO ] Flow matrix only has 179 transitions (discarded 3 similar events)
// Phase 1: matrix 179 rows 106 cols
[2024-06-02 22:39:04] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:39:05] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 22:39:05] [INFO ] Flow matrix only has 179 transitions (discarded 3 similar events)
[2024-06-02 22:39:05] [INFO ] Invariant cache hit.
[2024-06-02 22:39:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:39:05] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 106/192 places, 182/311 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 14119 ms. Remains : 106/192 places, 182/311 transitions.
[2024-06-02 22:39:05] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:39:05] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:39:05] [INFO ] Input system was already deterministic with 182 transitions.
[2024-06-02 22:39:05] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:39:05] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:39:05] [INFO ] Time to serialize gal into /tmp/CTLFireability11764538040235428578.gal : 2 ms
[2024-06-02 22:39:05] [INFO ] Time to serialize properties into /tmp/CTLFireability4169886633893579328.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11764538040235428578.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4169886633893579328.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,105819,0.265053,14648,2,1983,5,34601,6,0,604,40143,0
Converting to forward existential form...Done !
original formula: A(((p41==1)&&(p223==1)) U AG(!(((EF((((p41==1)&&(p173==1))||(p10==1))) * (p43==1)) * (p203==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!(((E(TRUE U (((p41==1)&&(p173==1))||(p10==1))) * (p43==1)) * (p203==1)))))))))) *...389
Reverse transition relation is NOT exact ! Due to transitions t24, t31, t33, t39, t41, t49, t50, t58, t59, t122, t126, t135, t139, t165, t166, t168, t170, ...279
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,4.47052,138628,1,0,482,875248,393,264,4542,510249,600
FORMULA FireWire-PT-15-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 311/311 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 176 transition count 294
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 176 transition count 294
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 171 transition count 278
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 171 transition count 278
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 170 transition count 276
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 170 transition count 276
Applied a total of 44 rules in 12 ms. Remains 170 /192 variables (removed 22) and now considering 276/311 (removed 35) transitions.
// Phase 1: matrix 276 rows 170 cols
[2024-06-02 22:39:09] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:39:09] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 22:39:09] [INFO ] Invariant cache hit.
[2024-06-02 22:39:09] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 275 sub problems to find dead transitions.
[2024-06-02 22:39:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 275 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 275 unsolved
[2024-06-02 22:39:11] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:39:11] [INFO ] Deduced a trap composed of 92 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:39:11] [INFO ] Deduced a trap composed of 104 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:39:11] [INFO ] Deduced a trap composed of 83 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:39:11] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:39:11] [INFO ] Deduced a trap composed of 90 places in 65 ms of which 1 ms to minimize.
[2024-06-02 22:39:12] [INFO ] Deduced a trap composed of 92 places in 74 ms of which 2 ms to minimize.
[2024-06-02 22:39:12] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:39:12] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:39:12] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
Problem TDEAD131 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 10/14 constraints. Problems are: Problem set: 26 solved, 249 unsolved
[2024-06-02 22:39:13] [INFO ] Deduced a trap composed of 96 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:39:13] [INFO ] Deduced a trap composed of 94 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:39:13] [INFO ] Deduced a trap composed of 115 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:39:13] [INFO ] Deduced a trap composed of 103 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 4/18 constraints. Problems are: Problem set: 26 solved, 249 unsolved
[2024-06-02 22:39:15] [INFO ] Deduced a trap composed of 100 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 1/19 constraints. Problems are: Problem set: 26 solved, 249 unsolved
[2024-06-02 22:39:16] [INFO ] Deduced a trap composed of 92 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:39:17] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 2/21 constraints. Problems are: Problem set: 26 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/21 constraints. Problems are: Problem set: 26 solved, 249 unsolved
At refinement iteration 7 (OVERLAPS) 276/446 variables, 170/191 constraints. Problems are: Problem set: 26 solved, 249 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 0/191 constraints. Problems are: Problem set: 26 solved, 249 unsolved
At refinement iteration 9 (OVERLAPS) 0/446 variables, 0/191 constraints. Problems are: Problem set: 26 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 191 constraints, problems are : Problem set: 26 solved, 249 unsolved in 14262 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 275/275 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 26 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 26 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 4/4 constraints. Problems are: Problem set: 26 solved, 249 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 17/21 constraints. Problems are: Problem set: 26 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/21 constraints. Problems are: Problem set: 26 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 276/446 variables, 170/191 constraints. Problems are: Problem set: 26 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 249/440 constraints. Problems are: Problem set: 26 solved, 249 unsolved
[2024-06-02 22:39:28] [INFO ] Deduced a trap composed of 96 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 1/441 constraints. Problems are: Problem set: 26 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 0/441 constraints. Problems are: Problem set: 26 solved, 249 unsolved
At refinement iteration 8 (OVERLAPS) 0/446 variables, 0/441 constraints. Problems are: Problem set: 26 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Int declared 446/446 variables, and 441 constraints, problems are : Problem set: 26 solved, 249 unsolved in 20821 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 249/275 constraints, Known Traps: 18/18 constraints]
After SMT, in 35132ms problems are : Problem set: 26 solved, 249 unsolved
Search for dead transitions found 26 dead transitions in 35134ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 170/192 places, 250/311 transitions.
Applied a total of 0 rules in 8 ms. Remains 170 /170 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35371 ms. Remains : 170/192 places, 250/311 transitions.
[2024-06-02 22:39:45] [INFO ] Flatten gal took : 8 ms
[2024-06-02 22:39:45] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:39:45] [INFO ] Input system was already deterministic with 250 transitions.
[2024-06-02 22:39:45] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:39:45] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:39:45] [INFO ] Time to serialize gal into /tmp/CTLFireability6816050164194739923.gal : 2 ms
[2024-06-02 22:39:45] [INFO ] Time to serialize properties into /tmp/CTLFireability2439121772132503185.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6816050164194739923.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2439121772132503185.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,552422,1.55666,50444,2,5945,5,144384,6,0,931,197238,0
Converting to forward existential form...Done !
original formula: E(!((!((!(EX(((p41==1)&&(p219==1)))) + !(((p43==1)&&(p246==1))))) + ((EG((p163==1)) * AX((p169==1))) * (p131==1)))) U (EF(EX((((p25==1)&&...216
=> equivalent forward existential formula: [((FwdU(Init,!((!((!(EX(((p41==1)&&(p219==1)))) + !(((p43==1)&&(p246==1))))) + ((EG((p163==1)) * !(EX(!((p169==1...298
Reverse transition relation is NOT exact ! Due to transitions t3, t39, t41, t45, t47, t53, t57, t61, t64, t68, t76, t84, t88, t89, t105, t109, t111, t120, ...309
Detected timeout of ITS tools.
[2024-06-02 22:40:15] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:40:15] [INFO ] Applying decomposition
[2024-06-02 22:40:15] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11204927155764428684.txt' '-o' '/tmp/graph11204927155764428684.bin' '-w' '/tmp/graph11204927155764428684.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11204927155764428684.bin' '-l' '-1' '-v' '-w' '/tmp/graph11204927155764428684.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:40:15] [INFO ] Decomposing Gal with order
[2024-06-02 22:40:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:40:15] [INFO ] Removed a total of 173 redundant transitions.
[2024-06-02 22:40:15] [INFO ] Flatten gal took : 43 ms
[2024-06-02 22:40:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 7 ms.
[2024-06-02 22:40:15] [INFO ] Time to serialize gal into /tmp/CTLFireability2756271766105094638.gal : 3 ms
[2024-06-02 22:40:15] [INFO ] Time to serialize properties into /tmp/CTLFireability11688226487656994501.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2756271766105094638.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11688226487656994501.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,552422,0.395365,19196,493,238,19027,23174,594,28866,208,72851,0
Converting to forward existential form...Done !
original formula: E(!((!((!(EX(((i3.u7.p41==1)&&(i8.i1.u41.p219==1)))) + !(((i3.u7.p43==1)&&(i9.u46.p246==1))))) + ((EG((i1.u31.p163==1)) * AX((i7.u33.p169...307
=> equivalent forward existential formula: [((FwdU(Init,!((!((!(EX(((i3.u7.p41==1)&&(i8.i1.u41.p219==1)))) + !(((i3.u7.p43==1)&&(i9.u46.p246==1))))) + ((EG...389
Reverse transition relation is NOT exact ! Due to transitions t53, t61, t68, t105, t111, t122, t211, t233, t234, t235, t240, t242, i0.i0.u0.t109, i1.u31.t3...421
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,1.70464,63020,1,0,87992,34438,3877,222057,1280,95524,222797
FORMULA FireWire-PT-15-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 311/311 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 172 transition count 281
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 172 transition count 281
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 167 transition count 273
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 167 transition count 273
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 165 transition count 269
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 165 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 165 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 164 transition count 267
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 164 transition count 267
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 163 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 163 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 162 transition count 263
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 162 transition count 263
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 161 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 161 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 160 transition count 259
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 160 transition count 259
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 159 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 159 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 158 transition count 255
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 158 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 157 transition count 252
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 157 transition count 252
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 156 transition count 251
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 156 transition count 251
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 74 place count 155 transition count 249
Iterating global reduction 1 with 1 rules applied. Total rules applied 75 place count 155 transition count 249
Applied a total of 75 rules in 19 ms. Remains 155 /192 variables (removed 37) and now considering 249/311 (removed 62) transitions.
// Phase 1: matrix 249 rows 155 cols
[2024-06-02 22:40:17] [INFO ] Computed 4 invariants in 6 ms
[2024-06-02 22:40:17] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 22:40:17] [INFO ] Invariant cache hit.
[2024-06-02 22:40:17] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 248 sub problems to find dead transitions.
[2024-06-02 22:40:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 248 unsolved
[2024-06-02 22:40:18] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 2 ms to minimize.
[2024-06-02 22:40:18] [INFO ] Deduced a trap composed of 92 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:40:18] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 2 ms to minimize.
[2024-06-02 22:40:18] [INFO ] Deduced a trap composed of 82 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:40:18] [INFO ] Deduced a trap composed of 87 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:40:19] [INFO ] Deduced a trap composed of 82 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:40:19] [INFO ] Deduced a trap composed of 84 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:40:19] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 2 ms to minimize.
[2024-06-02 22:40:19] [INFO ] Deduced a trap composed of 80 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:40:19] [INFO ] Deduced a trap composed of 83 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:40:19] [INFO ] Deduced a trap composed of 94 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:40:19] [INFO ] Deduced a trap composed of 89 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:40:19] [INFO ] Deduced a trap composed of 83 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:40:19] [INFO ] Deduced a trap composed of 84 places in 49 ms of which 1 ms to minimize.
Problem TDEAD127 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 14/18 constraints. Problems are: Problem set: 15 solved, 233 unsolved
[2024-06-02 22:40:20] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:40:20] [INFO ] Deduced a trap composed of 80 places in 46 ms of which 0 ms to minimize.
[2024-06-02 22:40:21] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 3/21 constraints. Problems are: Problem set: 15 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/21 constraints. Problems are: Problem set: 15 solved, 233 unsolved
At refinement iteration 5 (OVERLAPS) 249/404 variables, 155/176 constraints. Problems are: Problem set: 15 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 0/176 constraints. Problems are: Problem set: 15 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 0/404 variables, 0/176 constraints. Problems are: Problem set: 15 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 176 constraints, problems are : Problem set: 15 solved, 233 unsolved in 9234 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 248/248 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 15 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 233 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 17/21 constraints. Problems are: Problem set: 15 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/21 constraints. Problems are: Problem set: 15 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 249/404 variables, 155/176 constraints. Problems are: Problem set: 15 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 233/409 constraints. Problems are: Problem set: 15 solved, 233 unsolved
[2024-06-02 22:40:29] [INFO ] Deduced a trap composed of 91 places in 65 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 1/410 constraints. Problems are: Problem set: 15 solved, 233 unsolved
[2024-06-02 22:40:34] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 1/411 constraints. Problems are: Problem set: 15 solved, 233 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/411 constraints. Problems are: Problem set: 15 solved, 233 unsolved
At refinement iteration 9 (OVERLAPS) 0/404 variables, 0/411 constraints. Problems are: Problem set: 15 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 411 constraints, problems are : Problem set: 15 solved, 233 unsolved in 25801 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 233/248 constraints, Known Traps: 19/19 constraints]
After SMT, in 35082ms problems are : Problem set: 15 solved, 233 unsolved
Search for dead transitions found 15 dead transitions in 35085ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 155/192 places, 234/311 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 154 transition count 233
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 154 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 153 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 153 transition count 232
Applied a total of 4 rules in 3 ms. Remains 153 /155 variables (removed 2) and now considering 232/234 (removed 2) transitions.
// Phase 1: matrix 232 rows 153 cols
[2024-06-02 22:40:52] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:40:52] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 22:40:52] [INFO ] Invariant cache hit.
[2024-06-02 22:40:52] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 153/192 places, 232/311 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35527 ms. Remains : 153/192 places, 232/311 transitions.
[2024-06-02 22:40:52] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:40:52] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:40:52] [INFO ] Input system was already deterministic with 232 transitions.
[2024-06-02 22:40:52] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:40:52] [INFO ] Flatten gal took : 6 ms
[2024-06-02 22:40:52] [INFO ] Time to serialize gal into /tmp/CTLFireability14138313472849411550.gal : 1 ms
[2024-06-02 22:40:52] [INFO ] Time to serialize properties into /tmp/CTLFireability16619121326573177222.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14138313472849411550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16619121326573177222.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,526525,1.06803,39936,2,4930,5,111589,6,0,845,170124,0
Converting to forward existential form...Done !
original formula: EF(AG(((EF(EX(((p36==1)&&(p223==1)))) + (p179==1)) + EX(A(((p46==1)&&(p212==1)) U ((p106==1)&&(p198==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((E(TRUE U EX(((p36==1)&&(p223==1)))) + (p179==1)) + EX(!((E(!(((p106==1)&&(p19...270
Reverse transition relation is NOT exact ! Due to transitions t3, t37, t42, t49, t53, t57, t60, t64, t72, t80, t84, t85, t101, t104, t106, t115, t117, t192...311
(forward)formula 0,0,26.7278,827484,1,0,773,5.90195e+06,497,402,5730,3.67764e+06,935
FORMULA FireWire-PT-15-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 192/192 places, 311/311 transitions.
Graph (trivial) has 143 edges and 192 vertex of which 12 / 192 are part of one of the 3 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 182 transition count 274
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 55 place count 156 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 155 transition count 272
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 56 place count 155 transition count 262
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 76 place count 145 transition count 262
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 85 place count 136 transition count 234
Iterating global reduction 3 with 9 rules applied. Total rules applied 94 place count 136 transition count 234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 96 place count 136 transition count 232
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 96 place count 136 transition count 230
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 100 place count 134 transition count 230
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 103 place count 131 transition count 226
Iterating global reduction 4 with 3 rules applied. Total rules applied 106 place count 131 transition count 226
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 107 place count 130 transition count 225
Iterating global reduction 4 with 1 rules applied. Total rules applied 108 place count 130 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 110 place count 130 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 111 place count 129 transition count 223
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 131 place count 119 transition count 213
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 133 place count 117 transition count 209
Iterating global reduction 6 with 2 rules applied. Total rules applied 135 place count 117 transition count 209
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 136 place count 116 transition count 206
Iterating global reduction 6 with 1 rules applied. Total rules applied 137 place count 116 transition count 206
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 138 place count 115 transition count 205
Iterating global reduction 6 with 1 rules applied. Total rules applied 139 place count 115 transition count 205
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 140 place count 114 transition count 202
Iterating global reduction 6 with 1 rules applied. Total rules applied 141 place count 114 transition count 202
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 142 place count 113 transition count 201
Iterating global reduction 6 with 1 rules applied. Total rules applied 143 place count 113 transition count 201
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 144 place count 112 transition count 198
Iterating global reduction 6 with 1 rules applied. Total rules applied 145 place count 112 transition count 198
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 146 place count 111 transition count 197
Iterating global reduction 6 with 1 rules applied. Total rules applied 147 place count 111 transition count 197
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 148 place count 110 transition count 194
Iterating global reduction 6 with 1 rules applied. Total rules applied 149 place count 110 transition count 194
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 150 place count 109 transition count 193
Iterating global reduction 6 with 1 rules applied. Total rules applied 151 place count 109 transition count 193
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 152 place count 108 transition count 190
Iterating global reduction 6 with 1 rules applied. Total rules applied 153 place count 108 transition count 190
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 154 place count 107 transition count 189
Iterating global reduction 6 with 1 rules applied. Total rules applied 155 place count 107 transition count 189
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 156 place count 106 transition count 187
Iterating global reduction 6 with 1 rules applied. Total rules applied 157 place count 106 transition count 187
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 158 place count 105 transition count 186
Applied a total of 158 rules in 36 ms. Remains 105 /192 variables (removed 87) and now considering 186/311 (removed 125) transitions.
[2024-06-02 22:41:19] [INFO ] Flow matrix only has 183 transitions (discarded 3 similar events)
// Phase 1: matrix 183 rows 105 cols
[2024-06-02 22:41:19] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:41:19] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 22:41:19] [INFO ] Flow matrix only has 183 transitions (discarded 3 similar events)
[2024-06-02 22:41:19] [INFO ] Invariant cache hit.
[2024-06-02 22:41:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:41:19] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-06-02 22:41:19] [INFO ] Redundant transitions in 1 ms returned []
Running 181 sub problems to find dead transitions.
[2024-06-02 22:41:19] [INFO ] Flow matrix only has 183 transitions (discarded 3 similar events)
[2024-06-02 22:41:19] [INFO ] Invariant cache hit.
[2024-06-02 22:41:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-06-02 22:41:20] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:41:20] [INFO ] Deduced a trap composed of 60 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:41:20] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:41:20] [INFO ] Deduced a trap composed of 58 places in 43 ms of which 1 ms to minimize.
Problem TDEAD68 is UNSAT
[2024-06-02 22:41:20] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
Problem TDEAD92 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD154 is UNSAT
[2024-06-02 22:41:20] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 6/10 constraints. Problems are: Problem set: 15 solved, 166 unsolved
[2024-06-02 22:41:21] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 1/11 constraints. Problems are: Problem set: 15 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/11 constraints. Problems are: Problem set: 15 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 182/286 variables, 104/115 constraints. Problems are: Problem set: 15 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 1/116 constraints. Problems are: Problem set: 15 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/116 constraints. Problems are: Problem set: 15 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 1/287 variables, 1/117 constraints. Problems are: Problem set: 15 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/117 constraints. Problems are: Problem set: 15 solved, 166 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/117 constraints. Problems are: Problem set: 15 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/288 variables, and 117 constraints, problems are : Problem set: 15 solved, 166 unsolved in 5863 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 105/105 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 15 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 7/11 constraints. Problems are: Problem set: 15 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/11 constraints. Problems are: Problem set: 15 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 182/286 variables, 104/115 constraints. Problems are: Problem set: 15 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 1/116 constraints. Problems are: Problem set: 15 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 166/282 constraints. Problems are: Problem set: 15 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/282 constraints. Problems are: Problem set: 15 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 1/287 variables, 1/283 constraints. Problems are: Problem set: 15 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/283 constraints. Problems are: Problem set: 15 solved, 166 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/283 constraints. Problems are: Problem set: 15 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/288 variables, and 283 constraints, problems are : Problem set: 15 solved, 166 unsolved in 7662 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 105/105 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 166/181 constraints, Known Traps: 7/7 constraints]
After SMT, in 13565ms problems are : Problem set: 15 solved, 166 unsolved
Search for dead transitions found 15 dead transitions in 13566ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 105/192 places, 171/311 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 170
Applied a total of 2 rules in 9 ms. Remains 104 /105 variables (removed 1) and now considering 170/171 (removed 1) transitions.
[2024-06-02 22:41:33] [INFO ] Flow matrix only has 167 transitions (discarded 3 similar events)
// Phase 1: matrix 167 rows 104 cols
[2024-06-02 22:41:33] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:41:33] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 22:41:33] [INFO ] Flow matrix only has 167 transitions (discarded 3 similar events)
[2024-06-02 22:41:33] [INFO ] Invariant cache hit.
[2024-06-02 22:41:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:41:33] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 104/192 places, 170/311 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 13925 ms. Remains : 104/192 places, 170/311 transitions.
[2024-06-02 22:41:33] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:41:33] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:41:33] [INFO ] Input system was already deterministic with 170 transitions.
[2024-06-02 22:41:33] [INFO ] Flatten gal took : 3 ms
[2024-06-02 22:41:33] [INFO ] Flatten gal took : 3 ms
[2024-06-02 22:41:33] [INFO ] Time to serialize gal into /tmp/CTLFireability18306470772767667296.gal : 2 ms
[2024-06-02 22:41:33] [INFO ] Time to serialize properties into /tmp/CTLFireability8589229702529017633.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18306470772767667296.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8589229702529017633.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,95797,0.211831,12996,2,2117,5,31517,6,0,584,36917,0
Converting to forward existential form...Done !
original formula: E(EG((p215!=1)) U !(EF((p35==1))))
=> equivalent forward existential formula: [(FwdU(Init,EG((p215!=1))) * !(E(TRUE U (p35==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t24, t27, t30, t32, t38, t40, t41, t45, t46, t47, t54, t55, t118, t121, t132, t136, t152,...298
(forward)formula 0,1,7.30818,246992,1,0,769,1.38628e+06,368,540,4239,1.35548e+06,1029
FORMULA FireWire-PT-15-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 311/311 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 171 transition count 271
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 171 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 171 transition count 270
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 164 transition count 251
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 164 transition count 251
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 161 transition count 245
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 161 transition count 245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 161 transition count 244
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 160 transition count 243
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 160 transition count 243
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 159 transition count 240
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 159 transition count 240
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 158 transition count 239
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 158 transition count 239
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 157 transition count 236
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 157 transition count 236
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 156 transition count 235
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 156 transition count 235
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 155 transition count 232
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 155 transition count 232
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 154 transition count 231
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 154 transition count 231
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 153 transition count 228
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 153 transition count 228
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 152 transition count 227
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 152 transition count 227
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 151 transition count 225
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 151 transition count 225
Applied a total of 84 rules in 11 ms. Remains 151 /192 variables (removed 41) and now considering 225/311 (removed 86) transitions.
// Phase 1: matrix 225 rows 151 cols
[2024-06-02 22:41:40] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:41:40] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 22:41:40] [INFO ] Invariant cache hit.
[2024-06-02 22:41:41] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2024-06-02 22:41:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-06-02 22:41:42] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:41:42] [INFO ] Deduced a trap composed of 86 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:41:42] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:41:42] [INFO ] Deduced a trap composed of 88 places in 44 ms of which 1 ms to minimize.
[2024-06-02 22:41:42] [INFO ] Deduced a trap composed of 93 places in 47 ms of which 1 ms to minimize.
[2024-06-02 22:41:42] [INFO ] Deduced a trap composed of 84 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:41:42] [INFO ] Deduced a trap composed of 90 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:41:42] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:41:42] [INFO ] Deduced a trap composed of 75 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:41:42] [INFO ] Deduced a trap composed of 78 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:41:43] [INFO ] Deduced a trap composed of 85 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:41:43] [INFO ] Deduced a trap composed of 83 places in 57 ms of which 1 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 12/16 constraints. Problems are: Problem set: 15 solved, 209 unsolved
[2024-06-02 22:41:43] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:41:44] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:41:44] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 3/19 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/19 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 225/376 variables, 151/170 constraints. Problems are: Problem set: 15 solved, 209 unsolved
[2024-06-02 22:41:47] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 1/171 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 0/171 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 8 (OVERLAPS) 0/376 variables, 0/171 constraints. Problems are: Problem set: 15 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 171 constraints, problems are : Problem set: 15 solved, 209 unsolved in 9512 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 15 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 16/20 constraints. Problems are: Problem set: 15 solved, 209 unsolved
[2024-06-02 22:41:51] [INFO ] Deduced a trap composed of 88 places in 55 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 1/21 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/21 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 225/376 variables, 151/172 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 209/381 constraints. Problems are: Problem set: 15 solved, 209 unsolved
[2024-06-02 22:41:54] [INFO ] Deduced a trap composed of 89 places in 58 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 1/382 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/382 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 9 (OVERLAPS) 0/376 variables, 0/382 constraints. Problems are: Problem set: 15 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 382 constraints, problems are : Problem set: 15 solved, 209 unsolved in 13705 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 209/224 constraints, Known Traps: 18/18 constraints]
After SMT, in 23255ms problems are : Problem set: 15 solved, 209 unsolved
Search for dead transitions found 15 dead transitions in 23258ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 151/192 places, 210/311 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 150 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 150 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 149 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 149 transition count 208
Applied a total of 4 rules in 6 ms. Remains 149 /151 variables (removed 2) and now considering 208/210 (removed 2) transitions.
// Phase 1: matrix 208 rows 149 cols
[2024-06-02 22:42:04] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:42:04] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 22:42:04] [INFO ] Invariant cache hit.
[2024-06-02 22:42:04] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 149/192 places, 208/311 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23628 ms. Remains : 149/192 places, 208/311 transitions.
[2024-06-02 22:42:04] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:42:04] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:42:04] [INFO ] Input system was already deterministic with 208 transitions.
[2024-06-02 22:42:04] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:42:04] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:42:04] [INFO ] Time to serialize gal into /tmp/CTLFireability14961350695468424740.gal : 3 ms
[2024-06-02 22:42:04] [INFO ] Time to serialize properties into /tmp/CTLFireability12091558908612612426.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14961350695468424740.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12091558908612612426.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,477446,1.15603,39024,2,4898,5,106757,6,0,805,147401,0
Converting to forward existential form...Done !
original formula: AX(AF(((p107==0)||(p150==0))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(((p107==0)||(p150==0))))] = FALSE
(forward)formula 0,1,2.22336,48712,1,0,10,228647,19,2,3798,147401,7
FORMULA FireWire-PT-15-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 311/311 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 171 transition count 271
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 171 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 171 transition count 270
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 164 transition count 251
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 164 transition count 251
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 161 transition count 245
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 161 transition count 245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 161 transition count 244
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 160 transition count 243
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 160 transition count 243
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 159 transition count 240
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 159 transition count 240
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 158 transition count 239
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 158 transition count 239
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 157 transition count 236
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 157 transition count 236
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 156 transition count 235
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 156 transition count 235
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 155 transition count 232
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 155 transition count 232
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 154 transition count 231
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 154 transition count 231
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 153 transition count 228
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 153 transition count 228
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 152 transition count 227
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 152 transition count 227
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 151 transition count 225
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 151 transition count 225
Applied a total of 84 rules in 16 ms. Remains 151 /192 variables (removed 41) and now considering 225/311 (removed 86) transitions.
// Phase 1: matrix 225 rows 151 cols
[2024-06-02 22:42:06] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:42:06] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 22:42:06] [INFO ] Invariant cache hit.
[2024-06-02 22:42:07] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 224 sub problems to find dead transitions.
[2024-06-02 22:42:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 224 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 224 unsolved
[2024-06-02 22:42:08] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 1 ms to minimize.
[2024-06-02 22:42:08] [INFO ] Deduced a trap composed of 86 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:42:08] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:42:08] [INFO ] Deduced a trap composed of 88 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:42:08] [INFO ] Deduced a trap composed of 93 places in 50 ms of which 1 ms to minimize.
[2024-06-02 22:42:08] [INFO ] Deduced a trap composed of 84 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:42:08] [INFO ] Deduced a trap composed of 90 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:42:08] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:42:08] [INFO ] Deduced a trap composed of 75 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:42:08] [INFO ] Deduced a trap composed of 78 places in 45 ms of which 0 ms to minimize.
[2024-06-02 22:42:09] [INFO ] Deduced a trap composed of 85 places in 54 ms of which 1 ms to minimize.
[2024-06-02 22:42:09] [INFO ] Deduced a trap composed of 83 places in 52 ms of which 1 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 12/16 constraints. Problems are: Problem set: 15 solved, 209 unsolved
[2024-06-02 22:42:09] [INFO ] Deduced a trap composed of 75 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:42:09] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-02 22:42:10] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 3/19 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/19 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 225/376 variables, 151/170 constraints. Problems are: Problem set: 15 solved, 209 unsolved
[2024-06-02 22:42:13] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 1/171 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 0/171 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 8 (OVERLAPS) 0/376 variables, 0/171 constraints. Problems are: Problem set: 15 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 376/376 variables, and 171 constraints, problems are : Problem set: 15 solved, 209 unsolved in 9416 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 224/224 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 15 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 4/4 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 16/20 constraints. Problems are: Problem set: 15 solved, 209 unsolved
[2024-06-02 22:42:17] [INFO ] Deduced a trap composed of 88 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 1/21 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/21 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 225/376 variables, 151/172 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 209/381 constraints. Problems are: Problem set: 15 solved, 209 unsolved
[2024-06-02 22:42:20] [INFO ] Deduced a trap composed of 89 places in 55 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/376 variables, 1/382 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/376 variables, 0/382 constraints. Problems are: Problem set: 15 solved, 209 unsolved
At refinement iteration 9 (OVERLAPS) 0/376 variables, 0/382 constraints. Problems are: Problem set: 15 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 376/376 variables, and 382 constraints, problems are : Problem set: 15 solved, 209 unsolved in 13843 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 209/224 constraints, Known Traps: 18/18 constraints]
After SMT, in 23304ms problems are : Problem set: 15 solved, 209 unsolved
Search for dead transitions found 15 dead transitions in 23306ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 151/192 places, 210/311 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 150 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 150 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 149 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 149 transition count 208
Applied a total of 4 rules in 3 ms. Remains 149 /151 variables (removed 2) and now considering 208/210 (removed 2) transitions.
// Phase 1: matrix 208 rows 149 cols
[2024-06-02 22:42:30] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:42:30] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 22:42:30] [INFO ] Invariant cache hit.
[2024-06-02 22:42:30] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 149/192 places, 208/311 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 23699 ms. Remains : 149/192 places, 208/311 transitions.
[2024-06-02 22:42:30] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:42:30] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:42:30] [INFO ] Input system was already deterministic with 208 transitions.
[2024-06-02 22:42:30] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:42:30] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:42:30] [INFO ] Time to serialize gal into /tmp/CTLFireability10372445263183882723.gal : 2 ms
[2024-06-02 22:42:30] [INFO ] Time to serialize properties into /tmp/CTLFireability9006216248947592014.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10372445263183882723.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9006216248947592014.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,477446,1.00145,38796,2,4898,5,106757,6,0,805,147401,0
Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,1.00822,38796,1,0,6,106757,7,1,1050,147401,1
FORMULA FireWire-PT-15-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 192/192 places, 311/311 transitions.
Graph (trivial) has 139 edges and 192 vertex of which 12 / 192 are part of one of the 3 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 182 transition count 274
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 55 place count 156 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 155 transition count 272
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 56 place count 155 transition count 263
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 74 place count 146 transition count 263
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 83 place count 137 transition count 235
Iterating global reduction 3 with 9 rules applied. Total rules applied 92 place count 137 transition count 235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 94 place count 137 transition count 233
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 94 place count 137 transition count 231
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 98 place count 135 transition count 231
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 101 place count 132 transition count 227
Iterating global reduction 4 with 3 rules applied. Total rules applied 104 place count 132 transition count 227
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 105 place count 131 transition count 226
Iterating global reduction 4 with 1 rules applied. Total rules applied 106 place count 131 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 108 place count 131 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 109 place count 130 transition count 224
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 131 place count 119 transition count 213
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 132 place count 118 transition count 211
Iterating global reduction 6 with 1 rules applied. Total rules applied 133 place count 118 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 134 place count 117 transition count 210
Applied a total of 134 rules in 18 ms. Remains 117 /192 variables (removed 75) and now considering 210/311 (removed 101) transitions.
[2024-06-02 22:42:31] [INFO ] Flow matrix only has 207 transitions (discarded 3 similar events)
// Phase 1: matrix 207 rows 117 cols
[2024-06-02 22:42:31] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 22:42:31] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 22:42:31] [INFO ] Flow matrix only has 207 transitions (discarded 3 similar events)
[2024-06-02 22:42:31] [INFO ] Invariant cache hit.
[2024-06-02 22:42:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:42:31] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-06-02 22:42:31] [INFO ] Redundant transitions in 1 ms returned []
Running 205 sub problems to find dead transitions.
[2024-06-02 22:42:31] [INFO ] Flow matrix only has 207 transitions (discarded 3 similar events)
[2024-06-02 22:42:31] [INFO ] Invariant cache hit.
[2024-06-02 22:42:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-06-02 22:42:32] [INFO ] Deduced a trap composed of 67 places in 53 ms of which 1 ms to minimize.
[2024-06-02 22:42:32] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:42:32] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:42:32] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 0 ms to minimize.
[2024-06-02 22:42:32] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:42:32] [INFO ] Deduced a trap composed of 61 places in 36 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
[2024-06-02 22:42:32] [INFO ] Deduced a trap composed of 82 places in 58 ms of which 3 ms to minimize.
[2024-06-02 22:42:32] [INFO ] Deduced a trap composed of 66 places in 46 ms of which 1 ms to minimize.
Problem TDEAD83 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD123 is UNSAT
[2024-06-02 22:42:33] [INFO ] Deduced a trap composed of 68 places in 54 ms of which 0 ms to minimize.
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
[2024-06-02 22:42:33] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
Problem TDEAD167 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 10/14 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/14 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 3 (OVERLAPS) 206/322 variables, 116/130 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 1/131 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 0/131 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 6 (OVERLAPS) 1/323 variables, 1/132 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/132 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/323 variables, 0/132 constraints. Problems are: Problem set: 26 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/324 variables, and 132 constraints, problems are : Problem set: 26 solved, 179 unsolved in 5921 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 117/117 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 26 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 4/4 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 10/14 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/14 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 3 (OVERLAPS) 206/322 variables, 116/130 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 1/131 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 179/310 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/310 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 1/323 variables, 1/311 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 0/311 constraints. Problems are: Problem set: 26 solved, 179 unsolved
At refinement iteration 9 (OVERLAPS) 0/323 variables, 0/311 constraints. Problems are: Problem set: 26 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/324 variables, and 311 constraints, problems are : Problem set: 26 solved, 179 unsolved in 9195 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 117/117 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 179/205 constraints, Known Traps: 10/10 constraints]
After SMT, in 15169ms problems are : Problem set: 26 solved, 179 unsolved
Search for dead transitions found 26 dead transitions in 15174ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 117/192 places, 184/311 transitions.
Applied a total of 0 rules in 9 ms. Remains 117 /117 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2024-06-02 22:42:46] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 15382 ms. Remains : 117/192 places, 184/311 transitions.
[2024-06-02 22:42:46] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:42:46] [INFO ] Flatten gal took : 7 ms
[2024-06-02 22:42:46] [INFO ] Input system was already deterministic with 184 transitions.
[2024-06-02 22:42:46] [INFO ] Flatten gal took : 5 ms
[2024-06-02 22:42:46] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:42:46] [INFO ] Time to serialize gal into /tmp/CTLFireability11791326461898969585.gal : 4 ms
[2024-06-02 22:42:47] [INFO ] Time to serialize properties into /tmp/CTLFireability10570914407034288984.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11791326461898969585.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10570914407034288984.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,94630,0.325143,16804,2,2890,5,40271,6,0,650,47918,0
Converting to forward existential form...Done !
original formula: EG(EF(((AF((p180==1)) + A((p197==1) U ((p36==1)&&(p176==1)))) + (p227==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U ((!(EG(!((p180==1)))) + !((E(!(((p36==1)&&(p176==1))) U (!((p197==1)) * !(((p36==1)&&(p176==...220
Reverse transition relation is NOT exact ! Due to transitions t12, t25, t27, t28, t31, t33, t40, t42, t43, t47, t48, t55, t56, t123, t126, t139, t165, t166...299
(forward)formula 0,1,10.9721,349584,1,0,955,2.01101e+06,407,614,4711,1.80593e+06,1083
FORMULA FireWire-PT-15-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 192/192 places, 311/311 transitions.
Graph (trivial) has 145 edges and 192 vertex of which 12 / 192 are part of one of the 3 SCC in 1 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 182 transition count 274
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 28 rules applied. Total rules applied 55 place count 156 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 155 transition count 272
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 56 place count 155 transition count 262
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 76 place count 145 transition count 262
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 86 place count 135 transition count 233
Iterating global reduction 3 with 10 rules applied. Total rules applied 96 place count 135 transition count 233
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 135 transition count 231
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 98 place count 135 transition count 229
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 102 place count 133 transition count 229
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 106 place count 129 transition count 224
Iterating global reduction 4 with 4 rules applied. Total rules applied 110 place count 129 transition count 224
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 112 place count 127 transition count 221
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 127 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 116 place count 127 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 117 place count 126 transition count 219
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 139 place count 115 transition count 208
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 142 place count 112 transition count 194
Iterating global reduction 6 with 3 rules applied. Total rules applied 145 place count 112 transition count 194
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 146 place count 111 transition count 191
Iterating global reduction 6 with 1 rules applied. Total rules applied 147 place count 111 transition count 191
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 148 place count 110 transition count 190
Iterating global reduction 6 with 1 rules applied. Total rules applied 149 place count 110 transition count 190
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 150 place count 109 transition count 187
Iterating global reduction 6 with 1 rules applied. Total rules applied 151 place count 109 transition count 187
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 152 place count 108 transition count 186
Iterating global reduction 6 with 1 rules applied. Total rules applied 153 place count 108 transition count 186
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 154 place count 107 transition count 185
Applied a total of 154 rules in 28 ms. Remains 107 /192 variables (removed 85) and now considering 185/311 (removed 126) transitions.
[2024-06-02 22:42:58] [INFO ] Flow matrix only has 182 transitions (discarded 3 similar events)
// Phase 1: matrix 182 rows 107 cols
[2024-06-02 22:42:58] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:42:58] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 22:42:58] [INFO ] Flow matrix only has 182 transitions (discarded 3 similar events)
[2024-06-02 22:42:58] [INFO ] Invariant cache hit.
[2024-06-02 22:42:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:42:58] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-06-02 22:42:58] [INFO ] Redundant transitions in 1 ms returned []
Running 180 sub problems to find dead transitions.
[2024-06-02 22:42:58] [INFO ] Flow matrix only has 182 transitions (discarded 3 similar events)
[2024-06-02 22:42:58] [INFO ] Invariant cache hit.
[2024-06-02 22:42:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-06-02 22:42:58] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:42:58] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
[2024-06-02 22:42:59] [INFO ] Deduced a trap composed of 69 places in 50 ms of which 1 ms to minimize.
Problem TDEAD69 is UNSAT
[2024-06-02 22:42:59] [INFO ] Deduced a trap composed of 57 places in 48 ms of which 1 ms to minimize.
[2024-06-02 22:42:59] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD101 is UNSAT
[2024-06-02 22:42:59] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-06-02 22:42:59] [INFO ] Deduced a trap composed of 67 places in 47 ms of which 0 ms to minimize.
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
[2024-06-02 22:42:59] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
Problem TDEAD143 is UNSAT
[2024-06-02 22:42:59] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 9/13 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/13 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 3 (OVERLAPS) 181/287 variables, 106/119 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 1/120 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/120 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 6 (OVERLAPS) 1/288 variables, 1/121 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 0/121 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 8 (OVERLAPS) 0/288 variables, 0/121 constraints. Problems are: Problem set: 22 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/289 variables, and 121 constraints, problems are : Problem set: 22 solved, 158 unsolved in 4938 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 22 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 4/4 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 9/13 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/13 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 3 (OVERLAPS) 181/287 variables, 106/119 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 1/120 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 158/278 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/278 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 7 (OVERLAPS) 1/288 variables, 1/279 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 0/279 constraints. Problems are: Problem set: 22 solved, 158 unsolved
At refinement iteration 9 (OVERLAPS) 0/288 variables, 0/279 constraints. Problems are: Problem set: 22 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/289 variables, and 279 constraints, problems are : Problem set: 22 solved, 158 unsolved in 7249 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 107/107 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 158/180 constraints, Known Traps: 9/9 constraints]
After SMT, in 12231ms problems are : Problem set: 22 solved, 158 unsolved
Search for dead transitions found 22 dead transitions in 12233ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 107/192 places, 163/311 transitions.
Applied a total of 0 rules in 6 ms. Remains 107 /107 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-06-02 22:43:10] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 12457 ms. Remains : 107/192 places, 163/311 transitions.
[2024-06-02 22:43:10] [INFO ] Flatten gal took : 3 ms
[2024-06-02 22:43:10] [INFO ] Flatten gal took : 3 ms
[2024-06-02 22:43:10] [INFO ] Input system was already deterministic with 163 transitions.
[2024-06-02 22:43:10] [INFO ] Flatten gal took : 3 ms
[2024-06-02 22:43:10] [INFO ] Flatten gal took : 4 ms
[2024-06-02 22:43:10] [INFO ] Time to serialize gal into /tmp/CTLFireability9982332605149646000.gal : 5 ms
[2024-06-02 22:43:10] [INFO ] Time to serialize properties into /tmp/CTLFireability9248535456192398929.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9982332605149646000.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9248535456192398929.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,82897,0.256872,14012,2,2186,5,34204,6,0,589,38865,0
Converting to forward existential form...Done !
original formula: AF(((p51==1)&&(p139==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((p51==1)&&(p139==1))))] = FALSE
Hit Full ! (commute/partial/dont) 133/0/30
(forward)formula 0,0,0.917336,29256,1,0,8,108298,20,4,3124,82425,8
FORMULA FireWire-PT-15-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2024-06-02 22:43:11] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:43:11] [INFO ] Flatten gal took : 7 ms
Total runtime 520220 ms.
BK_STOP 1717368191569
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="FireWire-PT-15"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is FireWire-PT-15, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r550-tall-171734899000282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-15.tgz
mv FireWire-PT-15 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;