Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008300663.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 HealthRecord-PT-16, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008300663
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K 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.7K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 125K 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

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

=== Now, execution of the tool begins

BK_START 1749008933190

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 202505121319
[2025-06-04 03:48:55] [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]
[2025-06-04 03:48:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 03:48:56] [INFO ] Load time of PNML (sax parser for PT used): 226 ms
[2025-06-04 03:48:56] [INFO ] Transformed 453 places.
[2025-06-04 03:48:56] [INFO ] Transformed 594 transitions.
[2025-06-04 03:48:56] [INFO ] Found NUPN structural information;
[2025-06-04 03:48:56] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 649 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (338 resets) in 3249 ms. (12 steps per ms) remains 13/16 properties
FORMULA HealthRecord-PT-16-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (67 resets) in 234 ms. (170 steps per ms) remains 13/13 properties
[2025-06-04 03:48:57] [INFO ] Flatten gal took : 286 ms
BEST_FIRST walk for 40003 steps (51 resets) in 267 ms. (149 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (78 resets) in 153 ms. (259 steps per ms) remains 13/13 properties
[2025-06-04 03:48:57] [INFO ] Flatten gal took : 107 ms
[2025-06-04 03:48:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17392938251717899655.gal : 73 ms
BEST_FIRST walk for 40004 steps (72 resets) in 494 ms. (80 steps per ms) remains 12/13 properties
FORMULA HealthRecord-PT-16-ReachabilityFireability-2025-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (70 resets) in 93 ms. (425 steps per ms) remains 12/12 properties
[2025-06-04 03:48:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16114528335810785613.prop : 33 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17392938251717899655.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16114528335810785613.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (90 resets) in 319 ms. (125 steps per ms) remains 12/12 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 ...330
Loading property file /tmp/ReachabilityCardinality16114528335810785613.prop.
BEST_FIRST walk for 40003 steps (76 resets) in 780 ms. (51 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :11 after 24
BEST_FIRST walk for 40004 steps (83 resets) in 527 ms. (75 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :24 after 48
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :48 after 138
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :138 after 2550
BEST_FIRST walk for 40003 steps (68 resets) in 398 ms. (100 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (62 resets) in 216 ms. (184 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (57 resets) in 263 ms. (151 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (68 resets) in 177 ms. (224 steps per ms) remains 12/12 properties
// Phase 1: matrix 594 rows 453 cols
[2025-06-04 03:48:58] [INFO ] Computed 14 invariants in 38 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :2550 after 1.53612e+06
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem HealthRecord-PT-16-ReachabilityFireability-2025-05 is UNSAT
FORMULA HealthRecord-PT-16-ReachabilityFireability-2025-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem HealthRecord-PT-16-ReachabilityFireability-2025-07 is UNSAT
FORMULA HealthRecord-PT-16-ReachabilityFireability-2025-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem HealthRecord-PT-16-ReachabilityFireability-2025-14 is UNSAT
FORMULA HealthRecord-PT-16-ReachabilityFireability-2025-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 110/309 variables, 8/207 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 110/317 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 0/317 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Problem HealthRecord-PT-16-ReachabilityFireability-2025-09 is UNSAT
FORMULA HealthRecord-PT-16-ReachabilityFireability-2025-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 144/453 variables, 6/323 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/453 variables, 144/467 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 0/467 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 594/1047 variables, 453/920 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1047 variables, 0/920 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/1047 variables, 0/920 constraints. Problems are: Problem set: 4 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1047/1047 variables, and 920 constraints, problems are : Problem set: 4 solved, 8 unsolved in 3380 ms.
Refiners :[Domain max(s): 453/453 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 453/453 constraints, PredecessorRefiner: 12/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 155/256 variables, 8/109 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 155/264 constraints. Problems are: Problem set: 4 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:49:03] [INFO ] Deduced a trap composed of 85 places in 258 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:49:03] [INFO ] Deduced a trap composed of 86 places in 185 ms of which 31 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 2/266 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/266 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 197/453 variables, 6/272 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 197/469 constraints. Problems are: Problem set: 4 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:49:05] [INFO ] Deduced a trap composed of 93 places in 258 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:49:05] [INFO ] Deduced a trap composed of 89 places in 322 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:49:05] [INFO ] Deduced a trap composed of 90 places in 278 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:49:06] [INFO ] Deduced a trap composed of 91 places in 415 ms of which 79 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 4/473 constraints. Problems are: Problem set: 4 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:49:07] [INFO ] Deduced a trap composed of 91 places in 335 ms of which 72 ms to minimize.
SMT process timed out in 8803ms, After SMT, problems are : Problem set: 4 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 101 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 594/594 transitions.
Graph (trivial) has 277 edges and 453 vertex of which 24 / 453 are part of one of the 12 SCC in 4 ms
Free SCC test removed 12 places
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 848 edges and 441 vertex of which 429 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 114 place count 429 transition count 454
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 123 rules applied. Total rules applied 237 place count 317 transition count 443
Reduce places removed 5 places and 0 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Iterating post reduction 2 with 33 rules applied. Total rules applied 270 place count 312 transition count 415
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 31 rules applied. Total rules applied 301 place count 284 transition count 412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 302 place count 283 transition count 412
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 302 place count 283 transition count 403
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 320 place count 274 transition count 403
Discarding 45 places :
Symmetric choice reduction at 5 with 45 rule applications. Total rules 365 place count 229 transition count 340
Iterating global reduction 5 with 45 rules applied. Total rules applied 410 place count 229 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 412 place count 229 transition count 338
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 419 place count 222 transition count 324
Iterating global reduction 6 with 7 rules applied. Total rules applied 426 place count 222 transition count 324
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 427 place count 221 transition count 322
Iterating global reduction 6 with 1 rules applied. Total rules applied 428 place count 221 transition count 322
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 442 place count 214 transition count 315
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 448 place count 211 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 455 place count 211 transition count 313
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 456 place count 211 transition count 312
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 457 place count 210 transition count 312
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 459 place count 209 transition count 320
Free-agglomeration rule applied 13 times.
Iterating global reduction 8 with 13 rules applied. Total rules applied 472 place count 209 transition count 307
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 8 with 13 rules applied. Total rules applied 485 place count 196 transition count 307
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 486 place count 195 transition count 305
Iterating global reduction 9 with 1 rules applied. Total rules applied 487 place count 195 transition count 305
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 494 place count 195 transition count 305
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 495 place count 194 transition count 303
Iterating global reduction 9 with 1 rules applied. Total rules applied 496 place count 194 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 497 place count 194 transition count 302
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 503 place count 194 transition count 302
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 504 place count 193 transition count 301
Iterating global reduction 9 with 1 rules applied. Total rules applied 505 place count 193 transition count 301
Applied a total of 505 rules in 277 ms. Remains 193 /453 variables (removed 260) and now considering 301/594 (removed 293) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 289 ms. Remains : 193/453 places, 301/594 transitions.
RANDOM walk for 40000 steps (829 resets) in 372 ms. (107 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (175 resets) in 151 ms. (263 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (179 resets) in 132 ms. (300 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (207 resets) in 144 ms. (275 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (173 resets) in 176 ms. (226 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (196 resets) in 254 ms. (156 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (176 resets) in 370 ms. (107 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (182 resets) in 229 ms. (173 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (180 resets) in 78 ms. (506 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 592804 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :0 out of 8
Probabilistic random walk after 592804 steps, saw 98533 distinct states, run finished after 3009 ms. (steps per millisecond=197 ) properties seen :0
// Phase 1: matrix 301 rows 193 cols
[2025-06-04 03:49:11] [INFO ] Computed 6 invariants in 4 ms
[2025-06-04 03:49:11] [INFO ] State equation strengthened by 3 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 92/193 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 301/494 variables, 193/199 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/494 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/494 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/494 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 494/494 variables, and 202 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2473 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 8/6 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 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 92/193 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 301/494 variables, 193/199 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/494 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/494 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:49:15] [INFO ] Deduced a trap composed of 49 places in 123 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/494 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/494 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 494/494 variables, and 209 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4003 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 193/193 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 8/6 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6507ms problems are : Problem set: 0 solved, 8 unsolved
FORMULA HealthRecord-PT-16-ReachabilityFireability-2025-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2025-01 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2025-06 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2025-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2025-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2025-15 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 6 properties in 1952 ms.
Support contains 38 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 301/301 transitions.
Graph (trivial) has 106 edges and 193 vertex of which 4 / 193 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 444 edges and 191 vertex of which 189 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 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 189 transition count 273
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 167 transition count 270
Reduce places removed 1 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 8 rules applied. Total rules applied 57 place count 166 transition count 263
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 64 place count 159 transition count 263
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 64 place count 159 transition count 257
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 76 place count 153 transition count 257
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 95 place count 134 transition count 224
Iterating global reduction 4 with 19 rules applied. Total rules applied 114 place count 134 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 115 place count 134 transition count 223
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 117 place count 132 transition count 218
Iterating global reduction 5 with 2 rules applied. Total rules applied 119 place count 132 transition count 218
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 145 place count 119 transition count 205
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 151 place count 116 transition count 217
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 152 place count 115 transition count 214
Iterating global reduction 5 with 1 rules applied. Total rules applied 153 place count 115 transition count 214
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 154 place count 114 transition count 213
Iterating global reduction 5 with 1 rules applied. Total rules applied 155 place count 114 transition count 213
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 160 place count 114 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 162 place count 113 transition count 207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 164 place count 112 transition count 209
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 172 place count 112 transition count 201
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 181 place count 104 transition count 200
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 184 place count 104 transition count 197
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 186 place count 103 transition count 196
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 201 place count 103 transition count 196
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 202 place count 102 transition count 194
Iterating global reduction 6 with 1 rules applied. Total rules applied 203 place count 102 transition count 194
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 204 place count 102 transition count 193
Applied a total of 204 rules in 89 ms. Remains 102 /193 variables (removed 91) and now considering 193/301 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 102/193 places, 193/301 transitions.
RANDOM walk for 40000 steps (1747 resets) in 871 ms. (45 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (317 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (341 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 652757 steps, run visited all 2 properties in 2148 ms. (steps per millisecond=303 )
Probabilistic random walk after 652757 steps, saw 117943 distinct states, run finished after 2155 ms. (steps per millisecond=302 ) properties seen :2
FORMULA HealthRecord-PT-16-ReachabilityFireability-2025-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-16-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
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 26891 ms.

BK_STOP 1749008962595

--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-5832"
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 r100-smll-174867008300663"
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 ;