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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.7K Apr 13 03:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 13 03:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 13 03:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 13 03:49 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 27K 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 11K Apr 13 03:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 13 03:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 03:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 13 03:53 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 61K 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-06-ReachabilityCardinality-2024-00
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-01
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-02
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-03
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-04
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-05
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-06
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-07
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-08
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-09
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-10
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-11
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-12
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-13
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-14
FORMULA_NAME QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716646364150

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 14:12:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 14:12:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 14:12:45] [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:12:45] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 14:12:45] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 602 ms
[2024-05-25 14:12:45] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 270 PT places and 116.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 14:12:46] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2024-05-25 14:12:46] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Remains 16 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
RANDOM walk for 40000 steps (3032 resets) in 1233 ms. (32 steps per ms) remains 12/16 properties
BEST_FIRST walk for 40002 steps (952 resets) in 664 ms. (60 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1759 resets) in 217 ms. (183 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1393 resets) in 152 ms. (261 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1390 resets) in 296 ms. (134 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1380 resets) in 150 ms. (264 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1664 resets) in 844 ms. (47 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (1816 resets) in 126 ms. (314 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1434 resets) in 151 ms. (263 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40005 steps (1380 resets) in 109 ms. (363 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1382 resets) in 110 ms. (360 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1383 resets) in 94 ms. (421 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40005 steps (1429 resets) in 125 ms. (317 steps per ms) remains 12/12 properties
// Phase 1: matrix 26 rows 30 cols
[2024-05-25 14:12:47] [INFO ] Computed 5 invariants in 8 ms
Problem QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-01 is UNSAT
Problem QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-03 is UNSAT
Problem QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-04 is UNSAT
Problem QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-05 is UNSAT
Problem QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-06 is UNSAT
Problem QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-08 is UNSAT
Problem QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-09 is UNSAT
Problem QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-10 is UNSAT
Problem QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-12 is UNSAT
Problem QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-15 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 10 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 10 solved, 2 unsolved
Problem QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-02 is UNSAT
Problem QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-14 is UNSAT
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 12 solved, 0 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 290ms problems are : Problem set: 12 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-25 14:12:47] [INFO ] Flatten gal took : 16 ms
[2024-05-25 14:12:47] [INFO ] Flatten gal took : 5 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-01 TRUE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-02 FALSE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-03 TRUE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-04 TRUE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-05 TRUE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-06 FALSE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-08 TRUE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-09 FALSE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-10 FALSE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-12 TRUE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-14 FALSE TECHNIQUES CPN_APPROX
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-15 FALSE TECHNIQUES CPN_APPROX
Domain [tsid(7), tsid(7)] of place n9 breaks symmetries in sort tsid
[2024-05-25 14:12:47] [INFO ] Unfolded HLPN to a Petri net with 270 places and 116 transitions 659 arcs in 13 ms.
[2024-05-25 14:12:47] [INFO ] Unfolded 16 HLPN properties in 1 ms.
RANDOM walk for 40000 steps (3936 resets) in 1290 ms. (30 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (888 resets) in 204 ms. (195 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (700 resets) in 759 ms. (52 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (297 resets) in 225 ms. (177 steps per ms) remains 3/4 properties
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (292 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
// Phase 1: matrix 116 rows 270 cols
[2024-05-25 14:12:48] [INFO ] Computed 155 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 31/207 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 42/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 49/256 variables, 42/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 116/372 variables, 256/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/372 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 14/386 variables, 14/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/386 variables, 6/425 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/386 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/386 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 425 constraints, problems are : Problem set: 0 solved, 3 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 144/144 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 31/207 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 42/107 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-25 14:12:49] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 18 ms to minimize.
[2024-05-25 14:12:49] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 2 ms to minimize.
[2024-05-25 14:12:49] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-25 14:12:49] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-25 14:12:49] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-25 14:12:49] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 2 ms to minimize.
[2024-05-25 14:12:49] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-25 14:12:49] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 2 ms to minimize.
[2024-05-25 14:12:49] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2024-05-25 14:12:49] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-05-25 14:12:49] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-25 14:12:50] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-25 14:12:50] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-25 14:12:50] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-25 14:12:50] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-25 14:12:50] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-25 14:12:50] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-25 14:12:50] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-25 14:12:50] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 11 ms to minimize.
[2024-05-25 14:12:50] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-25 14:12:50] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-25 14:12:50] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-25 14:12:50] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-25 14:12:50] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-25 14:12:50] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-25 14:12:51] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-25 14:12:51] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-25 14:12:51] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-25 14:12:51] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-25 14:12:51] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-25 14:12:51] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-25 14:12:51] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-25 14:12:51] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 6/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-25 14:12:51] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
[2024-05-25 14:12:51] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-25 14:12:51] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-25 14:12:51] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-25 14:12:51] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-05-25 14:12:51] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-05-25 14:12:51] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 2 ms to minimize.
[2024-05-25 14:12:52] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-25 14:12:52] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-25 14:12:52] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-25 14:12:52] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-25 14:12:52] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-25 14:12:52] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-25 14:12:52] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-05-25 14:12:52] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-25 14:12:52] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-05-25 14:12:52] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-25 14:12:52] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-25 14:12:52] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-25 14:12:52] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-25 14:12:52] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-25 14:12:52] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-25 14:12:52] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 3/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-25 14:12:52] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-25 14:12:52] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 2 ms to minimize.
[2024-05-25 14:12:52] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-25 14:12:52] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2024-05-25 14:12:53] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-25 14:12:53] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-25 14:12:53] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-25 14:12:53] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-25 14:12:53] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-25 14:12:53] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-25 14:12:53] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 11/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-25 14:12:53] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 2 ms to minimize.
[2024-05-25 14:12:53] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 49/256 variables, 42/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/256 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 116/372 variables, 256/474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 372/386 variables, and 476 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 138/144 constraints, State Equation: 256/270 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 69/69 constraints]
After SMT, in 5450ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 176 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 116/116 transitions.
Graph (complete) has 860 edges and 270 vertex of which 255 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 19 ms. Remains 255 /270 variables (removed 15) and now considering 116/116 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 255/270 places, 116/116 transitions.
RANDOM walk for 40000 steps (3932 resets) in 211 ms. (188 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (888 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 38661 steps (283 resets) in 156 ms. (246 steps per ms) remains 0/3 properties
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-06-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 9058 ms.
ITS solved all properties within timeout

BK_STOP 1716646374355

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-COL-06"
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 QuasiCertifProtocol-COL-06, 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 r311-tall-171662335700014"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-06.tgz
mv QuasiCertifProtocol-COL-06 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 ;