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-171662335700018.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-COL-10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662335700018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.7K Apr 13 03:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 13 03:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 13 03:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 13 03:55 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.7K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 13 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 13 04:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 13 04:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 72K 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-COL-10-CTLFireability-2024-00
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-01
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-02
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-03
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-04
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-05
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-06
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-07
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-08
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-09
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-10
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-11
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-12
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-13
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-14
FORMULA_NAME QuasiCertifProtocol-COL-10-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716646388153

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 14:13:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 14:13:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 14:13:09] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 14:13:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 14:13:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 591 ms
[2024-05-25 14:13:10] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 550 PT places and 176.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
[2024-05-25 14:13:10] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2024-05-25 14:13:10] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 13 formulas.
FORMULA QuasiCertifProtocol-COL-10-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-CTLFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 7 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40010 steps (2216 resets) in 705 ms. (56 steps per ms) remains 2/17 properties
BEST_FIRST walk for 40004 steps (468 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (839 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
// Phase 1: matrix 26 rows 30 cols
[2024-05-25 14:13:10] [INFO ] Computed 5 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 1 (OVERLAPS) 15/24 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp16 is UNSAT
After SMT solving in domain Real declared 51/56 variables, and 30 constraints, problems are : Problem set: 2 solved, 0 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 25/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 232ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 6 simplifications.
[2024-05-25 14:13:10] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-25 14:13:10] [INFO ] Flatten gal took : 19 ms
FORMULA QuasiCertifProtocol-COL-10-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 14:13:10] [INFO ] Flatten gal took : 5 ms
Domain [tsid(11), tsid(11)] of place n9 breaks symmetries in sort tsid
[2024-05-25 14:13:10] [INFO ] Unfolded HLPN to a Petri net with 550 places and 176 transitions 1287 arcs in 18 ms.
[2024-05-25 14:13:10] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 524 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 524 transition count 176
Applied a total of 26 rules in 16 ms. Remains 524 /550 variables (removed 26) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2024-05-25 14:13:10] [INFO ] Computed 350 invariants in 48 ms
[2024-05-25 14:13:11] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-25 14:13:11] [INFO ] Invariant cache hit.
[2024-05-25 14:13:11] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-05-25 14:13:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 350/350 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/699 variables, 523/873 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/699 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/700 variables, 1/874 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/700 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/700 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 700/700 variables, and 874 constraints, problems are : Problem set: 0 solved, 164 unsolved in 12143 ms.
Refiners :[Generalized P Invariants (flows): 350/350 constraints, State Equation: 524/524 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 350/350 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/699 variables, 523/873 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/699 variables, 164/1037 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/699 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 1/700 variables, 1/1038 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/700 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 0/700 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 700/700 variables, and 1038 constraints, problems are : Problem set: 0 solved, 164 unsolved in 18757 ms.
Refiners :[Generalized P Invariants (flows): 350/350 constraints, State Equation: 524/524 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints]
After SMT, in 31072ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 31078ms
Starting structural reductions in LTL mode, iteration 1 : 524/550 places, 176/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31565 ms. Remains : 524/550 places, 176/176 transitions.
Support contains 524 out of 524 places after structural reductions.
[2024-05-25 14:13:42] [INFO ] Flatten gal took : 51 ms
[2024-05-25 14:13:42] [INFO ] Flatten gal took : 56 ms
[2024-05-25 14:13:42] [INFO ] Input system was already deterministic with 176 transitions.
Reduction of identical properties reduced properties to check from 52 to 45
RANDOM walk for 40000 steps (2764 resets) in 1228 ms. (32 steps per ms) remains 37/45 properties
BEST_FIRST walk for 4004 steps (12 resets) in 16 ms. (235 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4003 steps (29 resets) in 101 ms. (39 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (28 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (29 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (32 resets) in 35 ms. (111 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (23 resets) in 92 ms. (43 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (22 resets) in 71 ms. (55 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (24 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (32 resets) in 35 ms. (111 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (30 resets) in 22 ms. (173 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (23 resets) in 228 ms. (17 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (30 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (29 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (22 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (29 resets) in 29 ms. (133 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (28 resets) in 31 ms. (125 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (32 resets) in 31 ms. (125 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (30 resets) in 35 ms. (111 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (30 resets) in 28 ms. (138 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (26 resets) in 31 ms. (125 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (33 resets) in 37 ms. (105 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (34 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (32 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (20 resets) in 40 ms. (97 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (23 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (31 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (22 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (23 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (19 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (31 resets) in 30 ms. (129 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (21 resets) in 35 ms. (111 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (40 resets) in 21 ms. (181 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (28 resets) in 19 ms. (200 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (29 resets) in 25 ms. (154 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (32 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (33 resets) in 38 ms. (102 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (31 resets) in 31 ms. (125 steps per ms) remains 36/36 properties
[2024-05-25 14:13:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/491 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/491 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp48 is UNSAT
At refinement iteration 2 (OVERLAPS) 176/667 variables, 491/831 constraints. Problems are: Problem set: 8 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/667 variables, 0/831 constraints. Problems are: Problem set: 8 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 33/700 variables, 33/864 constraints. Problems are: Problem set: 8 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/700 variables, 10/874 constraints. Problems are: Problem set: 8 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/700 variables, 0/874 constraints. Problems are: Problem set: 8 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 0/700 variables, 0/874 constraints. Problems are: Problem set: 8 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 700/700 variables, and 874 constraints, problems are : Problem set: 8 solved, 28 unsolved in 4511 ms.
Refiners :[Generalized P Invariants (flows): 350/350 constraints, State Equation: 524/524 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/490 variables, 340/340 constraints. Problems are: Problem set: 8 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/490 variables, 0/340 constraints. Problems are: Problem set: 8 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 175/665 variables, 490/830 constraints. Problems are: Problem set: 8 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/665 variables, 24/854 constraints. Problems are: Problem set: 8 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/665 variables, 0/854 constraints. Problems are: Problem set: 8 solved, 28 unsolved
SMT process timed out in 9699ms, After SMT, problems are : Problem set: 8 solved, 28 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 490 out of 524 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 524/524 places, 176/176 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 524 transition count 175
Applied a total of 1 rules in 18 ms. Remains 524 /524 variables (removed 0) and now considering 175/176 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 524/524 places, 175/176 transitions.
RANDOM walk for 40000 steps (2976 resets) in 848 ms. (47 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (33 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (35 resets) in 40 ms. (97 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (33 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (32 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (26 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (25 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (25 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (37 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (32 resets) in 15 ms. (250 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (37 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (34 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (25 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (31 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (34 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (34 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (34 resets) in 24 ms. (160 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (38 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (37 resets) in 21 ms. (181 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (33 resets) in 12 ms. (307 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (32 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (23 resets) in 14 ms. (266 steps per ms) remains 23/28 properties
BEST_FIRST walk for 4002 steps (36 resets) in 28 ms. (138 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (31 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (34 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (34 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (36 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
// Phase 1: matrix 175 rows 524 cols
[2024-05-25 14:13:54] [INFO ] Computed 351 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 11/490 variables, 10/340 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 175/665 variables, 490/830 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/665 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 34/699 variables, 34/864 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/699 variables, 11/875 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/699 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/699 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 699/699 variables, and 875 constraints, problems are : Problem set: 0 solved, 23 unsolved in 3262 ms.
Refiners :[Generalized P Invariants (flows): 351/351 constraints, State Equation: 524/524 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/479 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/479 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 11/490 variables, 10/340 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 175/665 variables, 490/830 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/665 variables, 21/851 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 34/699 variables, 34/885 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/699 variables, 11/896 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/699 variables, 2/898 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/699 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 0/699 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 699/699 variables, and 898 constraints, problems are : Problem set: 0 solved, 23 unsolved in 13206 ms.
Refiners :[Generalized P Invariants (flows): 351/351 constraints, State Equation: 524/524 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
After SMT, in 16539ms problems are : Problem set: 0 solved, 23 unsolved
Fused 23 Parikh solutions to 22 different solutions.
Finished Parikh walk after 86 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=43 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 23 properties in 635 ms.
Successfully simplified 8 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-10-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 14:14:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-25 14:14:11] [INFO ] Flatten gal took : 37 ms
FORMULA QuasiCertifProtocol-COL-10-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 14:14:11] [INFO ] Flatten gal took : 31 ms
[2024-05-25 14:14:11] [INFO ] Input system was already deterministic with 176 transitions.
Computed a total of 524 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 524 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 47 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 524/524 places, 176/176 transitions.
[2024-05-25 14:14:11] [INFO ] Flatten gal took : 18 ms
[2024-05-25 14:14:11] [INFO ] Flatten gal took : 18 ms
[2024-05-25 14:14:11] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 17 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 524/524 places, 176/176 transitions.
[2024-05-25 14:14:11] [INFO ] Flatten gal took : 18 ms
[2024-05-25 14:14:11] [INFO ] Flatten gal took : 18 ms
[2024-05-25 14:14:11] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 16 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 524/524 places, 176/176 transitions.
[2024-05-25 14:14:11] [INFO ] Flatten gal took : 15 ms
[2024-05-25 14:14:11] [INFO ] Flatten gal took : 15 ms
[2024-05-25 14:14:11] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 524/524 places, 176/176 transitions.
[2024-05-25 14:14:11] [INFO ] Flatten gal took : 15 ms
[2024-05-25 14:14:11] [INFO ] Flatten gal took : 17 ms
[2024-05-25 14:14:11] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 524/524 places, 176/176 transitions.
[2024-05-25 14:14:11] [INFO ] Flatten gal took : 14 ms
[2024-05-25 14:14:11] [INFO ] Flatten gal took : 15 ms
[2024-05-25 14:14:11] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 524/524 places, 176/176 transitions.
[2024-05-25 14:14:12] [INFO ] Flatten gal took : 13 ms
[2024-05-25 14:14:12] [INFO ] Flatten gal took : 15 ms
[2024-05-25 14:14:12] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 524/524 places, 176/176 transitions.
[2024-05-25 14:14:12] [INFO ] Flatten gal took : 11 ms
[2024-05-25 14:14:12] [INFO ] Flatten gal took : 12 ms
[2024-05-25 14:14:12] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 524/524 places, 176/176 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 1 place count 523 transition count 175
Applied a total of 1 rules in 60 ms. Remains 523 /524 variables (removed 1) and now considering 175/176 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61 ms. Remains : 523/524 places, 175/176 transitions.
[2024-05-25 14:14:12] [INFO ] Flatten gal took : 12 ms
[2024-05-25 14:14:12] [INFO ] Flatten gal took : 13 ms
[2024-05-25 14:14:12] [INFO ] Input system was already deterministic with 175 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 524/524 places, 176/176 transitions.
[2024-05-25 14:14:12] [INFO ] Flatten gal took : 13 ms
[2024-05-25 14:14:12] [INFO ] Flatten gal took : 14 ms
[2024-05-25 14:14:12] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 524/524 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 524/524 places, 176/176 transitions.
[2024-05-25 14:14:12] [INFO ] Flatten gal took : 12 ms
[2024-05-25 14:14:12] [INFO ] Flatten gal took : 13 ms
[2024-05-25 14:14:12] [INFO ] Input system was already deterministic with 176 transitions.
[2024-05-25 14:14:12] [INFO ] Flatten gal took : 24 ms
[2024-05-25 14:14:12] [INFO ] Flatten gal took : 24 ms
[2024-05-25 14:14:12] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 17 ms.
[2024-05-25 14:14:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 524 places, 176 transitions and 1182 arcs took 5 ms.
Total runtime 63285 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running QuasiCertifProtocol-COL-10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 524
TRANSITIONS: 176
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.001s]


SAVING FILE /home/mcc/execution/411/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: 569
MODEL NAME: /home/mcc/execution/411/model
524 places, 176 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA QuasiCertifProtocol-COL-10-CTLFireability-2024-01 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-10-CTLFireability-2024-02 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-10-CTLFireability-2024-05 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-10-CTLFireability-2024-06 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-10-CTLFireability-2024-08 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-10-CTLFireability-2024-09 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-10-CTLFireability-2024-11 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-10-CTLFireability-2024-12 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-10-CTLFireability-2024-14 CANNOT_COMPUTE
FORMULA QuasiCertifProtocol-COL-10-CTLFireability-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716647743391

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-COL-10"
export BK_EXAMINATION="CTLFireability"
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-COL-10, examination is CTLFireability"
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-171662335700018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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