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.r179-tall-171640602300790.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 HealthRecord-PT-12, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640602300790
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K 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 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 20:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 12 20:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 20:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 71K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HealthRecord-PT-12-ReachabilityCardinality-2024-00
FORMULA_NAME HealthRecord-PT-12-ReachabilityCardinality-2024-01
FORMULA_NAME HealthRecord-PT-12-ReachabilityCardinality-2024-02
FORMULA_NAME HealthRecord-PT-12-ReachabilityCardinality-2024-03
FORMULA_NAME HealthRecord-PT-12-ReachabilityCardinality-2024-04
FORMULA_NAME HealthRecord-PT-12-ReachabilityCardinality-2024-05
FORMULA_NAME HealthRecord-PT-12-ReachabilityCardinality-2024-06
FORMULA_NAME HealthRecord-PT-12-ReachabilityCardinality-2024-07
FORMULA_NAME HealthRecord-PT-12-ReachabilityCardinality-2024-08
FORMULA_NAME HealthRecord-PT-12-ReachabilityCardinality-2024-09
FORMULA_NAME HealthRecord-PT-12-ReachabilityCardinality-2024-10
FORMULA_NAME HealthRecord-PT-12-ReachabilityCardinality-2024-11
FORMULA_NAME HealthRecord-PT-12-ReachabilityCardinality-2024-12
FORMULA_NAME HealthRecord-PT-12-ReachabilityCardinality-2024-13
FORMULA_NAME HealthRecord-PT-12-ReachabilityCardinality-2024-14
FORMULA_NAME HealthRecord-PT-12-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716491107223

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 19:05:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 19:05:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 19:05:08] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-05-23 19:05:08] [INFO ] Transformed 160 places.
[2024-05-23 19:05:08] [INFO ] Transformed 340 transitions.
[2024-05-23 19:05:08] [INFO ] Found NUPN structural information;
[2024-05-23 19:05:08] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA HealthRecord-PT-12-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (2890 resets) in 1602 ms. (24 steps per ms) remains 7/9 properties
FORMULA HealthRecord-PT-12-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (349 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (348 resets) in 234 ms. (170 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (355 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (389 resets) in 391 ms. (102 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (354 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 150 ms. (264 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (359 resets) in 81 ms. (487 steps per ms) remains 7/7 properties
[2024-05-23 19:05:09] [INFO ] Flow matrix only has 300 transitions (discarded 12 similar events)
// Phase 1: matrix 300 rows 160 cols
[2024-05-23 19:05:09] [INFO ] Computed 18 invariants in 15 ms
[2024-05-23 19:05:09] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem HealthRecord-PT-12-ReachabilityCardinality-2024-01 is UNSAT
FORMULA HealthRecord-PT-12-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 44/105 variables, 10/71 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 44/115 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 55/160 variables, 8/123 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 55/178 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/178 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 299/459 variables, 160/338 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/338 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/460 variables, 1/339 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 0/339 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/460 variables, 0/339 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 339 constraints, problems are : Problem set: 1 solved, 6 unsolved in 569 ms.
Refiners :[Domain max(s): 160/160 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 160/160 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 52/102 variables, 10/60 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 52/112 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-23 19:05:10] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 10 ms to minimize.
[2024-05-23 19:05:10] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 2 ms to minimize.
[2024-05-23 19:05:10] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-23 19:05:10] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:05:10] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 5/117 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-23 19:05:10] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 1/118 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-23 19:05:10] [INFO ] Deduced a trap composed of 37 places in 36 ms of which 1 ms to minimize.
[2024-05-23 19:05:10] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 2/120 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 58/160 variables, 8/128 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 58/186 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-23 19:05:10] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 2 ms to minimize.
[2024-05-23 19:05:10] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:05:10] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 2 ms to minimize.
[2024-05-23 19:05:11] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 10 ms to minimize.
[2024-05-23 19:05:11] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 1 ms to minimize.
[2024-05-23 19:05:11] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 2 ms to minimize.
[2024-05-23 19:05:11] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:05:11] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-23 19:05:11] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2024-05-23 19:05:11] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 2 ms to minimize.
[2024-05-23 19:05:11] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 2 ms to minimize.
[2024-05-23 19:05:11] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-23 19:05:11] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-05-23 19:05:11] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2024-05-23 19:05:11] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:05:11] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-23 19:05:11] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:05:11] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2024-05-23 19:05:11] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:05:11] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
Problem HealthRecord-PT-12-ReachabilityCardinality-2024-07 is UNSAT
FORMULA HealthRecord-PT-12-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 20/206 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-23 19:05:12] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 1 ms to minimize.
[2024-05-23 19:05:12] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:05:12] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-23 19:05:12] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:05:12] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:05:12] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 0 ms to minimize.
[2024-05-23 19:05:12] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:05:12] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 0 ms to minimize.
[2024-05-23 19:05:12] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2024-05-23 19:05:12] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:05:12] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:05:12] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:05:12] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-23 19:05:12] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2024-05-23 19:05:12] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:05:12] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 16/222 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-23 19:05:12] [INFO ] Deduced a trap composed of 47 places in 51 ms of which 1 ms to minimize.
[2024-05-23 19:05:12] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:05:13] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 1 ms to minimize.
[2024-05-23 19:05:13] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-23 19:05:13] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-23 19:05:13] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:05:13] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 2 ms to minimize.
[2024-05-23 19:05:13] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/160 variables, 8/230 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-23 19:05:13] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2024-05-23 19:05:13] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 2 ms to minimize.
[2024-05-23 19:05:13] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-05-23 19:05:13] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 0 ms to minimize.
[2024-05-23 19:05:13] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/160 variables, 5/235 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-23 19:05:13] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/160 variables, 1/236 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-23 19:05:13] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-05-23 19:05:13] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2024-05-23 19:05:13] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-05-23 19:05:13] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:05:14] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-23 19:05:14] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/160 variables, 6/242 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-23 19:05:14] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-23 19:05:14] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/160 variables, 2/244 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-23 19:05:14] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 1 ms to minimize.
[2024-05-23 19:05:14] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/160 variables, 2/246 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/160 variables, 0/246 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 299/459 variables, 160/406 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/459 variables, 5/411 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/459 variables, 0/411 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 1/460 variables, 1/412 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/460 variables, 0/412 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 0/460 variables, 0/412 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 412 constraints, problems are : Problem set: 2 solved, 5 unsolved in 4949 ms.
Refiners :[Domain max(s): 160/160 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 160/160 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 68/68 constraints]
After SMT, in 5607ms problems are : Problem set: 2 solved, 5 unsolved
FORMULA HealthRecord-PT-12-ReachabilityCardinality-2024-11 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-12-ReachabilityCardinality-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-12-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-12-ReachabilityCardinality-2024-00 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 100 ms.
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 312/312 transitions.
Graph (trivial) has 237 edges and 160 vertex of which 6 / 160 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 680 edges and 157 vertex of which 147 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 147 transition count 291
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 145 transition count 288
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 144 transition count 287
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 13 place count 143 transition count 286
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 13 place count 143 transition count 285
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 15 place count 142 transition count 285
Discarding 81 places :
Symmetric choice reduction at 4 with 81 rule applications. Total rules 96 place count 61 transition count 123
Iterating global reduction 4 with 81 rules applied. Total rules applied 177 place count 61 transition count 123
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 187 place count 51 transition count 103
Iterating global reduction 4 with 10 rules applied. Total rules applied 197 place count 51 transition count 103
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 205 place count 51 transition count 95
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 208 place count 48 transition count 86
Iterating global reduction 5 with 3 rules applied. Total rules applied 211 place count 48 transition count 86
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 214 place count 45 transition count 80
Iterating global reduction 5 with 3 rules applied. Total rules applied 217 place count 45 transition count 80
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 226 place count 45 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 228 place count 44 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 229 place count 44 transition count 69
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 239 place count 39 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 240 place count 39 transition count 98
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 243 place count 39 transition count 95
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 246 place count 36 transition count 95
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 247 place count 36 transition count 166
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 251 place count 35 transition count 163
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 252 place count 35 transition count 162
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 253 place count 34 transition count 124
Iterating global reduction 9 with 1 rules applied. Total rules applied 254 place count 34 transition count 124
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 255 place count 33 transition count 122
Iterating global reduction 9 with 1 rules applied. Total rules applied 256 place count 33 transition count 122
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 266 place count 33 transition count 112
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 269 place count 33 transition count 112
Applied a total of 269 rules in 75 ms. Remains 33 /160 variables (removed 127) and now considering 112/312 (removed 200) transitions.
Running 96 sub problems to find dead transitions.
[2024-05-23 19:05:15] [INFO ] Flow matrix only has 92 transitions (discarded 20 similar events)
// Phase 1: matrix 92 rows 33 cols
[2024-05-23 19:05:15] [INFO ] Computed 8 invariants in 2 ms
[2024-05-23 19:05:15] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/33 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
Problem TDEAD41 is UNSAT
Problem TDEAD111 is UNSAT
At refinement iteration 3 (OVERLAPS) 92/125 variables, 33/41 constraints. Problems are: Problem set: 2 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 19/60 constraints. Problems are: Problem set: 2 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/60 constraints. Problems are: Problem set: 2 solved, 94 unsolved
[2024-05-23 19:05:16] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
Problem TDEAD47 is UNSAT
At refinement iteration 6 (OVERLAPS) 0/125 variables, 1/61 constraints. Problems are: Problem set: 3 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/61 constraints. Problems are: Problem set: 3 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/61 constraints. Problems are: Problem set: 3 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 61 constraints, problems are : Problem set: 3 solved, 93 unsolved in 1469 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 33/33 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 2/33 variables, 8/8 constraints. Problems are: Problem set: 3 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/9 constraints. Problems are: Problem set: 3 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 92/125 variables, 33/42 constraints. Problems are: Problem set: 3 solved, 93 unsolved
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 19/61 constraints. Problems are: Problem set: 5 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 91/152 constraints. Problems are: Problem set: 5 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/152 constraints. Problems are: Problem set: 5 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/152 constraints. Problems are: Problem set: 5 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 152 constraints, problems are : Problem set: 5 solved, 91 unsolved in 1711 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 33/33 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 91/96 constraints, Known Traps: 1/1 constraints]
After SMT, in 3279ms problems are : Problem set: 5 solved, 91 unsolved
Search for dead transitions found 5 dead transitions in 3280ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 5 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 33/160 places, 107/312 transitions.
Graph (complete) has 128 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 32 transition count 107
Applied a total of 8 rules in 14 ms. Remains 32 /33 variables (removed 1) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3383 ms. Remains : 32/160 places, 107/312 transitions.
RANDOM walk for 1700 steps (250 resets) in 36 ms. (45 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-12-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 10353 ms.
ITS solved all properties within timeout

BK_STOP 1716491118710

--------------------
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="HealthRecord-PT-12"
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 HealthRecord-PT-12, 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 r179-tall-171640602300790"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-12.tgz
mv HealthRecord-PT-12 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 ;