About the Execution of GreatSPN+red for IBM319-PT-none
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
12680.651 | 3600000.00 | 14275458.00 | 418.50 | FTT?F?TTFT?T?F?? | 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.r201-smll-171649587100329.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 IBM319-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-171649587100329
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K 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.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.2K Apr 22 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 06:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 13 06:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 13 06:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 13 06:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 184K 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 IBM319-PT-none-CTLCardinality-2024-00
FORMULA_NAME IBM319-PT-none-CTLCardinality-2024-01
FORMULA_NAME IBM319-PT-none-CTLCardinality-2024-02
FORMULA_NAME IBM319-PT-none-CTLCardinality-2024-03
FORMULA_NAME IBM319-PT-none-CTLCardinality-2024-04
FORMULA_NAME IBM319-PT-none-CTLCardinality-2024-05
FORMULA_NAME IBM319-PT-none-CTLCardinality-2024-06
FORMULA_NAME IBM319-PT-none-CTLCardinality-2024-07
FORMULA_NAME IBM319-PT-none-CTLCardinality-2024-08
FORMULA_NAME IBM319-PT-none-CTLCardinality-2024-09
FORMULA_NAME IBM319-PT-none-CTLCardinality-2024-10
FORMULA_NAME IBM319-PT-none-CTLCardinality-2024-11
FORMULA_NAME IBM319-PT-none-CTLCardinality-2023-12
FORMULA_NAME IBM319-PT-none-CTLCardinality-2023-13
FORMULA_NAME IBM319-PT-none-CTLCardinality-2023-14
FORMULA_NAME IBM319-PT-none-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1716794305892
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM319-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 07:18:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 07:18:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 07:18:27] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2024-05-27 07:18:27] [INFO ] Transformed 253 places.
[2024-05-27 07:18:27] [INFO ] Transformed 178 transitions.
[2024-05-27 07:18:27] [INFO ] Found NUPN structural information;
[2024-05-27 07:18:27] [INFO ] Parsed PT model containing 253 places and 178 transitions and 526 arcs in 289 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 26 ms.
Support contains 118 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 178/178 transitions.
Ensure Unique test removed 57 places
Reduce places removed 63 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 189 transition count 178
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 188 transition count 177
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 188 transition count 177
Applied a total of 66 rules in 63 ms. Remains 188 /253 variables (removed 65) and now considering 177/178 (removed 1) transitions.
// Phase 1: matrix 177 rows 188 cols
[2024-05-27 07:18:28] [INFO ] Computed 22 invariants in 38 ms
[2024-05-27 07:18:28] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-05-27 07:18:28] [INFO ] Invariant cache hit.
[2024-05-27 07:18:28] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-05-27 07:18:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 177/362 variables, 185/207 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Problem TDEAD19 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD172 is UNSAT
At refinement iteration 4 (OVERLAPS) 3/365 variables, 3/210 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/210 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 0/365 variables, 0/210 constraints. Problems are: Problem set: 8 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 210 constraints, problems are : Problem set: 8 solved, 168 unsolved in 10658 ms.
Refiners :[Generalized P Invariants (flows): 22/22 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 21/21 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/21 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 2 (OVERLAPS) 2/175 variables, 1/22 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/22 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 170/345 variables, 175/197 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/345 variables, 158/355 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/355 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 7 (OVERLAPS) 9/354 variables, 7/362 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 10/372 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/372 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 10 (OVERLAPS) 4/358 variables, 2/374 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 0/374 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 12 (OVERLAPS) 5/363 variables, 2/376 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/363 variables, 0/376 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 14 (OVERLAPS) 2/365 variables, 2/378 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/365 variables, 0/378 constraints. Problems are: Problem set: 8 solved, 168 unsolved
At refinement iteration 16 (OVERLAPS) 0/365 variables, 0/378 constraints. Problems are: Problem set: 8 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 378 constraints, problems are : Problem set: 8 solved, 168 unsolved in 26841 ms.
Refiners :[Generalized P Invariants (flows): 22/22 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 168/176 constraints, Known Traps: 0/0 constraints]
After SMT, in 37616ms problems are : Problem set: 8 solved, 168 unsolved
Search for dead transitions found 8 dead transitions in 37652ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in LTL mode, iteration 1 : 188/253 places, 169/178 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 181 transition count 169
Deduced a syphon composed of 3 places in 1 ms
Applied a total of 7 rules in 6 ms. Remains 181 /188 variables (removed 7) and now considering 169/169 (removed 0) transitions.
// Phase 1: matrix 169 rows 181 cols
[2024-05-27 07:19:06] [INFO ] Computed 24 invariants in 4 ms
[2024-05-27 07:19:06] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-27 07:19:06] [INFO ] Invariant cache hit.
[2024-05-27 07:19:06] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 181/253 places, 169/178 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38747 ms. Remains : 181/253 places, 169/178 transitions.
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Support contains 115 out of 178 places after structural reductions.
[2024-05-27 07:19:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-27 07:19:07] [INFO ] Flatten gal took : 55 ms
FORMULA IBM319-PT-none-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 07:19:07] [INFO ] Flatten gal took : 22 ms
[2024-05-27 07:19:07] [INFO ] Input system was already deterministic with 169 transitions.
Support contains 108 out of 178 places (down from 115) after GAL structural reductions.
FORMULA IBM319-PT-none-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (765 resets) in 2309 ms. (17 steps per ms) remains 7/69 properties
BEST_FIRST walk for 40001 steps (496 resets) in 272 ms. (146 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (443 resets) in 204 ms. (195 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (460 resets) in 196 ms. (203 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (413 resets) in 249 ms. (160 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (271 resets) in 189 ms. (210 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (387 resets) in 111 ms. (357 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (447 resets) in 179 ms. (222 steps per ms) remains 7/7 properties
// Phase 1: matrix 169 rows 178 cols
[2024-05-27 07:19:08] [INFO ] Computed 21 invariants in 15 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 24/53 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1/54 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 64/118 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 71/189 variables, 33/99 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/189 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 64/253 variables, 34/134 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/253 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/253 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 47/300 variables, 26/162 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/300 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/300 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 29/329 variables, 18/183 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/329 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/329 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp57 is UNSAT
At refinement iteration 20 (OVERLAPS) 11/340 variables, 8/193 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/340 variables, 0/193 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 4/344 variables, 3/196 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/344 variables, 1/197 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/344 variables, 0/197 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 2/346 variables, 1/198 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/346 variables, 0/198 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 1/347 variables, 1/199 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/347 variables, 0/199 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/347 variables, 0/199 constraints. Problems are: Problem set: 4 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 199 constraints, problems are : Problem set: 4 solved, 3 unsolved in 652 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 24/38 variables, 5/6 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/40 variables, 2/8 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 46/86 variables, 40/48 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/48 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 45/131 variables, 21/69 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 1/70 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 3/73 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/131 variables, 0/73 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 46/177 variables, 23/96 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/177 variables, 1/97 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/177 variables, 0/97 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 49/226 variables, 24/121 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 3/124 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 0/124 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 41/267 variables, 23/147 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/267 variables, 4/151 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/267 variables, 0/151 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 30/297 variables, 16/167 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/297 variables, 0/167 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 20/317 variables, 13/180 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/317 variables, 3/183 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/317 variables, 0/183 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 16/333 variables, 9/192 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/333 variables, 1/193 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/333 variables, 0/193 constraints. Problems are: Problem set: 4 solved, 3 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
After SMT solving in domain Int declared 340/347 variables, and 198 constraints, problems are : Problem set: 7 solved, 0 unsolved in 479 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 174/178 constraints, PredecessorRefiner: 3/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 1157ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA IBM319-PT-none-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 07:19:09] [INFO ] Flatten gal took : 13 ms
[2024-05-27 07:19:09] [INFO ] Flatten gal took : 14 ms
[2024-05-27 07:19:09] [INFO ] Input system was already deterministic with 169 transitions.
Support contains 80 out of 178 places (down from 86) after GAL structural reductions.
Computed a total of 178 stabilizing places and 169 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 178 transition count 169
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 169/169 transitions.
Graph (complete) has 212 edges and 178 vertex of which 40 are kept as prefixes of interest. Removing 138 places using SCC suffix rule.2 ms
Discarding 138 places :
Also discarding 131 output transitions
Drop transitions (Output transitions of discarded places.) removed 131 transitions
Ensure Unique test removed 4 places
Reduce places removed 5 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 35 transition count 14
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 26 rules applied. Total rules applied 50 place count 12 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 52 place count 10 transition count 11
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 52 place count 10 transition count 8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 58 place count 7 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 rules applied. Total rules applied 60 place count 6 transition count 7
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 63 place count 5 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 64 place count 4 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 64 place count 4 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 66 place count 3 transition count 4
Applied a total of 66 rules in 37 ms. Remains 3 /178 variables (removed 175) and now considering 4/169 (removed 165) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 3/178 places, 4/169 transitions.
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 1 ms
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 1 ms
[2024-05-27 07:19:10] [INFO ] Input system was already deterministic with 4 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 169/169 transitions.
Graph (complete) has 212 edges and 178 vertex of which 2 are kept as prefixes of interest. Removing 176 places using SCC suffix rule.1 ms
Discarding 176 places :
Also discarding 167 output transitions
Drop transitions (Output transitions of discarded places.) removed 167 transitions
Applied a total of 1 rules in 4 ms. Remains 2 /178 variables (removed 176) and now considering 2/169 (removed 167) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 2/178 places, 2/169 transitions.
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 1 ms
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 0 ms
[2024-05-27 07:19:10] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 169/169 transitions.
Ensure Unique test removed 19 places
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 156 transition count 169
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 146 transition count 159
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 146 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 43 place count 146 transition count 158
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 144 transition count 156
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 144 transition count 156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 143 transition count 155
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 143 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 142 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 142 transition count 154
Applied a total of 51 rules in 51 ms. Remains 142 /178 variables (removed 36) and now considering 154/169 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 142/178 places, 154/169 transitions.
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:19:10] [INFO ] Input system was already deterministic with 154 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 169/169 transitions.
Graph (complete) has 212 edges and 178 vertex of which 141 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.1 ms
Discarding 37 places :
Also discarding 32 output transitions
Drop transitions (Output transitions of discarded places.) removed 32 transitions
Ensure Unique test removed 15 places
Reduce places removed 16 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 83 place count 125 transition count 54
Reduce places removed 82 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 89 rules applied. Total rules applied 172 place count 43 transition count 47
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 178 place count 39 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 180 place count 37 transition count 45
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 180 place count 37 transition count 34
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 204 place count 24 transition count 34
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 rules applied. Total rules applied 206 place count 23 transition count 33
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 5 with 3 rules applied. Total rules applied 209 place count 22 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 210 place count 21 transition count 31
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 210 place count 21 transition count 29
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 214 place count 19 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 218 place count 19 transition count 25
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 1 rules applied. Total rules applied 219 place count 19 transition count 24
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 221 place count 18 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 222 place count 17 transition count 23
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 222 place count 17 transition count 22
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 224 place count 16 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 225 place count 16 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 225 place count 16 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 227 place count 15 transition count 20
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 228 place count 15 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 229 place count 15 transition count 19
Applied a total of 229 rules in 39 ms. Remains 15 /178 variables (removed 163) and now considering 19/169 (removed 150) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 15/178 places, 19/169 transitions.
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 1 ms
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 1 ms
[2024-05-27 07:19:10] [INFO ] Input system was already deterministic with 19 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 169/169 transitions.
Graph (complete) has 212 edges and 178 vertex of which 117 are kept as prefixes of interest. Removing 61 places using SCC suffix rule.1 ms
Discarding 61 places :
Also discarding 57 output transitions
Drop transitions (Output transitions of discarded places.) removed 57 transitions
Ensure Unique test removed 14 places
Reduce places removed 15 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 102 transition count 40
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 81 rules applied. Total rules applied 153 place count 31 transition count 30
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 159 place count 25 transition count 30
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 159 place count 25 transition count 22
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 177 place count 15 transition count 22
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 rules applied. Total rules applied 179 place count 14 transition count 21
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 182 place count 13 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 183 place count 12 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 183 place count 12 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 185 place count 11 transition count 18
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 186 place count 10 transition count 17
Iterating global reduction 6 with 1 rules applied. Total rules applied 187 place count 10 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 191 place count 10 transition count 13
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 6 with 2 rules applied. Total rules applied 193 place count 10 transition count 11
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 196 place count 8 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 197 place count 7 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 198 place count 7 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 199 place count 7 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 200 place count 6 transition count 8
Applied a total of 200 rules in 26 ms. Remains 6 /178 variables (removed 172) and now considering 8/169 (removed 161) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 6/178 places, 8/169 transitions.
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 0 ms
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 1 ms
[2024-05-27 07:19:10] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 169/169 transitions.
Graph (complete) has 212 edges and 178 vertex of which 139 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.1 ms
Discarding 39 places :
Also discarding 35 output transitions
Drop transitions (Output transitions of discarded places.) removed 35 transitions
Ensure Unique test removed 15 places
Reduce places removed 16 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 123 transition count 48
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 95 rules applied. Total rules applied 181 place count 38 transition count 38
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 188 place count 32 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 189 place count 31 transition count 37
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 189 place count 31 transition count 25
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 215 place count 17 transition count 25
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 rules applied. Total rules applied 217 place count 16 transition count 24
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 5 with 3 rules applied. Total rules applied 220 place count 15 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 221 place count 14 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 221 place count 14 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 223 place count 13 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 228 place count 13 transition count 16
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 7 with 2 rules applied. Total rules applied 230 place count 13 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 232 place count 11 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 232 place count 11 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 236 place count 9 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 237 place count 9 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 237 place count 9 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 239 place count 8 transition count 10
Applied a total of 239 rules in 28 ms. Remains 8 /178 variables (removed 170) and now considering 10/169 (removed 159) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 8/178 places, 10/169 transitions.
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 1 ms
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 1 ms
[2024-05-27 07:19:10] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 169/169 transitions.
Graph (complete) has 212 edges and 178 vertex of which 32 are kept as prefixes of interest. Removing 146 places using SCC suffix rule.1 ms
Discarding 146 places :
Also discarding 137 output transitions
Drop transitions (Output transitions of discarded places.) removed 137 transitions
Ensure Unique test removed 2 places
Reduce places removed 3 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 29 transition count 14
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 12 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 11 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 37 place count 11 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 43 place count 8 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 44 place count 7 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 44 place count 7 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 46 place count 6 transition count 9
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 47 place count 6 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 47 place count 6 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 49 place count 5 transition count 7
Applied a total of 49 rules in 14 ms. Remains 5 /178 variables (removed 173) and now considering 7/169 (removed 162) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 5/178 places, 7/169 transitions.
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 1 ms
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 0 ms
[2024-05-27 07:19:10] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 169/169 transitions.
Graph (complete) has 212 edges and 178 vertex of which 161 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Ensure Unique test removed 18 places
Reduce places removed 19 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 93 place count 142 transition count 64
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 102 rules applied. Total rules applied 195 place count 50 transition count 54
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 203 place count 44 transition count 52
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 205 place count 42 transition count 52
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 205 place count 42 transition count 38
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 29 rules applied. Total rules applied 234 place count 27 transition count 38
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 rules applied. Total rules applied 236 place count 26 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 237 place count 25 transition count 37
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 237 place count 25 transition count 36
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 239 place count 24 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 245 place count 24 transition count 30
Discarding 1 places :
Implicit places reduction removed 1 places
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 6 with 2 rules applied. Total rules applied 247 place count 23 transition count 29
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 249 place count 22 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 250 place count 21 transition count 28
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 3 Pre rules applied. Total rules applied 250 place count 21 transition count 25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 256 place count 18 transition count 25
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 258 place count 18 transition count 25
Applied a total of 258 rules in 26 ms. Remains 18 /178 variables (removed 160) and now considering 25/169 (removed 144) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 18/178 places, 25/169 transitions.
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 1 ms
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 1 ms
[2024-05-27 07:19:10] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 169/169 transitions.
Ensure Unique test removed 19 places
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 157 transition count 169
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 152 transition count 164
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 152 transition count 164
Applied a total of 31 rules in 9 ms. Remains 152 /178 variables (removed 26) and now considering 164/169 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 152/178 places, 164/169 transitions.
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:19:10] [INFO ] Input system was already deterministic with 164 transitions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 169/169 transitions.
Ensure Unique test removed 19 places
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 156 transition count 169
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 34 place count 144 transition count 157
Iterating global reduction 1 with 12 rules applied. Total rules applied 46 place count 144 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 144 transition count 156
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 141 transition count 153
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 141 transition count 153
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 139 transition count 151
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 139 transition count 151
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 137 transition count 149
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 137 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 136 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 136 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 135 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 135 transition count 147
Applied a total of 65 rules in 26 ms. Remains 135 /178 variables (removed 43) and now considering 147/169 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 135/178 places, 147/169 transitions.
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 8 ms
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 8 ms
[2024-05-27 07:19:10] [INFO ] Input system was already deterministic with 147 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 169/169 transitions.
Graph (complete) has 212 edges and 178 vertex of which 162 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Ensure Unique test removed 18 places
Reduce places removed 19 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 94 place count 143 transition count 64
Reduce places removed 93 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 97 rules applied. Total rules applied 191 place count 50 transition count 60
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 196 place count 48 transition count 57
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 199 place count 45 transition count 57
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 199 place count 45 transition count 42
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 31 rules applied. Total rules applied 230 place count 29 transition count 42
Discarding 1 places :
Implicit places reduction removed 1 places
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 2 rules applied. Total rules applied 232 place count 28 transition count 41
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 5 with 3 rules applied. Total rules applied 235 place count 27 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 236 place count 26 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 236 place count 26 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 238 place count 25 transition count 38
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 7 with 2 rules applied. Total rules applied 240 place count 24 transition count 37
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 245 place count 24 transition count 32
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 1 rules applied. Total rules applied 246 place count 24 transition count 31
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 248 place count 23 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 249 place count 22 transition count 30
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 249 place count 22 transition count 28
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 253 place count 20 transition count 28
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 255 place count 20 transition count 28
Applied a total of 255 rules in 29 ms. Remains 20 /178 variables (removed 158) and now considering 28/169 (removed 141) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 20/178 places, 28/169 transitions.
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 2 ms
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 2 ms
[2024-05-27 07:19:10] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 169/169 transitions.
Ensure Unique test removed 19 places
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 155 transition count 169
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 35 place count 143 transition count 157
Iterating global reduction 1 with 12 rules applied. Total rules applied 47 place count 143 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 143 transition count 156
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 141 transition count 154
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 141 transition count 154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 140 transition count 153
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 140 transition count 153
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 139 transition count 152
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 139 transition count 152
Applied a total of 56 rules in 19 ms. Remains 139 /178 variables (removed 39) and now considering 152/169 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 139/178 places, 152/169 transitions.
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 8 ms
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 8 ms
[2024-05-27 07:19:10] [INFO ] Input system was already deterministic with 152 transitions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 169/169 transitions.
Ensure Unique test removed 18 places
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 157 transition count 169
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 31 place count 147 transition count 159
Iterating global reduction 1 with 10 rules applied. Total rules applied 41 place count 147 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 147 transition count 158
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 144 transition count 155
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 144 transition count 155
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 142 transition count 153
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 142 transition count 153
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 140 transition count 151
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 140 transition count 151
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 139 transition count 150
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 139 transition count 150
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 138 transition count 149
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 138 transition count 149
Applied a total of 60 rules in 24 ms. Remains 138 /178 variables (removed 40) and now considering 149/169 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 138/178 places, 149/169 transitions.
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 8 ms
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 7 ms
[2024-05-27 07:19:10] [INFO ] Input system was already deterministic with 149 transitions.
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 9 ms
[2024-05-27 07:19:10] [INFO ] Flatten gal took : 10 ms
[2024-05-27 07:19:10] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2024-05-27 07:19:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 178 places, 169 transitions and 379 arcs took 4 ms.
Total runtime 43020 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running IBM319-PT-none
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: 178
TRANSITIONS: 169
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.002s, Sys 0.001s]
SAVING FILE /home/mcc/execution/412/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: 567
MODEL NAME: /home/mcc/execution/412/model
178 places, 169 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.
Building monolithic NSF...
FORMULA IBM319-PT-none-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA IBM319-PT-none-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA IBM319-PT-none-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA IBM319-PT-none-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA IBM319-PT-none-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA IBM319-PT-none-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA IBM319-PT-none-CTLCardinality-2024-04 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
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="IBM319-PT-none"
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 IBM319-PT-none, 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 r201-smll-171649587100329"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/IBM319-PT-none.tgz
mv IBM319-PT-none 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 ;