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.r101-tall-171624201700302.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 DBSingleClientW-PT-d0m10, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-171624201700302
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 12 12:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 12:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 119K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1716296751141

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DBSingleClientW-PT-d0m10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202405141337
[2024-05-21 13:05:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-21 13:05:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:05:52] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-05-21 13:05:52] [INFO ] Transformed 553 places.
[2024-05-21 13:05:52] [INFO ] Transformed 150 transitions.
[2024-05-21 13:05:52] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 181 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 553/553 places, 150/150 transitions.
Reduce places removed 451 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 462 rules applied. Total rules applied 462 place count 102 transition count 139
Applied a total of 462 rules in 37 ms. Remains 102 /553 variables (removed 451) and now considering 139/150 (removed 11) transitions.
// Phase 1: matrix 139 rows 102 cols
[2024-05-21 13:05:52] [INFO ] Computed 2 invariants in 16 ms
[2024-05-21 13:05:52] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-21 13:05:52] [INFO ] Invariant cache hit.
[2024-05-21 13:05:52] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-21 13:05:53] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2024-05-21 13:05:53] [INFO ] Invariant cache hit.
[2024-05-21 13:05:53] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/241 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 63/167 constraints. Problems are: Problem set: 0 solved, 138 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/241 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 167 constraints, problems are : Problem set: 0 solved, 138 unsolved in 3415 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/241 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 63/167 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 138/305 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/241 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 241/241 variables, and 305 constraints, problems are : Problem set: 0 solved, 138 unsolved in 6539 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
After SMT, in 10196ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 10211ms
Starting structural reductions in LIVENESS mode, iteration 1 : 102/553 places, 139/150 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 10784 ms. Remains : 102/553 places, 139/150 transitions.
Discarding 48 transitions out of 139. Remains 91
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (9162 resets) in 2104 ms. (19 steps per ms) remains 48/90 properties
[2024-05-21 13:06:03] [INFO ] Flatten gal took : 109 ms
BEST_FIRST walk for 4001 steps (195 resets) in 60 ms. (65 steps per ms) remains 48/48 properties
[2024-05-21 13:06:03] [INFO ] Flatten gal took : 34 ms
BEST_FIRST walk for 4003 steps (197 resets) in 32 ms. (121 steps per ms) remains 47/48 properties
BEST_FIRST walk for 4003 steps (190 resets) in 28 ms. (138 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (195 resets) in 86 ms. (46 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4000 steps (199 resets) in 25 ms. (153 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (192 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (197 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (199 resets) in 17 ms. (222 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4002 steps (187 resets) in 47 ms. (83 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (191 resets) in 19 ms. (200 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (194 resets) in 15 ms. (250 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4003 steps (218 resets) in 11 ms. (333 steps per ms) remains 47/47 properties
[2024-05-21 13:06:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9765114599946187003.gal : 36 ms
BEST_FIRST walk for 4003 steps (176 resets) in 13 ms. (285 steps per ms) remains 45/47 properties
BEST_FIRST walk for 4002 steps (215 resets) in 31 ms. (125 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (173 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (189 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (170 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (195 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (216 resets) in 12 ms. (308 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (178 resets) in 11 ms. (333 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (208 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (202 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (184 resets) in 13 ms. (285 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (195 resets) in 14 ms. (266 steps per ms) remains 45/45 properties
[2024-05-21 13:06:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16106963880731664131.prop : 2 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/ReachabilityCardinality9765114599946187003.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16106963880731664131.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4000 steps (800 resets) in 42 ms. (93 steps per ms) remains 45/45 properties

BEST_FIRST walk for 4000 steps (800 resets) in 28 ms. (137 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (381 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
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
BEST_FIRST walk for 4002 steps (392 resets) in 37 ms. (105 steps per ms) remains 45/45 properties
Loading property file /tmp/ReachabilityCardinality16106963880731664131.prop.
BEST_FIRST walk for 4002 steps (383 resets) in 12 ms. (307 steps per ms) remains 45/45 properties
SDD proceeding with computation,45 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,45 properties remain. new max is 8
SDD size :5 after 33
BEST_FIRST walk for 4002 steps (386 resets) in 55 ms. (71 steps per ms) remains 45/45 properties
SDD proceeding with computation,45 properties remain. new max is 16
BEST_FIRST walk for 4003 steps (439 resets) in 32 ms. (121 steps per ms) remains 45/45 properties
SDD size :33 after 205
BEST_FIRST walk for 4003 steps (389 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (398 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (406 resets) in 15 ms. (250 steps per ms) remains 41/45 properties
BEST_FIRST walk for 4002 steps (426 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (386 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (407 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (415 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
SDD proceeding with computation,45 properties remain. new max is 32
SDD size :205 after 834
BEST_FIRST walk for 4003 steps (397 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (379 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (420 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (396 resets) in 32 ms. (121 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (416 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (409 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (411 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (422 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
[2024-05-21 13:06:04] [INFO ] Invariant cache hit.
[2024-05-21 13:06:04] [INFO ] State equation strengthened by 63 read => feed constraints.
Reachability property qltransition_119 is true.
Reachability property qltransition_117 is true.
Reachability property qltransition_115 is true.
Reachability property qltransition_111 is true.
Reachability property qltransition_19 is true.
SDD proceeding with computation,40 properties remain. new max is 32
SDD size :834 after 18714
SDD proceeding with computation,40 properties remain. new max is 64
SDD size :18714 after 128164
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 19/68 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 21/89 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 39 unsolved
SDD proceeding with computation,40 properties remain. new max is 128
SDD size :128164 after 594844
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 123/212 variables, 89/91 constraints. Problems are: Problem set: 2 solved, 39 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 47/138 constraints. Problems are: Problem set: 2 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/138 constraints. Problems are: Problem set: 2 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 29/241 variables, 13/151 constraints. Problems are: Problem set: 2 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 16/167 constraints. Problems are: Problem set: 2 solved, 39 unsolved
Reachability property qltransition_85 is true.
SDD proceeding with computation,39 properties remain. new max is 128
SDD size :594844 after 1.69867e+06
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/167 constraints. Problems are: Problem set: 3 solved, 38 unsolved
SDD proceeding with computation,39 properties remain. new max is 256
SDD size :1.69867e+06 after 2.06878e+06
SDD proceeding with computation,39 properties remain. new max is 512
SDD size :2.06878e+06 after 2.5217e+06
At refinement iteration 11 (OVERLAPS) 0/241 variables, 0/167 constraints. Problems are: Problem set: 3 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 167 constraints, problems are : Problem set: 3 solved, 38 unsolved in 1797 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 21/66 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 22/88 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 123/211 variables, 88/90 constraints. Problems are: Problem set: 3 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 47/137 constraints. Problems are: Problem set: 3 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 13/150 constraints. Problems are: Problem set: 3 solved, 38 unsolved
Reachability property qltransition_104 is true.
Reachability property qltransition_93 is true.
Reachability property qltransition_89 is true.
Reachability property qltransition_21 is true.
SDD proceeding with computation,35 properties remain. new max is 512
SDD size :2.5217e+06 after 9.5543e+06
[2024-05-21 13:06:07] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 10 ms to minimize.
[2024-05-21 13:06:07] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 2 ms to minimize.
SDD proceeding with computation,35 properties remain. new max is 1024
SDD size :9.5543e+06 after 1.04904e+07
[2024-05-21 13:06:07] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 1 ms to minimize.
[2024-05-21 13:06:07] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2024-05-21 13:06:07] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2024-05-21 13:06:07] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 1 ms to minimize.
[2024-05-21 13:06:08] [INFO ] Deduced a trap composed of 38 places in 409 ms of which 32 ms to minimize.
[2024-05-21 13:06:08] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
[2024-05-21 13:06:08] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-21 13:06:08] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-21 13:06:08] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 2 ms to minimize.
[2024-05-21 13:06:08] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
SDD proceeding with computation,35 properties remain. new max is 2048
SDD size :1.04904e+07 after 2.20986e+07
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 12/162 constraints. Problems are: Problem set: 6 solved, 35 unsolved
[2024-05-21 13:06:09] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 1/163 constraints. Problems are: Problem set: 6 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 0/163 constraints. Problems are: Problem set: 6 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 30/241 variables, 14/177 constraints. Problems are: Problem set: 6 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/241 variables, 16/193 constraints. Problems are: Problem set: 6 solved, 35 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/241 variables, 22/215 constraints. Problems are: Problem set: 6 solved, 35 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/241 variables, 0/215 constraints. Problems are: Problem set: 6 solved, 35 unsolved
At refinement iteration 15 (OVERLAPS) 0/241 variables, 0/215 constraints. Problems are: Problem set: 6 solved, 35 unsolved
No progress, stopping.
Reachability property qltransition_136 is true.
Reachability property qltransition_133 is true.
SDD proceeding with computation,33 properties remain. new max is 2048
SDD size :2.20986e+07 after 4.51116e+07
After SMT solving in domain Int declared 241/241 variables, and 215 constraints, problems are : Problem set: 6 solved, 35 unsolved in 4748 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 35/41 constraints, Known Traps: 13/13 constraints]
After SMT, in 6632ms problems are : Problem set: 6 solved, 35 unsolved
Fused 35 Parikh solutions to 29 different solutions.
Parikh walk visited 0 properties in 1176 ms.
Support contains 39 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 93 transition count 126
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 93 transition count 126
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 90 transition count 123
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 90 transition count 123
Applied a total of 24 rules in 23 ms. Remains 90 /102 variables (removed 12) and now considering 123/139 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 90/102 places, 123/139 transitions.
SDD proceeding with computation,33 properties remain. new max is 4096
SDD size :4.51116e+07 after 7.10583e+07
SDD proceeding with computation,33 properties remain. new max is 8192
SDD size :7.10583e+07 after 1.03381e+08
RANDOM walk for 4000000 steps (914897 resets) in 28673 ms. (139 steps per ms) remains 14/33 properties
SDD proceeding with computation,33 properties remain. new max is 16384
SDD size :1.03381e+08 after 1.28552e+08
BEST_FIRST walk for 4000003 steps (198743 resets) in 7254 ms. (551 steps per ms) remains 7/14 properties
BEST_FIRST walk for 4000000 steps (800000 resets) in 8104 ms. (493 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000002 steps (404415 resets) in 6094 ms. (656 steps per ms) remains 5/7 properties
BEST_FIRST walk for 4000003 steps (405109 resets) in 7271 ms. (550 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000001 steps (404518 resets) in 5452 ms. (733 steps per ms) remains 4/5 properties
// Phase 1: matrix 123 rows 90 cols
[2024-05-21 13:06:31] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 13:06:31] [INFO ] State equation strengthened by 54 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 29/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 24/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 78/139 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 62/201 variables, 23/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 39/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 12/213 variables, 6/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 6/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 146 constraints, problems are : Problem set: 0 solved, 4 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 29/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 24/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 78/139 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 9/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 62/201 variables, 23/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 39/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 12/213 variables, 6/144 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/213 variables, 6/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/213 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/213 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 150 constraints, problems are : Problem set: 0 solved, 4 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 558ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 636 ms.
Support contains 8 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 123/123 transitions.
Graph (complete) has 266 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 89 transition count 121
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 16 place count 76 transition count 94
Iterating global reduction 1 with 13 rules applied. Total rules applied 29 place count 76 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 76 transition count 93
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 39 place count 67 transition count 84
Iterating global reduction 2 with 9 rules applied. Total rules applied 48 place count 67 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 67 transition count 83
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 52 place count 64 transition count 77
Iterating global reduction 3 with 3 rules applied. Total rules applied 55 place count 64 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 64 transition count 76
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 58 place count 62 transition count 73
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 62 place count 60 transition count 71
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 60 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 66 place count 60 transition count 69
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 67 place count 59 transition count 68
Iterating global reduction 5 with 1 rules applied. Total rules applied 68 place count 59 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 70 place count 59 transition count 66
Applied a total of 70 rules in 28 ms. Remains 59 /90 variables (removed 31) and now considering 66/123 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 59/90 places, 66/123 transitions.
RANDOM walk for 4000000 steps (917418 resets) in 8301 ms. (481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000002 steps (203205 resets) in 3879 ms. (1030 steps per ms) remains 1/4 properties
BEST_FIRST walk for 4000002 steps (407433 resets) in 2003 ms. (1996 steps per ms) remains 1/1 properties
// Phase 1: matrix 66 rows 59 cols
[2024-05-21 13:06:37] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 13:06:37] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 73/96 variables, 34/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 14/110 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 12/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 15/125 variables, 11/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/125 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/125 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 81 constraints, problems are : Problem set: 0 solved, 1 unsolved in 62 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 73/96 variables, 34/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 14/110 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 12/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 15/125 variables, 11/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/125 variables, 6/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 82 constraints, problems are : Problem set: 0 solved, 1 unsolved in 67 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 139ms problems are : Problem set: 0 solved, 1 unsolved
Reachability property qltransition_137 is true.
Reachability property qltransition_135 is true.
Finished Parikh walk after 30 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 13 ms.
ITS runner timed out or was interrupted.
Reachability property qltransition_134 is true.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 91 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 45437 ms.

BK_STOP 1716296797729

--------------------
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
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="DBSingleClientW-PT-d0m10"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 DBSingleClientW-PT-d0m10, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r101-tall-171624201700302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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