fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r147-tall-174876819600262
Last Updated
June 24, 2025

About the Execution of ITS-Tools for Parking-PT-416

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 56962.00 0.00 0.00 T normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r147-tall-174876819600262.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is Parking-PT-416, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r147-tall-174876819600262
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 107K May 29 14:32 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 1748809982698

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Parking-PT-416
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202505121319
[2025-06-01 20:33:03] [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]
[2025-06-01 20:33:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 20:33:04] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2025-06-01 20:33:04] [INFO ] Transformed 305 places.
[2025-06-01 20:33:04] [INFO ] Transformed 433 transitions.
[2025-06-01 20:33:04] [INFO ] Found NUPN structural information;
[2025-06-01 20:33:04] [INFO ] Parsed PT model containing 305 places and 433 transitions and 1289 arcs in 177 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 305/305 places, 433/433 transitions.
Ensure Unique test removed 176 transitions
Reduce isomorphic transitions removed 176 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 184 rules applied. Total rules applied 184 place count 305 transition count 249
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 192 place count 297 transition count 249
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 192 place count 297 transition count 241
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 208 place count 289 transition count 241
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 240 place count 273 transition count 225
Applied a total of 240 rules in 53 ms. Remains 273 /305 variables (removed 32) and now considering 225/433 (removed 208) transitions.
// Phase 1: matrix 225 rows 273 cols
[2025-06-01 20:33:04] [INFO ] Computed 76 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 20:33:04] [INFO ] Implicit Places using invariants in 468 ms returned [47, 54, 60, 66, 82, 84, 109, 116, 122, 128, 144, 146, 171, 178, 184, 190, 206, 208, 233, 240, 246, 252, 268, 270]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 509 ms to find 24 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 249/305 places, 225/433 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 229 transition count 205
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 228 transition count 224
Applied a total of 42 rules in 17 ms. Remains 228 /249 variables (removed 21) and now considering 224/225 (removed 1) transitions.
// Phase 1: matrix 224 rows 228 cols
[2025-06-01 20:33:04] [INFO ] Computed 52 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 20:33:04] [INFO ] Implicit Places using invariants in 151 ms returned []
[2025-06-01 20:33:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 20:33:04] [INFO ] State equation strengthened by 104 read => feed constraints.
[2025-06-01 20:33:05] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 228/305 places, 224/433 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1287 ms. Remains : 228/305 places, 224/433 transitions.
Discarding 92 transitions out of 224. Remains 132
Initial state reduction rules removed 1 formulas.
[2025-06-01 20:33:05] [INFO ] Flatten gal took : 112 ms
[2025-06-01 20:33:05] [INFO ] Flatten gal took : 51 ms
RANDOM walk for 40000 steps (535 resets) in 1689 ms. (23 steps per ms) remains 31/131 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
[2025-06-01 20:33:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8566514874587132081.gal : 21 ms
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
[2025-06-01 20:33:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4438550768996749789.prop : 1 ms
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8566514874587132081.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4438550768996749789.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties

BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 31/31 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 31/31 properties
Loading property file /tmp/ReachabilityCardinality4438550768996749789.prop.
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 31/31 properties
SDD proceeding with computation,31 properties remain. new max is 4
SDD size :6 after 25
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
SDD proceeding with computation,31 properties remain. new max is 8
SDD size :25 after 273
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
SDD proceeding with computation,31 properties remain. new max is 16
SDD size :273 after 131089
SDD proceeding with computation,31 properties remain. new max is 32
SDD size :131089 after 2.09717e+06
SDD proceeding with computation,31 properties remain. new max is 64
SDD size :2.09717e+06 after 4.19443e+06
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
SDD proceeding with computation,31 properties remain. new max is 128
SDD size :4.19443e+06 after 9.43718e+06
SDD proceeding with computation,31 properties remain. new max is 256
SDD size :9.43718e+06 after 1.46801e+07
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 31/31 properties
[2025-06-01 20:33:06] [INFO ] Invariant cache hit.
[2025-06-01 20:33:06] [INFO ] State equation strengthened by 104 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 132/194 variables, 35/97 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 132/229 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 34/228 variables, 17/246 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 34/280 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 224/452 variables, 228/508 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 104/612 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (OVERLAPS) 0/452 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 452/452 variables, and 612 constraints, problems are : Problem set: 0 solved, 31 unsolved in 3525 ms.
Refiners :[Domain max(s): 228/228 constraints, Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 228/228 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 132/194 variables, 35/97 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 132/229 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 34/228 variables, 17/246 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 34/280 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 224/452 variables, 228/508 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/452 variables, 104/612 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/452 variables, 31/643 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/452 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Reachability property qltransition_219 is true.
Reachability property qltransition_150 is true.
Reachability property qltransition_149 is true.
Reachability property qltransition_148 is true.
Reachability property qltransition_147 is true.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/452 variables, and 643 constraints, problems are : Problem set: 5 solved, 26 unsolved in 5017 ms.
Refiners :[Domain max(s): 228/228 constraints, Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 228/228 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8617ms problems are : Problem set: 5 solved, 26 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 224/224 transitions.
Free-agglomeration rule applied 37 times.
Iterating global reduction 0 with 37 rules applied. Total rules applied 37 place count 228 transition count 187
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 74 place count 191 transition count 187
Applied a total of 74 rules in 47 ms. Remains 191 /228 variables (removed 37) and now considering 187/224 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 191/228 places, 187/224 transitions.
Reachability property qltransition_70 is true.
Reachability property qltransition_69 is true.
SDD proceeding with computation,24 properties remain. new max is 256
SDD size :1.46801e+07 after 1.88979e+11
Reachability property qltransition_131 is true.
SDD proceeding with computation,23 properties remain. new max is 256
SDD size :1.88979e+11 after 2.92058e+11
RANDOM walk for 4000000 steps (37879 resets) in 26259 ms. (152 steps per ms) remains 15/26 properties
BEST_FIRST walk for 400004 steps (362 resets) in 1040 ms. (384 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (358 resets) in 711 ms. (561 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (355 resets) in 570 ms. (700 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (360 resets) in 633 ms. (630 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (356 resets) in 567 ms. (704 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (355 resets) in 651 ms. (613 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (366 resets) in 634 ms. (629 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (367 resets) in 587 ms. (680 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (357 resets) in 680 ms. (587 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (344 resets) in 558 ms. (715 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (362 resets) in 615 ms. (649 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (359 resets) in 521 ms. (766 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400004 steps (362 resets) in 600 ms. (665 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (363 resets) in 569 ms. (701 steps per ms) remains 15/15 properties
BEST_FIRST walk for 400003 steps (363 resets) in 619 ms. (645 steps per ms) remains 15/15 properties
// Phase 1: matrix 187 rows 191 cols
[2025-06-01 20:33:27] [INFO ] Computed 52 invariants in 2 ms
[2025-06-01 20:33:27] [INFO ] State equation strengthened by 130 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 85/115 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 85/133 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 76/191 variables, 34/167 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 76/243 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 187/378 variables, 191/434 constraints. Problems are: Problem set: 0 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 130/564 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/378 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 378/378 variables, and 564 constraints, problems are : Problem set: 0 solved, 15 unsolved in 848 ms.
Refiners :[Domain max(s): 191/191 constraints, Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 191/191 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 85/115 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 85/133 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 76/191 variables, 34/167 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 76/243 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 187/378 variables, 191/434 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 130/564 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 15/579 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 0/378 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 378/378 variables, and 579 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1692 ms.
Refiners :[Domain max(s): 191/191 constraints, Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 191/191 constraints, ReadFeed: 130/130 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2555ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 3 properties in 4954 ms.
Support contains 24 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 187/187 transitions.
Free-agglomeration rule applied 14 times.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 191 transition count 173
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 28 place count 177 transition count 173
Applied a total of 28 rules in 30 ms. Remains 177 /191 variables (removed 14) and now considering 173/187 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 177/191 places, 173/187 transitions.
RANDOM walk for 4000000 steps (8 resets) in 15628 ms. (255 steps per ms) remains 10/12 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 6106 ms. (654 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 8232 ms. (485 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 5905 ms. (677 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 6610 ms. (605 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 6765 ms. (591 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 5291 ms. (755 steps per ms) remains 9/10 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 5697 ms. (702 steps per ms) remains 9/9 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 4952 ms. (807 steps per ms) remains 8/9 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 5719 ms. (699 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 5743 ms. (696 steps per ms) remains 8/8 properties
// Phase 1: matrix 173 rows 177 cols
[2025-06-01 20:33:57] [INFO ] Computed 52 invariants in 1 ms
[2025-06-01 20:33:57] [INFO ] State equation strengthened by 144 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 57/73 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 57/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 104/177 variables, 42/125 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 104/229 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 173/350 variables, 177/406 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 144/550 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/350 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 550 constraints, problems are : Problem set: 0 solved, 8 unsolved in 461 ms.
Refiners :[Domain max(s): 177/177 constraints, Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 177/177 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 57/73 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 57/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 104/177 variables, 42/125 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/177 variables, 104/229 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 173/350 variables, 177/406 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 144/550 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 8/558 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/350 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 558 constraints, problems are : Problem set: 0 solved, 8 unsolved in 754 ms.
Refiners :[Domain max(s): 177/177 constraints, Positive P Invariants (semi-flows): 52/52 constraints, State Equation: 177/177 constraints, ReadFeed: 144/144 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1232ms problems are : Problem set: 0 solved, 8 unsolved
Finished Parikh walk after 84 steps, including 1 resets, run visited all 4 properties in 2 ms. (steps per millisecond=42 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 8 properties in 651 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 132 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 55718 ms.

BK_STOP 1748810039660

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="Parking-PT-416"
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-5832"
echo " Executing tool itstools"
echo " Input is Parking-PT-416, 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 r147-tall-174876819600262"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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