About the Execution of GreatSPN+red for SieveSingleMsgMbox-PT-d1m04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3869.123 | 506368.00 | 551786.00 | 1478.60 | FFFFFTTFTFFFT?TT | 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.r377-smll-171683809600050.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 SieveSingleMsgMbox-PT-d1m04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r377-smll-171683809600050
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 836K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 19:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 19:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 19:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 19:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 450K May 18 16:43 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 SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716887386217
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 09:09:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 09:09:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 09:09:49] [INFO ] Load time of PNML (sax parser for PT used): 333 ms
[2024-05-28 09:09:49] [INFO ] Transformed 1295 places.
[2024-05-28 09:09:49] [INFO ] Transformed 749 transitions.
[2024-05-28 09:09:49] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 583 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 29 ms.
Deduced a syphon composed of 1036 places in 20 ms
Reduce places removed 1036 places and 0 transitions.
Support contains 59 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 749/749 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 240 transitions
Reduce isomorphic transitions removed 240 transitions.
Iterating post reduction 0 with 257 rules applied. Total rules applied 257 place count 242 transition count 509
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 291 place count 208 transition count 448
Iterating global reduction 1 with 34 rules applied. Total rules applied 325 place count 208 transition count 448
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 331 place count 208 transition count 442
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 345 place count 194 transition count 428
Iterating global reduction 2 with 14 rules applied. Total rules applied 359 place count 194 transition count 428
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 367 place count 194 transition count 420
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 374 place count 187 transition count 413
Iterating global reduction 3 with 7 rules applied. Total rules applied 381 place count 187 transition count 413
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 3 with 34 rules applied. Total rules applied 415 place count 187 transition count 379
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 416 place count 186 transition count 377
Iterating global reduction 4 with 1 rules applied. Total rules applied 417 place count 186 transition count 377
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 418 place count 185 transition count 376
Iterating global reduction 4 with 1 rules applied. Total rules applied 419 place count 185 transition count 376
Applied a total of 419 rules in 254 ms. Remains 185 /259 variables (removed 74) and now considering 376/749 (removed 373) transitions.
// Phase 1: matrix 376 rows 185 cols
[2024-05-28 09:09:49] [INFO ] Computed 5 invariants in 44 ms
[2024-05-28 09:09:50] [INFO ] Implicit Places using invariants in 552 ms returned []
[2024-05-28 09:09:50] [INFO ] Invariant cache hit.
[2024-05-28 09:09:50] [INFO ] State equation strengthened by 246 read => feed constraints.
[2024-05-28 09:09:51] [INFO ] Implicit Places using invariants and state equation in 1485 ms returned []
Implicit Place search using SMT with State Equation took 2089 ms to find 0 implicit places.
Running 375 sub problems to find dead transitions.
[2024-05-28 09:09:51] [INFO ] Invariant cache hit.
[2024-05-28 09:09:51] [INFO ] State equation strengthened by 246 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-28 09:09:58] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 35 ms to minimize.
[2024-05-28 09:09:58] [INFO ] Deduced a trap composed of 26 places in 162 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-28 09:09:59] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 2 ms to minimize.
[2024-05-28 09:09:59] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 2 ms to minimize.
[2024-05-28 09:10:01] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (OVERLAPS) 1/185 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-28 09:10:09] [INFO ] Deduced a trap composed of 57 places in 142 ms of which 3 ms to minimize.
[2024-05-28 09:10:09] [INFO ] Deduced a trap composed of 59 places in 112 ms of which 3 ms to minimize.
[2024-05-28 09:10:09] [INFO ] Deduced a trap composed of 57 places in 139 ms of which 3 ms to minimize.
[2024-05-28 09:10:10] [INFO ] Deduced a trap composed of 59 places in 152 ms of which 4 ms to minimize.
[2024-05-28 09:10:10] [INFO ] Deduced a trap composed of 61 places in 143 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-28 09:10:13] [INFO ] Deduced a trap composed of 57 places in 114 ms of which 2 ms to minimize.
[2024-05-28 09:10:15] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Problem TDEAD315 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
At refinement iteration 9 (OVERLAPS) 376/561 variables, 185/202 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/561 variables, 246/448 constraints. Problems are: Problem set: 7 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 561/561 variables, and 448 constraints, problems are : Problem set: 7 solved, 368 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 185/185 constraints, ReadFeed: 246/246 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 7 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 1/1 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/177 variables, 4/5 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/5 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 3 (OVERLAPS) 3/180 variables, 1/6 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 2/8 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 2/10 constraints. Problems are: Problem set: 7 solved, 368 unsolved
[2024-05-28 09:10:26] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 1/11 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/180 variables, 0/11 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 8 (OVERLAPS) 4/184 variables, 1/12 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 6/18 constraints. Problems are: Problem set: 7 solved, 368 unsolved
[2024-05-28 09:10:33] [INFO ] Deduced a trap composed of 28 places in 153 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 1/19 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 0/19 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 12 (OVERLAPS) 375/559 variables, 184/203 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/559 variables, 245/448 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/559 variables, 53/501 constraints. Problems are: Problem set: 7 solved, 368 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/559 variables, 0/501 constraints. Problems are: Problem set: 7 solved, 368 unsolved
SMT process timed out in 61532ms, After SMT, problems are : Problem set: 7 solved, 368 unsolved
Search for dead transitions found 7 dead transitions in 61575ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in LTL mode, iteration 1 : 185/259 places, 369/749 transitions.
Reduce places removed 8 places and 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 177 transition count 361
Reduce places removed 2 places and 4 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 175 transition count 357
Reduce places removed 0 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 174 transition count 355
Deduced a syphon composed of 33 places in 2 ms
Reduce places removed 8 places and 203 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 20 place count 166 transition count 152
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 41 place count 152 transition count 145
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 44 place count 149 transition count 142
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 47 place count 149 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 48 place count 149 transition count 141
Deduced a syphon composed of 25 places in 0 ms
Applied a total of 48 rules in 30 ms. Remains 149 /185 variables (removed 36) and now considering 141/369 (removed 228) transitions.
// Phase 1: matrix 141 rows 149 cols
[2024-05-28 09:10:53] [INFO ] Computed 27 invariants in 3 ms
[2024-05-28 09:10:53] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-28 09:10:53] [INFO ] Invariant cache hit.
[2024-05-28 09:10:53] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-28 09:10:53] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 149/259 places, 141/749 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64507 ms. Remains : 149/259 places, 141/749 transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Support contains 26 out of 124 places after structural reductions.
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 09:10:54] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-28 09:10:54] [INFO ] Flatten gal took : 79 ms
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 09:10:54] [INFO ] Flatten gal took : 38 ms
[2024-05-28 09:10:54] [INFO ] Input system was already deterministic with 141 transitions.
Support contains 15 out of 124 places (down from 26) after GAL structural reductions.
RANDOM walk for 40000 steps (8859 resets) in 2383 ms. (16 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40002 steps (3872 resets) in 214 ms. (186 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1842 resets) in 217 ms. (183 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (3883 resets) in 127 ms. (312 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1850 resets) in 189 ms. (210 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (4013 resets) in 148 ms. (268 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1822 resets) in 102 ms. (388 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1895 resets) in 121 ms. (327 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1917 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
// Phase 1: matrix 141 rows 124 cols
[2024-05-28 09:10:55] [INFO ] Computed 2 invariants in 2 ms
[2024-05-28 09:10:55] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 68/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 5/86 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 134/220 variables, 86/88 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 51/139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 8 (OVERLAPS) 45/265 variables, 38/177 constraints. Problems are: Problem set: 2 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 7/184 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 0/184 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/265 variables, 0/184 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 184 constraints, problems are : Problem set: 2 solved, 6 unsolved in 410 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 124/124 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 68/78 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 5/83 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 133/216 variables, 83/85 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/216 variables, 50/135 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/135 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 49/265 variables, 41/176 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 8/184 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 6/190 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/190 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/265 variables, 0/190 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 190 constraints, problems are : Problem set: 3 solved, 5 unsolved in 594 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 124/124 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 1040ms problems are : Problem set: 3 solved, 5 unsolved
Parikh walk visited 0 properties in 497 ms.
Support contains 8 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 141/141 transitions.
Graph (complete) has 331 edges and 124 vertex of which 120 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 120 transition count 138
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 18 place count 106 transition count 123
Iterating global reduction 1 with 14 rules applied. Total rules applied 32 place count 106 transition count 123
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 38 place count 106 transition count 117
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 44 place count 100 transition count 111
Iterating global reduction 2 with 6 rules applied. Total rules applied 50 place count 100 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 100 transition count 110
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 57 place count 94 transition count 103
Iterating global reduction 3 with 6 rules applied. Total rules applied 63 place count 94 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 94 transition count 102
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 67 place count 91 transition count 98
Iterating global reduction 4 with 3 rules applied. Total rules applied 70 place count 91 transition count 98
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 73 place count 88 transition count 95
Iterating global reduction 4 with 3 rules applied. Total rules applied 76 place count 88 transition count 95
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 78 place count 86 transition count 92
Iterating global reduction 4 with 2 rules applied. Total rules applied 80 place count 86 transition count 92
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 82 place count 84 transition count 90
Iterating global reduction 4 with 2 rules applied. Total rules applied 84 place count 84 transition count 90
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 86 place count 82 transition count 88
Iterating global reduction 4 with 2 rules applied. Total rules applied 88 place count 82 transition count 88
Applied a total of 88 rules in 65 ms. Remains 82 /124 variables (removed 42) and now considering 88/141 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 82/124 places, 88/141 transitions.
RANDOM walk for 40000 steps (8934 resets) in 252 ms. (158 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (4194 resets) in 112 ms. (354 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1948 resets) in 119 ms. (333 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1915 resets) in 165 ms. (240 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1920 resets) in 139 ms. (285 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40001 steps (1909 resets) in 112 ms. (353 steps per ms) remains 4/4 properties
// Phase 1: matrix 88 rows 82 cols
[2024-05-28 09:10:57] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 09:10:57] [INFO ] State equation strengthened by 34 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 46/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 5/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-28 09:10:57] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 84/142 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 30/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 28/170 variables, 24/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/170 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 119 constraints, problems are : Problem set: 0 solved, 4 unsolved in 395 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 46/53 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 5/58 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 84/142 variables, 58/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 30/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 28/170 variables, 24/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/170 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/170 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 123 constraints, problems are : Problem set: 0 solved, 4 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 34/34 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 806ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 1 properties in 396 ms.
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 88/88 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 81 transition count 87
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 87
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 80 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 80 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 80 transition count 85
Applied a total of 5 rules in 11 ms. Remains 80 /82 variables (removed 2) and now considering 85/88 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 80/82 places, 85/88 transitions.
RANDOM walk for 40000 steps (8982 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1870 resets) in 47 ms. (833 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1920 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (1896 resets) in 72 ms. (547 steps per ms) remains 3/3 properties
Probably explored full state space saw : 1195 states, properties seen :2
Probabilistic random walk after 2940 steps, saw 1195 distinct states, run finished after 30 ms. (steps per millisecond=98 ) properties seen :2
Explored full state space saw : 1195 states, properties seen :0
Exhaustive walk after 2940 steps, saw 1195 distinct states, run finished after 10 ms. (steps per millisecond=294 ) properties seen :0
Successfully simplified 4 atomic propositions for a total of 7 simplifications.
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 09:10:59] [INFO ] Flatten gal took : 13 ms
[2024-05-28 09:10:59] [INFO ] Flatten gal took : 14 ms
[2024-05-28 09:10:59] [INFO ] Input system was already deterministic with 141 transitions.
Computed a total of 124 stabilizing places and 141 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 124 transition count 141
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 141/141 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 121 transition count 139
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 23 place count 103 transition count 119
Iterating global reduction 1 with 18 rules applied. Total rules applied 41 place count 103 transition count 119
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 48 place count 103 transition count 112
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 58 place count 93 transition count 102
Iterating global reduction 2 with 10 rules applied. Total rules applied 68 place count 93 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 93 transition count 100
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 79 place count 84 transition count 89
Iterating global reduction 3 with 9 rules applied. Total rules applied 88 place count 84 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 91 place count 84 transition count 86
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 95 place count 80 transition count 81
Iterating global reduction 4 with 4 rules applied. Total rules applied 99 place count 80 transition count 81
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 103 place count 76 transition count 77
Iterating global reduction 4 with 4 rules applied. Total rules applied 107 place count 76 transition count 77
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 109 place count 74 transition count 74
Iterating global reduction 4 with 2 rules applied. Total rules applied 111 place count 74 transition count 74
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 113 place count 72 transition count 72
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 72 transition count 72
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 117 place count 70 transition count 70
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 70 transition count 70
Applied a total of 119 rules in 19 ms. Remains 70 /124 variables (removed 54) and now considering 70/141 (removed 71) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 70/124 places, 70/141 transitions.
[2024-05-28 09:10:59] [INFO ] Flatten gal took : 6 ms
[2024-05-28 09:10:59] [INFO ] Flatten gal took : 7 ms
[2024-05-28 09:10:59] [INFO ] Input system was already deterministic with 70 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 141/141 transitions.
Graph (complete) has 376 edges and 124 vertex of which 121 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 121 transition count 139
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 103 transition count 119
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 103 transition count 119
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 46 place count 103 transition count 112
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 56 place count 93 transition count 102
Iterating global reduction 2 with 10 rules applied. Total rules applied 66 place count 93 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 93 transition count 100
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 77 place count 84 transition count 89
Iterating global reduction 3 with 9 rules applied. Total rules applied 86 place count 84 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 89 place count 84 transition count 86
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 92 place count 81 transition count 82
Iterating global reduction 4 with 3 rules applied. Total rules applied 95 place count 81 transition count 82
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 98 place count 78 transition count 79
Iterating global reduction 4 with 3 rules applied. Total rules applied 101 place count 78 transition count 79
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 102 place count 77 transition count 78
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 77 transition count 78
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 104 place count 76 transition count 77
Iterating global reduction 4 with 1 rules applied. Total rules applied 105 place count 76 transition count 77
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 106 place count 75 transition count 76
Iterating global reduction 4 with 1 rules applied. Total rules applied 107 place count 75 transition count 76
Applied a total of 107 rules in 34 ms. Remains 75 /124 variables (removed 49) and now considering 76/141 (removed 65) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 75/124 places, 76/141 transitions.
[2024-05-28 09:10:59] [INFO ] Flatten gal took : 6 ms
[2024-05-28 09:10:59] [INFO ] Flatten gal took : 8 ms
[2024-05-28 09:10:59] [INFO ] Input system was already deterministic with 76 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 141/141 transitions.
Graph (complete) has 376 edges and 124 vertex of which 121 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 121 transition count 139
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 20 place count 104 transition count 120
Iterating global reduction 1 with 17 rules applied. Total rules applied 37 place count 104 transition count 120
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 44 place count 104 transition count 113
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 53 place count 95 transition count 104
Iterating global reduction 2 with 9 rules applied. Total rules applied 62 place count 95 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 95 transition count 103
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 72 place count 86 transition count 92
Iterating global reduction 3 with 9 rules applied. Total rules applied 81 place count 86 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 84 place count 86 transition count 89
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 88 place count 82 transition count 84
Iterating global reduction 4 with 4 rules applied. Total rules applied 92 place count 82 transition count 84
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 96 place count 78 transition count 80
Iterating global reduction 4 with 4 rules applied. Total rules applied 100 place count 78 transition count 80
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 102 place count 76 transition count 77
Iterating global reduction 4 with 2 rules applied. Total rules applied 104 place count 76 transition count 77
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 106 place count 74 transition count 75
Iterating global reduction 4 with 2 rules applied. Total rules applied 108 place count 74 transition count 75
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 110 place count 72 transition count 73
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 72 transition count 73
Applied a total of 112 rules in 33 ms. Remains 72 /124 variables (removed 52) and now considering 73/141 (removed 68) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 72/124 places, 73/141 transitions.
[2024-05-28 09:10:59] [INFO ] Flatten gal took : 6 ms
[2024-05-28 09:10:59] [INFO ] Flatten gal took : 7 ms
[2024-05-28 09:10:59] [INFO ] Input system was already deterministic with 73 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 141/141 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 121 transition count 139
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 23 place count 103 transition count 119
Iterating global reduction 1 with 18 rules applied. Total rules applied 41 place count 103 transition count 119
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 48 place count 103 transition count 112
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 58 place count 93 transition count 102
Iterating global reduction 2 with 10 rules applied. Total rules applied 68 place count 93 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 93 transition count 100
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 79 place count 84 transition count 89
Iterating global reduction 3 with 9 rules applied. Total rules applied 88 place count 84 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 91 place count 84 transition count 86
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 95 place count 80 transition count 81
Iterating global reduction 4 with 4 rules applied. Total rules applied 99 place count 80 transition count 81
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 103 place count 76 transition count 77
Iterating global reduction 4 with 4 rules applied. Total rules applied 107 place count 76 transition count 77
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 109 place count 74 transition count 74
Iterating global reduction 4 with 2 rules applied. Total rules applied 111 place count 74 transition count 74
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 113 place count 72 transition count 72
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 72 transition count 72
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 117 place count 70 transition count 70
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 70 transition count 70
Applied a total of 119 rules in 14 ms. Remains 70 /124 variables (removed 54) and now considering 70/141 (removed 71) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 70/124 places, 70/141 transitions.
[2024-05-28 09:10:59] [INFO ] Flatten gal took : 6 ms
[2024-05-28 09:10:59] [INFO ] Flatten gal took : 6 ms
[2024-05-28 09:10:59] [INFO ] Input system was already deterministic with 70 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 141/141 transitions.
Graph (complete) has 376 edges and 124 vertex of which 121 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 121 transition count 139
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 19 place count 105 transition count 122
Iterating global reduction 1 with 16 rules applied. Total rules applied 35 place count 105 transition count 122
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 42 place count 105 transition count 115
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 50 place count 97 transition count 107
Iterating global reduction 2 with 8 rules applied. Total rules applied 58 place count 97 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 60 place count 97 transition count 105
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 67 place count 90 transition count 97
Iterating global reduction 3 with 7 rules applied. Total rules applied 74 place count 90 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 90 transition count 96
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 79 place count 86 transition count 91
Iterating global reduction 4 with 4 rules applied. Total rules applied 83 place count 86 transition count 91
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 87 place count 82 transition count 87
Iterating global reduction 4 with 4 rules applied. Total rules applied 91 place count 82 transition count 87
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 92 place count 81 transition count 86
Iterating global reduction 4 with 1 rules applied. Total rules applied 93 place count 81 transition count 86
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 94 place count 80 transition count 85
Iterating global reduction 4 with 1 rules applied. Total rules applied 95 place count 80 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 96 place count 79 transition count 84
Iterating global reduction 4 with 1 rules applied. Total rules applied 97 place count 79 transition count 84
Applied a total of 97 rules in 32 ms. Remains 79 /124 variables (removed 45) and now considering 84/141 (removed 57) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 79/124 places, 84/141 transitions.
[2024-05-28 09:10:59] [INFO ] Flatten gal took : 6 ms
[2024-05-28 09:10:59] [INFO ] Flatten gal took : 7 ms
[2024-05-28 09:10:59] [INFO ] Input system was already deterministic with 84 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 141/141 transitions.
Graph (complete) has 376 edges and 124 vertex of which 121 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 121 transition count 139
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 21 place count 103 transition count 119
Iterating global reduction 1 with 18 rules applied. Total rules applied 39 place count 103 transition count 119
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 46 place count 103 transition count 112
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 56 place count 93 transition count 102
Iterating global reduction 2 with 10 rules applied. Total rules applied 66 place count 93 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 93 transition count 100
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 77 place count 84 transition count 89
Iterating global reduction 3 with 9 rules applied. Total rules applied 86 place count 84 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 89 place count 84 transition count 86
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 93 place count 80 transition count 81
Iterating global reduction 4 with 4 rules applied. Total rules applied 97 place count 80 transition count 81
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 101 place count 76 transition count 77
Iterating global reduction 4 with 4 rules applied. Total rules applied 105 place count 76 transition count 77
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 107 place count 74 transition count 74
Iterating global reduction 4 with 2 rules applied. Total rules applied 109 place count 74 transition count 74
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 111 place count 72 transition count 72
Iterating global reduction 4 with 2 rules applied. Total rules applied 113 place count 72 transition count 72
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 115 place count 70 transition count 70
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 70 transition count 70
Applied a total of 117 rules in 31 ms. Remains 70 /124 variables (removed 54) and now considering 70/141 (removed 71) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 70/124 places, 70/141 transitions.
[2024-05-28 09:10:59] [INFO ] Flatten gal took : 6 ms
[2024-05-28 09:10:59] [INFO ] Flatten gal took : 7 ms
[2024-05-28 09:10:59] [INFO ] Input system was already deterministic with 70 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 141/141 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 121 transition count 139
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 23 place count 103 transition count 119
Iterating global reduction 1 with 18 rules applied. Total rules applied 41 place count 103 transition count 119
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 48 place count 103 transition count 112
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 58 place count 93 transition count 102
Iterating global reduction 2 with 10 rules applied. Total rules applied 68 place count 93 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 93 transition count 100
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 79 place count 84 transition count 89
Iterating global reduction 3 with 9 rules applied. Total rules applied 88 place count 84 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 91 place count 84 transition count 86
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 95 place count 80 transition count 81
Iterating global reduction 4 with 4 rules applied. Total rules applied 99 place count 80 transition count 81
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 103 place count 76 transition count 77
Iterating global reduction 4 with 4 rules applied. Total rules applied 107 place count 76 transition count 77
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 109 place count 74 transition count 74
Iterating global reduction 4 with 2 rules applied. Total rules applied 111 place count 74 transition count 74
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 113 place count 72 transition count 72
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 72 transition count 72
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 117 place count 70 transition count 70
Iterating global reduction 4 with 2 rules applied. Total rules applied 119 place count 70 transition count 70
Applied a total of 119 rules in 13 ms. Remains 70 /124 variables (removed 54) and now considering 70/141 (removed 71) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 70/124 places, 70/141 transitions.
[2024-05-28 09:10:59] [INFO ] Flatten gal took : 6 ms
[2024-05-28 09:10:59] [INFO ] Flatten gal took : 7 ms
[2024-05-28 09:10:59] [INFO ] Input system was already deterministic with 70 transitions.
[2024-05-28 09:10:59] [INFO ] Flatten gal took : 13 ms
[2024-05-28 09:10:59] [INFO ] Flatten gal took : 12 ms
[2024-05-28 09:10:59] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-28 09:10:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 124 places, 141 transitions and 553 arcs took 4 ms.
Total runtime 71181 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running SieveSingleMsgMbox-PT-d1m04
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 124
TRANSITIONS: 141
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.006s, Sys 0.000s]
SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.001s]
----------------------------------------------------------------------
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: 622
MODEL NAME: /home/mcc/execution/412/model
124 places, 141 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 SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d1m04-CTLFireability-2023-13 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716887892585
--------------------
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 CTLFireability -timeout 360 -rebuildPNML
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="SieveSingleMsgMbox-PT-d1m04"
export BK_EXAMINATION="CTLFireability"
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 SieveSingleMsgMbox-PT-d1m04, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r377-smll-171683809600050"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m04.tgz
mv SieveSingleMsgMbox-PT-d1m04 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;