Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r146-tall-177961074300663.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is HealthRecord-PT-16, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074300663
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.3K Mar 7 13:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 7 13:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 7 13:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 7 13:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Mar 7 13:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 7 13:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 7 13:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 7 13:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 125K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-00
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-01
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-02
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-03
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-04
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-05
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-06
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-07
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-08
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-09
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-10
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-11
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-12
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-13
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-14
FORMULA_NAME HealthRecord-PT-16-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779737889836

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-25 19:38:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 19:38:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 19:38:11] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2026-05-25 19:38:11] [INFO ] Transformed 453 places.
[2026-05-25 19:38:11] [INFO ] Transformed 594 transitions.
[2026-05-25 19:38:11] [INFO ] Found NUPN structural information;
[2026-05-25 19:38:11] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (143 resets) in 1233 ms. (32 steps per ms) remains 8/16 properties
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 19:38:11] [INFO ] Flatten gal took : 120 ms
BEST_FIRST walk for 40004 steps (67 resets) in 311 ms. (128 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (52 resets) in 147 ms. (270 steps per ms) remains 8/8 properties
[2026-05-25 19:38:11] [INFO ] Flatten gal took : 95 ms
BEST_FIRST walk for 40003 steps (67 resets) in 126 ms. (314 steps per ms) remains 8/8 properties
[2026-05-25 19:38:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6791767907043593285.gal : 52 ms
BEST_FIRST walk for 40004 steps (69 resets) in 218 ms. (182 steps per ms) remains 8/8 properties
[2026-05-25 19:38:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12314714590874190422.prop : 15 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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6791767907043593285.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12314714590874190422.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.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40002 steps (62 resets) in 187 ms. (212 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality12314714590874190422.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :11 after 24
BEST_FIRST walk for 40004 steps (65 resets) in 423 ms. (94 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :24 after 48
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :48 after 138
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :138 after 2550
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :2550 after 1.53612e+06
BEST_FIRST walk for 40004 steps (67 resets) in 168 ms. (236 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (52 resets) in 116 ms. (341 steps per ms) remains 8/8 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1668974834162573624.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11013556343936350862.kers'
[2026-05-25 19:38:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1668974834162573624.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11013556343936350862.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 594 rows 453 cols 1333 entries
Finished phase 1 with 437 SingleSign rule and 2 generalized
[2026-05-25 19:38:12] [INFO ] Computed 14 invariants in 2 ms
Computed 14 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11013556343936350862.kers
Total runtime 3 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 104/104 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 275/379 variables, 7/111 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 275/386 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 74/453 variables, 7/393 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/453 variables, 74/467 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 594/1047 variables, 453/920 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1047 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/1047 variables, 0/920 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1047/1047 variables, and 920 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4049 ms.
Refiners :[Domain max(s): 453/453 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 453/453 constraints, PredecessorRefiner: 8/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 104/104 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 275/379 variables, 7/111 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/379 variables, 275/386 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/379 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/379 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 74/453 variables, 7/394 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 74/468 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem HealthRecord-PT-16-ReachabilityFireability-2024-13 is UNSAT
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 6/474 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 1/475 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 0/475 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 594/1047 variables, 453/928 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1047/1047 variables, and 932 constraints, problems are : Problem set: 1 solved, 7 unsolved in 5017 ms.
Refiners :[Domain max(s): 453/453 constraints, Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 453/453 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9221ms problems are : Problem set: 1 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 98 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 594/594 transitions.
Graph (trivial) has 265 edges and 453 vertex of which 22 / 453 are part of one of the 11 SCC in 6 ms
Free SCC test removed 11 places
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Graph (complete) has 850 edges and 442 vertex of which 432 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.4 ms
Discarding 10 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 107 place count 432 transition count 463
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 113 rules applied. Total rules applied 220 place count 327 transition count 455
Reduce places removed 3 places and 0 transitions.
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Iterating post reduction 2 with 45 rules applied. Total rules applied 265 place count 324 transition count 413
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 49 rules applied. Total rules applied 314 place count 282 transition count 406
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 316 place count 280 transition count 406
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 316 place count 280 transition count 397
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 334 place count 271 transition count 397
Discarding 43 places :
Symmetric choice reduction at 5 with 43 rule applications. Total rules 377 place count 228 transition count 340
Iterating global reduction 5 with 43 rules applied. Total rules applied 420 place count 228 transition count 340
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 424 place count 228 transition count 336
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 431 place count 221 transition count 322
Iterating global reduction 6 with 7 rules applied. Total rules applied 438 place count 221 transition count 322
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 464 place count 208 transition count 309
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 474 place count 203 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 480 place count 203 transition count 314
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 484 place count 201 transition count 314
Free-agglomeration rule applied 11 times.
Iterating global reduction 6 with 11 rules applied. Total rules applied 495 place count 201 transition count 303
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 506 place count 190 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 507 place count 190 transition count 302
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 517 place count 190 transition count 302
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 520 place count 187 transition count 296
Iterating global reduction 7 with 3 rules applied. Total rules applied 523 place count 187 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 524 place count 187 transition count 295
Applied a total of 524 rules in 177 ms. Remains 187 /453 variables (removed 266) and now considering 295/594 (removed 299) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 187/453 places, 295/594 transitions.
RANDOM walk for 40000 steps (882 resets) in 286 ms. (139 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (167 resets) in 74 ms. (533 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (75 resets) in 51 ms. (769 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (164 resets) in 52 ms. (754 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (144 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (164 resets) in 79 ms. (500 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (145 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (170 resets) in 74 ms. (533 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 821649 steps, run timeout after 3001 ms. (steps per millisecond=273 ) properties seen :0 out of 7
Probabilistic random walk after 821649 steps, saw 123799 distinct states, run finished after 3006 ms. (steps per millisecond=273 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12218695016855726398.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8228847361060260427.kers'
[2026-05-25 19:38:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12218695016855726398.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8228847361060260427.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 295 rows 187 cols 772 entries
Finished phase 1 with 177 SingleSign rule and 2 generalized
[2026-05-25 19:38:24] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8228847361060260427.kers
Total runtime 1 ms.
[2026-05-25 19:38:24] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 16/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 73/187 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 295/482 variables, 187/195 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/482 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 197 constraints, problems are : Problem set: 0 solved, 7 unsolved in 689 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 187/187 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 16/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 73/187 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 295/482 variables, 187/201 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/482 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/482 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/482 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/482 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/482 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/482 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/482 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 210 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3337 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 187/187 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 7/5 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4054ms problems are : Problem set: 0 solved, 7 unsolved
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-02 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-11 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 6 properties in 910 ms.
Support contains 28 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 295/295 transitions.
Graph (trivial) has 162 edges and 187 vertex of which 11 / 187 are part of one of the 4 SCC in 0 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 438 edges and 180 vertex of which 179 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 179 transition count 261
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 27 rules applied. Total rules applied 51 place count 157 transition count 256
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 154 transition count 256
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 54 place count 154 transition count 247
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 72 place count 145 transition count 247
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 88 place count 129 transition count 214
Iterating global reduction 3 with 16 rules applied. Total rules applied 104 place count 129 transition count 214
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 106 place count 127 transition count 209
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 127 transition count 209
Performed 16 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 140 place count 111 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 141 place count 111 transition count 189
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 142 place count 110 transition count 187
Iterating global reduction 4 with 1 rules applied. Total rules applied 143 place count 110 transition count 187
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 161 place count 101 transition count 237
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 163 place count 99 transition count 229
Iterating global reduction 4 with 2 rules applied. Total rules applied 165 place count 99 transition count 229
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 166 place count 98 transition count 227
Iterating global reduction 4 with 1 rules applied. Total rules applied 167 place count 98 transition count 227
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 168 place count 98 transition count 226
Free-agglomeration rule applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 177 place count 98 transition count 217
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 187 place count 89 transition count 216
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 188 place count 88 transition count 212
Iterating global reduction 5 with 1 rules applied. Total rules applied 189 place count 88 transition count 212
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 190 place count 87 transition count 209
Iterating global reduction 5 with 1 rules applied. Total rules applied 191 place count 87 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 193 place count 87 transition count 207
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 208 place count 87 transition count 207
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 209 place count 87 transition count 207
Applied a total of 209 rules in 49 ms. Remains 87 /187 variables (removed 100) and now considering 207/295 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 87/187 places, 207/295 transitions.
RANDOM walk for 40000 steps (2301 resets) in 726 ms. (55 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (270 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2744286 steps, run timeout after 3001 ms. (steps per millisecond=914 ) properties seen :0 out of 1
Probabilistic random walk after 2744286 steps, saw 458200 distinct states, run finished after 3001 ms. (steps per millisecond=914 ) properties seen :0
[2026-05-25 19:38:33] [INFO ] Flow matrix only has 203 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18111887463683083216.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13145285451608251372.kers'
[2026-05-25 19:38:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18111887463683083216.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13145285451608251372.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 203 rows 87 cols 850 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-25 19:38:33] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13145285451608251372.kers
Total runtime 2 ms.
[2026-05-25 19:38:33] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/87 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 203/290 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 13/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/290 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 107 constraints, problems are : Problem set: 0 solved, 1 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 87/87 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/87 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 203/290 variables, 87/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 13/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/290 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 107 constraints, problems are : Problem set: 0 solved, 1 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 87/87 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 249ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1935 steps, including 97 resets, run visited all 1 properties in 7 ms. (steps per millisecond=276 )
FORMULA HealthRecord-PT-16-ReachabilityFireability-2024-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 9 ms.
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 22499 ms.

BK_STOP 1779737913473

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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
++ 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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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="HealthRecord-PT-16"
export BK_EXAMINATION="ReachabilityFireability"
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-5973"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-16, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r146-tall-177961074300663"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-16.tgz
mv HealthRecord-PT-16 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;