About the Execution of ITS-Tools for ShieldIIPs-PT-010A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16206.348 | 3600000.00 | 6474160.00 | 9380.90 | FFFFTTTTFTTFTTF? | normal |
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.r356-tall-171683760300087.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 ShieldIIPs-PT-010A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760300087
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Apr 11 14:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 11 14:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 84K May 18 16:43 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 ShieldIIPs-PT-010A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-010A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-010A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-010A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-010A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-010A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-010A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-010A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-010A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-010A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-010A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-010A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-010A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPs-PT-010A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPs-PT-010A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPs-PT-010A-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716891102078
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-010A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-28 10:11:43] [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-28 10:11:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 10:11:43] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-05-28 10:11:43] [INFO ] Transformed 253 places.
[2024-05-28 10:11:43] [INFO ] Transformed 243 transitions.
[2024-05-28 10:11:43] [INFO ] Found NUPN structural information;
[2024-05-28 10:11:43] [INFO ] Parsed PT model containing 253 places and 243 transitions and 1086 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 10:11:43] [INFO ] Flatten gal took : 139 ms
RANDOM walk for 40000 steps (68 resets) in 1892 ms. (21 steps per ms) remains 3/16 properties
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 10:11:44] [INFO ] Flatten gal took : 82 ms
[2024-05-28 10:11:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15629714321933986798.gal : 35 ms
BEST_FIRST walk for 40004 steps (8 resets) in 355 ms. (112 steps per ms) remains 2/3 properties
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-28 10:11:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7476951612701613336.prop : 1 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/ReachabilityCardinality15629714321933986798.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7476951612701613336.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 2/2 properties
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/ReachabilityCardinality7476951612701613336.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :2 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 16
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :16 after 33
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :33 after 61
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :61 after 142
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :142 after 636
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :636 after 31239
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :31239 after 41362
BEST_FIRST walk for 40004 steps (11 resets) in 1252 ms. (31 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :41362 after 84585
// Phase 1: matrix 243 rows 253 cols
[2024-05-28 10:11:44] [INFO ] Computed 91 invariants in 22 ms
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :84585 after 952471
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 210/253 variables, 89/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 210/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/496 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 597 constraints, problems are : Problem set: 0 solved, 2 unsolved in 460 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem ShieldIIPs-PT-010A-ReachabilityFireability-2024-12 is UNSAT
FORMULA ShieldIIPs-PT-010A-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 210/253 variables, 89/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 210/344 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :952471 after 1.61888e+08
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/344 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 243/496 variables, 253/597 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 1/598 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/598 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/496 variables, 0/598 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 598 constraints, problems are : Problem set: 1 solved, 1 unsolved in 348 ms.
Refiners :[Domain max(s): 253/253 constraints, Positive P Invariants (semi-flows): 91/91 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 884ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 156 ms.
Support contains 39 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 243/243 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 253 transition count 242
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 252 transition count 242
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 251 transition count 241
Partial Free-agglomeration rule applied 52 times.
Drop transitions (Partial Free agglomeration) removed 52 transitions
Iterating global reduction 0 with 52 rules applied. Total rules applied 56 place count 251 transition count 241
Applied a total of 56 rules in 69 ms. Remains 251 /253 variables (removed 2) and now considering 241/243 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 251/253 places, 241/243 transitions.
RANDOM walk for 40000 steps (54 resets) in 706 ms. (56 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (10 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :1.61888e+08 after 3.82901e+09
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :3.82901e+09 after 1.0858e+12
Interrupted probabilistic random walk after 964547 steps, run timeout after 3001 ms. (steps per millisecond=321 ) properties seen :0 out of 1
Probabilistic random walk after 964547 steps, saw 177038 distinct states, run finished after 3007 ms. (steps per millisecond=320 ) properties seen :0
// Phase 1: matrix 241 rows 251 cols
[2024-05-28 10:11:49] [INFO ] Computed 91 invariants in 6 ms
[2024-05-28 10:11:49] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 72/111 variables, 35/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 72/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 136/247 variables, 54/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 136/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/251 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/251 variables, 4/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 241/492 variables, 251/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 4/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/492 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 597 constraints, problems are : Problem set: 0 solved, 1 unsolved in 192 ms.
Refiners :[Domain max(s): 251/251 constraints, Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 251/251 constraints, ReadFeed: 4/4 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/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 72/111 variables, 35/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 72/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 136/247 variables, 54/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 136/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 10:11:49] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/251 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/251 variables, 4/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 241/492 variables, 251/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 4/598 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/492 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/492 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/492 variables, and 599 constraints, problems are : Problem set: 0 solved, 1 unsolved in 452 ms.
Refiners :[Domain max(s): 251/251 constraints, Positive P Invariants (semi-flows): 89/89 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 251/251 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 681ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 128 ms.
Support contains 39 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 241/241 transitions.
Applied a total of 0 rules in 14 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 251/251 places, 241/241 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 241/241 transitions.
Applied a total of 0 rules in 10 ms. Remains 251 /251 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2024-05-28 10:11:49] [INFO ] Invariant cache hit.
[2024-05-28 10:11:50] [INFO ] Implicit Places using invariants in 200 ms returned [237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 206 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 250/251 places, 241/241 transitions.
Applied a total of 0 rules in 10 ms. Remains 250 /250 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 226 ms. Remains : 250/251 places, 241/241 transitions.
RANDOM walk for 40000 steps (55 resets) in 259 ms. (153 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 995049 steps, run timeout after 3001 ms. (steps per millisecond=331 ) properties seen :0 out of 1
Probabilistic random walk after 995049 steps, saw 180808 distinct states, run finished after 3001 ms. (steps per millisecond=331 ) properties seen :0
// Phase 1: matrix 241 rows 250 cols
[2024-05-28 10:11:53] [INFO ] Computed 90 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 72/111 variables, 35/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 72/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 53/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 135/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/250 variables, 2/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 241/491 variables, 250/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/491 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 491/491 variables, and 590 constraints, problems are : Problem set: 0 solved, 1 unsolved in 162 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 88/88 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 250/250 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/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 72/111 variables, 35/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 72/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 53/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 135/334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 10:11:53] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/250 variables, 2/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 4/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 241/491 variables, 250/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 10:11:53] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/491 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
At refinement iteration 16 (OVERLAPS) 0/491 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
SDD size :1.0858e+12 after 2.23143e+13
After SMT solving in domain Int declared 491/491 variables, and 593 constraints, problems are : Problem set: 0 solved, 1 unsolved in 573 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 88/88 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 764ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 72 ms.
Support contains 39 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 241/241 transitions.
Applied a total of 0 rules in 22 ms. Remains 250 /250 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 250/250 places, 241/241 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 241/241 transitions.
Applied a total of 0 rules in 9 ms. Remains 250 /250 variables (removed 0) and now considering 241/241 (removed 0) transitions.
[2024-05-28 10:11:54] [INFO ] Invariant cache hit.
[2024-05-28 10:11:54] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-28 10:11:54] [INFO ] Invariant cache hit.
[2024-05-28 10:11:54] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2024-05-28 10:11:54] [INFO ] Redundant transitions in 22 ms returned []
Running 240 sub problems to find dead transitions.
[2024-05-28 10:11:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 1/250 variables, 88/339 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:11:57] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-28 10:11:57] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-28 10:11:57] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-28 10:11:57] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-28 10:11:58] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-28 10:11:58] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-28 10:11:58] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-28 10:11:58] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-28 10:11:58] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-05-28 10:11:58] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:11:58] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
[2024-05-28 10:11:58] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-28 10:11:58] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 13/353 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (OVERLAPS) 241/491 variables, 250/603 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:12:01] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-28 10:12:01] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:12:01] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 10:12:01] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:12:01] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-28 10:12:02] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-28 10:12:02] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-28 10:12:02] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-28 10:12:02] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:12:02] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:12:02] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-28 10:12:03] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 10:12:03] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 10:12:03] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/491 variables, 14/617 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:12:03] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-05-28 10:12:03] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 10:12:04] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 131072
SDD size :2.23143e+13 after 5.89999e+15
At refinement iteration 9 (INCLUDED_ONLY) 0/491 variables, 3/620 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:12:06] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/491 variables, 1/621 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:12:06] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:12:06] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 3 ms to minimize.
[2024-05-28 10:12:07] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-28 10:12:08] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/491 variables, 4/625 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:12:08] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-28 10:12:09] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 2 ms to minimize.
[2024-05-28 10:12:09] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-28 10:12:10] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/491 variables, 4/629 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:12:11] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:12:12] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/491 variables, 2/631 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:12:13] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 10:12:13] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/491 variables, 2/633 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:12:14] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/491 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/491 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:12:18] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/491 variables, 1/635 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:12:20] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/491 variables, 1/636 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:12:23] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 10:12:23] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 2 ms to minimize.
[2024-05-28 10:12:23] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/491 variables, 3/639 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:12:23] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 10:12:24] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 10:12:24] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-28 10:12:24] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-28 10:12:24] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 491/491 variables, and 644 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30030 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 88/88 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 249/249 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/249 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 1/250 variables, 88/339 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 54/394 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (OVERLAPS) 241/491 variables, 250/644 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/491 variables, 240/884 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:12:32] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-28 10:12:35] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
SDD proceeding with computation,2 properties remain. new max is 262144
SDD size :5.89999e+15 after 1.14883e+17
[2024-05-28 10:12:37] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-28 10:12:37] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/491 variables, 4/888 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-28 10:12:53] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 491/491 variables, and 889 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30018 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 88/88 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 59/59 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60538 ms. Remains : 250/250 places, 241/241 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-28 10:12:54] [INFO ] Flatten gal took : 23 ms
[2024-05-28 10:12:54] [INFO ] Applying decomposition
[2024-05-28 10:12:54] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5576168359414472247.txt' '-o' '/tmp/graph5576168359414472247.bin' '-w' '/tmp/graph5576168359414472247.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5576168359414472247.bin' '-l' '-1' '-v' '-w' '/tmp/graph5576168359414472247.weights' '-q' '0' '-e' '0.001'
[2024-05-28 10:12:54] [INFO ] Decomposing Gal with order
[2024-05-28 10:12:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 10:12:54] [INFO ] Removed a total of 160 redundant transitions.
[2024-05-28 10:12:54] [INFO ] Flatten gal took : 59 ms
[2024-05-28 10:12:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 160 labels/synchronizations in 16 ms.
[2024-05-28 10:12:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1166878234170626779.gal : 7 ms
[2024-05-28 10:12:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8991339985567713705.prop : 0 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/ReachabilityCardinality1166878234170626779.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8991339985567713705.prop' '--nowitness'
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 ...307
Loading property file /tmp/ReachabilityCardinality8991339985567713705.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 331
ITS-tools command line returned an error code 137
[2024-05-28 10:31:29] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13707917704102310579
[2024-05-28 10:31:29] [INFO ] Applying decomposition
[2024-05-28 10:31:29] [INFO ] Flatten gal took : 20 ms
[2024-05-28 10:31:29] [INFO ] Computing symmetric may disable matrix : 241 transitions.
[2024-05-28 10:31:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:31:29] [INFO ] Computing symmetric may enable matrix : 241 transitions.
[2024-05-28 10:31:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:31:29] [INFO ] Computing Do-Not-Accords matrix : 241 transitions.
[2024-05-28 10:31:29] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2821320970403697403.txt' '-o' '/tmp/graph2821320970403697403.bin' '-w' '/tmp/graph2821320970403697403.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2821320970403697403.bin' '-l' '-1' '-v' '-w' '/tmp/graph2821320970403697403.weights' '-q' '0' '-e' '0.001'
[2024-05-28 10:31:29] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13707917704102310579
Running compilation step : cd /tmp/ltsmin13707917704102310579;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 10:31:29] [INFO ] Decomposing Gal with order
[2024-05-28 10:31:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 10:31:29] [INFO ] Removed a total of 195 redundant transitions.
[2024-05-28 10:31:29] [INFO ] Flatten gal took : 33 ms
[2024-05-28 10:31:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 176 labels/synchronizations in 8 ms.
[2024-05-28 10:31:29] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4208776228584822643.gal : 4 ms
[2024-05-28 10:31:29] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8914776915225721811.prop : 1 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/ReachabilityFireability4208776228584822643.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability8914776915225721811.prop' '--nowitness'
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 ...307
Loading property file /tmp/ReachabilityFireability8914776915225721811.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2 after 119
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :119 after 26325
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :26325 after 7.78469e+13
Compilation finished in 766 ms.
Running link step : cd /tmp/ltsmin13707917704102310579;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin13707917704102310579;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT010AReachabilityFireability202415==true'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.018: Initializing POR dependencies: labels 242, guards 241
pins2lts-mc-linux64( 6/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.513: Forcing use of the an ignoring proviso (closed-set)
pins2lts-mc-linux64( 7/ 8), 0.559: "ShieldIIPsPT010AReachabilityFireability202415==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.561: "ShieldIIPsPT010AReachabilityFireability202415==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.562: There are 242 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.562: State length is 250, there are 241 groups
pins2lts-mc-linux64( 0/ 8), 0.562: Running bfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.562: Using a non-indexing tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.562: Successor permutation: none
pins2lts-mc-linux64( 0/ 8), 0.562: Visible groups: 0 / 241, labels: 1 / 242
pins2lts-mc-linux64( 0/ 8), 0.562: POR cycle proviso: closed-set
pins2lts-mc-linux64( 0/ 8), 0.562: Global bits: 0, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.562: "ShieldIIPsPT010AReachabilityFireability202415==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.562: "ShieldIIPsPT010AReachabilityFireability202415==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.562: "ShieldIIPsPT010AReachabilityFireability202415==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.561: "ShieldIIPsPT010AReachabilityFireability202415==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.562: "ShieldIIPsPT010AReachabilityFireability202415==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.562: "ShieldIIPsPT010AReachabilityFireability202415==true" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.631: ~4 levels ~960 states ~3736 transitions
pins2lts-mc-linux64( 6/ 8), 0.644: ~5 levels ~1920 states ~7896 transitions
pins2lts-mc-linux64( 6/ 8), 0.668: ~6 levels ~3840 states ~16448 transitions
pins2lts-mc-linux64( 6/ 8), 0.740: ~7 levels ~7680 states ~34616 transitions
pins2lts-mc-linux64( 6/ 8), 0.942: ~9 levels ~15360 states ~73248 transitions
pins2lts-mc-linux64( 6/ 8), 1.341: ~10 levels ~30720 states ~154512 transitions
pins2lts-mc-linux64( 6/ 8), 2.093: ~12 levels ~61440 states ~322504 transitions
pins2lts-mc-linux64( 6/ 8), 3.333: ~14 levels ~122880 states ~683728 transitions
pins2lts-mc-linux64( 6/ 8), 5.616: ~15 levels ~245760 states ~1392464 transitions
pins2lts-mc-linux64( 4/ 8), 9.834: ~14 levels ~491520 states ~2831016 transitions
pins2lts-mc-linux64( 4/ 8), 18.155: ~15 levels ~983040 states ~6084096 transitions
pins2lts-mc-linux64( 4/ 8), 35.366: ~17 levels ~1966080 states ~12614744 transitions
pins2lts-mc-linux64( 4/ 8), 71.382: ~18 levels ~3932160 states ~26192488 transitions
pins2lts-mc-linux64( 4/ 8), 150.646: ~19 levels ~7864320 states ~55645896 transitions
pins2lts-mc-linux64( 4/ 8), 311.254: ~20 levels ~15728640 states ~114608240 transitions
pins2lts-mc-linux64( 4/ 8), 658.840: ~21 levels ~31457280 states ~243259632 transitions
pins2lts-mc-linux64( 7/ 8), 910.441: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 910.470:
pins2lts-mc-linux64( 0/ 8), 910.470: mean standard work distribution: 6.4% (states) 2.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 910.470:
pins2lts-mc-linux64( 0/ 8), 910.470: Explored 38463250 states 325670508 transitions, fanout: 8.467
pins2lts-mc-linux64( 0/ 8), 910.470: Total exploration time 909.900 sec (909.880 sec minimum, 909.889 sec on average)
pins2lts-mc-linux64( 0/ 8), 910.470: States per second: 42272, Transitions per second: 357919
pins2lts-mc-linux64( 0/ 8), 910.470: Ignoring proviso: 19738229
pins2lts-mc-linux64( 0/ 8), 910.470:
pins2lts-mc-linux64( 0/ 8), 910.470: Queue width: 8B, total height: 32253504, memory: 246.07MB
pins2lts-mc-linux64( 0/ 8), 910.470: Tree memory: 795.5MB, 11.8 B/state, compr.: 1.2%
pins2lts-mc-linux64( 0/ 8), 910.470: Tree fill ratio (roots/leafs): 52.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 910.471: Stored 242 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 910.471: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 910.471: Est. total memory use: 1041.6MB (~1270.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13707917704102310579;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT010AReachabilityFireability202415==true'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin13707917704102310579;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'ShieldIIPsPT010AReachabilityFireability202415==true'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-28 10:57:05] [INFO ] Applying decomposition
[2024-05-28 10:57:05] [INFO ] Flatten gal took : 26 ms
[2024-05-28 10:57:05] [INFO ] Decomposing Gal with order
[2024-05-28 10:57:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 10:57:05] [INFO ] Removed a total of 212 redundant transitions.
[2024-05-28 10:57:05] [INFO ] Flatten gal took : 21 ms
[2024-05-28 10:57:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 192 labels/synchronizations in 7 ms.
[2024-05-28 10:57:05] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5211402494309833591.gal : 3 ms
[2024-05-28 10:57:05] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5521763813787431263.prop : 0 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/ReachabilityFireability5211402494309833591.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability5521763813787431263.prop' '--nowitness'
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 ...307
Loading property file /tmp/ReachabilityFireability5521763813787431263.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :4 after 8
ITS-tools command line returned an error code 137
[2024-05-28 11:06:27] [INFO ] Flatten gal took : 21 ms
[2024-05-28 11:06:27] [INFO ] Input system was already deterministic with 241 transitions.
[2024-05-28 11:06:27] [INFO ] Transformed 250 places.
[2024-05-28 11:06:27] [INFO ] Transformed 241 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 11:06:27] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9660907063388180264.gal : 3 ms
[2024-05-28 11:06:27] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3988374256405573787.prop : 1 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/ReachabilityFireability9660907063388180264.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability3988374256405573787.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--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 ...373
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability3988374256405573787.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :2 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 11
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :11 after 50
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :50 after 579
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :579 after 763
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :763 after 2362
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2362 after 64943
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :64943 after 6.50745e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :6.50745e+06 after 9.52531e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :9.52531e+06 after 2.29192e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.29192e+08 after 2.26038e+09
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.26038e+09 after 1.56467e+10
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.56467e+10 after 3.41494e+11
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :3.41494e+11 after 9.50869e+12
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :9.50869e+12 after 6.48159e+14
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :6.48159e+14 after 2.64641e+16
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :2.64641e+16 after 2.66973e+18
SDD proceeding with computation,1 properties remain. new max is 1048576
SDD size :2.66973e+18 after 5.47463e+19
BK_TIME_CONFINEMENT_REACHED
--------------------
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="ShieldIIPs-PT-010A"
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 ShieldIIPs-PT-010A, 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 r356-tall-171683760300087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-010A.tgz
mv ShieldIIPs-PT-010A 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 '
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 ;