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.r549-tall-171734898200273.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 greatspnxred
Input is FireWire-PT-14, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898200273
=====================================================================

--------------------
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-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-14-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-14-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-14-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-14-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-14-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-14-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-14-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-14-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-14-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-14-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-14-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-14-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-14-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-14-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-14-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717370203989

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 23:16:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 23:16:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:16:45] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2024-06-02 23:16:45] [INFO ] Transformed 205 places.
[2024-06-02 23:16:45] [INFO ] Transformed 610 transitions.
[2024-06-02 23:16:45] [INFO ] Found NUPN structural information;
[2024-06-02 23:16:45] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2315 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Ensure Unique test removed 71 transitions
Reduce redundant transitions removed 71 transitions.
Support contains 69 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 539/539 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 202 transition count 533
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 202 transition count 533
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 202 transition count 532
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 201 transition count 529
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 201 transition count 529
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 200 transition count 527
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 200 transition count 527
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 17 place count 200 transition count 521
Applied a total of 17 rules in 62 ms. Remains 200 /205 variables (removed 5) and now considering 521/539 (removed 18) transitions.
[2024-06-02 23:16:45] [INFO ] Flow matrix only has 489 transitions (discarded 32 similar events)
// Phase 1: matrix 489 rows 200 cols
[2024-06-02 23:16:45] [INFO ] Computed 10 invariants in 20 ms
[2024-06-02 23:16:45] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-06-02 23:16:45] [INFO ] Flow matrix only has 489 transitions (discarded 32 similar events)
[2024-06-02 23:16:45] [INFO ] Invariant cache hit.
[2024-06-02 23:16:46] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-06-02 23:16:46] [INFO ] Implicit Places using invariants and state equation in 370 ms returned [21, 82, 145]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 704 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 197/205 places, 521/539 transitions.
Applied a total of 0 rules in 5 ms. Remains 197 /197 variables (removed 0) and now considering 521/521 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 796 ms. Remains : 197/205 places, 521/539 transitions.
Support contains 69 out of 197 places after structural reductions.
[2024-06-02 23:16:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 23:16:46] [INFO ] Flatten gal took : 70 ms
[2024-06-02 23:16:46] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA FireWire-PT-14-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-14-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-14-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 23:16:46] [INFO ] Flatten gal took : 35 ms
[2024-06-02 23:16:46] [INFO ] Input system was already deterministic with 521 transitions.
Support contains 56 out of 197 places (down from 69) after GAL structural reductions.
RANDOM walk for 40000 steps (1181 resets) in 2305 ms. (17 steps per ms) remains 11/39 properties
BEST_FIRST walk for 40003 steps (262 resets) in 318 ms. (125 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (257 resets) in 101 ms. (392 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (229 resets) in 95 ms. (416 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (232 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (247 resets) in 124 ms. (320 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (255 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (233 resets) in 89 ms. (444 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (232 resets) in 124 ms. (320 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (244 resets) in 120 ms. (330 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (247 resets) in 85 ms. (465 steps per ms) remains 10/10 properties
[2024-06-02 23:16:47] [INFO ] Flow matrix only has 489 transitions (discarded 32 similar events)
// Phase 1: matrix 489 rows 197 cols
[2024-06-02 23:16:47] [INFO ] Computed 7 invariants in 13 ms
[2024-06-02 23:16:47] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 152/167 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 23:16:48] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 4 ms to minimize.
[2024-06-02 23:16:48] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 15/182 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 23:16:48] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 476/658 variables, 182/192 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/658 variables, 68/260 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/658 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 27/685 variables, 15/275 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/685 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 23:16:48] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 2 ms to minimize.
[2024-06-02 23:16:49] [INFO ] Deduced a trap composed of 66 places in 110 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/685 variables, 2/280 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/685 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 1/686 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/686 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 0/686 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 686/686 variables, and 281 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1572 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 197/197 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 152/167 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 15/182 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-02 23:16:49] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 476/658 variables, 182/195 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/658 variables, 68/263 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/658 variables, 7/270 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/658 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 27/685 variables, 15/285 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/685 variables, 3/288 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/685 variables, 3/291 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/685 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 1/686 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/686 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 0/686 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 686/686 variables, and 292 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1372 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 197/197 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 6/6 constraints]
After SMT, in 3027ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 2351 ms.
Support contains 15 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 521/521 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 197 transition count 518
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 197 transition count 515
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 194 transition count 515
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 191 transition count 508
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 191 transition count 508
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 191 transition count 506
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 23 place count 188 transition count 503
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 25 place count 187 transition count 505
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 27 place count 187 transition count 503
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 187 transition count 502
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 31 place count 187 transition count 545
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 40 place count 184 transition count 539
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 4 with 21 rules applied. Total rules applied 61 place count 184 transition count 518
Applied a total of 61 rules in 126 ms. Remains 184 /197 variables (removed 13) and now considering 518/521 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 127 ms. Remains : 184/197 places, 518/521 transitions.
RANDOM walk for 40000 steps (1273 resets) in 863 ms. (46 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (299 resets) in 117 ms. (339 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (258 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (275 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (269 resets) in 271 ms. (147 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (260 resets) in 399 ms. (100 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (260 resets) in 55 ms. (714 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (294 resets) in 69 ms. (571 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (274 resets) in 47 ms. (833 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (292 resets) in 39 ms. (1000 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (280 resets) in 41 ms. (952 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 394780 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :1 out of 10
Probabilistic random walk after 394780 steps, saw 120187 distinct states, run finished after 3006 ms. (steps per millisecond=131 ) properties seen :1
[2024-06-02 23:16:57] [INFO ] Flow matrix only has 485 transitions (discarded 33 similar events)
// Phase 1: matrix 485 rows 184 cols
[2024-06-02 23:16:57] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:16:57] [INFO ] State equation strengthened by 76 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 148/160 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 23:16:57] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-06-02 23:16:57] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 15/175 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 23:16:57] [INFO ] Deduced a trap composed of 35 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 479/654 variables, 175/185 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/654 variables, 73/258 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/654 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 15/669 variables, 9/267 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 3/270 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/669 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 23:16:58] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/669 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/669 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/669 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 669/669 variables, and 271 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1078 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 148/160 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 15/175 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 23:16:58] [INFO ] Deduced a trap composed of 105 places in 92 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 23:16:58] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/175 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/175 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 479/654 variables, 175/188 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/654 variables, 73/261 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/654 variables, 6/267 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/654 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 15/669 variables, 9/276 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/669 variables, 3/279 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/669 variables, 3/282 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 23:16:59] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/669 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 23:16:59] [INFO ] Deduced a trap composed of 51 places in 93 ms of which 2 ms to minimize.
[2024-06-02 23:16:59] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/669 variables, 2/285 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/669 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 0/669 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 669/669 variables, and 285 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1712 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 184/184 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 9/9 constraints]
After SMT, in 2811ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 1690 ms.
Support contains 12 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 518/518 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 182 transition count 513
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 182 transition count 513
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 180 transition count 508
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 180 transition count 508
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 180 transition count 510
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 12 place count 179 transition count 508
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 179 transition count 506
Applied a total of 14 rules in 51 ms. Remains 179 /184 variables (removed 5) and now considering 506/518 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 179/184 places, 506/518 transitions.
RANDOM walk for 40000 steps (1209 resets) in 222 ms. (179 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (309 resets) in 57 ms. (689 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (279 resets) in 55 ms. (714 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (289 resets) in 61 ms. (645 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (254 resets) in 56 ms. (701 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (267 resets) in 56 ms. (701 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (267 resets) in 54 ms. (727 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (284 resets) in 58 ms. (678 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (266 resets) in 76 ms. (519 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (288 resets) in 56 ms. (701 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 405499 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :0 out of 9
Probabilistic random walk after 405499 steps, saw 122909 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
[2024-06-02 23:17:05] [INFO ] Flow matrix only has 472 transitions (discarded 34 similar events)
// Phase 1: matrix 472 rows 179 cols
[2024-06-02 23:17:05] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 23:17:05] [INFO ] State equation strengthened by 74 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 143/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 23:17:05] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:17:05] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 15/170 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 23:17:05] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 2 ms to minimize.
[2024-06-02 23:17:05] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:17:05] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 466/636 variables, 170/182 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/636 variables, 71/253 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 23:17:06] [INFO ] Deduced a trap composed of 66 places in 93 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/636 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 23:17:06] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/636 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/636 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 15/651 variables, 9/264 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/651 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/651 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/651 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 651/651 variables, and 267 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1374 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 179/179 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 143/155 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 15/170 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 23:17:06] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 466/636 variables, 170/185 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/636 variables, 71/256 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/636 variables, 6/262 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/636 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 15/651 variables, 9/271 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/651 variables, 3/274 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/651 variables, 3/277 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/651 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/651 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 651/651 variables, and 277 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1026 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 179/179 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 8/8 constraints]
After SMT, in 2430ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 1 properties in 1491 ms.
Support contains 10 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 506/506 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 178 transition count 508
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 178 transition count 506
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 178 transition count 505
Applied a total of 5 rules in 27 ms. Remains 178 /179 variables (removed 1) and now considering 505/506 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 178/179 places, 505/506 transitions.
RANDOM walk for 40000 steps (1232 resets) in 269 ms. (148 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (293 resets) in 70 ms. (563 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (270 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (284 resets) in 86 ms. (459 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (284 resets) in 54 ms. (727 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (283 resets) in 65 ms. (606 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (276 resets) in 67 ms. (588 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (279 resets) in 47 ms. (833 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (261 resets) in 48 ms. (816 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 369415 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 8
Probabilistic random walk after 369415 steps, saw 114059 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
[2024-06-02 23:17:12] [INFO ] Flow matrix only has 469 transitions (discarded 36 similar events)
// Phase 1: matrix 469 rows 178 cols
[2024-06-02 23:17:12] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:17:12] [INFO ] State equation strengthened by 74 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 141/151 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 23:17:12] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 18/169 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 23:17:12] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-06-02 23:17:12] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 0 ms to minimize.
[2024-06-02 23:17:12] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 463/632 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/632 variables, 71/251 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 23:17:13] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/632 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/632 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 15/647 variables, 9/261 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/647 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/647 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/647 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 647/647 variables, and 264 constraints, problems are : Problem set: 0 solved, 8 unsolved in 980 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/178 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 141/151 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 18/169 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 23:17:13] [INFO ] Deduced a trap composed of 102 places in 94 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 463/632 variables, 169/182 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/632 variables, 71/253 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/632 variables, 6/259 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/632 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 15/647 variables, 9/268 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/647 variables, 3/271 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/647 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 23:17:14] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/647 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/647 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/647 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 647/647 variables, and 274 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1170 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/178 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 7/7 constraints]
After SMT, in 2179ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 2545 ms.
Support contains 10 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 505/505 transitions.
Applied a total of 0 rules in 9 ms. Remains 178 /178 variables (removed 0) and now considering 505/505 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 178/178 places, 505/505 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 505/505 transitions.
Applied a total of 0 rules in 9 ms. Remains 178 /178 variables (removed 0) and now considering 505/505 (removed 0) transitions.
[2024-06-02 23:17:17] [INFO ] Flow matrix only has 469 transitions (discarded 36 similar events)
[2024-06-02 23:17:17] [INFO ] Invariant cache hit.
[2024-06-02 23:17:17] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-06-02 23:17:17] [INFO ] Flow matrix only has 469 transitions (discarded 36 similar events)
[2024-06-02 23:17:17] [INFO ] Invariant cache hit.
[2024-06-02 23:17:17] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-06-02 23:17:17] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
[2024-06-02 23:17:17] [INFO ] Redundant transitions in 25 ms returned []
Running 504 sub problems to find dead transitions.
[2024-06-02 23:17:17] [INFO ] Flow matrix only has 469 transitions (discarded 36 similar events)
[2024-06-02 23:17:17] [INFO ] Invariant cache hit.
[2024-06-02 23:17:17] [INFO ] State equation strengthened by 74 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 504 unsolved
[2024-06-02 23:17:21] [INFO ] Deduced a trap composed of 69 places in 97 ms of which 1 ms to minimize.
[2024-06-02 23:17:21] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
[2024-06-02 23:17:22] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2024-06-02 23:17:22] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
[2024-06-02 23:17:22] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 5 ms to minimize.
[2024-06-02 23:17:23] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 1 ms to minimize.
[2024-06-02 23:17:23] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 0 ms to minimize.
[2024-06-02 23:17:23] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
[2024-06-02 23:17:23] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 0 ms to minimize.
[2024-06-02 23:17:24] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 4 (OVERLAPS) 469/647 variables, 178/195 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/647 variables, 74/269 constraints. Problems are: Problem set: 0 solved, 504 unsolved
[2024-06-02 23:17:29] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-06-02 23:17:31] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2024-06-02 23:17:32] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:17:33] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/647 variables, 4/273 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/647 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 8 (OVERLAPS) 0/647 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 504 unsolved
No progress, stopping.
After SMT solving in domain Real declared 647/647 variables, and 273 constraints, problems are : Problem set: 0 solved, 504 unsolved in 28193 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/178 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 504/504 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 504 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 4 (OVERLAPS) 469/647 variables, 178/199 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/647 variables, 74/273 constraints. Problems are: Problem set: 0 solved, 504 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/647 variables, 504/777 constraints. Problems are: Problem set: 0 solved, 504 unsolved
[2024-06-02 23:17:57] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/647 variables, 1/778 constraints. Problems are: Problem set: 0 solved, 504 unsolved
[2024-06-02 23:18:14] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 647/647 variables, and 779 constraints, problems are : Problem set: 0 solved, 504 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 178/178 constraints, ReadFeed: 74/74 constraints, PredecessorRefiner: 504/504 constraints, Known Traps: 16/16 constraints]
After SMT, in 58927ms problems are : Problem set: 0 solved, 504 unsolved
Search for dead transitions found 0 dead transitions in 58935ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59546 ms. Remains : 178/178 places, 505/505 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 126 edges and 178 vertex of which 16 / 178 are part of one of the 3 SCC in 2 ms
Free SCC test removed 13 places
Drop transitions (Empty/Sink Transition effects.) removed 69 transitions
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 111 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 164 transition count 393
Drop transitions (Redundant composition of simpler transitions.) removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 0 with 31 rules applied. Total rules applied 34 place count 164 transition count 362
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 35 place count 164 transition count 361
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 37 place count 163 transition count 360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 162 transition count 360
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 38 place count 162 transition count 359
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 161 transition count 359
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 44 place count 159 transition count 357
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 46 place count 159 transition count 355
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 158 transition count 354
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 157 transition count 301
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 157 transition count 301
Free-agglomeration rule applied 12 times with reduction of 12 identical transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 62 place count 157 transition count 277
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 80 place count 145 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 82 place count 145 transition count 269
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 83 place count 145 transition count 270
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 88 place count 144 transition count 266
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 92 place count 144 transition count 266
Applied a total of 92 rules in 65 ms. Remains 144 /178 variables (removed 34) and now considering 266/505 (removed 239) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 266 rows 144 cols
[2024-06-02 23:18:16] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:18:16] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-06-02 23:18:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:18:17] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-06-02 23:18:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 23:18:17] [INFO ] After 67ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2024-06-02 23:18:17] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-06-02 23:18:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-06-02 23:18:17] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-06-02 23:18:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2024-06-02 23:18:17] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-06-02 23:18:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-06-02 23:18:17] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-06-02 23:18:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
TRAPS : Iteration 1
[2024-06-02 23:18:17] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-02 23:18:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
TRAPS : Iteration 2
[2024-06-02 23:18:17] [INFO ] After 707ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2024-06-02 23:18:17] [INFO ] After 961ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Over-approximation ignoring read arcs solved 0 properties in 1095 ms.
[2024-06-02 23:18:17] [INFO ] Flatten gal took : 29 ms
[2024-06-02 23:18:17] [INFO ] Flatten gal took : 27 ms
[2024-06-02 23:18:17] [INFO ] Input system was already deterministic with 521 transitions.
Computed a total of 54 stabilizing places and 127 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 521/521 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 192 transition count 509
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 192 transition count 509
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 192 transition count 507
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 189 transition count 500
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 189 transition count 500
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 186 transition count 492
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 186 transition count 492
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 183 transition count 485
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 183 transition count 485
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 180 transition count 477
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 180 transition count 477
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 177 transition count 470
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 177 transition count 470
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 174 transition count 462
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 174 transition count 462
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 171 transition count 455
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 171 transition count 455
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 168 transition count 448
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 168 transition count 448
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 165 transition count 441
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 165 transition count 441
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 163 transition count 437
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 163 transition count 437
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 161 transition count 433
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 161 transition count 433
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 160 transition count 431
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 160 transition count 431
Applied a total of 76 rules in 33 ms. Remains 160 /197 variables (removed 37) and now considering 431/521 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 160/197 places, 431/521 transitions.
[2024-06-02 23:18:18] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:18:18] [INFO ] Flatten gal took : 18 ms
[2024-06-02 23:18:18] [INFO ] Input system was already deterministic with 431 transitions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 521/521 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 192 transition count 509
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 192 transition count 509
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 192 transition count 507
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 189 transition count 500
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 189 transition count 500
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 186 transition count 492
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 186 transition count 492
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 183 transition count 485
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 183 transition count 485
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 180 transition count 477
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 180 transition count 477
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 177 transition count 470
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 177 transition count 470
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 174 transition count 462
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 174 transition count 462
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 171 transition count 455
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 171 transition count 455
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 168 transition count 448
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 168 transition count 448
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 62 place count 166 transition count 444
Iterating global reduction 1 with 2 rules applied. Total rules applied 64 place count 166 transition count 444
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 165 transition count 442
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 165 transition count 442
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 164 transition count 440
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 164 transition count 440
Applied a total of 68 rules in 29 ms. Remains 164 /197 variables (removed 33) and now considering 440/521 (removed 81) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 164/197 places, 440/521 transitions.
[2024-06-02 23:18:18] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:18:18] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:18:18] [INFO ] Input system was already deterministic with 440 transitions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 521/521 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 193 transition count 511
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 193 transition count 511
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 193 transition count 510
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 190 transition count 503
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 190 transition count 503
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 187 transition count 495
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 187 transition count 495
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 184 transition count 488
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 184 transition count 488
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 181 transition count 480
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 181 transition count 480
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 178 transition count 473
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 178 transition count 473
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 175 transition count 465
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 175 transition count 465
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 173 transition count 460
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 173 transition count 460
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 171 transition count 456
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 171 transition count 456
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 169 transition count 451
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 169 transition count 451
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 168 transition count 449
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 168 transition count 449
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 167 transition count 447
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 167 transition count 447
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 166 transition count 445
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 166 transition count 445
Applied a total of 63 rules in 32 ms. Remains 166 /197 variables (removed 31) and now considering 445/521 (removed 76) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 166/197 places, 445/521 transitions.
[2024-06-02 23:18:18] [INFO ] Flatten gal took : 16 ms
[2024-06-02 23:18:18] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:18:18] [INFO ] Input system was already deterministic with 445 transitions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 521/521 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 192 transition count 509
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 192 transition count 509
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 192 transition count 507
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 189 transition count 500
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 189 transition count 500
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 186 transition count 492
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 186 transition count 492
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 183 transition count 485
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 183 transition count 485
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 180 transition count 477
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 180 transition count 477
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 177 transition count 470
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 177 transition count 470
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 174 transition count 462
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 174 transition count 462
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 171 transition count 455
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 171 transition count 455
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 168 transition count 448
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 168 transition count 448
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 165 transition count 441
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 165 transition count 441
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 163 transition count 437
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 163 transition count 437
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 161 transition count 433
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 161 transition count 433
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 160 transition count 431
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 160 transition count 431
Applied a total of 76 rules in 30 ms. Remains 160 /197 variables (removed 37) and now considering 431/521 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 160/197 places, 431/521 transitions.
[2024-06-02 23:18:18] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:18:18] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:18:18] [INFO ] Input system was already deterministic with 431 transitions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 521/521 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 193 transition count 512
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 193 transition count 512
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 193 transition count 510
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 191 transition count 505
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 191 transition count 505
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 189 transition count 500
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 189 transition count 500
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 187 transition count 495
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 187 transition count 495
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 185 transition count 490
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 185 transition count 490
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 183 transition count 485
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 183 transition count 485
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 181 transition count 480
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 181 transition count 480
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 179 transition count 475
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 179 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 177 transition count 470
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 177 transition count 470
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 175 transition count 465
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 175 transition count 465
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 173 transition count 461
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 173 transition count 461
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 171 transition count 457
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 171 transition count 457
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 170 transition count 455
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 170 transition count 455
Applied a total of 56 rules in 31 ms. Remains 170 /197 variables (removed 27) and now considering 455/521 (removed 66) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 170/197 places, 455/521 transitions.
[2024-06-02 23:18:18] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:18:18] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:18:18] [INFO ] Input system was already deterministic with 455 transitions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 521/521 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 193 transition count 511
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 193 transition count 511
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 193 transition count 510
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 191 transition count 505
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 191 transition count 505
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 190 transition count 502
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 190 transition count 502
Applied a total of 15 rules in 10 ms. Remains 190 /197 variables (removed 7) and now considering 502/521 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 190/197 places, 502/521 transitions.
[2024-06-02 23:18:18] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:18:18] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:18:18] [INFO ] Input system was already deterministic with 502 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 197/197 places, 521/521 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 196 transition count 517
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 193 transition count 517
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 188 transition count 505
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 188 transition count 505
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 188 transition count 503
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 186 transition count 498
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 186 transition count 498
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 185 transition count 496
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 185 transition count 496
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 184 transition count 493
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 184 transition count 493
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 183 transition count 491
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 183 transition count 491
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 182 transition count 488
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 182 transition count 488
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 181 transition count 486
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 181 transition count 486
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 180 transition count 483
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 180 transition count 483
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 179 transition count 481
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 179 transition count 481
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 178 transition count 478
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 178 transition count 478
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 177 transition count 476
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 177 transition count 476
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 176 transition count 474
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 176 transition count 474
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 175 transition count 472
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 175 transition count 472
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 172 transition count 469
Applied a total of 50 rules in 69 ms. Remains 172 /197 variables (removed 25) and now considering 469/521 (removed 52) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 70 ms. Remains : 172/197 places, 469/521 transitions.
[2024-06-02 23:18:18] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:18:18] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:18:18] [INFO ] Input system was already deterministic with 469 transitions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 521/521 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 192 transition count 509
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 192 transition count 509
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 192 transition count 507
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 189 transition count 500
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 189 transition count 500
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 186 transition count 492
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 186 transition count 492
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 183 transition count 485
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 183 transition count 485
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 180 transition count 477
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 180 transition count 477
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 178 transition count 472
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 178 transition count 472
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 176 transition count 467
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 176 transition count 467
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 45 place count 175 transition count 464
Iterating global reduction 1 with 1 rules applied. Total rules applied 46 place count 175 transition count 464
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 174 transition count 462
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 174 transition count 462
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 173 transition count 459
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 173 transition count 459
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 172 transition count 457
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 172 transition count 457
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 171 transition count 455
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 171 transition count 455
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 170 transition count 453
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 170 transition count 453
Applied a total of 56 rules in 23 ms. Remains 170 /197 variables (removed 27) and now considering 453/521 (removed 68) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 170/197 places, 453/521 transitions.
[2024-06-02 23:18:18] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:18:18] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:18:18] [INFO ] Input system was already deterministic with 453 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 197/197 places, 521/521 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 196 transition count 517
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 193 transition count 517
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 11 place count 188 transition count 505
Iterating global reduction 0 with 5 rules applied. Total rules applied 16 place count 188 transition count 505
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 188 transition count 503
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 185 transition count 496
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 185 transition count 496
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 182 transition count 488
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 182 transition count 488
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 180 transition count 484
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 180 transition count 484
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 178 transition count 478
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 178 transition count 478
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 176 transition count 474
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 176 transition count 474
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 174 transition count 468
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 174 transition count 468
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 172 transition count 464
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 172 transition count 464
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 170 transition count 459
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 170 transition count 459
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 168 transition count 455
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 168 transition count 455
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 167 transition count 453
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 167 transition count 453
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 166 transition count 451
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 166 transition count 451
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 68 place count 163 transition count 448
Applied a total of 68 rules in 49 ms. Remains 163 /197 variables (removed 34) and now considering 448/521 (removed 73) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49 ms. Remains : 163/197 places, 448/521 transitions.
[2024-06-02 23:18:18] [INFO ] Flatten gal took : 17 ms
[2024-06-02 23:18:18] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:18:18] [INFO ] Input system was already deterministic with 448 transitions.
RANDOM walk for 18985 steps (597 resets) in 170 ms. (111 steps per ms) remains 0/1 properties
FORMULA FireWire-PT-14-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 521/521 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 193 transition count 511
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 193 transition count 511
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 193 transition count 509
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 191 transition count 505
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 191 transition count 505
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 189 transition count 499
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 189 transition count 499
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 187 transition count 495
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 187 transition count 495
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 185 transition count 489
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 185 transition count 489
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 183 transition count 485
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 183 transition count 485
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 181 transition count 479
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 181 transition count 479
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 179 transition count 475
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 179 transition count 475
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 177 transition count 470
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 177 transition count 470
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 175 transition count 466
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 175 transition count 466
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 174 transition count 464
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 174 transition count 464
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 173 transition count 462
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 173 transition count 462
Applied a total of 50 rules in 24 ms. Remains 173 /197 variables (removed 24) and now considering 462/521 (removed 59) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 173/197 places, 462/521 transitions.
[2024-06-02 23:18:18] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:18:19] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:18:19] [INFO ] Input system was already deterministic with 462 transitions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 521/521 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 192 transition count 509
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 192 transition count 509
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 192 transition count 507
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 189 transition count 500
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 189 transition count 500
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 186 transition count 492
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 186 transition count 492
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 183 transition count 485
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 183 transition count 485
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 180 transition count 477
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 180 transition count 477
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 177 transition count 470
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 177 transition count 470
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 45 place count 174 transition count 462
Iterating global reduction 1 with 3 rules applied. Total rules applied 48 place count 174 transition count 462
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 171 transition count 455
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 171 transition count 455
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 168 transition count 448
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 168 transition count 448
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 165 transition count 441
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 165 transition count 441
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 163 transition count 437
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 163 transition count 437
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 72 place count 161 transition count 433
Iterating global reduction 1 with 2 rules applied. Total rules applied 74 place count 161 transition count 433
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 160 transition count 431
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 160 transition count 431
Applied a total of 76 rules in 22 ms. Remains 160 /197 variables (removed 37) and now considering 431/521 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 160/197 places, 431/521 transitions.
[2024-06-02 23:18:19] [INFO ] Flatten gal took : 11 ms
[2024-06-02 23:18:19] [INFO ] Flatten gal took : 13 ms
[2024-06-02 23:18:19] [INFO ] Input system was already deterministic with 431 transitions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 521/521 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 194 transition count 514
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 194 transition count 514
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 194 transition count 512
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 193 transition count 510
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 193 transition count 510
Applied a total of 10 rules in 6 ms. Remains 193 /197 variables (removed 4) and now considering 510/521 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 193/197 places, 510/521 transitions.
[2024-06-02 23:18:19] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:18:19] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:18:19] [INFO ] Input system was already deterministic with 510 transitions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 521/521 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 192 transition count 509
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 192 transition count 509
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 192 transition count 507
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 190 transition count 502
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 190 transition count 502
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 188 transition count 497
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 188 transition count 497
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 186 transition count 492
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 186 transition count 492
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 184 transition count 487
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 184 transition count 487
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 183 transition count 484
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 183 transition count 484
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 182 transition count 482
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 182 transition count 482
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 181 transition count 479
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 181 transition count 479
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 180 transition count 477
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 180 transition count 477
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 179 transition count 474
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 179 transition count 474
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 178 transition count 472
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 178 transition count 472
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 177 transition count 470
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 177 transition count 470
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 176 transition count 468
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 176 transition count 468
Applied a total of 44 rules in 23 ms. Remains 176 /197 variables (removed 21) and now considering 468/521 (removed 53) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 176/197 places, 468/521 transitions.
[2024-06-02 23:18:19] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:18:19] [INFO ] Flatten gal took : 12 ms
[2024-06-02 23:18:19] [INFO ] Input system was already deterministic with 468 transitions.
[2024-06-02 23:18:19] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:18:19] [INFO ] Flatten gal took : 14 ms
[2024-06-02 23:18:19] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-02 23:18:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 197 places, 521 transitions and 1945 arcs took 3 ms.
Total runtime 94170 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-14

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 197
TRANSITIONS: 521
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.010s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.001s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 754
MODEL NAME: /home/mcc/execution/412/model
197 places, 521 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA FireWire-PT-14-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-14-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-14-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-14-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-14-CTLCardinality-2024-03 CANNOT_COMPUTE
FORMULA FireWire-PT-14-CTLCardinality-2024-06 CANNOT_COMPUTE
FORMULA FireWire-PT-14-CTLCardinality-2024-07 CANNOT_COMPUTE
FORMULA FireWire-PT-14-CTLCardinality-2024-08 CANNOT_COMPUTE
FORMULA FireWire-PT-14-CTLCardinality-2024-10 CANNOT_COMPUTE
FORMULA FireWire-PT-14-CTLCardinality-2024-11 CANNOT_COMPUTE
FORMULA FireWire-PT-14-CTLCardinality-2024-14 CANNOT_COMPUTE
FORMULA FireWire-PT-14-CTLCardinality-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717371193463

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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="CTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is FireWire-PT-14, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r549-tall-171734898200273"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;