About the Execution of GreatSPN+red for ShieldRVt-PT-100A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3488.228 | 146709.00 | 197326.00 | 371.50 | TTTFTFFTFTFFTFFF | 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.r355-tall-171683760101046.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 ShieldRVt-PT-100A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683760101046
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 11:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K Apr 12 11:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 08:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 08:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 273K 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 ShieldRVt-PT-100A-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVt-PT-100A-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717090875184
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-100A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 17:41:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 17:41:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 17:41:16] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2024-05-30 17:41:16] [INFO ] Transformed 803 places.
[2024-05-30 17:41:16] [INFO ] Transformed 803 transitions.
[2024-05-30 17:41:16] [INFO ] Found NUPN structural information;
[2024-05-30 17:41:16] [INFO ] Parsed PT model containing 803 places and 803 transitions and 3406 arcs in 246 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2182 ms. (18 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 834 ms. (47 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 599 ms. (66 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 884 ms. (45 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 405 ms. (98 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 445 ms. (89 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 357 ms. (111 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 262 ms. (152 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 271 ms. (147 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 268740 steps, run timeout after 6001 ms. (steps per millisecond=44 ) properties seen :11 out of 14
Probabilistic random walk after 268740 steps, saw 266594 distinct states, run finished after 6009 ms. (steps per millisecond=44 ) properties seen :11
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 802 rows 803 cols
[2024-05-30 17:41:25] [INFO ] Computed 401 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 141/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 662/803 variables, 391/542 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/803 variables, 662/1204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/803 variables, 0/1204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 802/1605 variables, 803/2007 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1605 variables, 0/2007 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1605 variables, 0/2007 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1605/1605 variables, and 2007 constraints, problems are : Problem set: 0 solved, 3 unsolved in 971 ms.
Refiners :[Domain max(s): 803/803 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 803/803 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 141/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 10/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 662/803 variables, 391/542 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/803 variables, 662/1204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/803 variables, 0/1204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 802/1605 variables, 803/2007 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1605 variables, 3/2010 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1605 variables, 0/2010 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1605 variables, 0/2010 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1605/1605 variables, and 2010 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1593 ms.
Refiners :[Domain max(s): 803/803 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 803/803 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2733ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 5916 ms.
Support contains 141 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 802/802 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 802 transition count 801
Partial Free-agglomeration rule applied 69 times.
Drop transitions (Partial Free agglomeration) removed 69 transitions
Iterating global reduction 0 with 69 rules applied. Total rules applied 71 place count 802 transition count 801
Drop transitions (Redundant composition of simpler transitions.) removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 0 with 69 rules applied. Total rules applied 140 place count 802 transition count 732
Applied a total of 140 rules in 247 ms. Remains 802 /803 variables (removed 1) and now considering 732/802 (removed 70) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 264 ms. Remains : 802/803 places, 732/802 transitions.
RANDOM walk for 40000 steps (8 resets) in 732 ms. (54 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 442 ms. (90 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 423 ms. (94 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 340 ms. (117 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 199077 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :2 out of 3
Probabilistic random walk after 199077 steps, saw 197577 distinct states, run finished after 3002 ms. (steps per millisecond=66 ) properties seen :2
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 732 rows 802 cols
[2024-05-30 17:41:37] [INFO ] Computed 401 invariants in 11 ms
[2024-05-30 17:41:37] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 28/55 variables, 27/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 28/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 747/802 variables, 374/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 747/1203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 732/1534 variables, 802/2005 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1534 variables, 2/2007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1534 variables, 0/2007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1534 variables, 0/2007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1534/1534 variables, and 2007 constraints, problems are : Problem set: 0 solved, 1 unsolved in 458 ms.
Refiners :[Domain max(s): 802/802 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 802/802 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 28/55 variables, 27/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 28/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 747/802 variables, 374/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 747/1203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 732/1534 variables, 802/2005 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1534 variables, 2/2007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1534 variables, 1/2008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1534 variables, 0/2008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1534 variables, 0/2008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1534/1534 variables, and 2008 constraints, problems are : Problem set: 0 solved, 1 unsolved in 731 ms.
Refiners :[Domain max(s): 802/802 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 802/802 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1222ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 913 ms.
Support contains 27 out of 802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 732/732 transitions.
Partial Free-agglomeration rule applied 20 times.
Drop transitions (Partial Free agglomeration) removed 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 802 transition count 732
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 802 transition count 712
Applied a total of 40 rules in 89 ms. Remains 802 /802 variables (removed 0) and now considering 712/732 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 802/802 places, 712/732 transitions.
RANDOM walk for 40000 steps (8 resets) in 540 ms. (73 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 498 ms. (80 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 285152 steps, run timeout after 3002 ms. (steps per millisecond=94 ) properties seen :0 out of 1
Probabilistic random walk after 285152 steps, saw 283113 distinct states, run finished after 3002 ms. (steps per millisecond=94 ) properties seen :0
// Phase 1: matrix 712 rows 802 cols
[2024-05-30 17:41:43] [INFO ] Computed 401 invariants in 10 ms
[2024-05-30 17:41:43] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 28/55 variables, 27/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 28/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 747/802 variables, 374/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 747/1203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 712/1514 variables, 802/2005 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1514 variables, 2/2007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1514 variables, 0/2007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1514 variables, 0/2007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1514/1514 variables, and 2007 constraints, problems are : Problem set: 0 solved, 1 unsolved in 424 ms.
Refiners :[Domain max(s): 802/802 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 802/802 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 28/55 variables, 27/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 28/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 747/802 variables, 374/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 747/1203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/1203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 712/1514 variables, 802/2005 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1514 variables, 2/2007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1514 variables, 1/2008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1514 variables, 0/2008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1514 variables, 0/2008 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1514/1514 variables, and 2008 constraints, problems are : Problem set: 0 solved, 1 unsolved in 598 ms.
Refiners :[Domain max(s): 802/802 constraints, Positive P Invariants (semi-flows): 401/401 constraints, State Equation: 802/802 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1057ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1057 ms.
Support contains 27 out of 802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 712/712 transitions.
Applied a total of 0 rules in 41 ms. Remains 802 /802 variables (removed 0) and now considering 712/712 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 802/802 places, 712/712 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 712/712 transitions.
Applied a total of 0 rules in 25 ms. Remains 802 /802 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2024-05-30 17:41:45] [INFO ] Invariant cache hit.
[2024-05-30 17:41:45] [INFO ] Implicit Places using invariants in 444 ms returned [795]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 453 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 801/802 places, 712/712 transitions.
Applied a total of 0 rules in 26 ms. Remains 801 /801 variables (removed 0) and now considering 712/712 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 505 ms. Remains : 801/802 places, 712/712 transitions.
RANDOM walk for 40000 steps (8 resets) in 616 ms. (64 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 335311 steps, run timeout after 3002 ms. (steps per millisecond=111 ) properties seen :0 out of 1
Probabilistic random walk after 335311 steps, saw 332773 distinct states, run finished after 3004 ms. (steps per millisecond=111 ) properties seen :0
// Phase 1: matrix 712 rows 801 cols
[2024-05-30 17:41:49] [INFO ] Computed 400 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 28/55 variables, 27/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 28/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 746/801 variables, 373/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/801 variables, 746/1201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/801 variables, 0/1201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 712/1513 variables, 801/2002 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1513 variables, 0/2002 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1513 variables, 0/2002 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1513/1513 variables, and 2002 constraints, problems are : Problem set: 0 solved, 1 unsolved in 410 ms.
Refiners :[Domain max(s): 801/801 constraints, Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 801/801 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 28/55 variables, 27/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 28/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 746/801 variables, 373/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/801 variables, 746/1201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/801 variables, 0/1201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 712/1513 variables, 801/2002 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1513 variables, 1/2003 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1513 variables, 0/2003 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1513 variables, 0/2003 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1513/1513 variables, and 2003 constraints, problems are : Problem set: 0 solved, 1 unsolved in 639 ms.
Refiners :[Domain max(s): 801/801 constraints, Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 801/801 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1083ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 982 ms.
Support contains 27 out of 801 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 712/712 transitions.
Applied a total of 0 rules in 20 ms. Remains 801 /801 variables (removed 0) and now considering 712/712 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 801/801 places, 712/712 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 712/712 transitions.
Applied a total of 0 rules in 20 ms. Remains 801 /801 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2024-05-30 17:41:51] [INFO ] Invariant cache hit.
[2024-05-30 17:41:51] [INFO ] Implicit Places using invariants in 473 ms returned []
[2024-05-30 17:41:51] [INFO ] Invariant cache hit.
[2024-05-30 17:41:52] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1324 ms to find 0 implicit places.
[2024-05-30 17:41:52] [INFO ] Redundant transitions in 40 ms returned []
Running 711 sub problems to find dead transitions.
[2024-05-30 17:41:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 800/800 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/800 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 2 (OVERLAPS) 1/801 variables, 400/1200 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/801 variables, 1/1201 constraints. Problems are: Problem set: 0 solved, 711 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 801/1513 variables, and 1201 constraints, problems are : Problem set: 0 solved, 711 unsolved in 30043 ms.
Refiners :[Domain max(s): 801/801 constraints, Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 0/801 constraints, PredecessorRefiner: 711/711 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 711 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 800/800 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/800 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 2 (OVERLAPS) 1/801 variables, 400/1200 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/801 variables, 1/1201 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/801 variables, 0/1201 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 5 (OVERLAPS) 712/1513 variables, 801/2002 constraints. Problems are: Problem set: 0 solved, 711 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1513 variables, 711/2713 constraints. Problems are: Problem set: 0 solved, 711 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1513/1513 variables, and 2713 constraints, problems are : Problem set: 0 solved, 711 unsolved in 30020 ms.
Refiners :[Domain max(s): 801/801 constraints, Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 801/801 constraints, PredecessorRefiner: 711/711 constraints, Known Traps: 0/0 constraints]
After SMT, in 60282ms problems are : Problem set: 0 solved, 711 unsolved
Search for dead transitions found 0 dead transitions in 60300ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61701 ms. Remains : 801/801 places, 712/712 transitions.
[2024-05-30 17:42:53] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-30 17:42:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 801 places, 712 transitions and 3219 arcs took 7 ms.
[2024-05-30 17:42:53] [INFO ] Flatten gal took : 162 ms
Total runtime 97098 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ShieldRVt-PT-100A
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/406/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 801
TRANSITIONS: 712
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.019s, Sys 0.000s]
SAVING FILE /home/mcc/execution/406/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 590
MODEL NAME: /home/mcc/execution/406/model
801 places, 712 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.
Building monolithic NSF...
FORMULA ShieldRVt-PT-100A-ReachabilityCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717091021893
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-100A"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldRVt-PT-100A, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683760101046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-100A.tgz
mv ShieldRVt-PT-100A execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;