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.r553-tall-171734901300274.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FireWire-PT-14, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901300274
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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 153K 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-14-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-14-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-14-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-14-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-14-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-14-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-14-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-14-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-14-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-14-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-14-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-14-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-14-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-14-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-14-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-14-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717356223222

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:23:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:23:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:23:44] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-06-02 19:23:44] [INFO ] Transformed 205 places.
[2024-06-02 19:23:44] [INFO ] Transformed 610 transitions.
[2024-06-02 19:23:44] [INFO ] Found NUPN structural information;
[2024-06-02 19:23:44] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2315 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Ensure Unique test removed 71 transitions
Reduce redundant transitions removed 71 transitions.
Support contains 103 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 539/539 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 204 transition count 537
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 204 transition count 537
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 204 transition count 536
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 204 transition count 530
Applied a total of 9 rules in 39 ms. Remains 204 /205 variables (removed 1) and now considering 530/539 (removed 9) transitions.
[2024-06-02 19:23:44] [INFO ] Flow matrix only has 498 transitions (discarded 32 similar events)
// Phase 1: matrix 498 rows 204 cols
[2024-06-02 19:23:44] [INFO ] Computed 10 invariants in 31 ms
[2024-06-02 19:23:44] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-06-02 19:23:44] [INFO ] Flow matrix only has 498 transitions (discarded 32 similar events)
[2024-06-02 19:23:44] [INFO ] Invariant cache hit.
[2024-06-02 19:23:45] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-02 19:23:45] [INFO ] Implicit Places using invariants and state equation in 461 ms returned [21, 85, 148]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 796 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 201/205 places, 530/539 transitions.
Applied a total of 0 rules in 15 ms. Remains 201 /201 variables (removed 0) and now considering 530/530 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 867 ms. Remains : 201/205 places, 530/539 transitions.
Support contains 103 out of 201 places after structural reductions.
[2024-06-02 19:23:45] [INFO ] Flatten gal took : 73 ms
[2024-06-02 19:23:45] [INFO ] Flatten gal took : 40 ms
[2024-06-02 19:23:45] [INFO ] Input system was already deterministic with 530 transitions.
Support contains 99 out of 201 places (down from 103) after GAL structural reductions.
RANDOM walk for 40000 steps (1203 resets) in 1786 ms. (22 steps per ms) remains 34/88 properties
BEST_FIRST walk for 4004 steps (9 resets) in 50 ms. (78 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (22 resets) in 56 ms. (70 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (31 resets) in 30 ms. (129 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (23 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (31 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (27 resets) in 35 ms. (111 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (53 resets) in 30 ms. (129 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (14 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4003 steps (25 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (24 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (25 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (26 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (24 resets) in 11 ms. (333 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (26 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (21 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (25 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (13 resets) in 12 ms. (307 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (50 resets) in 13 ms. (286 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (19 resets) in 12 ms. (307 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (11 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (23 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (25 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (14 resets) in 10 ms. (363 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (27 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (22 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
[2024-06-02 19:23:46] [INFO ] Flow matrix only has 498 transitions (discarded 32 similar events)
// Phase 1: matrix 498 rows 201 cols
[2024-06-02 19:23:46] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 19:23:46] [INFO ] State equation strengthened by 73 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp81 is UNSAT
At refinement iteration 1 (OVERLAPS) 133/185 variables, 5/5 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 6/191 variables, 2/7 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 492/683 variables, 191/198 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/683 variables, 71/269 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/683 variables, 0/269 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 15/698 variables, 10/279 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/698 variables, 1/280 constraints. Problems are: Problem set: 5 solved, 26 unsolved
[2024-06-02 19:23:48] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 7 ms to minimize.
[2024-06-02 19:23:48] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 2 ms to minimize.
[2024-06-02 19:23:48] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/698 variables, 3/283 constraints. Problems are: Problem set: 5 solved, 26 unsolved
[2024-06-02 19:23:48] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/698 variables, 1/284 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/698 variables, 0/284 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 1/699 variables, 1/285 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/699 variables, 0/285 constraints. Problems are: Problem set: 5 solved, 26 unsolved
At refinement iteration 15 (OVERLAPS) 0/699 variables, 0/285 constraints. Problems are: Problem set: 5 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 699/699 variables, and 285 constraints, problems are : Problem set: 5 solved, 26 unsolved in 2989 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 201/201 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 5 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 26 unsolved
Problem AtomicPropp17 is UNSAT
At refinement iteration 1 (OVERLAPS) 141/181 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 2/6 constraints. Problems are: Problem set: 6 solved, 25 unsolved
[2024-06-02 19:23:50] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 1/7 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/7 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 9/190 variables, 3/10 constraints. Problems are: Problem set: 6 solved, 25 unsolved
[2024-06-02 19:23:50] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:23:50] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 2/12 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/12 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 492/682 variables, 190/202 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/682 variables, 71/273 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/682 variables, 23/296 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/682 variables, 0/296 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 12 (OVERLAPS) 16/698 variables, 11/307 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/698 variables, 1/308 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/698 variables, 2/310 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/698 variables, 2/312 constraints. Problems are: Problem set: 6 solved, 25 unsolved
[2024-06-02 19:23:52] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/698 variables, 1/313 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/698 variables, 0/313 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 18 (OVERLAPS) 1/699 variables, 1/314 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/699 variables, 0/314 constraints. Problems are: Problem set: 6 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 699/699 variables, and 314 constraints, problems are : Problem set: 6 solved, 25 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 201/201 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 25/31 constraints, Known Traps: 8/8 constraints]
After SMT, in 8107ms problems are : Problem set: 6 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 530/530 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 201 transition count 527
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 201 transition count 524
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 198 transition count 524
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 196 transition count 520
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 196 transition count 520
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 196 transition count 519
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 195 transition count 516
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 195 transition count 516
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 192 transition count 522
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 28 place count 192 transition count 516
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 31 place count 192 transition count 513
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 191 transition count 512
Applied a total of 32 rules in 109 ms. Remains 191 /201 variables (removed 10) and now considering 512/530 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 191/201 places, 512/530 transitions.
RANDOM walk for 40000 steps (1282 resets) in 1091 ms. (36 steps per ms) remains 20/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (28 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (22 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (35 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (26 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (28 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (29 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (17 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (24 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (29 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (35 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (30 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (29 resets) in 9 ms. (400 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (30 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (23 resets) in 10 ms. (363 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (24 resets) in 12 ms. (307 steps per ms) remains 20/20 properties
[2024-06-02 19:23:55] [INFO ] Flow matrix only has 478 transitions (discarded 34 similar events)
// Phase 1: matrix 478 rows 191 cols
[2024-06-02 19:23:55] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:23:55] [INFO ] State equation strengthened by 70 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 143/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 474/648 variables, 174/178 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/648 variables, 70/248 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 21/669 variables, 17/265 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/669 variables, 3/268 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-02 19:23:56] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:23:56] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/669 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 270 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1271 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 191/191 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 143/174 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-02 19:23:57] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 474/648 variables, 174/180 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 70/250 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/648 variables, 17/267 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/648 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 21/669 variables, 17/284 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 3/287 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/669 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-02 19:23:58] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:23:58] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 0 ms to minimize.
[2024-06-02 19:23:58] [INFO ] Deduced a trap composed of 53 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/669 variables, 3/294 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-02 19:23:59] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/669 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/669 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (OVERLAPS) 0/669 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 295 constraints, problems are : Problem set: 0 solved, 20 unsolved in 3871 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 191/191 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 7/7 constraints]
After SMT, in 5185ms problems are : Problem set: 0 solved, 20 unsolved
Parikh walk visited 1 properties in 1105 ms.
Support contains 30 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 512/512 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 190 transition count 510
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 190 transition count 510
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 190 transition count 509
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 189 transition count 508
Applied a total of 5 rules in 36 ms. Remains 189 /191 variables (removed 2) and now considering 508/512 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 189/191 places, 508/512 transitions.
RANDOM walk for 40000 steps (1266 resets) in 307 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (9 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (30 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (36 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (32 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (22 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (34 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (30 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (29 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (20 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (21 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (30 resets) in 8 ms. (444 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (25 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (30 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (24 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (28 resets) in 10 ms. (364 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 308518 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :1 out of 19
Probabilistic random walk after 308518 steps, saw 90368 distinct states, run finished after 3008 ms. (steps per millisecond=102 ) properties seen :1
[2024-06-02 19:24:05] [INFO ] Flow matrix only has 474 transitions (discarded 34 similar events)
// Phase 1: matrix 474 rows 189 cols
[2024-06-02 19:24:05] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:24:05] [INFO ] State equation strengthened by 70 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 142/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 469/641 variables, 172/176 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 70/246 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/641 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 21/662 variables, 16/262 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/662 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 19:24:05] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/662 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/662 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 1/663 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 0/663 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 663/663 variables, and 267 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1363 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 142/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 19:24:06] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 469/641 variables, 172/178 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 70/248 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 16/264 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 21/662 variables, 16/280 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/662 variables, 3/283 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/662 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 19:24:08] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/662 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/662 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 1/663 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/663 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (OVERLAPS) 0/663 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 663/663 variables, and 287 constraints, problems are : Problem set: 0 solved, 18 unsolved in 3328 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 3/3 constraints]
After SMT, in 4729ms problems are : Problem set: 0 solved, 18 unsolved
Parikh walk visited 0 properties in 742 ms.
Support contains 30 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 508/508 transitions.
Applied a total of 0 rules in 12 ms. Remains 189 /189 variables (removed 0) and now considering 508/508 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 189/189 places, 508/508 transitions.
RANDOM walk for 40000 steps (1280 resets) in 247 ms. (161 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (9 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (27 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (9 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (36 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (30 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (27 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (26 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (25 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (23 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (23 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (31 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (26 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (21 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (27 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (29 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 331387 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 18
Probabilistic random walk after 331387 steps, saw 96468 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
[2024-06-02 19:24:13] [INFO ] Flow matrix only has 474 transitions (discarded 34 similar events)
[2024-06-02 19:24:13] [INFO ] Invariant cache hit.
[2024-06-02 19:24:13] [INFO ] State equation strengthened by 70 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 142/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 469/641 variables, 172/176 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 70/246 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/641 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 21/662 variables, 16/262 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/662 variables, 3/265 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 19:24:14] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/662 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/662 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 1/663 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 19:24:14] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/663 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 0/663 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 663/663 variables, and 268 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1598 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 142/172 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 19:24:15] [INFO ] Deduced a trap composed of 64 places in 89 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 469/641 variables, 172/179 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 70/249 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 16/265 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 21/662 variables, 16/281 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/662 variables, 3/284 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/662 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-06-02 19:24:16] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 0 ms to minimize.
[2024-06-02 19:24:17] [INFO ] Deduced a trap composed of 51 places in 41 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/662 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/662 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 1/663 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/663 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 16 (OVERLAPS) 0/663 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 663/663 variables, and 289 constraints, problems are : Problem set: 0 solved, 18 unsolved in 3473 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 5/5 constraints]
After SMT, in 5103ms problems are : Problem set: 0 solved, 18 unsolved
Parikh walk visited 0 properties in 1983 ms.
Support contains 30 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 508/508 transitions.
Applied a total of 0 rules in 11 ms. Remains 189 /189 variables (removed 0) and now considering 508/508 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 189/189 places, 508/508 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 508/508 transitions.
Applied a total of 0 rules in 11 ms. Remains 189 /189 variables (removed 0) and now considering 508/508 (removed 0) transitions.
[2024-06-02 19:24:20] [INFO ] Flow matrix only has 474 transitions (discarded 34 similar events)
[2024-06-02 19:24:20] [INFO ] Invariant cache hit.
[2024-06-02 19:24:20] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 19:24:20] [INFO ] Flow matrix only has 474 transitions (discarded 34 similar events)
[2024-06-02 19:24:20] [INFO ] Invariant cache hit.
[2024-06-02 19:24:21] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-06-02 19:24:21] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2024-06-02 19:24:21] [INFO ] Redundant transitions in 32 ms returned []
Running 502 sub problems to find dead transitions.
[2024-06-02 19:24:21] [INFO ] Flow matrix only has 474 transitions (discarded 34 similar events)
[2024-06-02 19:24:21] [INFO ] Invariant cache hit.
[2024-06-02 19:24:21] [INFO ] State equation strengthened by 70 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 19:24:23] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
[2024-06-02 19:24:23] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-06-02 19:24:23] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 1 ms to minimize.
[2024-06-02 19:24:24] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-06-02 19:24:24] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:24:24] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-06-02 19:24:25] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:24:26] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 474/663 variables, 189/204 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/663 variables, 70/274 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 19:24:36] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:24:37] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/663 variables, 2/276 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/663 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 0/663 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 663/663 variables, and 276 constraints, problems are : Problem set: 0 solved, 502 unsolved in 28871 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (OVERLAPS) 474/663 variables, 189/206 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/663 variables, 70/276 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/663 variables, 502/778 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-02 19:24:57] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 2 ms to minimize.
[2024-06-02 19:24:57] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-06-02 19:24:58] [INFO ] Deduced a trap composed of 53 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:25:02] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/663 variables, 4/782 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/663 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 663/663 variables, and 782 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 189/189 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 14/14 constraints]
After SMT, in 59466ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 59477ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59936 ms. Remains : 189/189 places, 508/508 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 119 edges and 189 vertex of which 27 / 189 are part of one of the 6 SCC in 2 ms
Free SCC test removed 21 places
Drop transitions (Empty/Sink Transition effects.) removed 98 transitions
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 134 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 14 place count 168 transition count 361
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 0 with 1 rules applied. Total rules applied 15 place count 168 transition count 360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 167 transition count 360
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 167 transition count 359
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 166 transition count 359
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 165 transition count 359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 165 transition count 358
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 165 transition count 356
Free-agglomeration rule applied 5 times with reduction of 2 identical transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 28 place count 165 transition count 349
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 36 place count 160 transition count 346
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 37 place count 159 transition count 344
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 159 transition count 344
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 40 place count 159 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 41 place count 159 transition count 343
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 42 place count 158 transition count 342
Iterating global reduction 5 with 1 rules applied. Total rules applied 43 place count 158 transition count 342
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 44 place count 158 transition count 341
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 45 place count 157 transition count 340
Iterating global reduction 5 with 1 rules applied. Total rules applied 46 place count 157 transition count 340
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 47 place count 157 transition count 340
Applied a total of 47 rules in 96 ms. Remains 157 /189 variables (removed 32) and now considering 340/508 (removed 168) transitions.
Running SMT prover for 18 properties.
[2024-06-02 19:25:20] [INFO ] Flow matrix only has 339 transitions (discarded 1 similar events)
// Phase 1: matrix 339 rows 157 cols
[2024-06-02 19:25:20] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:25:21] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:25:21] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-06-02 19:25:21] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:25:21] [INFO ] After 346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
TRAPS : Iteration 0
[2024-06-02 19:25:21] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-06-02 19:25:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-06-02 19:25:21] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-06-02 19:25:21] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-06-02 19:25:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
TRAPS : Iteration 1
[2024-06-02 19:25:22] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-06-02 19:25:22] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
[2024-06-02 19:25:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
TRAPS : Iteration 2
[2024-06-02 19:25:23] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:25:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
TRAPS : Iteration 3
[2024-06-02 19:25:23] [INFO ] After 2338ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
[2024-06-02 19:25:23] [INFO ] After 2733ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Over-approximation ignoring read arcs solved 0 properties in 3053 ms.
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
FORMULA FireWire-PT-14-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:25:23] [INFO ] Flatten gal took : 28 ms
[2024-06-02 19:25:23] [INFO ] Flatten gal took : 28 ms
[2024-06-02 19:25:23] [INFO ] Input system was already deterministic with 530 transitions.
Computed a total of 58 stabilizing places and 136 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 530/530 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 196 transition count 520
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 196 transition count 520
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 196 transition count 518
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 194 transition count 512
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 194 transition count 512
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 192 transition count 508
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 192 transition count 508
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 191 transition count 505
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 191 transition count 505
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 190 transition count 503
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 190 transition count 503
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 189 transition count 500
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 189 transition count 500
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 188 transition count 498
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 188 transition count 498
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 187 transition count 495
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 187 transition count 495
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 186 transition count 493
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 186 transition count 493
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 185 transition count 490
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 185 transition count 490
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 184 transition count 488
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 184 transition count 488
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 183 transition count 486
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 183 transition count 486
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 182 transition count 484
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 182 transition count 484
Applied a total of 40 rules in 37 ms. Remains 182 /201 variables (removed 19) and now considering 484/530 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 182/201 places, 484/530 transitions.
[2024-06-02 19:25:24] [INFO ] Flatten gal took : 21 ms
[2024-06-02 19:25:24] [INFO ] Flatten gal took : 21 ms
[2024-06-02 19:25:24] [INFO ] Input system was already deterministic with 484 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 530/530 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 196 transition count 520
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 196 transition count 520
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 196 transition count 518
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 193 transition count 509
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 193 transition count 509
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 190 transition count 503
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 190 transition count 503
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 187 transition count 494
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 187 transition count 494
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 184 transition count 488
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 184 transition count 488
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 181 transition count 479
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 181 transition count 479
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 178 transition count 473
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 178 transition count 473
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 175 transition count 464
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 175 transition count 464
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 172 transition count 458
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 172 transition count 458
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 169 transition count 449
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 169 transition count 449
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 166 transition count 443
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 166 transition count 443
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 163 transition count 437
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 163 transition count 437
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 161 transition count 433
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 161 transition count 433
Applied a total of 82 rules in 31 ms. Remains 161 /201 variables (removed 40) and now considering 433/530 (removed 97) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 161/201 places, 433/530 transitions.
[2024-06-02 19:25:24] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:25:24] [INFO ] Flatten gal took : 19 ms
[2024-06-02 19:25:24] [INFO ] Input system was already deterministic with 433 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 530/530 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 198 transition count 524
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 198 transition count 524
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 198 transition count 523
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 196 transition count 517
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 196 transition count 517
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 194 transition count 513
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 194 transition count 513
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 192 transition count 507
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 192 transition count 507
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 190 transition count 503
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 190 transition count 503
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 188 transition count 497
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 188 transition count 497
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 186 transition count 493
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 186 transition count 493
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 184 transition count 487
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 184 transition count 487
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 182 transition count 483
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 182 transition count 483
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 180 transition count 477
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 180 transition count 477
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 178 transition count 473
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 178 transition count 473
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 177 transition count 471
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 177 transition count 471
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 176 transition count 469
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 176 transition count 469
Applied a total of 51 rules in 29 ms. Remains 176 /201 variables (removed 25) and now considering 469/530 (removed 61) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 176/201 places, 469/530 transitions.
[2024-06-02 19:25:24] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:25:24] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:25:24] [INFO ] Input system was already deterministic with 469 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 201/201 places, 530/530 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 200 transition count 526
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 197 transition count 526
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 10 place count 193 transition count 518
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 193 transition count 518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 193 transition count 517
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 190 transition count 508
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 190 transition count 508
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 187 transition count 502
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 187 transition count 502
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 184 transition count 493
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 184 transition count 493
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 181 transition count 487
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 181 transition count 487
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 178 transition count 478
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 178 transition count 478
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 175 transition count 472
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 175 transition count 472
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 172 transition count 463
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 172 transition count 463
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 169 transition count 457
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 169 transition count 457
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 65 place count 167 transition count 451
Iterating global reduction 1 with 2 rules applied. Total rules applied 67 place count 167 transition count 451
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 166 transition count 449
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 166 transition count 449
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 165 transition count 447
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 165 transition count 447
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 72 place count 164 transition count 445
Iterating global reduction 1 with 1 rules applied. Total rules applied 73 place count 164 transition count 445
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 79 place count 161 transition count 442
Applied a total of 79 rules in 65 ms. Remains 161 /201 variables (removed 40) and now considering 442/530 (removed 88) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 65 ms. Remains : 161/201 places, 442/530 transitions.
[2024-06-02 19:25:24] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:25:24] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:25:24] [INFO ] Input system was already deterministic with 442 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 530/530 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 197 transition count 522
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 197 transition count 522
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 197 transition count 520
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 195 transition count 514
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 195 transition count 514
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 193 transition count 510
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 193 transition count 510
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 192 transition count 507
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 192 transition count 507
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 191 transition count 505
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 191 transition count 505
Applied a total of 22 rules in 13 ms. Remains 191 /201 variables (removed 10) and now considering 505/530 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 191/201 places, 505/530 transitions.
[2024-06-02 19:25:24] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:25:24] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:25:24] [INFO ] Input system was already deterministic with 505 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 530/530 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 196 transition count 520
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 196 transition count 520
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 196 transition count 518
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 193 transition count 509
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 193 transition count 509
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 190 transition count 503
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 190 transition count 503
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 187 transition count 494
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 187 transition count 494
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 184 transition count 488
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 184 transition count 488
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 181 transition count 479
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 181 transition count 479
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 178 transition count 473
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 178 transition count 473
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 175 transition count 464
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 175 transition count 464
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 172 transition count 458
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 172 transition count 458
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 169 transition count 449
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 169 transition count 449
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 166 transition count 443
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 166 transition count 443
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 163 transition count 437
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 163 transition count 437
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 160 transition count 431
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 160 transition count 431
Applied a total of 84 rules in 27 ms. Remains 160 /201 variables (removed 41) and now considering 431/530 (removed 99) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 160/201 places, 431/530 transitions.
[2024-06-02 19:25:24] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:25:24] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:25:24] [INFO ] Input system was already deterministic with 431 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 530/530 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 196 transition count 520
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 196 transition count 520
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 196 transition count 518
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 193 transition count 509
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 193 transition count 509
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 190 transition count 503
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 190 transition count 503
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 188 transition count 497
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 188 transition count 497
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 186 transition count 493
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 186 transition count 493
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 184 transition count 487
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 184 transition count 487
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 182 transition count 483
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 182 transition count 483
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 180 transition count 477
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 180 transition count 477
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 178 transition count 473
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 178 transition count 473
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 176 transition count 467
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 176 transition count 467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 174 transition count 463
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 174 transition count 463
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 172 transition count 459
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 172 transition count 459
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 170 transition count 455
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 170 transition count 455
Applied a total of 64 rules in 27 ms. Remains 170 /201 variables (removed 31) and now considering 455/530 (removed 75) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 170/201 places, 455/530 transitions.
[2024-06-02 19:25:24] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:25:24] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:25:24] [INFO ] Input system was already deterministic with 455 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 530/530 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 196 transition count 520
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 196 transition count 520
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 196 transition count 518
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 193 transition count 509
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 193 transition count 509
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 191 transition count 505
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 191 transition count 505
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 189 transition count 499
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 189 transition count 499
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 187 transition count 495
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 187 transition count 495
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 185 transition count 489
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 185 transition count 489
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 183 transition count 485
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 183 transition count 485
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 182 transition count 482
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 182 transition count 482
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 181 transition count 480
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 181 transition count 480
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 180 transition count 477
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 180 transition count 477
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 179 transition count 475
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 179 transition count 475
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 178 transition count 473
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 178 transition count 473
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 177 transition count 471
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 177 transition count 471
Applied a total of 50 rules in 22 ms. Remains 177 /201 variables (removed 24) and now considering 471/530 (removed 59) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 177/201 places, 471/530 transitions.
[2024-06-02 19:25:24] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:25:24] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:25:24] [INFO ] Input system was already deterministic with 471 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 530/530 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 196 transition count 520
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 196 transition count 520
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 196 transition count 518
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 193 transition count 509
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 193 transition count 509
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 190 transition count 503
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 190 transition count 503
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 187 transition count 494
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 187 transition count 494
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 184 transition count 488
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 184 transition count 488
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 181 transition count 479
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 181 transition count 479
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 178 transition count 473
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 178 transition count 473
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 176 transition count 467
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 176 transition count 467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 174 transition count 463
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 174 transition count 463
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 172 transition count 457
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 172 transition count 457
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 170 transition count 453
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 170 transition count 453
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 66 place count 168 transition count 449
Iterating global reduction 1 with 2 rules applied. Total rules applied 68 place count 168 transition count 449
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 166 transition count 445
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 166 transition count 445
Applied a total of 72 rules in 19 ms. Remains 166 /201 variables (removed 35) and now considering 445/530 (removed 85) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 166/201 places, 445/530 transitions.
[2024-06-02 19:25:24] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:25:24] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:25:24] [INFO ] Input system was already deterministic with 445 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 201/201 places, 530/530 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 200 transition count 526
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 197 transition count 526
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 192 transition count 516
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 192 transition count 516
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 192 transition count 514
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 189 transition count 505
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 189 transition count 505
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 186 transition count 499
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 186 transition count 499
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 183 transition count 490
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 183 transition count 490
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 180 transition count 484
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 180 transition count 484
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 178 transition count 478
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 178 transition count 478
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 176 transition count 474
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 176 transition count 474
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 174 transition count 468
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 174 transition count 468
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 172 transition count 464
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 172 transition count 464
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 170 transition count 458
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 170 transition count 458
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 168 transition count 454
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 168 transition count 454
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 166 transition count 450
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 166 transition count 450
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 164 transition count 446
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 164 transition count 446
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 161 transition count 443
Applied a total of 80 rules in 46 ms. Remains 161 /201 variables (removed 40) and now considering 443/530 (removed 87) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 161/201 places, 443/530 transitions.
[2024-06-02 19:25:24] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:25:24] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:25:24] [INFO ] Input system was already deterministic with 443 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 201/201 places, 530/530 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 200 transition count 526
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 197 transition count 526
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 192 transition count 516
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 192 transition count 516
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 192 transition count 514
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 189 transition count 505
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 189 transition count 505
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 186 transition count 499
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 186 transition count 499
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 183 transition count 490
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 183 transition count 490
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 180 transition count 484
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 180 transition count 484
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 177 transition count 475
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 177 transition count 475
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 174 transition count 469
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 174 transition count 469
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 171 transition count 460
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 171 transition count 460
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 168 transition count 454
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 168 transition count 454
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 165 transition count 445
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 165 transition count 445
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 75 place count 162 transition count 439
Iterating global reduction 1 with 3 rules applied. Total rules applied 78 place count 162 transition count 439
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 159 transition count 433
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 159 transition count 433
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 87 place count 156 transition count 427
Iterating global reduction 1 with 3 rules applied. Total rules applied 90 place count 156 transition count 427
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 96 place count 153 transition count 424
Applied a total of 96 rules in 41 ms. Remains 153 /201 variables (removed 48) and now considering 424/530 (removed 106) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 153/201 places, 424/530 transitions.
[2024-06-02 19:25:25] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:25:25] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:25:25] [INFO ] Input system was already deterministic with 424 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 530/530 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 198 transition count 524
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 198 transition count 524
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 198 transition count 523
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 196 transition count 517
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 196 transition count 517
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 194 transition count 513
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 194 transition count 513
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 192 transition count 507
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 192 transition count 507
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 191 transition count 505
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 191 transition count 505
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 190 transition count 502
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 190 transition count 502
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 189 transition count 500
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 189 transition count 500
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 188 transition count 497
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 188 transition count 497
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 187 transition count 495
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 187 transition count 495
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 186 transition count 492
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 186 transition count 492
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 185 transition count 490
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 185 transition count 490
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 184 transition count 488
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 184 transition count 488
Applied a total of 35 rules in 18 ms. Remains 184 /201 variables (removed 17) and now considering 488/530 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 184/201 places, 488/530 transitions.
[2024-06-02 19:25:25] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:25:25] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:25:25] [INFO ] Input system was already deterministic with 488 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 530/530 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 196 transition count 520
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 196 transition count 520
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 196 transition count 518
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 194 transition count 512
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 194 transition count 512
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 192 transition count 508
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 192 transition count 508
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 190 transition count 502
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 190 transition count 502
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 188 transition count 498
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 188 transition count 498
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 186 transition count 492
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 186 transition count 492
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 185 transition count 490
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 185 transition count 490
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 184 transition count 487
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 184 transition count 487
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 183 transition count 485
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 183 transition count 485
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 182 transition count 482
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 182 transition count 482
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 181 transition count 480
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 181 transition count 480
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 180 transition count 478
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 180 transition count 478
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 179 transition count 476
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 179 transition count 476
Applied a total of 46 rules in 25 ms. Remains 179 /201 variables (removed 22) and now considering 476/530 (removed 54) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 179/201 places, 476/530 transitions.
[2024-06-02 19:25:25] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:25:25] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:25:25] [INFO ] Input system was already deterministic with 476 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 530/530 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 196 transition count 520
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 196 transition count 520
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 196 transition count 518
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 193 transition count 509
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 193 transition count 509
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 190 transition count 503
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 190 transition count 503
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 188 transition count 497
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 188 transition count 497
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 186 transition count 493
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 186 transition count 493
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 184 transition count 487
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 184 transition count 487
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 182 transition count 483
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 182 transition count 483
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 180 transition count 477
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 180 transition count 477
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 178 transition count 473
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 178 transition count 473
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 177 transition count 470
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 177 transition count 470
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 176 transition count 468
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 176 transition count 468
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 175 transition count 466
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 175 transition count 466
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 174 transition count 464
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 174 transition count 464
Applied a total of 56 rules in 19 ms. Remains 174 /201 variables (removed 27) and now considering 464/530 (removed 66) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 174/201 places, 464/530 transitions.
[2024-06-02 19:25:25] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:25:25] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:25:25] [INFO ] Input system was already deterministic with 464 transitions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 530/530 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 197 transition count 522
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 197 transition count 522
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 197 transition count 521
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 194 transition count 512
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 194 transition count 512
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 191 transition count 506
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 191 transition count 506
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 188 transition count 497
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 188 transition count 497
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 185 transition count 491
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 185 transition count 491
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 183 transition count 485
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 183 transition count 485
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 181 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 181 transition count 481
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 179 transition count 475
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 179 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 177 transition count 471
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 177 transition count 471
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 175 transition count 465
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 175 transition count 465
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 173 transition count 461
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 173 transition count 461
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 171 transition count 457
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 171 transition count 457
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 169 transition count 453
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 169 transition count 453
Applied a total of 65 rules in 19 ms. Remains 169 /201 variables (removed 32) and now considering 453/530 (removed 77) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 169/201 places, 453/530 transitions.
[2024-06-02 19:25:25] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:25:25] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:25:25] [INFO ] Input system was already deterministic with 453 transitions.
[2024-06-02 19:25:25] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:25:25] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:25:25] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-02 19:25:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 201 places, 530 transitions and 1975 arcs took 3 ms.
Total runtime 101129 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : FireWire-PT-14-CTLFireability-2024-00
Could not compute solution for formula : FireWire-PT-14-CTLFireability-2024-01
Could not compute solution for formula : FireWire-PT-14-CTLFireability-2024-02
Could not compute solution for formula : FireWire-PT-14-CTLFireability-2024-04
Could not compute solution for formula : FireWire-PT-14-CTLFireability-2024-05
Could not compute solution for formula : FireWire-PT-14-CTLFireability-2024-06
Could not compute solution for formula : FireWire-PT-14-CTLFireability-2024-07
Could not compute solution for formula : FireWire-PT-14-CTLFireability-2024-08
Could not compute solution for formula : FireWire-PT-14-CTLFireability-2024-09
Could not compute solution for formula : FireWire-PT-14-CTLFireability-2024-10
Could not compute solution for formula : FireWire-PT-14-CTLFireability-2024-11
Could not compute solution for formula : FireWire-PT-14-CTLFireability-2024-12
Could not compute solution for formula : FireWire-PT-14-CTLFireability-2024-13
Could not compute solution for formula : FireWire-PT-14-CTLFireability-2024-14
Could not compute solution for formula : FireWire-PT-14-CTLFireability-2024-15

BK_STOP 1717356325857

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name FireWire-PT-14-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/694/ctl_0_
ctl formula name FireWire-PT-14-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/694/ctl_1_
ctl formula name FireWire-PT-14-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/694/ctl_2_
ctl formula name FireWire-PT-14-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/694/ctl_3_
ctl formula name FireWire-PT-14-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/694/ctl_4_
ctl formula name FireWire-PT-14-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/694/ctl_5_
ctl formula name FireWire-PT-14-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/694/ctl_6_
ctl formula name FireWire-PT-14-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/694/ctl_7_
ctl formula name FireWire-PT-14-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/694/ctl_8_
ctl formula name FireWire-PT-14-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/694/ctl_9_
ctl formula name FireWire-PT-14-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/694/ctl_10_
ctl formula name FireWire-PT-14-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/694/ctl_11_
ctl formula name FireWire-PT-14-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/694/ctl_12_
ctl formula name FireWire-PT-14-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/694/ctl_13_
ctl formula name FireWire-PT-14-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/694/ctl_14_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-14"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FireWire-PT-14, 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 r553-tall-171734901300274"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-14.tgz
mv FireWire-PT-14 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;