Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r180-tall-171640604200799.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is HealthRecord-PT-13, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640604200799
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Apr 12 20:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 20:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 20:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 71K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716520805144

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-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-24 03:20:06] [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]
[2024-05-24 03:20:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:20:06] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-24 03:20:06] [INFO ] Transformed 161 places.
[2024-05-24 03:20:06] [INFO ] Transformed 341 transitions.
[2024-05-24 03:20:06] [INFO ] Found NUPN structural information;
[2024-05-24 03:20:06] [INFO ] Parsed PT model containing 161 places and 341 transitions and 899 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
[2024-05-24 03:20:07] [INFO ] Flatten gal took : 111 ms
[2024-05-24 03:20:07] [INFO ] Flatten gal took : 41 ms
[2024-05-24 03:20:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7661403013245900918.gal : 21 ms
[2024-05-24 03:20:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11171865679813524203.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7661403013245900918.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11171865679813524203.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (3124 resets) in 1954 ms. (20 steps per ms) remains 14/16 properties
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality11171865679813524203.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :9 after 97
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :97 after 649
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :649 after 4755
BEST_FIRST walk for 40003 steps (436 resets) in 579 ms. (68 steps per ms) remains 13/14 properties
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (450 resets) in 173 ms. (229 steps per ms) remains 13/13 properties
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :4755 after 6697
BEST_FIRST walk for 40004 steps (424 resets) in 365 ms. (109 steps per ms) remains 13/13 properties
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :6697 after 7777
BEST_FIRST walk for 40003 steps (432 resets) in 657 ms. (60 steps per ms) remains 12/13 properties
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (259 resets) in 137 ms. (289 steps per ms) remains 11/12 properties
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (432 resets) in 94 ms. (421 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (433 resets) in 164 ms. (242 steps per ms) remains 11/11 properties
SDD proceeding with computation,16 properties remain. new max is 512
BEST_FIRST walk for 40004 steps (429 resets) in 85 ms. (465 steps per ms) remains 11/11 properties
SDD size :7777 after 10693
BEST_FIRST walk for 40004 steps (436 resets) in 117 ms. (339 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (446 resets) in 82 ms. (481 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (268 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (440 resets) in 107 ms. (370 steps per ms) remains 10/11 properties
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Reachability property HealthRecord-PT-13-ReachabilityFireability-2024-15 is true.
Invariant property HealthRecord-PT-13-ReachabilityFireability-2024-14 does not hold.
Reachability property HealthRecord-PT-13-ReachabilityFireability-2024-13 is true.
[2024-05-24 03:20:08] [INFO ] Flow matrix only has 301 transitions (discarded 12 similar events)
// Phase 1: matrix 301 rows 161 cols
[2024-05-24 03:20:08] [INFO ] Computed 18 invariants in 11 ms
[2024-05-24 03:20:08] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem HealthRecord-PT-13-ReachabilityFireability-2024-01 is UNSAT
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem HealthRecord-PT-13-ReachabilityFireability-2024-11 is UNSAT
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 38/137 variables, 10/109 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 38/147 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 1/148 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/148 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem HealthRecord-PT-13-ReachabilityFireability-2024-12 is UNSAT
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 24/161 variables, 7/155 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 24/179 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Invariant property HealthRecord-PT-13-ReachabilityFireability-2024-06 does not hold.
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/179 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 300/461 variables, 161/340 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 0/340 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/462 variables, 1/341 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/341 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Invariant property HealthRecord-PT-13-ReachabilityFireability-2024-00 does not hold.
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :10693 after 56641
At refinement iteration 13 (OVERLAPS) 0/462 variables, 0/341 constraints. Problems are: Problem set: 3 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 341 constraints, problems are : Problem set: 3 solved, 7 unsolved in 704 ms.
Refiners :[Domain max(s): 161/161 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 161/161 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 89/89 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/89 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 43/132 variables, 10/99 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 43/142 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 1/143 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-05-24 03:20:09] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 11 ms to minimize.
[2024-05-24 03:20:09] [INFO ] Deduced a trap composed of 40 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 2/145 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-05-24 03:20:09] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 2 ms to minimize.
[2024-05-24 03:20:09] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 2/147 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-05-24 03:20:09] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 1/148 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/148 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 29/161 variables, 7/155 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 29/184 constraints. Problems are: Problem set: 3 solved, 7 unsolved
[2024-05-24 03:20:09] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:20:09] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
Problem HealthRecord-PT-13-ReachabilityFireability-2024-03 is UNSAT
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :56641 after 60529
[2024-05-24 03:20:09] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:20:09] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 7 ms to minimize.
[2024-05-24 03:20:09] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 2 ms to minimize.
Problem HealthRecord-PT-13-ReachabilityFireability-2024-04 is UNSAT
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-24 03:20:10] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:20:10] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:20:10] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 10 ms to minimize.
[2024-05-24 03:20:10] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 2 ms to minimize.
[2024-05-24 03:20:10] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:20:10] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 1 ms to minimize.
[2024-05-24 03:20:10] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
[2024-05-24 03:20:10] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:20:10] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2024-05-24 03:20:10] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:20:10] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :60529 after 66361
[2024-05-24 03:20:10] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:20:10] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:20:10] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:20:10] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
Problem HealthRecord-PT-13-ReachabilityFireability-2024-03 is UNSAT
Problem HealthRecord-PT-13-ReachabilityFireability-2024-04 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/161 variables, 20/204 constraints. Problems are: Problem set: 5 solved, 5 unsolved
[2024-05-24 03:20:11] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:20:11] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:20:11] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:20:11] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:20:11] [INFO ] Deduced a trap composed of 48 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:20:11] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:20:11] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:20:11] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:20:11] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2024-05-24 03:20:11] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 2 ms to minimize.
[2024-05-24 03:20:11] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 2 ms to minimize.
[2024-05-24 03:20:11] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:20:11] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:20:11] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/161 variables, 14/218 constraints. Problems are: Problem set: 5 solved, 5 unsolved
[2024-05-24 03:20:12] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:20:12] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:20:12] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:20:12] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2024-05-24 03:20:12] [INFO ] Deduced a trap composed of 47 places in 68 ms of which 1 ms to minimize.
[2024-05-24 03:20:12] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:20:12] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:20:12] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:20:12] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:20:12] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/161 variables, 10/228 constraints. Problems are: Problem set: 5 solved, 5 unsolved
[2024-05-24 03:20:12] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:20:12] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/161 variables, 2/230 constraints. Problems are: Problem set: 5 solved, 5 unsolved
[2024-05-24 03:20:12] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 1 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :66361 after 155137
[2024-05-24 03:20:13] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:20:13] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:20:13] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:20:13] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 9 ms to minimize.
[2024-05-24 03:20:13] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/161 variables, 6/236 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/161 variables, 0/236 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 300/461 variables, 161/397 constraints. Problems are: Problem set: 5 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/461 variables, 5/402 constraints. Problems are: Problem set: 5 solved, 5 unsolved
[2024-05-24 03:20:13] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:20:13] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:20:13] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 461/462 variables, and 405 constraints, problems are : Problem set: 5 solved, 5 unsolved in 5014 ms.
Refiners :[Domain max(s): 161/161 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 161/161 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 5/10 constraints, Known Traps: 60/60 constraints]
After SMT, in 5933ms problems are : Problem set: 5 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 67 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 313/313 transitions.
Graph (trivial) has 46 edges and 161 vertex of which 4 / 161 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 685 edges and 159 vertex of which 151 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output 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 0 with 1 rules applied. Total rules applied 3 place count 151 transition count 295
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 150 transition count 294
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 51 place count 104 transition count 202
Iterating global reduction 2 with 46 rules applied. Total rules applied 97 place count 104 transition count 202
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 99 place count 102 transition count 198
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 102 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 102 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 3 with 2 rules applied. Total rules applied 104 place count 101 transition count 196
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 101 transition count 195
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 105 place count 101 transition count 194
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 107 place count 100 transition count 194
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 100 transition count 194
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 109 place count 100 transition count 193
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 99 transition count 192
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 99 transition count 192
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 99 transition count 192
Applied a total of 112 rules in 73 ms. Remains 99 /161 variables (removed 62) and now considering 192/313 (removed 121) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 99/161 places, 192/313 transitions.
RANDOM walk for 40000 steps (2999 resets) in 285 ms. (139 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (467 resets) in 148 ms. (268 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (488 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (469 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (442 resets) in 54 ms. (727 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (478 resets) in 73 ms. (540 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 1211016 steps, run timeout after 3001 ms. (steps per millisecond=403 ) properties seen :0 out of 5
Probabilistic random walk after 1211016 steps, saw 158308 distinct states, run finished after 3004 ms. (steps per millisecond=403 ) properties seen :0
// Phase 1: matrix 192 rows 99 cols
[2024-05-24 03:20:17] [INFO ] Computed 10 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 32/99 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 192/291 variables, 99/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/291 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 109 constraints, problems are : Problem set: 0 solved, 5 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 32/99 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 03:20:17] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:20:17] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:20:17] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 0 ms to minimize.
[2024-05-24 03:20:17] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:20:17] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:20:17] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:20:17] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:20:18] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2024-05-24 03:20:18] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:20:18] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:20:18] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:20:18] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:20:18] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:20:18] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:20:18] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:20:18] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:20:18] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:20:18] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 03:20:18] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:20:18] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 03:20:18] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:20:18] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 03:20:18] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:20:18] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 03:20:18] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 03:20:18] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 03:20:19] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 192/291 variables, 99/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 5/141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 03:20:19] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:20:19] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 03:20:19] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/291 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/291 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/291 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 144 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2373 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 30/30 constraints]
After SMT, in 2570ms problems are : Problem set: 0 solved, 5 unsolved
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-09 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-05 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 477 steps, including 16 resets, run visited all 1 properties in 2 ms. (steps per millisecond=238 )
FORMULA HealthRecord-PT-13-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
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 5 properties in 64 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 13773 ms.

BK_STOP 1716520820086

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-13"
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-5568"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-13, 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 r180-tall-171640604200799"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-13.tgz
mv HealthRecord-PT-13 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;