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-171683759300694.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 ShieldPPPt-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-171683759300694
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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 4.0K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 14:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Apr 11 14:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 14:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 14:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 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 685K 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 ShieldPPPt-PT-100A-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldPPPt-PT-100A-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717032613115

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-100A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 01:30:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 01:30:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:30:14] [INFO ] Load time of PNML (sax parser for PT used): 193 ms
[2024-05-30 01:30:14] [INFO ] Transformed 2503 places.
[2024-05-30 01:30:14] [INFO ] Transformed 1803 transitions.
[2024-05-30 01:30:14] [INFO ] Found NUPN structural information;
[2024-05-30 01:30:14] [INFO ] Parsed PT model containing 2503 places and 1803 transitions and 7206 arcs in 409 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2062 ms. (19 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 690 ms. (57 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 778 ms. (51 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 667 ms. (59 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 523 ms. (76 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 521 ms. (76 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 712 ms. (56 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 549 ms. (72 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 541 ms. (73 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 518 ms. (77 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 591 ms. (67 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 610 ms. (65 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 545 ms. (73 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 531 ms. (75 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 504 ms. (79 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 211314 steps, run timeout after 9008 ms. (steps per millisecond=23 ) properties seen :6 out of 14
Probabilistic random walk after 211314 steps, saw 209733 distinct states, run finished after 9014 ms. (steps per millisecond=23 ) properties seen :6
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 1802 rows 2503 cols
[2024-05-30 01:30:27] [INFO ] Computed 1101 invariants in 48 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 200/315 variables, 128/243 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 200/443 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2188/2503 variables, 973/1416 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2503 variables, 2188/3604 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2503 variables, 0/3604 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1802/4305 variables, 2503/6107 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4305 variables, 0/6107 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/4305 variables, 0/6107 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4305/4305 variables, and 6107 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2981 ms.
Refiners :[Domain max(s): 2503/2503 constraints, Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 2503/2503 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 200/315 variables, 128/243 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 200/443 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2188/2503 variables, 973/1416 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2503 variables, 2188/3604 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2503 variables, 0/3604 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1802/4305 variables, 2503/6107 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4305 variables, 8/6115 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4305 variables, 0/6115 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4305/4305 variables, and 6115 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5023 ms.
Refiners :[Domain max(s): 2503/2503 constraints, Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 2503/2503 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 8162ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 115 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Partial Free-agglomeration rule applied 355 times.
Drop transitions (Partial Free agglomeration) removed 355 transitions
Iterating global reduction 0 with 355 rules applied. Total rules applied 359 place count 2501 transition count 1800
Applied a total of 359 rules in 799 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 811 ms. Remains : 2501/2503 places, 1800/1802 transitions.
RANDOM walk for 40000 steps (8 resets) in 1212 ms. (32 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 671 ms. (59 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 527 ms. (75 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 523 ms. (76 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 501 ms. (79 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 526 ms. (75 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 535 ms. (74 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 597 ms. (66 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 743 ms. (53 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 66646 steps, run timeout after 3002 ms. (steps per millisecond=22 ) properties seen :0 out of 8
Probabilistic random walk after 66646 steps, saw 64433 distinct states, run finished after 3003 ms. (steps per millisecond=22 ) properties seen :0
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-30 01:30:40] [INFO ] Computed 1101 invariants in 20 ms
[2024-05-30 01:30:40] [INFO ] State equation strengthened by 97 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 200/315 variables, 128/243 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 200/443 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2186/2501 variables, 973/1416 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2501 variables, 2186/3602 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2501 variables, 0/3602 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1800/4301 variables, 2501/6103 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4301 variables, 97/6200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4301 variables, 0/6200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/4301 variables, 0/6200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4301/4301 variables, and 6200 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2754 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 2501/2501 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 115/115 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 200/315 variables, 128/243 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 200/443 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2186/2501 variables, 973/1416 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2501 variables, 2186/3602 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2501 variables, 0/3602 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1800/4301 variables, 2501/6103 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4301 variables, 97/6200 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4301 variables, 8/6208 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-30 01:30:47] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 11 ms to minimize.
[2024-05-30 01:30:47] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-30 01:30:47] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/4301 variables, 3/6211 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4301 variables, 0/6211 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/4301 variables, 0/6211 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4301/4301 variables, and 6211 constraints, problems are : Problem set: 0 solved, 8 unsolved in 11999 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 2501/2501 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 3/3 constraints]
After SMT, in 14829ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-2024-15 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-2024-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-2024-11 TRUE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-2024-07 FALSE TECHNIQUES PARIKH_WALK
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-2024-01 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 7 properties in 33844 ms.
Support contains 30 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Partial Free-agglomeration rule applied 33 times.
Drop transitions (Partial Free agglomeration) removed 33 transitions
Iterating global reduction 0 with 33 rules applied. Total rules applied 33 place count 2501 transition count 1800
Applied a total of 33 rules in 198 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 2501/2501 places, 1800/1800 transitions.
RANDOM walk for 40000 steps (8 resets) in 897 ms. (44 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 517 ms. (77 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 126241 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 1
Probabilistic random walk after 126241 steps, saw 120935 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
// Phase 1: matrix 1800 rows 2501 cols
[2024-05-30 01:31:33] [INFO ] Computed 1101 invariants in 13 ms
[2024-05-30 01:31:33] [INFO ] State equation strengthened by 99 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 53/83 variables, 34/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 53/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2418/2501 variables, 1067/1184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2501 variables, 2418/3602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2501 variables, 0/3602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1800/4301 variables, 2501/6103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4301 variables, 99/6202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4301 variables, 0/6202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/4301 variables, 0/6202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4301/4301 variables, and 6202 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1188 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 2501/2501 constraints, ReadFeed: 99/99 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/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 53/83 variables, 34/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 53/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2418/2501 variables, 1067/1184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2501 variables, 2418/3602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2501 variables, 0/3602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1800/4301 variables, 2501/6103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4301 variables, 99/6202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4301 variables, 1/6203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4301 variables, 0/6203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/4301 variables, 0/6203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4301/4301 variables, and 6203 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2689 ms.
Refiners :[Domain max(s): 2501/2501 constraints, Positive P Invariants (semi-flows): 1101/1101 constraints, State Equation: 2501/2501 constraints, ReadFeed: 99/99 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3925ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4898 ms.
Support contains 30 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 97 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 94 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2024-05-30 01:31:42] [INFO ] Invariant cache hit.
[2024-05-30 01:31:43] [INFO ] Implicit Places using invariants in 1756 ms returned [2494]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1768 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 1800/1800 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 1798
Applied a total of 4 rules in 118 ms. Remains 2498 /2500 variables (removed 2) and now considering 1798/1800 (removed 2) transitions.
// Phase 1: matrix 1798 rows 2498 cols
[2024-05-30 01:31:43] [INFO ] Computed 1100 invariants in 6 ms
[2024-05-30 01:31:45] [INFO ] Implicit Places using invariants in 1838 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1855 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2496/2501 places, 1798/1800 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2494 transition count 1796
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2494 transition count 1796
Applied a total of 4 rules in 347 ms. Remains 2494 /2496 variables (removed 2) and now considering 1796/1798 (removed 2) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2024-05-30 01:31:46] [INFO ] Computed 1098 invariants in 7 ms
[2024-05-30 01:31:47] [INFO ] Implicit Places using invariants in 1340 ms returned []
[2024-05-30 01:31:47] [INFO ] Invariant cache hit.
[2024-05-30 01:31:48] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-05-30 01:31:54] [INFO ] Implicit Places using invariants and state equation in 7350 ms returned []
Implicit Place search using SMT with State Equation took 8696 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 2494/2501 places, 1796/1800 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 12884 ms. Remains : 2494/2501 places, 1796/1800 transitions.
RANDOM walk for 40000 steps (8 resets) in 660 ms. (60 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 494 ms. (80 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 122925 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 1
Probabilistic random walk after 122925 steps, saw 117753 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
[2024-05-30 01:31:58] [INFO ] Invariant cache hit.
[2024-05-30 01:31:58] [INFO ] State equation strengthened by 97 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/83 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2411/2494 variables, 1064/1098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2494 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1796/4290 variables, 2494/3592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4290 variables, 97/3689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4290 variables, 0/3689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4290 variables, 0/3689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4290/4290 variables, and 3689 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1013 ms.
Refiners :[Positive P Invariants (semi-flows): 1098/1098 constraints, State Equation: 2494/2494 constraints, ReadFeed: 97/97 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/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/83 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2411/2494 variables, 1064/1098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2494 variables, 0/1098 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1796/4290 variables, 2494/3592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4290 variables, 97/3689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4290 variables, 1/3690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4290 variables, 0/3690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/4290 variables, 0/3690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4290/4290 variables, and 3690 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2176 ms.
Refiners :[Positive P Invariants (semi-flows): 1098/1098 constraints, State Equation: 2494/2494 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3211ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2374 steps, including 0 resets, run visited all 1 properties in 47 ms. (steps per millisecond=50 )
FORMULA ShieldPPPt-PT-100A-ReachabilityCardinality-2024-10 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 61 ms.
All properties solved without resorting to model-checking.
Total runtime 107123 ms.
ITS solved all properties within timeout

BK_STOP 1717032721539

--------------------
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 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="ShieldPPPt-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 ShieldPPPt-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-171683759300694"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-100A.tgz
mv ShieldPPPt-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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;