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.r311-tall-171662335800057.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 QuasiCertifProtocol-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662335800057
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 9.0K Apr 13 03:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 13 03:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 13 03:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 13 03:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 13 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 13 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 13 03:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 13 03:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 58K 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 QuasiCertifProtocol-PT-02-CTLCardinality-2024-00
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-01
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-02
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-03
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-04
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-05
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-06
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-07
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-08
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-09
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-10
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-11
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-12
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-13
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-14
FORMULA_NAME QuasiCertifProtocol-PT-02-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716654877150

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 16:34:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 16:34:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:34:38] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2024-05-25 16:34:38] [INFO ] Transformed 86 places.
[2024-05-25 16:34:38] [INFO ] Transformed 56 transitions.
[2024-05-25 16:34:38] [INFO ] Found NUPN structural information;
[2024-05-25 16:34:38] [INFO ] Parsed PT model containing 86 places and 56 transitions and 223 arcs in 145 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Support contains 85 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Applied a total of 0 rules in 12 ms. Remains 86 /86 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 86 cols
[2024-05-25 16:34:38] [INFO ] Computed 31 invariants in 11 ms
[2024-05-25 16:34:38] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-25 16:34:38] [INFO ] Invariant cache hit.
[2024-05-25 16:34:38] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 16:34:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 8/83 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-25 16:34:39] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 7 ms to minimize.
[2024-05-25 16:34:39] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 3/86 variables, 10/33 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-25 16:34:39] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 56/142 variables, 86/120 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/142 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 0/142 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 120 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1528 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 8/83 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 3/86 variables, 10/33 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-25 16:34:40] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-25 16:34:40] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-25 16:34:40] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-25 16:34:40] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-25 16:34:40] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-25 16:34:41] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-25 16:34:41] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 56/142 variables, 86/127 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 52/179 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/142 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 12 (OVERLAPS) 0/142 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 179 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1491 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 10/10 constraints]
After SMT, in 3076ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 3089ms
Finished structural reductions in LTL mode , in 1 iterations and 3395 ms. Remains : 86/86 places, 56/56 transitions.
Support contains 85 out of 86 places after structural reductions.
[2024-05-25 16:34:42] [INFO ] Flatten gal took : 25 ms
[2024-05-25 16:34:42] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 16:34:42] [INFO ] Flatten gal took : 10 ms
[2024-05-25 16:34:42] [INFO ] Input system was already deterministic with 56 transitions.
RANDOM walk for 40000 steps (6571 resets) in 2801 ms. (14 steps per ms) remains 67/88 properties
BEST_FIRST walk for 4000 steps (264 resets) in 76 ms. (51 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (217 resets) in 35 ms. (111 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (216 resets) in 23 ms. (166 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (212 resets) in 52 ms. (75 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (228 resets) in 17 ms. (222 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (229 resets) in 59 ms. (66 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (219 resets) in 44 ms. (88 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (100 resets) in 31 ms. (125 steps per ms) remains 39/67 properties
BEST_FIRST walk for 4003 steps (92 resets) in 35 ms. (111 steps per ms) remains 34/39 properties
BEST_FIRST walk for 4002 steps (227 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (235 resets) in 39 ms. (100 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (207 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (224 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (173 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (218 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (224 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (191 resets) in 33 ms. (117 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (220 resets) in 33 ms. (117 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (225 resets) in 30 ms. (129 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (264 resets) in 22 ms. (173 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (173 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (221 resets) in 27 ms. (142 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (216 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (218 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (230 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (229 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (94 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (157 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (218 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (225 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (222 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (223 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (227 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (218 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (224 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (222 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
[2024-05-25 16:34:43] [INFO ] Invariant cache hit.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp55 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 18/19 constraints. Problems are: Problem set: 4 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/19 constraints. Problems are: Problem set: 4 solved, 30 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
At refinement iteration 3 (OVERLAPS) 10/83 variables, 2/21 constraints. Problems are: Problem set: 12 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/21 constraints. Problems are: Problem set: 12 solved, 22 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 5 (OVERLAPS) 3/86 variables, 10/31 constraints. Problems are: Problem set: 15 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/31 constraints. Problems are: Problem set: 15 solved, 19 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp85 is UNSAT
At refinement iteration 7 (OVERLAPS) 56/142 variables, 86/117 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/117 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/142 variables, 0/117 constraints. Problems are: Problem set: 31 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 117 constraints, problems are : Problem set: 31 solved, 3 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 31 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 22/28 variables, 2/2 constraints. Problems are: Problem set: 31 solved, 3 unsolved
[2024-05-25 16:34:43] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-05-25 16:34:43] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 2/4 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 25/53 variables, 14/18 constraints. Problems are: Problem set: 31 solved, 3 unsolved
[2024-05-25 16:34:43] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 1/19 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/19 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 13/66 variables, 10/29 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/29 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 47/113 variables, 66/95 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 2/97 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 0/97 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 21/134 variables, 15/112 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/134 variables, 4/116 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/134 variables, 1/117 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/134 variables, 0/117 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 5/139 variables, 1/118 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/139 variables, 1/119 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/139 variables, 0/119 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 3/142 variables, 4/123 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/142 variables, 0/123 constraints. Problems are: Problem set: 31 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/142 variables, 0/123 constraints. Problems are: Problem set: 31 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 123 constraints, problems are : Problem set: 31 solved, 3 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 3/34 constraints, Known Traps: 3/3 constraints]
After SMT, in 587ms problems are : Problem set: 31 solved, 3 unsolved
Finished Parikh walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 11 ms.
Successfully simplified 31 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 16:34:44] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-25 16:34:44] [INFO ] Flatten gal took : 7 ms
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 16:34:44] [INFO ] Flatten gal took : 6 ms
[2024-05-25 16:34:44] [INFO ] Input system was already deterministic with 56 transitions.
Support contains 55 out of 86 places (down from 69) after GAL structural reductions.
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 86 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 56
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Graph (complete) has 184 edges and 86 vertex of which 23 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.1 ms
Discarding 63 places :
Also discarding 22 output transitions
Drop transitions (Output transitions of discarded places.) removed 22 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 22 transition count 19
Applied a total of 15 rules in 14 ms. Remains 22 /86 variables (removed 64) and now considering 19/56 (removed 37) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 22/86 places, 19/56 transitions.
[2024-05-25 16:34:44] [INFO ] Flatten gal took : 2 ms
[2024-05-25 16:34:44] [INFO ] Flatten gal took : 1 ms
[2024-05-25 16:34:44] [INFO ] Input system was already deterministic with 19 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 79 transition count 56
Applied a total of 7 rules in 2 ms. Remains 79 /86 variables (removed 7) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 79/86 places, 56/56 transitions.
[2024-05-25 16:34:44] [INFO ] Flatten gal took : 5 ms
[2024-05-25 16:34:44] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:34:44] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Graph (complete) has 184 edges and 86 vertex of which 77 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 5 ms. Remains 76 /86 variables (removed 10) and now considering 55/56 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 76/86 places, 55/56 transitions.
[2024-05-25 16:34:44] [INFO ] Flatten gal took : 5 ms
[2024-05-25 16:34:44] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:34:44] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Graph (complete) has 184 edges and 86 vertex of which 73 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 4 ms. Remains 72 /86 variables (removed 14) and now considering 53/56 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 72/86 places, 53/56 transitions.
[2024-05-25 16:34:44] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:34:44] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:34:44] [INFO ] Input system was already deterministic with 53 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Graph (complete) has 184 edges and 86 vertex of which 77 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 76 transition count 55
Applied a total of 2 rules in 8 ms. Remains 76 /86 variables (removed 10) and now considering 55/56 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 76/86 places, 55/56 transitions.
[2024-05-25 16:34:44] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:34:44] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:34:44] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 77 transition count 56
Applied a total of 9 rules in 2 ms. Remains 77 /86 variables (removed 9) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 77/86 places, 56/56 transitions.
[2024-05-25 16:34:44] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:34:44] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:34:44] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 78 transition count 56
Applied a total of 8 rules in 2 ms. Remains 78 /86 variables (removed 8) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 78/86 places, 56/56 transitions.
[2024-05-25 16:34:44] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:34:44] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:34:44] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 77 transition count 56
Applied a total of 9 rules in 1 ms. Remains 77 /86 variables (removed 9) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 77/86 places, 56/56 transitions.
[2024-05-25 16:34:44] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:34:44] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:34:44] [INFO ] Input system was already deterministic with 56 transitions.
[2024-05-25 16:34:44] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:34:44] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:34:44] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-25 16:34:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 86 places, 56 transitions and 223 arcs took 2 ms.
Total runtime 5989 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running QuasiCertifProtocol-PT-02

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/409/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 86
TRANSITIONS: 56
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.000s]


SAVING FILE /home/mcc/execution/409/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 576
MODEL NAME: /home/mcc/execution/409/model
86 places, 56 transitions.

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.
Creating all event NSFs..
Building monolithic NSF...
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716654885096

--------------------
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 CTLCardinality -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="QuasiCertifProtocol-PT-02"
export BK_EXAMINATION="CTLCardinality"
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 QuasiCertifProtocol-PT-02, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r311-tall-171662335800057"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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