fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r549-tall-171734898100225
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for FireWire-PT-08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1479.987 131127.00 249664.00 252.50 TTTFFTTTFTFFTTFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r549-tall-171734898100225.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-08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898100225
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K 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 97K 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-08-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-08-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717366421185

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-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:13:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 22:13:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:13:42] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-06-02 22:13:42] [INFO ] Transformed 127 places.
[2024-06-02 22:13:42] [INFO ] Transformed 397 transitions.
[2024-06-02 22:13:42] [INFO ] Found NUPN structural information;
[2024-06-02 22:13:42] [INFO ] Parsed PT model containing 127 places and 397 transitions and 1475 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Support contains 87 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 344/344 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 336
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 336
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 124 transition count 335
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 13 place count 124 transition count 329
Applied a total of 13 rules in 31 ms. Remains 124 /127 variables (removed 3) and now considering 329/344 (removed 15) transitions.
[2024-06-02 22:13:42] [INFO ] Flow matrix only has 303 transitions (discarded 26 similar events)
// Phase 1: matrix 303 rows 124 cols
[2024-06-02 22:13:42] [INFO ] Computed 8 invariants in 17 ms
[2024-06-02 22:13:42] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-06-02 22:13:42] [INFO ] Flow matrix only has 303 transitions (discarded 26 similar events)
[2024-06-02 22:13:42] [INFO ] Invariant cache hit.
[2024-06-02 22:13:42] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-06-02 22:13:43] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2024-06-02 22:13:43] [INFO ] Flow matrix only has 303 transitions (discarded 26 similar events)
[2024-06-02 22:13:43] [INFO ] Invariant cache hit.
[2024-06-02 22:13:43] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 328 unsolved
[2024-06-02 22:13:45] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 5 ms to minimize.
[2024-06-02 22:13:45] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 2 ms to minimize.
[2024-06-02 22:13:45] [INFO ] Deduced a trap composed of 42 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:13:45] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:13:45] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-06-02 22:13:46] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:13:46] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:13:46] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (OVERLAPS) 302/426 variables, 124/140 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 42/182 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (OVERLAPS) 1/427 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (OVERLAPS) 0/427 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 328 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 183 constraints, problems are : Problem set: 0 solved, 328 unsolved in 14246 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 328 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 4 (OVERLAPS) 302/426 variables, 124/140 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 42/182 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 328/510 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 8 (OVERLAPS) 1/427 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 10 (OVERLAPS) 0/427 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 328 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 511 constraints, problems are : Problem set: 0 solved, 328 unsolved in 28357 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 8/8 constraints]
After SMT, in 43001ms problems are : Problem set: 0 solved, 328 unsolved
Search for dead transitions found 0 dead transitions in 43025ms
Starting structural reductions in LTL mode, iteration 1 : 124/127 places, 329/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43520 ms. Remains : 124/127 places, 329/344 transitions.
Support contains 87 out of 124 places after structural reductions.
[2024-06-02 22:14:26] [INFO ] Flatten gal took : 75 ms
[2024-06-02 22:14:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FireWire-PT-08-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 22:14:26] [INFO ] Flatten gal took : 24 ms
[2024-06-02 22:14:26] [INFO ] Input system was already deterministic with 329 transitions.
Support contains 79 out of 124 places (down from 87) after GAL structural reductions.
RANDOM walk for 40000 steps (2184 resets) in 2839 ms. (14 steps per ms) remains 26/60 properties
BEST_FIRST walk for 4003 steps (38 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (35 resets) in 82 ms. (48 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (61 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (55 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (53 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (63 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (63 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (70 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (59 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (62 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (65 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (47 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (47 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (39 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (54 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (63 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (59 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (61 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (57 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (53 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (61 resets) in 10 ms. (363 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (51 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (46 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (48 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (58 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (65 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
[2024-06-02 22:14:27] [INFO ] Flow matrix only has 303 transitions (discarded 26 similar events)
[2024-06-02 22:14:27] [INFO ] Invariant cache hit.
[2024-06-02 22:14:27] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 83/123 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 302/425 variables, 123/131 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 1/426 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 1/427 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 0/427 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 175 constraints, problems are : Problem set: 0 solved, 26 unsolved in 1029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 83/123 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-02 22:14:29] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-06-02 22:14:29] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-06-02 22:14:29] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-02 22:14:29] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 302/425 variables, 123/135 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 42/177 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 24/201 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-02 22:14:29] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 1/426 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 1/427 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/427 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-06-02 22:14:31] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 4 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/427 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/427 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 16 (OVERLAPS) 0/427 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 427/427 variables, and 207 constraints, problems are : Problem set: 0 solved, 26 unsolved in 3713 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 6/6 constraints]
After SMT, in 4789ms problems are : Problem set: 0 solved, 26 unsolved
Parikh walk visited 0 properties in 1434 ms.
Support contains 40 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 329/329 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 124 transition count 326
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 123 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 123 transition count 324
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 123 transition count 323
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 121 transition count 327
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 14 place count 121 transition count 323
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 16 place count 121 transition count 321
Applied a total of 16 rules in 48 ms. Remains 121 /124 variables (removed 3) and now considering 321/329 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 121/124 places, 321/329 transitions.
RANDOM walk for 40000 steps (2186 resets) in 453 ms. (88 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (50 resets) in 12 ms. (307 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (37 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (58 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (46 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (56 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (58 resets) in 13 ms. (285 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (50 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (65 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (69 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (69 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (49 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (63 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (58 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (26 resets) in 13 ms. (286 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4002 steps (48 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (47 resets) in 34 ms. (114 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (61 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (49 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (50 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (69 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (48 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (62 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (57 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (59 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (68 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (50 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
Interrupted probabilistic random walk after 565750 steps, run timeout after 3001 ms. (steps per millisecond=188 ) properties seen :16 out of 25
Probabilistic random walk after 565750 steps, saw 127743 distinct states, run finished after 3004 ms. (steps per millisecond=188 ) properties seen :16
[2024-06-02 22:14:37] [INFO ] Flow matrix only has 295 transitions (discarded 26 similar events)
// Phase 1: matrix 295 rows 121 cols
[2024-06-02 22:14:37] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 22:14:37] [INFO ] State equation strengthened by 44 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, 9 unsolved
At refinement iteration 1 (OVERLAPS) 103/118 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 22:14:37] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-06-02 22:14:37] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:14:37] [INFO ] Deduced a trap composed of 42 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 295/413 variables, 118/129 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 44/173 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 3/416 variables, 3/176 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 22:14:37] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/416 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/416 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 416/416 variables, and 177 constraints, problems are : Problem set: 0 solved, 9 unsolved in 652 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 121/121 constraints, ReadFeed: 44/44 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/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 103/118 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 22:14:38] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 295/413 variables, 118/131 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 44/175 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 8/183 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 22:14:38] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 0 ms to minimize.
[2024-06-02 22:14:38] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 3/416 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/416 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/416 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 416/416 variables, and 189 constraints, problems are : Problem set: 0 solved, 9 unsolved in 941 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 121/121 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 7/7 constraints]
After SMT, in 1605ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 2003 ms.
Support contains 15 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 321/321 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 118 transition count 315
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 118 transition count 315
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 118 transition count 314
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 1 with 2 rules applied. Total rules applied 9 place count 117 transition count 316
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 11 place count 117 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 117 transition count 313
Applied a total of 12 rules in 32 ms. Remains 117 /121 variables (removed 4) and now considering 313/321 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 117/121 places, 313/321 transitions.
RANDOM walk for 40000 steps (2182 resets) in 679 ms. (58 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (523 resets) in 62 ms. (634 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (527 resets) in 39 ms. (1000 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (522 resets) in 36 ms. (1081 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (595 resets) in 39 ms. (1000 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (545 resets) in 40 ms. (975 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (370 resets) in 37 ms. (1052 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (538 resets) in 39 ms. (1000 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (541 resets) in 48 ms. (816 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (624 resets) in 45 ms. (869 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 532773 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 9
Probabilistic random walk after 532773 steps, saw 121761 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
[2024-06-02 22:14:44] [INFO ] Flow matrix only has 285 transitions (discarded 28 similar events)
// Phase 1: matrix 285 rows 117 cols
[2024-06-02 22:14:44] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:14:44] [INFO ] State equation strengthened by 44 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, 9 unsolved
At refinement iteration 1 (OVERLAPS) 99/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 22:14:44] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:14:44] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 285/399 variables, 114/124 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 44/168 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 3/402 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/402 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 171 constraints, problems are : Problem set: 0 solved, 9 unsolved in 443 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 99/114 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 22:14:44] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 285/399 variables, 114/125 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 44/169 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-02 22:14:45] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 3/402 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/402 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/402 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 182 constraints, problems are : Problem set: 0 solved, 9 unsolved in 786 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 4/4 constraints]
After SMT, in 1238ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 3189 ms.
Support contains 15 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 313/313 transitions.
Applied a total of 0 rules in 8 ms. Remains 117 /117 variables (removed 0) and now considering 313/313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 117/117 places, 313/313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 313/313 transitions.
Applied a total of 0 rules in 7 ms. Remains 117 /117 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2024-06-02 22:14:48] [INFO ] Flow matrix only has 285 transitions (discarded 28 similar events)
[2024-06-02 22:14:48] [INFO ] Invariant cache hit.
[2024-06-02 22:14:48] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 22:14:48] [INFO ] Flow matrix only has 285 transitions (discarded 28 similar events)
[2024-06-02 22:14:48] [INFO ] Invariant cache hit.
[2024-06-02 22:14:48] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-02 22:14:49] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2024-06-02 22:14:49] [INFO ] Redundant transitions in 19 ms returned []
Running 312 sub problems to find dead transitions.
[2024-06-02 22:14:49] [INFO ] Flow matrix only has 285 transitions (discarded 28 similar events)
[2024-06-02 22:14:49] [INFO ] Invariant cache hit.
[2024-06-02 22:14:49] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 22:14:50] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2024-06-02 22:14:50] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 0 ms to minimize.
[2024-06-02 22:14:50] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:14:50] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-02 22:14:50] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-06-02 22:14:51] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:14:51] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:14:51] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-02 22:14:52] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-06-02 22:14:52] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 2 ms to minimize.
[2024-06-02 22:14:52] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (OVERLAPS) 285/402 variables, 117/136 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 44/180 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (OVERLAPS) 0/402 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/402 variables, and 180 constraints, problems are : Problem set: 0 solved, 312 unsolved in 9130 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 285/402 variables, 117/136 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 44/180 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 312/492 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (OVERLAPS) 0/402 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/402 variables, and 492 constraints, problems are : Problem set: 0 solved, 312 unsolved in 17246 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 117/117 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 11/11 constraints]
After SMT, in 26567ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 26571ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26864 ms. Remains : 117/117 places, 313/313 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 106 edges and 117 vertex of which 31 / 117 are part of one of the 5 SCC in 3 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 122 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 129 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 90 transition count 183
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 90 transition count 181
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 7 place count 89 transition count 180
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 89 transition count 179
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 10 place count 88 transition count 178
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 87 transition count 151
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 87 transition count 151
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 87 transition count 150
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 15 place count 86 transition count 149
Applied a total of 15 rules in 33 ms. Remains 86 /117 variables (removed 31) and now considering 149/313 (removed 164) transitions.
Running SMT prover for 9 properties.
[2024-06-02 22:15:15] [INFO ] Flow matrix only has 147 transitions (discarded 2 similar events)
// Phase 1: matrix 147 rows 86 cols
[2024-06-02 22:15:15] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 22:15:15] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-06-02 22:15:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:15:15] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-06-02 22:15:15] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 22:15:15] [INFO ] After 52ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :9
TRAPS : Iteration 0
[2024-06-02 22:15:15] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 1 ms to minimize.
[2024-06-02 22:15:16] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-06-02 22:15:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 72 ms
[2024-06-02 22:15:16] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-06-02 22:15:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
TRAPS : Iteration 1
[2024-06-02 22:15:16] [INFO ] After 327ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
[2024-06-02 22:15:16] [INFO ] After 516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Over-approximation ignoring read arcs solved 0 properties in 602 ms.
[2024-06-02 22:15:16] [INFO ] Flatten gal took : 17 ms
[2024-06-02 22:15:16] [INFO ] Flatten gal took : 19 ms
[2024-06-02 22:15:16] [INFO ] Input system was already deterministic with 329 transitions.
Computed a total of 23 stabilizing places and 48 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
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 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 118 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 110 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 110 transition count 294
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 1 with 2 rules applied. Total rules applied 32 place count 109 transition count 293
Applied a total of 32 rules in 34 ms. Remains 109 /124 variables (removed 15) and now considering 293/329 (removed 36) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 109/124 places, 293/329 transitions.
[2024-06-02 22:15:16] [INFO ] Flatten gal took : 14 ms
[2024-06-02 22:15:16] [INFO ] Flatten gal took : 15 ms
[2024-06-02 22:15:16] [INFO ] Input system was already deterministic with 293 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 321
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 321
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 120 transition count 320
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 119 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 118 transition count 315
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 118 transition count 315
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 116 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 116 transition count 310
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 114 transition count 305
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 114 transition count 305
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 112 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 112 transition count 300
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 110 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 110 transition count 295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 108 transition count 291
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 107 transition count 290
Applied a total of 35 rules in 38 ms. Remains 107 /124 variables (removed 17) and now considering 290/329 (removed 39) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 107/124 places, 290/329 transitions.
[2024-06-02 22:15:16] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:15:16] [INFO ] Flatten gal took : 18 ms
[2024-06-02 22:15:16] [INFO ] Input system was already deterministic with 290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
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 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 118 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 112 transition count 299
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 112 transition count 299
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 111 transition count 297
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 111 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 110 transition count 294
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 110 transition count 294
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 109 transition count 292
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 109 transition count 292
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 108 transition count 290
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 108 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 107 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 107 transition count 288
Applied a total of 36 rules in 14 ms. Remains 107 /124 variables (removed 17) and now considering 288/329 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 107/124 places, 288/329 transitions.
[2024-06-02 22:15:16] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:15:16] [INFO ] Flatten gal took : 14 ms
[2024-06-02 22:15:16] [INFO ] Input system was already deterministic with 288 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 321
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 321
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 120 transition count 319
Applied a total of 10 rules in 3 ms. Remains 120 /124 variables (removed 4) and now considering 319/329 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 120/124 places, 319/329 transitions.
[2024-06-02 22:15:16] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:15:16] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:15:16] [INFO ] Input system was already deterministic with 319 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
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 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 118 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 116 transition count 309
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 115 transition count 307
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 115 transition count 307
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 114 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 114 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 113 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 113 transition count 302
Applied a total of 24 rules in 7 ms. Remains 113 /124 variables (removed 11) and now considering 302/329 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 113/124 places, 302/329 transitions.
[2024-06-02 22:15:16] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:15:16] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:15:16] [INFO ] Input system was already deterministic with 302 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
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 119 transition count 317
Applied a total of 12 rules in 2 ms. Remains 119 /124 variables (removed 5) and now considering 317/329 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 119/124 places, 317/329 transitions.
[2024-06-02 22:15:16] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:15:16] [INFO ] Flatten gal took : 13 ms
[2024-06-02 22:15:16] [INFO ] Input system was already deterministic with 317 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 318
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 318
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 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 116 transition count 311
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 1 with 2 rules applied. Total rules applied 18 place count 115 transition count 310
Applied a total of 18 rules in 15 ms. Remains 115 /124 variables (removed 9) and now considering 310/329 (removed 19) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 115/124 places, 310/329 transitions.
[2024-06-02 22:15:16] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:15:16] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:15:16] [INFO ] Input system was already deterministic with 310 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 321
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 321
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 120 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 119 transition count 316
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 119 transition count 316
Applied a total of 12 rules in 3 ms. Remains 119 /124 variables (removed 5) and now considering 316/329 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 119/124 places, 316/329 transitions.
[2024-06-02 22:15:16] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:15:16] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:15:16] [INFO ] Input system was already deterministic with 316 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 119 transition count 319
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 119 transition count 319
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 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 118 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 118 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 117 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 117 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 116 transition count 309
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 116 transition count 309
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 1 with 2 rules applied. Total rules applied 20 place count 115 transition count 308
Applied a total of 20 rules in 13 ms. Remains 115 /124 variables (removed 9) and now considering 308/329 (removed 21) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 115/124 places, 308/329 transitions.
[2024-06-02 22:15:16] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:15:16] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:15:16] [INFO ] Input system was already deterministic with 308 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 323
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 323
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 121 transition count 322
Applied a total of 7 rules in 2 ms. Remains 121 /124 variables (removed 3) and now considering 322/329 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 121/124 places, 322/329 transitions.
[2024-06-02 22:15:16] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:15:16] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:15:16] [INFO ] Input system was already deterministic with 322 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 323
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 323
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 121 transition count 322
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 120 transition count 319
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 120 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 119 transition count 317
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 119 transition count 317
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 118 transition count 314
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 118 transition count 314
Applied a total of 13 rules in 4 ms. Remains 118 /124 variables (removed 6) and now considering 314/329 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 118/124 places, 314/329 transitions.
[2024-06-02 22:15:17] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:15:17] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:15:17] [INFO ] Input system was already deterministic with 314 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 318
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 318
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 118 transition count 316
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 117 transition count 315
Applied a total of 14 rules in 10 ms. Remains 117 /124 variables (removed 7) and now considering 315/329 (removed 14) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 117/124 places, 315/329 transitions.
[2024-06-02 22:15:17] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:15:17] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:15:17] [INFO ] Input system was already deterministic with 315 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 120 transition count 322
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 120 transition count 322
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 120 transition count 321
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 1 with 2 rules applied. Total rules applied 9 place count 119 transition count 320
Applied a total of 9 rules in 9 ms. Remains 119 /124 variables (removed 5) and now considering 320/329 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 119/124 places, 320/329 transitions.
[2024-06-02 22:15:17] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:15:17] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:15:17] [INFO ] Input system was already deterministic with 320 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 318
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 318
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 118 transition count 316
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 117 transition count 315
Applied a total of 14 rules in 9 ms. Remains 117 /124 variables (removed 7) and now considering 315/329 (removed 14) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 117/124 places, 315/329 transitions.
[2024-06-02 22:15:17] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:15:17] [INFO ] Flatten gal took : 10 ms
[2024-06-02 22:15:17] [INFO ] Input system was already deterministic with 315 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 329/329 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 118 transition count 318
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 118 transition count 318
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 118 transition count 316
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 117 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 117 transition count 313
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 116 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 116 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 115 transition count 308
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 115 transition count 308
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 114 transition count 306
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 114 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 113 transition count 303
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 113 transition count 303
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 112 transition count 301
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 112 transition count 301
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 111 transition count 298
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 111 transition count 298
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 110 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 110 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 109 transition count 293
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 109 transition count 293
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 108 transition count 291
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 108 transition count 291
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 107 transition count 289
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 107 transition count 289
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 106 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 106 transition count 287
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 1 with 2 rules applied. Total rules applied 38 place count 105 transition count 286
Applied a total of 38 rules in 23 ms. Remains 105 /124 variables (removed 19) and now considering 286/329 (removed 43) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 105/124 places, 286/329 transitions.
[2024-06-02 22:15:17] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:15:17] [INFO ] Flatten gal took : 9 ms
[2024-06-02 22:15:17] [INFO ] Input system was already deterministic with 286 transitions.
[2024-06-02 22:15:17] [INFO ] Flatten gal took : 12 ms
[2024-06-02 22:15:17] [INFO ] Flatten gal took : 11 ms
[2024-06-02 22:15:17] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-02 22:15:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 124 places, 329 transitions and 1213 arcs took 3 ms.
Total runtime 95045 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-08

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: 124
TRANSITIONS: 329
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.003s]


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


----------------------------------------------------------------------
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: 719
MODEL NAME: /home/mcc/execution/412/model
124 places, 329 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-08-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FireWire-PT-08-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717366552312

--------------------
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

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-08"
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-08, 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-171734898100225"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-08.tgz
mv FireWire-PT-08 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 ;