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.r312-tall-171662337800110.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 itstools
Input is QuasiCertifProtocol-PT-32, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662337800110
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 80K Apr 13 04:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 499K Apr 13 04:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 13 03:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 148K Apr 13 03:48 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 49K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 216K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 387K Apr 13 04:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 2.3M Apr 13 04:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 40K Apr 13 04:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 236K Apr 13 04:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.5K 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 942K 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-32-ReachabilityCardinality-2024-00
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-01
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-02
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-03
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-04
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-05
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-06
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-07
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-08
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-09
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-10
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-11
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-12
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-13
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-14
FORMULA_NAME QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716673896229

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-32
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-25 21:51:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 21:51:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 21:51:37] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2024-05-25 21:51:37] [INFO ] Transformed 3806 places.
[2024-05-25 21:51:37] [INFO ] Transformed 506 transitions.
[2024-05-25 21:51:37] [INFO ] Parsed PT model containing 3806 places and 506 transitions and 8173 arcs in 251 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 92 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 21:51:38] [INFO ] Flatten gal took : 539 ms
[2024-05-25 21:51:39] [INFO ] Flatten gal took : 239 ms
[2024-05-25 21:51:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2791771177444685185.gal : 108 ms
[2024-05-25 21:51:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10003692938792938834.prop : 95 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2791771177444685185.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10003692938792938834.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (1071 resets) in 6611 ms. (6 steps per ms) remains 15/16 properties
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 685 ms. (5 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
Loading property file /tmp/ReachabilityCardinality10003692938792938834.prop.
BEST_FIRST walk for 4004 steps (8 resets) in 971 ms. (4 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 193 ms. (20 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 633 ms. (6 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 237 ms. (16 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 744676 steps, run timeout after 6001 ms. (steps per millisecond=124 ) properties seen :0 out of 15
Probabilistic random walk after 744676 steps, saw 91485 distinct states, run finished after 6005 ms. (steps per millisecond=124 ) properties seen :0
// Phase 1: matrix 506 rows 3806 cols
[2024-05-25 21:51:46] [INFO ] Computed 3301 invariants in 125 ms
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :8 after 16
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :16 after 64
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :64 after 256
Problem QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-01 is UNSAT
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-02 is UNSAT
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-03 is UNSAT
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-04 is UNSAT
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-05 is UNSAT
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-06 is UNSAT
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-07 is UNSAT
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3806 variables, 3/3 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3806 variables, 3298/3301 constraints. Problems are: Problem set: 7 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3806 variables, 0/3301 constraints. Problems are: Problem set: 7 solved, 8 unsolved
Problem QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-11 is UNSAT
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4312/4312 variables, and 7107 constraints, problems are : Problem set: 8 solved, 7 unsolved in 5047 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3298/3298 constraints, State Equation: 3806/3806 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 228/418 variables, 2/2 constraints. Problems are: Problem set: 8 solved, 7 unsolved
[2024-05-25 21:51:56] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 19 ms to minimize.
[2024-05-25 21:51:57] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 2 ms to minimize.
[2024-05-25 21:51:57] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 2 ms to minimize.
[2024-05-25 21:51:57] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 2 ms to minimize.
[2024-05-25 21:51:57] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 2 ms to minimize.
[2024-05-25 21:51:57] [INFO ] Deduced a trap composed of 8 places in 107 ms of which 2 ms to minimize.
[2024-05-25 21:51:57] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 2 ms to minimize.
[2024-05-25 21:51:57] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2024-05-25 21:51:57] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 2 ms to minimize.
[2024-05-25 21:51:57] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-05-25 21:51:58] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-05-25 21:51:58] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 1 ms to minimize.
[2024-05-25 21:51:58] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2024-05-25 21:51:58] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-05-25 21:51:58] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2024-05-25 21:51:58] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-25 21:51:58] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 2 ms to minimize.
[2024-05-25 21:51:58] [INFO ] Deduced a trap composed of 8 places in 114 ms of which 2 ms to minimize.
[2024-05-25 21:51:58] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 2 ms to minimize.
[2024-05-25 21:51:58] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 20/22 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 0/22 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/420 variables, 1/23 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 0/23 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1744/2164 variables, 1740/1763 constraints. Problems are: Problem set: 8 solved, 7 unsolved
[2024-05-25 21:52:00] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 4 ms to minimize.
[2024-05-25 21:52:01] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 3 ms to minimize.
[2024-05-25 21:52:01] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2164/4312 variables, and 1766 constraints, problems are : Problem set: 8 solved, 7 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1740/3298 constraints, State Equation: 0/3806 constraints, PredecessorRefiner: 0/15 constraints, Known Traps: 23/23 constraints]
After SMT, in 15082ms problems are : Problem set: 8 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 190 out of 3806 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3806/3806 places, 506/506 transitions.
Graph (complete) has 43474 edges and 3806 vertex of which 3603 are kept as prefixes of interest. Removing 203 places using SCC suffix rule.22 ms
Discarding 203 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 225 transitions
Reduce isomorphic transitions removed 225 transitions.
Discarding 63 places :
Implicit places reduction removed 63 places
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 293 rules applied. Total rules applied 294 place count 3540 transition count 272
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 299 place count 3535 transition count 272
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 58 Pre rules applied. Total rules applied 299 place count 3535 transition count 214
Deduced a syphon composed of 58 places in 1 ms
Ensure Unique test removed 83 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 199 rules applied. Total rules applied 498 place count 3394 transition count 214
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 10 ms
Ensure Unique test removed 189 places
Reduce places removed 221 places and 0 transitions.
Iterating global reduction 2 with 253 rules applied. Total rules applied 751 place count 3173 transition count 182
Applied a total of 751 rules in 976 ms. Remains 3173 /3806 variables (removed 633) and now considering 182/506 (removed 324) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 988 ms. Remains : 3173/3806 places, 182/506 transitions.
RANDOM walk for 40000 steps (4490 resets) in 640 ms. (62 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1175 resets) in 271 ms. (147 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1148 resets) in 210 ms. (189 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (1292 resets) in 317 ms. (125 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (993 resets) in 227 ms. (175 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1144 resets) in 144 ms. (275 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (1247 resets) in 124 ms. (320 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (1127 resets) in 172 ms. (231 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 183212 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 7
Probabilistic random walk after 183212 steps, saw 26544 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
// Phase 1: matrix 182 rows 3173 cols
[2024-05-25 21:52:06] [INFO ] Computed 2991 invariants in 30 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 169/359 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-08 is UNSAT
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-09 is UNSAT
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-12 is UNSAT
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-13 is UNSAT
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-14 is UNSAT
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 2076/2435 variables, 2116/2253 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2435 variables, 0/2253 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 738/3173 variables, 738/2991 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3173 variables, 0/2991 constraints. Problems are: Problem set: 5 solved, 2 unsolved
Problem QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-15 is UNSAT
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 182/3355 variables, 3173/6164 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3355 variables, 0/6164 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/3355 variables, 0/6164 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3355/3355 variables, and 6164 constraints, problems are : Problem set: 6 solved, 1 unsolved in 2855 ms.
Refiners :[Positive P Invariants (semi-flows): 137/137 constraints, Generalized P Invariants (flows): 2854/2854 constraints, State Equation: 3173/3173 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/282 variables, 137/137 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/137 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2116/2398 variables, 2079/2216 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2398 variables, 0/2216 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 775/3173 variables, 775/2991 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3173 variables, 0/2991 constraints. Problems are: Problem set: 6 solved, 1 unsolved
Problem QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-10 is UNSAT
FORMULA QuasiCertifProtocol-PT-32-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 3355/3355 variables, and 6164 constraints, problems are : Problem set: 7 solved, 0 unsolved in 1797 ms.
Refiners :[Positive P Invariants (semi-flows): 137/137 constraints, Generalized P Invariants (flows): 2854/2854 constraints, State Equation: 3173/3173 constraints, PredecessorRefiner: 0/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 4755ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 33760 ms.

BK_STOP 1716673931135

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-32"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is QuasiCertifProtocol-PT-32, 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 r312-tall-171662337800110"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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