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-171640604100767.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-09, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640604100767
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 19K Apr 12 21:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 230K Apr 12 21:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 21:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 21:30 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 68K 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-09-ReachabilityFireability-2024-00
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-2024-01
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-2024-02
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-2024-03
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-2024-04
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-2024-05
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-2024-06
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-2024-07
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-2024-08
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-2024-09
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-2024-10
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-2024-11
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-2024-12
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-2024-13
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-2024-14
FORMULA_NAME HealthRecord-PT-09-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716520141197

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-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-24 03:09:02] [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:09:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:09:02] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-05-24 03:09:02] [INFO ] Transformed 157 places.
[2024-05-24 03:09:02] [INFO ] Transformed 327 transitions.
[2024-05-24 03:09:02] [INFO ] Found NUPN structural information;
[2024-05-24 03:09:02] [INFO ] Parsed PT model containing 157 places and 327 transitions and 859 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
[2024-05-24 03:09:03] [INFO ] Flatten gal took : 173 ms
RANDOM walk for 40000 steps (2366 resets) in 1724 ms. (23 steps per ms) remains 13/16 properties
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-24 03:09:03] [INFO ] Flatten gal took : 38 ms
[2024-05-24 03:09:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14294539511922834311.gal : 24 ms
BEST_FIRST walk for 40003 steps (340 resets) in 220 ms. (181 steps per ms) remains 13/13 properties
[2024-05-24 03:09:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15284334288275219522.prop : 7 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/ReachabilityCardinality14294539511922834311.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15284334288275219522.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality15284334288275219522.prop.
BEST_FIRST walk for 40003 steps (217 resets) in 497 ms. (80 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :4 after 13
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :13 after 17
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :17 after 1153
BEST_FIRST walk for 40004 steps (340 resets) in 183 ms. (217 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (337 resets) in 136 ms. (292 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (366 resets) in 235 ms. (169 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (355 resets) in 97 ms. (408 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (336 resets) in 108 ms. (367 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :1153 after 15553
BEST_FIRST walk for 40004 steps (346 resets) in 112 ms. (354 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (226 resets) in 826 ms. (48 steps per ms) remains 12/13 properties
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (356 resets) in 70 ms. (563 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (254 resets) in 92 ms. (430 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (355 resets) in 94 ms. (421 steps per ms) remains 12/12 properties
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :15553 after 19009
[2024-05-24 03:09:04] [INFO ] Flow matrix only has 289 transitions (discarded 12 similar events)
// Phase 1: matrix 289 rows 157 cols
[2024-05-24 03:09:04] [INFO ] Computed 18 invariants in 10 ms
[2024-05-24 03:09:04] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :19009 after 27073
Problem HealthRecord-PT-09-ReachabilityFireability-2024-08 is UNSAT
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 115/115 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/115 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem HealthRecord-PT-09-ReachabilityFireability-2024-02 is UNSAT
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem HealthRecord-PT-09-ReachabilityFireability-2024-13 is UNSAT
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 25/140 variables, 10/125 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 25/150 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 3/153 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Reachability property HealthRecord-PT-09-ReachabilityFireability-2024-12 is true.
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 17/157 variables, 5/158 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 17/175 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/175 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 288/445 variables, 157/332 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/332 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/446 variables, 1/333 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/333 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/446 variables, 0/333 constraints. Problems are: Problem set: 3 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/446 variables, and 333 constraints, problems are : Problem set: 3 solved, 9 unsolved in 892 ms.
Refiners :[Domain max(s): 157/157 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 157/157 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/99 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Problem HealthRecord-PT-09-ReachabilityFireability-2024-10 is UNSAT
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 33/132 variables, 10/109 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 33/142 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 1/143 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-05-24 03:09:05] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 11 ms to minimize.
[2024-05-24 03:09:05] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:09:05] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:09:05] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 2 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :27073 after 124609
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 4/147 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-05-24 03:09:05] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:09:05] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:09:05] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 3/150 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-05-24 03:09:05] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:09:05] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 2/152 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/152 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 25/157 variables, 7/159 constraints. Problems are: Problem set: 4 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 25/184 constraints. Problems are: Problem set: 4 solved, 8 unsolved
[2024-05-24 03:09:06] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 2 ms to minimize.
[2024-05-24 03:09:06] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:09:06] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 2 ms to minimize.
[2024-05-24 03:09:06] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 3 ms to minimize.
[2024-05-24 03:09:06] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2024-05-24 03:09:06] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:09:06] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
Problem HealthRecord-PT-09-ReachabilityFireability-2024-03 is UNSAT
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-24 03:09:06] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-24 03:09:06] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:09:06] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:09:06] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 1 ms to minimize.
[2024-05-24 03:09:06] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :124609 after 133825
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 12/196 constraints. Problems are: Problem set: 5 solved, 7 unsolved
[2024-05-24 03:09:06] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:09:06] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:09:06] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:09:07] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:09:07] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/157 variables, 5/201 constraints. Problems are: Problem set: 5 solved, 7 unsolved
[2024-05-24 03:09:07] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:09:07] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:09:07] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:09:07] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-24 03:09:07] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:09:07] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:09:07] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/157 variables, 7/208 constraints. Problems are: Problem set: 5 solved, 7 unsolved
[2024-05-24 03:09:07] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/157 variables, 1/209 constraints. Problems are: Problem set: 5 solved, 7 unsolved
[2024-05-24 03:09:07] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:09:07] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/157 variables, 2/211 constraints. Problems are: Problem set: 5 solved, 7 unsolved
[2024-05-24 03:09:07] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:09:07] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:09:08] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:09:08] [INFO ] Deduced a trap composed of 47 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:09:08] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/157 variables, 5/216 constraints. Problems are: Problem set: 5 solved, 7 unsolved
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :133825 after 152257
At refinement iteration 17 (INCLUDED_ONLY) 0/157 variables, 0/216 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 288/445 variables, 157/373 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/445 variables, 7/380 constraints. Problems are: Problem set: 5 solved, 7 unsolved
[2024-05-24 03:09:08] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 0 ms to minimize.
[2024-05-24 03:09:08] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:09:08] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-05-24 03:09:08] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:09:09] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/445 variables, 5/385 constraints. Problems are: Problem set: 5 solved, 7 unsolved
[2024-05-24 03:09:09] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:09:09] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:09:09] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:09:09] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 0 ms to minimize.
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :152257 after 229441
At refinement iteration 21 (INCLUDED_ONLY) 0/445 variables, 4/389 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/445 variables, 0/389 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 1/446 variables, 1/390 constraints. Problems are: Problem set: 5 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 446/446 variables, and 390 constraints, problems are : Problem set: 5 solved, 7 unsolved in 5015 ms.
Refiners :[Domain max(s): 157/157 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 157/157 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/12 constraints, Known Traps: 50/50 constraints]
After SMT, in 6108ms problems are : Problem set: 5 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 82 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 301/301 transitions.
Graph (trivial) has 26 edges and 157 vertex of which 6 / 157 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 659 edges and 154 vertex of which 147 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 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 147 transition count 281
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 146 transition count 280
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 39 place count 112 transition count 212
Iterating global reduction 2 with 34 rules applied. Total rules applied 73 place count 112 transition count 212
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 111 transition count 210
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 111 transition count 210
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 2 with 2 rules applied. Total rules applied 77 place count 110 transition count 209
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 110 transition count 206
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 80 place count 110 transition count 205
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 109 transition count 205
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 109 transition count 205
Applied a total of 84 rules in 95 ms. Remains 109 /157 variables (removed 48) and now considering 205/301 (removed 96) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 109/157 places, 205/301 transitions.
RANDOM walk for 40000 steps (2682 resets) in 479 ms. (83 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (408 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (253 resets) in 121 ms. (327 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (447 resets) in 225 ms. (177 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (409 resets) in 76 ms. (519 steps per ms) remains 6/7 properties
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (413 resets) in 50 ms. (784 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (405 resets) in 74 ms. (533 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (414 resets) in 41 ms. (952 steps per ms) remains 6/6 properties
// Phase 1: matrix 205 rows 109 cols
[2024-05-24 03:09:10] [INFO ] Computed 11 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 18/98 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 11/109 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 205/314 variables, 109/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/314 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 120 constraints, problems are : Problem set: 0 solved, 6 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 18/98 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Reachability property HealthRecord-PT-09-ReachabilityFireability-2024-07 is true.
[2024-05-24 03:09:11] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 3 ms to minimize.
[2024-05-24 03:09:11] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 03:09:11] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 03:09:11] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-24 03:09:11] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 11/109 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 03:09:11] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:09:11] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 8 ms to minimize.
[2024-05-24 03:09:11] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-24 03:09:11] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
[2024-05-24 03:09:11] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2024-05-24 03:09:11] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:09:11] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:09:11] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 205/314 variables, 109/133 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/314 variables, 6/139 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 03:09:11] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:09:12] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:09:12] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:09:12] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/314 variables, 4/143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 03:09:12] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/314 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/314 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 144 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1771 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 18/18 constraints]
After SMT, in 2060ms problems are : Problem set: 0 solved, 6 unsolved
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :229441 after 878977
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-11 TRUE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 732 ms.
Support contains 77 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 205/205 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 105 transition count 197
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 105 transition count 197
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 105 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 104 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 104 transition count 195
Applied a total of 11 rules in 12 ms. Remains 104 /109 variables (removed 5) and now considering 195/205 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 104/109 places, 195/205 transitions.
RANDOM walk for 40000 steps (2713 resets) in 205 ms. (194 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (420 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (248 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (440 resets) in 174 ms. (228 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1644830 steps, run timeout after 3001 ms. (steps per millisecond=548 ) properties seen :2 out of 3
Probabilistic random walk after 1644830 steps, saw 221498 distinct states, run finished after 3011 ms. (steps per millisecond=546 ) properties seen :2
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 195 rows 104 cols
[2024-05-24 03:09:16] [INFO ] Computed 11 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 41/104 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 195/299 variables, 104/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/299 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 115 constraints, problems are : Problem set: 0 solved, 1 unsolved in 114 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 03:09:16] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 41/104 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 03:09:17] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 195/299 variables, 104/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 03:09:17] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/299 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/299 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 299/299 variables, and 119 constraints, problems are : Problem set: 0 solved, 1 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 503ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 26 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 195/195 transitions.
Graph (trivial) has 60 edges and 104 vertex of which 2 / 104 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 424 edges and 103 vertex of which 100 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 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 100 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 99 transition count 192
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 99 transition count 190
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 9 place count 96 transition count 190
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 39 place count 66 transition count 130
Iterating global reduction 2 with 30 rules applied. Total rules applied 69 place count 66 transition count 130
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 64 transition count 126
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 64 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 76 place count 64 transition count 123
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 78 place count 63 transition count 122
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 81 place count 63 transition count 119
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 84 place count 60 transition count 119
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 100 place count 60 transition count 119
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 101 place count 59 transition count 117
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 59 transition count 117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 103 place count 58 transition count 115
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 58 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 107 place count 58 transition count 112
Applied a total of 107 rules in 22 ms. Remains 58 /104 variables (removed 46) and now considering 112/195 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 58/104 places, 112/195 transitions.
RANDOM walk for 40000 steps (8 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 231165 steps, run visited all 1 properties in 215 ms. (steps per millisecond=1075 )
Probabilistic random walk after 231165 steps, saw 35181 distinct states, run finished after 218 ms. (steps per millisecond=1060 ) properties seen :1
FORMULA HealthRecord-PT-09-ReachabilityFireability-2024-01 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 15230 ms.

BK_STOP 1716520157631

--------------------
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-09"
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-09, 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-171640604100767"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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