About the Execution of GreatSPN+red for CO4-PT-18
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
530.552 | 12143.00 | 26901.00 | 101.30 | FTFTFTTTTTTTTTFF | 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-171734897900142.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 CO4-PT-18, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734897900142
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K 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 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 239K 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 CO4-PT-18-ReachabilityCardinality-2024-00
FORMULA_NAME CO4-PT-18-ReachabilityCardinality-2024-01
FORMULA_NAME CO4-PT-18-ReachabilityCardinality-2024-02
FORMULA_NAME CO4-PT-18-ReachabilityCardinality-2024-03
FORMULA_NAME CO4-PT-18-ReachabilityCardinality-2024-04
FORMULA_NAME CO4-PT-18-ReachabilityCardinality-2024-05
FORMULA_NAME CO4-PT-18-ReachabilityCardinality-2024-06
FORMULA_NAME CO4-PT-18-ReachabilityCardinality-2024-07
FORMULA_NAME CO4-PT-18-ReachabilityCardinality-2024-08
FORMULA_NAME CO4-PT-18-ReachabilityCardinality-2024-09
FORMULA_NAME CO4-PT-18-ReachabilityCardinality-2024-10
FORMULA_NAME CO4-PT-18-ReachabilityCardinality-2024-11
FORMULA_NAME CO4-PT-18-ReachabilityCardinality-2024-12
FORMULA_NAME CO4-PT-18-ReachabilityCardinality-2024-13
FORMULA_NAME CO4-PT-18-ReachabilityCardinality-2024-14
FORMULA_NAME CO4-PT-18-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717361042130
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 20:44:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 20:44:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:44:03] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-06-02 20:44:03] [INFO ] Transformed 979 places.
[2024-06-02 20:44:03] [INFO ] Transformed 1111 transitions.
[2024-06-02 20:44:03] [INFO ] Found NUPN structural information;
[2024-06-02 20:44:03] [INFO ] Parsed PT model containing 979 places and 1111 transitions and 2420 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 157 places in 14 ms
Reduce places removed 157 places and 177 transitions.
FORMULA CO4-PT-18-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-18-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (90 resets) in 1395 ms. (28 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (97 resets) in 633 ms. (63 steps per ms) remains 13/14 properties
FORMULA CO4-PT-18-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (264 resets) in 250 ms. (159 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (139 resets) in 182 ms. (218 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (64 resets) in 428 ms. (93 steps per ms) remains 12/13 properties
FORMULA CO4-PT-18-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (41 resets) in 398 ms. (100 steps per ms) remains 11/12 properties
FORMULA CO4-PT-18-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (94 resets) in 176 ms. (225 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (62 resets) in 164 ms. (242 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (167 resets) in 153 ms. (259 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (91 resets) in 153 ms. (259 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (117 resets) in 118 ms. (336 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (60 resets) in 109 ms. (363 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (140 resets) in 160 ms. (248 steps per ms) remains 11/11 properties
// Phase 1: matrix 934 rows 822 cols
[2024-06-02 20:44:05] [INFO ] Computed 8 invariants in 29 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 141/141 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem CO4-PT-18-ReachabilityCardinality-2024-15 is UNSAT
FORMULA CO4-PT-18-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 680/821 variables, 7/148 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/821 variables, 680/828 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/821 variables, 0/828 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1/822 variables, 1/829 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/822 variables, 1/830 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/822 variables, 0/830 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 934/1756 variables, 822/1652 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1756 variables, 0/1652 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/1756 variables, 0/1652 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1756/1756 variables, and 1652 constraints, problems are : Problem set: 1 solved, 10 unsolved in 2077 ms.
Refiners :[Domain max(s): 822/822 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 822/822 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 119/119 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem CO4-PT-18-ReachabilityCardinality-2024-01 is UNSAT
FORMULA CO4-PT-18-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem CO4-PT-18-ReachabilityCardinality-2024-11 is UNSAT
FORMULA CO4-PT-18-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 702/821 variables, 7/126 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/821 variables, 702/828 constraints. Problems are: Problem set: 3 solved, 8 unsolved
[2024-06-02 20:44:08] [INFO ] Deduced a trap composed of 566 places in 318 ms of which 53 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/821 variables, 1/829 constraints. Problems are: Problem set: 3 solved, 8 unsolved
[2024-06-02 20:44:08] [INFO ] Deduced a trap composed of 22 places in 221 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/821 variables, 1/830 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/821 variables, 0/830 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/822 variables, 1/831 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/822 variables, 1/832 constraints. Problems are: Problem set: 3 solved, 8 unsolved
[2024-06-02 20:44:09] [INFO ] Deduced a trap composed of 377 places in 176 ms of which 4 ms to minimize.
[2024-06-02 20:44:09] [INFO ] Deduced a trap composed of 20 places in 192 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/822 variables, 2/834 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/822 variables, 0/834 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 934/1756 variables, 822/1656 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1756 variables, 8/1664 constraints. Problems are: Problem set: 3 solved, 8 unsolved
[2024-06-02 20:44:10] [INFO ] Deduced a trap composed of 125 places in 154 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1756 variables, 1/1665 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1756 variables, 0/1665 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/1756 variables, 0/1665 constraints. Problems are: Problem set: 3 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1756/1756 variables, and 1665 constraints, problems are : Problem set: 3 solved, 8 unsolved in 4695 ms.
Refiners :[Domain max(s): 822/822 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 822/822 constraints, PredecessorRefiner: 8/11 constraints, Known Traps: 5/5 constraints]
After SMT, in 6889ms problems are : Problem set: 3 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
FORMULA CO4-PT-18-ReachabilityCardinality-2024-14 FALSE TECHNIQUES PARIKH_WALK
FORMULA CO4-PT-18-ReachabilityCardinality-2024-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA CO4-PT-18-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
FORMULA CO4-PT-18-ReachabilityCardinality-2024-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA CO4-PT-18-ReachabilityCardinality-2024-07 TRUE TECHNIQUES PARIKH_WALK
FORMULA CO4-PT-18-ReachabilityCardinality-2024-08 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 6 properties in 1772 ms.
Support contains 3 out of 822 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 822/822 places, 934/934 transitions.
Graph (trivial) has 839 edges and 822 vertex of which 3 / 822 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1118 edges and 820 vertex of which 778 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.3 ms
Discarding 42 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 513 transitions
Trivial Post-agglo rules discarded 513 transitions
Performed 513 trivial Post agglomeration. Transition count delta: 513
Iterating post reduction 0 with 536 rules applied. Total rules applied 538 place count 778 transition count 372
Reduce places removed 513 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 525 rules applied. Total rules applied 1063 place count 265 transition count 360
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 13 rules applied. Total rules applied 1076 place count 259 transition count 353
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 1080 place count 257 transition count 351
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 1083 place count 256 transition count 349
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 1086 place count 255 transition count 347
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1087 place count 254 transition count 347
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1087 place count 254 transition count 346
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1089 place count 253 transition count 346
Discarding 38 places :
Symmetric choice reduction at 7 with 38 rule applications. Total rules 1127 place count 215 transition count 308
Iterating global reduction 7 with 38 rules applied. Total rules applied 1165 place count 215 transition count 308
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 13 Pre rules applied. Total rules applied 1165 place count 215 transition count 295
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1191 place count 202 transition count 295
Discarding 23 places :
Symmetric choice reduction at 7 with 23 rule applications. Total rules 1214 place count 179 transition count 272
Iterating global reduction 7 with 23 rules applied. Total rules applied 1237 place count 179 transition count 272
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 5 rules applied. Total rules applied 1242 place count 179 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1243 place count 178 transition count 267
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 1245 place count 176 transition count 264
Iterating global reduction 9 with 2 rules applied. Total rules applied 1247 place count 176 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1249 place count 176 transition count 262
Performed 75 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 10 with 150 rules applied. Total rules applied 1399 place count 101 transition count 177
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 1406 place count 101 transition count 170
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 1410 place count 97 transition count 166
Iterating global reduction 11 with 4 rules applied. Total rules applied 1414 place count 97 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1415 place count 97 transition count 165
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 12 with 6 rules applied. Total rules applied 1421 place count 94 transition count 162
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 1424 place count 94 transition count 159
Discarding 3 places :
Symmetric choice reduction at 13 with 3 rule applications. Total rules 1427 place count 91 transition count 156
Iterating global reduction 13 with 3 rules applied. Total rules applied 1430 place count 91 transition count 156
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1432 place count 91 transition count 154
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 1433 place count 90 transition count 153
Iterating global reduction 14 with 1 rules applied. Total rules applied 1434 place count 90 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 1435 place count 90 transition count 152
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 15 with 54 rules applied. Total rules applied 1489 place count 63 transition count 154
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 15 with 34 rules applied. Total rules applied 1523 place count 63 transition count 120
Discarding 22 places :
Symmetric choice reduction at 16 with 22 rule applications. Total rules 1545 place count 41 transition count 89
Iterating global reduction 16 with 22 rules applied. Total rules applied 1567 place count 41 transition count 89
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 16 with 17 rules applied. Total rules applied 1584 place count 41 transition count 72
Discarding 3 places :
Symmetric choice reduction at 17 with 3 rule applications. Total rules 1587 place count 38 transition count 64
Iterating global reduction 17 with 3 rules applied. Total rules applied 1590 place count 38 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 1592 place count 38 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 18 with 2 rules applied. Total rules applied 1594 place count 38 transition count 60
Discarding 1 places :
Symmetric choice reduction at 18 with 1 rule applications. Total rules 1595 place count 37 transition count 59
Iterating global reduction 18 with 1 rules applied. Total rules applied 1596 place count 37 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 1597 place count 37 transition count 58
Free-agglomeration rule applied 5 times.
Iterating global reduction 19 with 5 rules applied. Total rules applied 1602 place count 37 transition count 53
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 19 with 6 rules applied. Total rules applied 1608 place count 32 transition count 52
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 20 with 3 rules applied. Total rules applied 1611 place count 32 transition count 52
Graph (complete) has 95 edges and 32 vertex of which 31 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 20 with 1 rules applied. Total rules applied 1612 place count 31 transition count 52
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 21 with 1 rules applied. Total rules applied 1613 place count 31 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 1614 place count 31 transition count 50
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 22 with 1 rules applied. Total rules applied 1615 place count 31 transition count 50
Graph (complete) has 92 edges and 31 vertex of which 30 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 22 with 1 rules applied. Total rules applied 1616 place count 30 transition count 50
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 23 with 1 rules applied. Total rules applied 1617 place count 30 transition count 49
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 24 with 1 rules applied. Total rules applied 1618 place count 30 transition count 49
Graph (complete) has 89 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 24 with 1 rules applied. Total rules applied 1619 place count 29 transition count 49
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 1620 place count 29 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 26 with 1 rules applied. Total rules applied 1621 place count 28 transition count 47
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t154.t155.t973 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 19 edges and 24 vertex of which 5 / 24 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 26 with 3 rules applied. Total rules applied 1624 place count 21 transition count 45
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t62.t63.t64.t955.t298.t299.t300.t1068.t37.t317 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (trivial) has 13 edges and 19 vertex of which 3 / 19 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 27 with 10 rules applied. Total rules applied 1634 place count 17 transition count 36
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 1638 place count 17 transition count 32
Discarding 1 places :
Symmetric choice reduction at 29 with 1 rule applications. Total rules 1639 place count 16 transition count 31
Iterating global reduction 29 with 1 rules applied. Total rules applied 1640 place count 16 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 29 with 8 rules applied. Total rules applied 1648 place count 16 transition count 23
Discarding 4 places :
Symmetric choice reduction at 29 with 4 rule applications. Total rules 1652 place count 12 transition count 19
Iterating global reduction 29 with 4 rules applied. Total rules applied 1656 place count 12 transition count 19
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 1658 place count 12 transition count 17
Discarding 1 places :
Symmetric choice reduction at 30 with 1 rule applications. Total rules 1659 place count 11 transition count 16
Iterating global reduction 30 with 1 rules applied. Total rules applied 1660 place count 11 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 30 with 1 rules applied. Total rules applied 1661 place count 11 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 31 with 1 rules applied. Total rules applied 1662 place count 11 transition count 14
Free-agglomeration rule applied 2 times.
Iterating global reduction 31 with 2 rules applied. Total rules applied 1664 place count 11 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 1666 place count 9 transition count 12
Applied a total of 1666 rules in 140 ms. Remains 9 /822 variables (removed 813) and now considering 12/934 (removed 922) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 9/822 places, 12/934 transitions.
RANDOM walk for 20049 steps (5 resets) in 106 ms. (187 steps per ms) remains 0/2 properties
FORMULA CO4-PT-18-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CO4-PT-18-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 10980 ms.
ITS solved all properties within timeout
BK_STOP 1717361054273
--------------------
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 ReachabilityCardinality -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="CO4-PT-18"
export BK_EXAMINATION="ReachabilityCardinality"
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 CO4-PT-18, examination is ReachabilityCardinality"
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-171734897900142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-18.tgz
mv CO4-PT-18 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;