fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r364-tall-171683777300192
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for ShieldIIPt-PT-040A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
659.976 195543.00 520352.00 210.20 T 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.r364-tall-171683777300192.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 ShieldIIPt-PT-040A, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r364-tall-171683777300192
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 22:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 22:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 22:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 212K 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1716910631159

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldIIPt-PT-040A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 15:37:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-28 15:37:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 15:37:12] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2024-05-28 15:37:12] [INFO ] Transformed 763 places.
[2024-05-28 15:37:12] [INFO ] Transformed 563 transitions.
[2024-05-28 15:37:12] [INFO ] Found NUPN structural information;
[2024-05-28 15:37:12] [INFO ] Parsed PT model containing 763 places and 563 transitions and 2406 arcs in 248 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 763/763 places, 563/563 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 763 transition count 562
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 763 transition count 561
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 761 transition count 560
Applied a total of 5 rules in 85 ms. Remains 761 /763 variables (removed 2) and now considering 560/563 (removed 3) transitions.
// Phase 1: matrix 560 rows 761 cols
[2024-05-28 15:37:12] [INFO ] Computed 361 invariants in 49 ms
[2024-05-28 15:37:13] [INFO ] Implicit Places using invariants in 700 ms returned [753, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 729 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 759/763 places, 560/563 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 759 transition count 559
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 559
Applied a total of 2 rules in 21 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2024-05-28 15:37:13] [INFO ] Computed 359 invariants in 9 ms
[2024-05-28 15:37:13] [INFO ] Implicit Places using invariants in 410 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 413 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 757/763 places, 559/563 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 756 transition count 558
Applied a total of 2 rules in 21 ms. Remains 756 /757 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 756 cols
[2024-05-28 15:37:13] [INFO ] Computed 358 invariants in 5 ms
[2024-05-28 15:37:14] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-05-28 15:37:14] [INFO ] Invariant cache hit.
[2024-05-28 15:37:15] [INFO ] Implicit Places using invariants and state equation in 840 ms returned []
Implicit Place search using SMT with State Equation took 1296 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 3 : 756/763 places, 558/563 transitions.
Finished structural reductions in LIVENESS mode , in 3 iterations and 2583 ms. Remains : 756/763 places, 558/563 transitions.
Discarding 159 transitions out of 558. Remains 399
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (8 resets) in 2898 ms. (13 steps per ms) remains 260/398 properties
BEST_FIRST walk for 404 steps (8 resets) in 19 ms. (20 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 19 ms. (20 steps per ms) remains 260/260 properties
BEST_FIRST walk for 402 steps (8 resets) in 25 ms. (15 steps per ms) remains 260/260 properties
BEST_FIRST walk for 402 steps (8 resets) in 28 ms. (13 steps per ms) remains 260/260 properties
BEST_FIRST walk for 402 steps (8 resets) in 28 ms. (13 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 260/260 properties
BEST_FIRST walk for 402 steps (8 resets) in 25 ms. (15 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 19 ms. (20 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 15 ms. (25 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 260/260 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 260/260 properties
BEST_FIRST walk for 402 steps (8 resets) in 12 ms. (30 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 14 ms. (26 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 260/260 properties
BEST_FIRST walk for 401 steps (8 resets) in 14 ms. (26 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 13 ms. (28 steps per ms) remains 260/260 properties
BEST_FIRST walk for 402 steps (8 resets) in 10 ms. (36 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 12 ms. (31 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 260/260 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 260/260 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 260/260 properties
BEST_FIRST walk for 403 steps (8 resets) in 21 ms. (18 steps per ms) remains 260/260 properties
[2024-05-28 15:37:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 496/496 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/496 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 10/506 variables, 239/735 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/506 variables, 10/745 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 506/1314 variables, and 745 constraints, problems are : Problem set: 0 solved, 260 unsolved in 5023 ms.
Refiners :[Domain max(s): 506/756 constraints, Positive P Invariants (semi-flows): 239/358 constraints, State Equation: 0/756 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 496/496 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/496 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (OVERLAPS) 10/506 variables, 239/735 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/506 variables, 10/745 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 250/756 variables, 119/864 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 250/1114 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 756/1314 variables, and 1114 constraints, problems are : Problem set: 0 solved, 260 unsolved in 5013 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 0/756 constraints, PredecessorRefiner: 0/260 constraints, Known Traps: 0/0 constraints]
After SMT, in 10191ms problems are : Problem set: 0 solved, 260 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 496 out of 756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 558/558 transitions.
Partial Free-agglomeration rule applied 27 times.
Drop transitions (Partial Free agglomeration) removed 27 transitions
Iterating global reduction 0 with 27 rules applied. Total rules applied 27 place count 756 transition count 558
Applied a total of 27 rules in 66 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 756/756 places, 558/558 transitions.
RANDOM walk for 4000000 steps (8 resets) in 69249 ms. (57 steps per ms) remains 86/260 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2133 ms. (187 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2132 ms. (187 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2161 ms. (185 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2161 ms. (185 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2176 ms. (183 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2234 ms. (178 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2223 ms. (179 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2202 ms. (181 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2171 ms. (184 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2198 ms. (181 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2250 ms. (177 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2258 ms. (177 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2258 ms. (177 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2257 ms. (177 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2244 ms. (178 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2251 ms. (177 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2236 ms. (178 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2212 ms. (180 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2208 ms. (181 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2195 ms. (182 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2220 ms. (180 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2217 ms. (180 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2214 ms. (180 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2217 ms. (180 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2218 ms. (180 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2227 ms. (179 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2224 ms. (179 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2232 ms. (179 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2233 ms. (179 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2193 ms. (182 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2206 ms. (181 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2229 ms. (179 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2232 ms. (179 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2251 ms. (177 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2259 ms. (176 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2257 ms. (177 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2269 ms. (176 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2257 ms. (177 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2249 ms. (177 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2254 ms. (177 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2251 ms. (177 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2274 ms. (175 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2256 ms. (177 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2267 ms. (176 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2249 ms. (177 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2209 ms. (180 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2191 ms. (182 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2187 ms. (182 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2222 ms. (179 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2227 ms. (179 steps per ms) remains 86/86 properties
// Phase 1: matrix 558 rows 756 cols
[2024-05-28 15:38:13] [INFO ] Computed 358 invariants in 6 ms
[2024-05-28 15:38:13] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 10/176 variables, 83/249 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 10/259 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 580/756 variables, 275/534 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 580/1114 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 558/1314 variables, 756/1870 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1314 variables, 15/1885 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1314 variables, 0/1885 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 0/1314 variables, 0/1885 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 1885 constraints, problems are : Problem set: 0 solved, 86 unsolved in 8960 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 756/756 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 10/176 variables, 83/249 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 10/259 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 580/756 variables, 275/534 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 580/1114 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 558/1314 variables, 756/1870 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1314 variables, 15/1885 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1314 variables, 86/1971 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1314 variables, 0/1971 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 12 (OVERLAPS) 0/1314 variables, 0/1971 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 1971 constraints, problems are : Problem set: 0 solved, 86 unsolved in 16944 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 756/756 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints]
After SMT, in 25970ms problems are : Problem set: 0 solved, 86 unsolved
Fused 86 Parikh solutions to 84 different solutions.
Parikh walk visited 0 properties in 30207 ms.
Support contains 166 out of 756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 558/558 transitions.
Partial Free-agglomeration rule applied 34 times.
Drop transitions (Partial Free agglomeration) removed 34 transitions
Iterating global reduction 0 with 34 rules applied. Total rules applied 34 place count 756 transition count 558
Applied a total of 34 rules in 66 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 756/756 places, 558/558 transitions.
RANDOM walk for 4000000 steps (8 resets) in 49649 ms. (80 steps per ms) remains 35/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2122 ms. (188 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2116 ms. (188 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2105 ms. (189 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2104 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2109 ms. (189 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2093 ms. (191 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2107 ms. (189 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2106 ms. (189 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2122 ms. (188 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2091 ms. (191 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2092 ms. (191 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2076 ms. (192 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2091 ms. (191 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2101 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2107 ms. (189 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2126 ms. (188 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2083 ms. (191 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2061 ms. (193 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2068 ms. (193 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2056 ms. (194 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2064 ms. (193 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2050 ms. (195 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2075 ms. (192 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2076 ms. (192 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2082 ms. (192 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2080 ms. (192 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2068 ms. (193 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2093 ms. (191 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2083 ms. (191 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2090 ms. (191 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2099 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2104 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2112 ms. (189 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2100 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2082 ms. (192 steps per ms) remains 35/35 properties
// Phase 1: matrix 558 rows 756 cols
[2024-05-28 15:39:41] [INFO ] Computed 358 invariants in 3 ms
[2024-05-28 15:39:41] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 13/83 variables, 39/109 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 13/122 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 673/756 variables, 319/441 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 673/1114 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 558/1314 variables, 756/1870 constraints. Problems are: Problem set: 0 solved, 35 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1314 variables, 31/1901 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1314 variables, 0/1901 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 0/1314 variables, 0/1901 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 1901 constraints, problems are : Problem set: 0 solved, 35 unsolved in 2979 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 756/756 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (OVERLAPS) 13/83 variables, 39/109 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 13/122 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 673/756 variables, 319/441 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 673/1114 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 558/1314 variables, 756/1870 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1314 variables, 31/1901 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1314 variables, 35/1936 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1314 variables, 0/1936 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 12 (OVERLAPS) 0/1314 variables, 0/1936 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 1936 constraints, problems are : Problem set: 0 solved, 35 unsolved in 5167 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 756/756 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 0/0 constraints]
After SMT, in 8171ms problems are : Problem set: 0 solved, 35 unsolved
Fused 35 Parikh solutions to 34 different solutions.
Parikh walk visited 0 properties in 21561 ms.
Support contains 70 out of 756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 558/558 transitions.
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 756 transition count 558
Applied a total of 11 rules in 66 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 756/756 places, 558/558 transitions.
RANDOM walk for 3299638 steps (7 resets) in 40048 ms. (82 steps per ms) remains 0/35 properties
Able to resolve query QuasiLiveness after proving 399 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 194287 ms.
ITS solved all properties within timeout

BK_STOP 1716910826702

--------------------
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:
++ 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
++ sed s/.jar//
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -timeout 180 -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="ShieldIIPt-PT-040A"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 ShieldIIPt-PT-040A, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r364-tall-171683777300192"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-040A.tgz
mv ShieldIIPt-PT-040A execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;