About the Execution of GreatSPN+red for CloudDeployment-PT-4a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 739.812 | 91161.00 | 154202.00 | 185.10 | TTFFFFFTFFTTTFTF | 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.r069-tall-171620504800569.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 CloudDeployment-PT-4a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620504800569
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 652K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 11 16:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 15:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 15:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 156K 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 CloudDeployment-PT-4a-CTLCardinality-2024-00
FORMULA_NAME CloudDeployment-PT-4a-CTLCardinality-2024-01
FORMULA_NAME CloudDeployment-PT-4a-CTLCardinality-2024-02
FORMULA_NAME CloudDeployment-PT-4a-CTLCardinality-2024-03
FORMULA_NAME CloudDeployment-PT-4a-CTLCardinality-2024-04
FORMULA_NAME CloudDeployment-PT-4a-CTLCardinality-2024-05
FORMULA_NAME CloudDeployment-PT-4a-CTLCardinality-2024-06
FORMULA_NAME CloudDeployment-PT-4a-CTLCardinality-2024-07
FORMULA_NAME CloudDeployment-PT-4a-CTLCardinality-2024-08
FORMULA_NAME CloudDeployment-PT-4a-CTLCardinality-2024-09
FORMULA_NAME CloudDeployment-PT-4a-CTLCardinality-2024-10
FORMULA_NAME CloudDeployment-PT-4a-CTLCardinality-2024-11
FORMULA_NAME CloudDeployment-PT-4a-CTLCardinality-2023-12
FORMULA_NAME CloudDeployment-PT-4a-CTLCardinality-2023-13
FORMULA_NAME CloudDeployment-PT-4a-CTLCardinality-2023-14
FORMULA_NAME CloudDeployment-PT-4a-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1716466423998
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-4a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 12:13:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 12:13:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 12:13:45] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-05-23 12:13:45] [INFO ] Transformed 141 places.
[2024-05-23 12:13:45] [INFO ] Transformed 475 transitions.
[2024-05-23 12:13:45] [INFO ] Found NUPN structural information;
[2024-05-23 12:13:45] [INFO ] Parsed PT model containing 141 places and 475 transitions and 2657 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Ensure Unique test removed 52 transitions
Reduce redundant transitions removed 52 transitions.
FORMULA CloudDeployment-PT-4a-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 89 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 423/423 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 136 transition count 423
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 135 transition count 422
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 135 transition count 422
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 1 with 38 rules applied. Total rules applied 45 place count 135 transition count 384
Applied a total of 45 rules in 41 ms. Remains 135 /141 variables (removed 6) and now considering 384/423 (removed 39) transitions.
[2024-05-23 12:13:45] [INFO ] Flow matrix only has 225 transitions (discarded 159 similar events)
// Phase 1: matrix 225 rows 135 cols
[2024-05-23 12:13:45] [INFO ] Computed 19 invariants in 18 ms
[2024-05-23 12:13:45] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-23 12:13:45] [INFO ] Flow matrix only has 225 transitions (discarded 159 similar events)
[2024-05-23 12:13:45] [INFO ] Invariant cache hit.
[2024-05-23 12:13:45] [INFO ] State equation strengthened by 89 read => feed constraints.
[2024-05-23 12:13:46] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Running 383 sub problems to find dead transitions.
[2024-05-23 12:13:46] [INFO ] Flow matrix only has 225 transitions (discarded 159 similar events)
[2024-05-23 12:13:46] [INFO ] Invariant cache hit.
[2024-05-23 12:13:46] [INFO ] State equation strengthened by 89 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (OVERLAPS) 224/358 variables, 134/153 constraints. Problems are: Problem set: 0 solved, 383 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 88/241 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 5 (OVERLAPS) 1/359 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 7 (OVERLAPS) 1/360 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 9 (OVERLAPS) 0/360 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 383 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 243 constraints, problems are : Problem set: 0 solved, 383 unsolved in 21231 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 135/135 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 383/383 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 383 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 2 (OVERLAPS) 224/358 variables, 134/153 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 88/241 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 383/624 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 6 (OVERLAPS) 1/359 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 8 (OVERLAPS) 1/360 variables, 1/626 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 383 unsolved
At refinement iteration 10 (OVERLAPS) 0/360 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 383 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 626 constraints, problems are : Problem set: 0 solved, 383 unsolved in 28571 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 135/135 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 383/383 constraints, Known Traps: 0/0 constraints]
After SMT, in 50266ms problems are : Problem set: 0 solved, 383 unsolved
Search for dead transitions found 0 dead transitions in 50294ms
Starting structural reductions in LTL mode, iteration 1 : 135/141 places, 384/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50839 ms. Remains : 135/141 places, 384/423 transitions.
Support contains 89 out of 135 places after structural reductions.
[2024-05-23 12:14:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-23 12:14:36] [INFO ] Flatten gal took : 105 ms
[2024-05-23 12:14:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA CloudDeployment-PT-4a-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-4a-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 12:14:36] [INFO ] Flatten gal took : 81 ms
[2024-05-23 12:14:37] [INFO ] Input system was already deterministic with 384 transitions.
Support contains 78 out of 135 places (down from 89) after GAL structural reductions.
RANDOM walk for 40000 steps (648 resets) in 1871 ms. (21 steps per ms) remains 5/56 properties
BEST_FIRST walk for 40002 steps (115 resets) in 369 ms. (108 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (80 resets) in 232 ms. (171 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (104 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (20 resets) in 74 ms. (533 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
[2024-05-23 12:14:38] [INFO ] Flow matrix only has 225 transitions (discarded 159 similar events)
[2024-05-23 12:14:38] [INFO ] Invariant cache hit.
[2024-05-23 12:14:38] [INFO ] State equation strengthened by 89 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 90/102 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 32/134 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 224/358 variables, 134/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 88/241 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/359 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/359 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/360 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/360 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 243 constraints, problems are : Problem set: 0 solved, 4 unsolved in 411 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 135/135 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 90/102 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 32/134 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 224/358 variables, 134/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 88/241 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 4/245 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp32 is UNSAT
At refinement iteration 9 (OVERLAPS) 1/359 variables, 1/246 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/359 variables, 0/246 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/360 variables, 1/247 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 0/247 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/360 variables, 0/247 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 360/360 variables, and 247 constraints, problems are : Problem set: 1 solved, 3 unsolved in 665 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 135/135 constraints, ReadFeed: 89/89 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1091ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 251 ms.
Support contains 7 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 384/384 transitions.
Graph (trivial) has 141 edges and 135 vertex of which 31 / 135 are part of one of the 10 SCC in 2 ms
Free SCC test removed 21 places
Drop transitions (Empty/Sink Transition effects.) removed 74 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 86 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 111 transition count 298
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 7 place count 108 transition count 287
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 108 transition count 287
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 107 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 107 transition count 286
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 34 place count 96 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 51 transitions
Redundant transition composition rules discarded 51 transitions
Iterating global reduction 1 with 51 rules applied. Total rules applied 85 place count 96 transition count 257
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 89 place count 94 transition count 255
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 93 place count 94 transition count 266
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 97 place count 90 transition count 266
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 90 transition count 266
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 89 transition count 265
Applied a total of 99 rules in 155 ms. Remains 89 /135 variables (removed 46) and now considering 265/384 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 89/135 places, 265/384 transitions.
RANDOM walk for 40000 steps (732 resets) in 402 ms. (99 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (160 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1793084 steps, run timeout after 3001 ms. (steps per millisecond=597 ) properties seen :0 out of 1
Probabilistic random walk after 1793084 steps, saw 268120 distinct states, run finished after 3004 ms. (steps per millisecond=596 ) properties seen :0
[2024-05-23 12:14:42] [INFO ] Flow matrix only has 145 transitions (discarded 120 similar events)
// Phase 1: matrix 145 rows 89 cols
[2024-05-23 12:14:42] [INFO ] Computed 16 invariants in 3 ms
[2024-05-23 12:14:42] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/59 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/89 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 145/234 variables, 89/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/234 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 309 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 89/89 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/59 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 30/89 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 145/234 variables, 89/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/234 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 116 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 89/89 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 436ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 7 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 265/265 transitions.
Applied a total of 0 rules in 35 ms. Remains 89 /89 variables (removed 0) and now considering 265/265 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 89/89 places, 265/265 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 265/265 transitions.
Applied a total of 0 rules in 7 ms. Remains 89 /89 variables (removed 0) and now considering 265/265 (removed 0) transitions.
[2024-05-23 12:14:43] [INFO ] Flow matrix only has 145 transitions (discarded 120 similar events)
[2024-05-23 12:14:43] [INFO ] Invariant cache hit.
[2024-05-23 12:14:43] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-23 12:14:43] [INFO ] Flow matrix only has 145 transitions (discarded 120 similar events)
[2024-05-23 12:14:43] [INFO ] Invariant cache hit.
[2024-05-23 12:14:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 12:14:43] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-05-23 12:14:43] [INFO ] Redundant transitions in 13 ms returned []
Running 249 sub problems to find dead transitions.
[2024-05-23 12:14:43] [INFO ] Flow matrix only has 145 transitions (discarded 120 similar events)
[2024-05-23 12:14:43] [INFO ] Invariant cache hit.
[2024-05-23 12:14:43] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 4/89 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 145/234 variables, 89/105 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (OVERLAPS) 0/234 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 111 constraints, problems are : Problem set: 0 solved, 249 unsolved in 6180 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 89/89 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 4/89 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 145/234 variables, 89/105 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 249/360 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 8 (OVERLAPS) 0/234 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 360 constraints, problems are : Problem set: 0 solved, 249 unsolved in 7824 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 89/89 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints]
After SMT, in 14209ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 14211ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14566 ms. Remains : 89/89 places, 265/265 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 60 edges and 89 vertex of which 14 / 89 are part of one of the 2 SCC in 0 ms
Free SCC test removed 12 places
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 136 transitions.
Ensure Unique test removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 70 transition count 115
Reduce places removed 14 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 18 rules applied. Total rules applied 40 place count 56 transition count 111
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 45 place count 52 transition count 110
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 45 place count 52 transition count 105
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 55 place count 47 transition count 105
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 58 place count 44 transition count 102
Iterating global reduction 3 with 3 rules applied. Total rules applied 61 place count 44 transition count 102
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 64 place count 41 transition count 90
Iterating global reduction 3 with 3 rules applied. Total rules applied 67 place count 41 transition count 90
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 76 place count 41 transition count 81
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 80 place count 39 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 84 place count 39 transition count 75
Free-agglomeration rule applied 4 times with reduction of 4 identical transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 88 place count 39 transition count 67
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 96 place count 35 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 98 place count 35 transition count 61
Applied a total of 98 rules in 27 ms. Remains 35 /89 variables (removed 54) and now considering 61/265 (removed 204) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 61 rows 35 cols
[2024-05-23 12:14:57] [INFO ] Computed 9 invariants in 1 ms
[2024-05-23 12:14:58] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 12:14:58] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-23 12:14:58] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 12:14:58] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 12:14:58] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 214 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2024-05-23 12:14:58] [INFO ] Flatten gal took : 41 ms
[2024-05-23 12:14:58] [INFO ] Flatten gal took : 33 ms
[2024-05-23 12:14:58] [INFO ] Input system was already deterministic with 384 transitions.
Computed a total of 67 stabilizing places and 248 stable transitions
Graph (complete) has 1139 edges and 135 vertex of which 131 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 384/384 transitions.
Graph (trivial) has 151 edges and 135 vertex of which 34 / 135 are part of one of the 10 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 104 transition count 309
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 104 transition count 309
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 103 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 103 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 26 place count 103 transition count 291
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 0 with 4 rules applied. Total rules applied 30 place count 103 transition count 287
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 34 place count 99 transition count 287
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 44 place count 94 transition count 282
Applied a total of 44 rules in 68 ms. Remains 94 /135 variables (removed 41) and now considering 282/384 (removed 102) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 68 ms. Remains : 94/135 places, 282/384 transitions.
[2024-05-23 12:14:58] [INFO ] Flatten gal took : 30 ms
[2024-05-23 12:14:58] [INFO ] Flatten gal took : 30 ms
[2024-05-23 12:14:58] [INFO ] Input system was already deterministic with 282 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 384/384 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 384
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 131 transition count 383
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 131 transition count 383
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 130 transition count 382
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 130 transition count 382
Applied a total of 7 rules in 23 ms. Remains 130 /135 variables (removed 5) and now considering 382/384 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 130/135 places, 382/384 transitions.
[2024-05-23 12:14:58] [INFO ] Flatten gal took : 33 ms
[2024-05-23 12:14:58] [INFO ] Flatten gal took : 33 ms
[2024-05-23 12:14:58] [INFO ] Input system was already deterministic with 382 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 384/384 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 384
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 131 transition count 383
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 131 transition count 383
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 130 transition count 382
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 130 transition count 382
Applied a total of 7 rules in 6 ms. Remains 130 /135 variables (removed 5) and now considering 382/384 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 130/135 places, 382/384 transitions.
[2024-05-23 12:14:58] [INFO ] Flatten gal took : 15 ms
[2024-05-23 12:14:58] [INFO ] Flatten gal took : 31 ms
[2024-05-23 12:14:58] [INFO ] Input system was already deterministic with 382 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 384/384 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 384
Applied a total of 3 rules in 3 ms. Remains 132 /135 variables (removed 3) and now considering 384/384 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 132/135 places, 384/384 transitions.
[2024-05-23 12:14:58] [INFO ] Flatten gal took : 15 ms
[2024-05-23 12:14:58] [INFO ] Flatten gal took : 15 ms
[2024-05-23 12:14:58] [INFO ] Input system was already deterministic with 384 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 384/384 transitions.
Graph (trivial) has 148 edges and 135 vertex of which 39 / 135 are part of one of the 12 SCC in 1 ms
Free SCC test removed 27 places
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 99 transition count 288
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 99 transition count 288
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 98 transition count 287
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 98 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 98 transition count 274
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 29 place count 98 transition count 271
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 32 place count 95 transition count 271
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 91 transition count 267
Applied a total of 40 rules in 57 ms. Remains 91 /135 variables (removed 44) and now considering 267/384 (removed 117) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57 ms. Remains : 91/135 places, 267/384 transitions.
[2024-05-23 12:14:58] [INFO ] Flatten gal took : 11 ms
[2024-05-23 12:14:58] [INFO ] Flatten gal took : 27 ms
[2024-05-23 12:14:59] [INFO ] Input system was already deterministic with 267 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 384/384 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 384
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 131 transition count 383
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 131 transition count 383
Applied a total of 5 rules in 3 ms. Remains 131 /135 variables (removed 4) and now considering 383/384 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 131/135 places, 383/384 transitions.
[2024-05-23 12:14:59] [INFO ] Flatten gal took : 29 ms
[2024-05-23 12:14:59] [INFO ] Flatten gal took : 16 ms
[2024-05-23 12:14:59] [INFO ] Input system was already deterministic with 383 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 384/384 transitions.
Graph (trivial) has 153 edges and 135 vertex of which 36 / 135 are part of one of the 11 SCC in 1 ms
Free SCC test removed 25 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Ensure Unique test removed 3 places
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 102 transition count 294
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 102 transition count 294
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 101 transition count 293
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 101 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 29 place count 101 transition count 277
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 0 with 4 rules applied. Total rules applied 33 place count 101 transition count 273
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 37 place count 97 transition count 273
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 45 place count 93 transition count 269
Applied a total of 45 rules in 61 ms. Remains 93 /135 variables (removed 42) and now considering 269/384 (removed 115) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61 ms. Remains : 93/135 places, 269/384 transitions.
[2024-05-23 12:14:59] [INFO ] Flatten gal took : 24 ms
[2024-05-23 12:14:59] [INFO ] Flatten gal took : 12 ms
[2024-05-23 12:14:59] [INFO ] Input system was already deterministic with 269 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 384/384 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 384
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 131 transition count 383
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 131 transition count 383
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 130 transition count 382
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 130 transition count 382
Applied a total of 7 rules in 5 ms. Remains 130 /135 variables (removed 5) and now considering 382/384 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 130/135 places, 382/384 transitions.
[2024-05-23 12:14:59] [INFO ] Flatten gal took : 16 ms
[2024-05-23 12:14:59] [INFO ] Flatten gal took : 14 ms
[2024-05-23 12:14:59] [INFO ] Input system was already deterministic with 382 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 384/384 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 384
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 131 transition count 383
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 131 transition count 383
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 130 transition count 382
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 130 transition count 382
Applied a total of 7 rules in 7 ms. Remains 130 /135 variables (removed 5) and now considering 382/384 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 130/135 places, 382/384 transitions.
[2024-05-23 12:14:59] [INFO ] Flatten gal took : 14 ms
[2024-05-23 12:14:59] [INFO ] Flatten gal took : 14 ms
[2024-05-23 12:14:59] [INFO ] Input system was already deterministic with 382 transitions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 384/384 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 384
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 131 transition count 383
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 131 transition count 383
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 130 transition count 382
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 130 transition count 382
Applied a total of 7 rules in 5 ms. Remains 130 /135 variables (removed 5) and now considering 382/384 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 130/135 places, 382/384 transitions.
[2024-05-23 12:14:59] [INFO ] Flatten gal took : 14 ms
[2024-05-23 12:14:59] [INFO ] Flatten gal took : 14 ms
[2024-05-23 12:14:59] [INFO ] Input system was already deterministic with 382 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 135/135 places, 384/384 transitions.
Graph (trivial) has 155 edges and 135 vertex of which 36 / 135 are part of one of the 11 SCC in 0 ms
Free SCC test removed 25 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Ensure Unique test removed 3 places
Reduce places removed 4 places and 1 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 102 transition count 302
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 102 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 101 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 101 transition count 301
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 28 place count 101 transition count 284
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 0 with 4 rules applied. Total rules applied 32 place count 101 transition count 280
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 36 place count 97 transition count 280
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 46 place count 92 transition count 275
Applied a total of 46 rules in 28 ms. Remains 92 /135 variables (removed 43) and now considering 275/384 (removed 109) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 92/135 places, 275/384 transitions.
[2024-05-23 12:14:59] [INFO ] Flatten gal took : 10 ms
[2024-05-23 12:14:59] [INFO ] Flatten gal took : 11 ms
[2024-05-23 12:14:59] [INFO ] Input system was already deterministic with 275 transitions.
[2024-05-23 12:14:59] [INFO ] Flatten gal took : 15 ms
[2024-05-23 12:14:59] [INFO ] Flatten gal took : 15 ms
[2024-05-23 12:14:59] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 12 ms.
[2024-05-23 12:14:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 135 places, 384 transitions and 2315 arcs took 24 ms.
Total runtime 74518 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running CloudDeployment-PT-4a
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: 135
TRANSITIONS: 384
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.014s, Sys 0.000s]
SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 591
MODEL NAME: /home/mcc/execution/412/model
135 places, 384 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 CloudDeployment-PT-4a-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudDeployment-PT-4a-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudDeployment-PT-4a-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudDeployment-PT-4a-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudDeployment-PT-4a-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudDeployment-PT-4a-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudDeployment-PT-4a-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudDeployment-PT-4a-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudDeployment-PT-4a-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudDeployment-PT-4a-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudDeployment-PT-4a-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716466515159
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudDeployment-PT-4a"
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 CloudDeployment-PT-4a, 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 r069-tall-171620504800569"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-4a.tgz
mv CloudDeployment-PT-4a 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 ;