About the Execution of GreatSPN+red for DES-PT-10a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
12988.707 | 3600000.00 | 9551764.00 | 5122.30 | ?T?TF??TF???F?FF | 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.r091-tall-171624188200665.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 DES-PT-10a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188200665
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Apr 12 08:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 12 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 43K May 18 16:42 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 DES-PT-10a-CTLCardinality-2024-00
FORMULA_NAME DES-PT-10a-CTLCardinality-2024-01
FORMULA_NAME DES-PT-10a-CTLCardinality-2024-02
FORMULA_NAME DES-PT-10a-CTLCardinality-2024-03
FORMULA_NAME DES-PT-10a-CTLCardinality-2024-04
FORMULA_NAME DES-PT-10a-CTLCardinality-2024-05
FORMULA_NAME DES-PT-10a-CTLCardinality-2024-06
FORMULA_NAME DES-PT-10a-CTLCardinality-2024-07
FORMULA_NAME DES-PT-10a-CTLCardinality-2024-08
FORMULA_NAME DES-PT-10a-CTLCardinality-2024-09
FORMULA_NAME DES-PT-10a-CTLCardinality-2024-10
FORMULA_NAME DES-PT-10a-CTLCardinality-2024-11
FORMULA_NAME DES-PT-10a-CTLCardinality-2023-12
FORMULA_NAME DES-PT-10a-CTLCardinality-2023-13
FORMULA_NAME DES-PT-10a-CTLCardinality-2023-14
FORMULA_NAME DES-PT-10a-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1716314828883
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-10a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 18:07:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 18:07:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 18:07:10] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-05-21 18:07:10] [INFO ] Transformed 155 places.
[2024-05-21 18:07:10] [INFO ] Transformed 112 transitions.
[2024-05-21 18:07:10] [INFO ] Found NUPN structural information;
[2024-05-21 18:07:10] [INFO ] Parsed PT model containing 155 places and 112 transitions and 552 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-10a-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 69 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 154 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 154 transition count 97
Applied a total of 2 rules in 24 ms. Remains 154 /155 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 154 cols
[2024-05-21 18:07:10] [INFO ] Computed 59 invariants in 18 ms
[2024-05-21 18:07:10] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-21 18:07:10] [INFO ] Invariant cache hit.
[2024-05-21 18:07:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 18:07:10] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-21 18:07:10] [INFO ] Invariant cache hit.
[2024-05-21 18:07:10] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/154 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-21 18:07:11] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/251 variables, 154/214 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-21 18:07:12] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-21 18:07:14] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-21 18:07:14] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/251 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (OVERLAPS) 0/251 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 218 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4646 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 154/154 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/154 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/251 variables, 154/217 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 96/314 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-21 18:07:18] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-21 18:07:21] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-21 18:07:21] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 12 (OVERLAPS) 0/251 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 317 constraints, problems are : Problem set: 0 solved, 96 unsolved in 17574 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 154/154 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 7/7 constraints]
After SMT, in 22312ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 22332ms
Starting structural reductions in LTL mode, iteration 1 : 154/155 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22977 ms. Remains : 154/155 places, 97/98 transitions.
Support contains 69 out of 154 places after structural reductions.
[2024-05-21 18:07:33] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-21 18:07:33] [INFO ] Flatten gal took : 38 ms
[2024-05-21 18:07:33] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DES-PT-10a-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 18:07:33] [INFO ] Flatten gal took : 25 ms
[2024-05-21 18:07:33] [INFO ] Input system was already deterministic with 97 transitions.
Support contains 67 out of 154 places (down from 69) after GAL structural reductions.
RANDOM walk for 40000 steps (904 resets) in 1492 ms. (26 steps per ms) remains 9/49 properties
BEST_FIRST walk for 40002 steps (185 resets) in 152 ms. (261 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (192 resets) in 126 ms. (314 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (175 resets) in 195 ms. (204 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (215 resets) in 221 ms. (180 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (179 resets) in 191 ms. (208 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (244 resets) in 117 ms. (339 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (186 resets) in 142 ms. (279 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (169 resets) in 67 ms. (588 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (170 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
[2024-05-21 18:07:34] [INFO ] Invariant cache hit.
[2024-05-21 18:07:34] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 3/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 74/93 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 52/145 variables, 23/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 97/242 variables, 145/204 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 9/251 variables, 9/214 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/251 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 214 constraints, problems are : Problem set: 0 solved, 9 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 154/154 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 3/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 74/93 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp42 is UNSAT
At refinement iteration 6 (OVERLAPS) 52/145 variables, 23/59 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 97/242 variables, 145/204 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 1/205 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 4/209 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-21 18:07:35] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 1/210 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-21 18:07:35] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-21 18:07:35] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 2/212 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 9/251 variables, 9/221 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/251 variables, 4/225 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/251 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/251 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 225 constraints, problems are : Problem set: 1 solved, 8 unsolved in 1302 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 154/154 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 3/3 constraints]
After SMT, in 1694ms problems are : Problem set: 1 solved, 8 unsolved
Parikh walk visited 0 properties in 5313 ms.
Support contains 14 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 97/97 transitions.
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 154 transition count 97
Applied a total of 6 rules in 47 ms. Remains 154 /154 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 154/154 places, 97/97 transitions.
RANDOM walk for 40000 steps (970 resets) in 423 ms. (94 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (215 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (217 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (201 resets) in 95 ms. (416 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (188 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (196 resets) in 59 ms. (666 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (215 resets) in 53 ms. (740 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (195 resets) in 54 ms. (727 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (184 resets) in 51 ms. (769 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 728221 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :0 out of 8
Probabilistic random walk after 728221 steps, saw 103205 distinct states, run finished after 3006 ms. (steps per millisecond=242 ) properties seen :0
// Phase 1: matrix 97 rows 154 cols
[2024-05-21 18:07:45] [INFO ] Computed 59 invariants in 6 ms
[2024-05-21 18:07:45] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 3/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 71/88 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 57/145 variables, 26/59 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 97/242 variables, 145/204 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 9/251 variables, 9/218 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/251 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 218 constraints, problems are : Problem set: 0 solved, 8 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 154/154 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 3/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 71/88 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 57/145 variables, 26/59 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 97/242 variables, 145/204 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 5/209 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 4/213 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 9/251 variables, 9/222 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 18:07:45] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/251 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/251 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-21 18:07:46] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/251 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/251 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/251 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 228 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1381 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 154/154 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints]
After SMT, in 1747ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 6 properties in 2794 ms.
Support contains 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 97/97 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 154 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 153 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 152 transition count 94
Applied a total of 4 rules in 21 ms. Remains 152 /154 variables (removed 2) and now considering 94/97 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 152/154 places, 94/97 transitions.
RANDOM walk for 40000 steps (537 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (89 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (89 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1415703 steps, run timeout after 3001 ms. (steps per millisecond=471 ) properties seen :0 out of 2
Probabilistic random walk after 1415703 steps, saw 197843 distinct states, run finished after 3001 ms. (steps per millisecond=471 ) properties seen :0
// Phase 1: matrix 94 rows 152 cols
[2024-05-21 18:07:52] [INFO ] Computed 60 invariants in 2 ms
[2024-05-21 18:07:52] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 67/71 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 32/103 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 22/125 variables, 15/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/131 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 81/212 variables, 131/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/212 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/212 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/224 variables, 8/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/224 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/224 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/225 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/225 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/225 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 12/237 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/237 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/237 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 9/246 variables, 9/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/246 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/246 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 214 constraints, problems are : Problem set: 0 solved, 2 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 152/152 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 67/71 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 32/103 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 18:07:52] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 22/125 variables, 15/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/131 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/131 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 81/212 variables, 131/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/212 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/212 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/212 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/224 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/224 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 18:07:53] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/224 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/224 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 1/225 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/225 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 18:07:53] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/225 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/225 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 12/237 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/237 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/237 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 9/246 variables, 9/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/246 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 0/246 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 219 constraints, problems are : Problem set: 0 solved, 2 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 152/152 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 521ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 8397 steps, including 34 resets, run visited all 2 properties in 69 ms. (steps per millisecond=121 )
Parikh walk visited 2 properties in 74 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 21 ms
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 11 ms
[2024-05-21 18:07:53] [INFO ] Input system was already deterministic with 97 transitions.
Support contains 59 out of 154 places (down from 61) after GAL structural reductions.
Computed a total of 57 stabilizing places and 51 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 97/97 transitions.
Applied a total of 0 rules in 10 ms. Remains 154 /154 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 154/154 places, 97/97 transitions.
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 9 ms
[2024-05-21 18:07:53] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 154 /154 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 154/154 places, 97/97 transitions.
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:07:53] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 154/154 places, 97/97 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 152 transition count 96
Applied a total of 1 rules in 8 ms. Remains 152 /154 variables (removed 2) and now considering 96/97 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 152/154 places, 96/97 transitions.
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:07:53] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 154 /154 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 154/154 places, 97/97 transitions.
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:07:53] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 154 /154 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 154/154 places, 97/97 transitions.
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:07:53] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 154 /154 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 154/154 places, 97/97 transitions.
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:07:53] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 154 /154 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 154/154 places, 97/97 transitions.
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 8 ms
[2024-05-21 18:07:53] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 154 /154 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 154/154 places, 97/97 transitions.
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 7 ms
[2024-05-21 18:07:53] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 154/154 places, 97/97 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 152 transition count 96
Applied a total of 1 rules in 13 ms. Remains 152 /154 variables (removed 2) and now considering 96/97 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 152/154 places, 96/97 transitions.
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:07:53] [INFO ] Input system was already deterministic with 96 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 97/97 transitions.
Applied a total of 0 rules in 17 ms. Remains 154 /154 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 154/154 places, 97/97 transitions.
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 21 ms
[2024-05-21 18:07:53] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 154 /154 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 154/154 places, 97/97 transitions.
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:07:53] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 154/154 places, 97/97 transitions.
Applied a total of 0 rules in 6 ms. Remains 154 /154 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 154/154 places, 97/97 transitions.
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 5 ms
[2024-05-21 18:07:53] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:07:53] [INFO ] Flatten gal took : 6 ms
[2024-05-21 18:07:53] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-21 18:07:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 154 places, 97 transitions and 484 arcs took 2 ms.
Total runtime 43982 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DES-PT-10a
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 154
TRANSITIONS: 97
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.000s]
SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 614
MODEL NAME: /home/mcc/execution/411/model
154 places, 97 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 DES-PT-10a-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DES-PT-10a-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DES-PT-10a-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DES-PT-10a-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
BK_TIME_CONFINEMENT_REACHED
--------------------
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
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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="DES-PT-10a"
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 DES-PT-10a, 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 r091-tall-171624188200665"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10a.tgz
mv DES-PT-10a 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 '
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 ;