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.r576-smll-171734919900031.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 MedleyA-PT-04, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734919900031
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 28K Jun 2 16:33 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 MedleyA-PT-04-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-04-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717352975890

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-06-02 18:29:38] [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-06-02 18:29:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:29:38] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-06-02 18:29:38] [INFO ] Transformed 115 places.
[2024-06-02 18:29:38] [INFO ] Transformed 107 transitions.
[2024-06-02 18:29:38] [INFO ] Found NUPN structural information;
[2024-06-02 18:29:38] [INFO ] Parsed PT model containing 115 places and 107 transitions and 300 arcs in 284 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
[2024-06-02 18:29:39] [INFO ] Flatten gal took : 85 ms
[2024-06-02 18:29:39] [INFO ] Flatten gal took : 43 ms
RANDOM walk for 40000 steps (1110 resets) in 2745 ms. (14 steps per ms) remains 9/16 properties
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-06-02 18:29:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12393539215796098929.gal : 34 ms
[2024-06-02 18:29:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3537155677702904391.prop : 6 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/ReachabilityCardinality12393539215796098929.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3537155677702904391.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 ...329
Loading property file /tmp/ReachabilityCardinality3537155677702904391.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :10 after 12
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :12 after 38
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :38 after 854
BEST_FIRST walk for 40002 steps (344 resets) in 1040 ms. (38 steps per ms) remains 9/9 properties
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :854 after 10488
BEST_FIRST walk for 40001 steps (342 resets) in 644 ms. (62 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (291 resets) in 843 ms. (47 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (268 resets) in 568 ms. (70 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (308 resets) in 217 ms. (183 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (345 resets) in 99 ms. (400 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (342 resets) in 485 ms. (82 steps per ms) remains 9/9 properties
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :10488 after 54154
BEST_FIRST walk for 40003 steps (344 resets) in 256 ms. (155 steps per ms) remains 8/9 properties
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Reachability property MedleyA-PT-04-ReachabilityFireability-2024-13 is true.
// Phase 1: matrix 107 rows 115 cols
[2024-06-02 18:29:40] [INFO ] Computed 9 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 10/115 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 10/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 107/222 variables, 115/239 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/222 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 239 constraints, problems are : Problem set: 0 solved, 8 unsolved in 989 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem MedleyA-PT-04-ReachabilityFireability-2024-05 is UNSAT
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 4/109 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-02 18:29:42] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 15 ms to minimize.
[2024-06-02 18:29:42] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
Problem MedleyA-PT-04-ReachabilityFireability-2024-11 is UNSAT
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 2/111 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-06-02 18:29:42] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:29:42] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:29:42] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-02 18:29:42] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 4/115 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/115 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 10/115 variables, 5/120 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 10/130 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-06-02 18:29:42] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-06-02 18:29:42] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:29:42] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-06-02 18:29:42] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-06-02 18:29:42] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-02 18:29:43] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
Problem MedleyA-PT-04-ReachabilityFireability-2024-03 is UNSAT
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-02 18:29:43] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
Problem MedleyA-PT-04-ReachabilityFireability-2024-06 is UNSAT
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-02 18:29:43] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 8/138 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/138 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Problem MedleyA-PT-04-ReachabilityFireability-2024-09 is UNSAT
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 107/222 variables, 115/253 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 3/256 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 0/256 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/222 variables, 0/256 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 256 constraints, problems are : Problem set: 5 solved, 3 unsolved in 1966 ms.
Refiners :[Domain max(s): 115/115 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 3/8 constraints, Known Traps: 14/14 constraints]
After SMT, in 3174ms problems are : Problem set: 5 solved, 3 unsolved
Parikh walk visited 0 properties in 2571 ms.
Support contains 60 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 107/107 transitions.
Graph (complete) has 207 edges and 115 vertex of which 114 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 114 transition count 104
Reduce places removed 3 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 7 rules applied. Total rules applied 11 place count 111 transition count 100
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 15 place count 107 transition count 100
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 107 transition count 99
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 106 transition count 99
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 18 place count 105 transition count 98
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 105 transition count 98
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 31 place count 99 transition count 92
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 99 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 33 place count 98 transition count 91
Applied a total of 33 rules in 65 ms. Remains 98 /115 variables (removed 17) and now considering 91/107 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 98/115 places, 91/107 transitions.
RANDOM walk for 40000 steps (1423 resets) in 316 ms. (126 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (507 resets) in 197 ms. (202 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (521 resets) in 207 ms. (192 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (504 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :750158 after 1.06227e+06
Interrupted probabilistic random walk after 2298627 steps, run timeout after 3001 ms. (steps per millisecond=765 ) properties seen :2 out of 3
Probabilistic random walk after 2298627 steps, saw 400601 distinct states, run finished after 3007 ms. (steps per millisecond=764 ) properties seen :2
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 91 rows 98 cols
[2024-06-02 18:29:49] [INFO ] Computed 8 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/80 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 91/171 variables, 80/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/189 variables, 18/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/189 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 106 constraints, problems are : Problem set: 0 solved, 1 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 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/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/80 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:29:50] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-06-02 18:29:50] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-06-02 18:29:50] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2024-06-02 18:29:50] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:29:50] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 91/171 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 18/189 variables, 18/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 501 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 680ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 37 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 91/91 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 98 transition count 87
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 94 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 93 transition count 86
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 93 transition count 83
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 16 place count 90 transition count 83
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 18 place count 88 transition count 81
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 88 transition count 81
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 38 place count 79 transition count 72
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 79 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 78 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 41 place count 77 transition count 70
Applied a total of 41 rules in 28 ms. Remains 77 /98 variables (removed 21) and now considering 70/91 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 77/98 places, 70/91 transitions.
RANDOM walk for 40000 steps (2451 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (946 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3443426 steps, run timeout after 3001 ms. (steps per millisecond=1147 ) properties seen :0 out of 1
Probabilistic random walk after 3443426 steps, saw 600725 distinct states, run finished after 3001 ms. (steps per millisecond=1147 ) properties seen :0
// Phase 1: matrix 70 rows 77 cols
[2024-06-02 18:29:53] [INFO ] Computed 8 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/59 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 70/129 variables, 59/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/147 variables, 18/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/147 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 77/77 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/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/59 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:29:53] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 3 ms to minimize.
[2024-06-02 18:29:54] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 10 ms to minimize.
[2024-06-02 18:29:54] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:29:54] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:29:54] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 70/129 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 18/147 variables, 18/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 18:29:54] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:29:54] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 2 ms to minimize.
[2024-06-02 18:29:54] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 94 constraints, problems are : Problem set: 0 solved, 1 unsolved in 576 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 724ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 37 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 70/70 transitions.
Applied a total of 0 rules in 5 ms. Remains 77 /77 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 77/77 places, 70/70 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 70/70 transitions.
Applied a total of 0 rules in 4 ms. Remains 77 /77 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-06-02 18:29:54] [INFO ] Invariant cache hit.
[2024-06-02 18:29:54] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 18:29:54] [INFO ] Invariant cache hit.
[2024-06-02 18:29:54] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-06-02 18:29:54] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2024-06-02 18:29:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-02 18:29:55] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 4/77 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-02 18:29:55] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:29:55] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:29:55] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:29:55] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-06-02 18:29:55] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-02 18:29:55] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-02 18:29:55] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-06-02 18:29:55] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
[2024-06-02 18:29:55] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-02 18:29:55] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 70/147 variables, 77/96 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-02 18:29:56] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-06-02 18:29:56] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 2 ms to minimize.
[2024-06-02 18:29:56] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-02 18:29:57] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/147 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/147 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 12 (OVERLAPS) 0/147 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 100 constraints, problems are : Problem set: 0 solved, 66 unsolved in 3552 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 4/77 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 70/147 variables, 77/100 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 66/166 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-02 18:29:59] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 66 unsolved
[2024-06-02 18:30:00] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (OVERLAPS) 0/147 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 168 constraints, problems are : Problem set: 0 solved, 66 unsolved in 5689 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 17/17 constraints]
After SMT, in 9284ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 9286ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9473 ms. Remains : 77/77 places, 70/70 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-06-02 18:30:04] [INFO ] Flatten gal took : 19 ms
[2024-06-02 18:30:04] [INFO ] Applying decomposition
[2024-06-02 18:30:04] [INFO ] Flatten gal took : 15 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/graph8102746454697450087.txt' '-o' '/tmp/graph8102746454697450087.bin' '-w' '/tmp/graph8102746454697450087.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8102746454697450087.bin' '-l' '-1' '-v' '-w' '/tmp/graph8102746454697450087.weights' '-q' '0' '-e' '0.001'
[2024-06-02 18:30:04] [INFO ] Decomposing Gal with order
[2024-06-02 18:30:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 18:30:04] [INFO ] Flatten gal took : 59 ms
[2024-06-02 18:30:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-06-02 18:30:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15786004972195471186.gal : 6 ms
[2024-06-02 18:30:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12274368736608670157.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/ReachabilityCardinality15786004972195471186.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12274368736608670157.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 ...309
Loading property file /tmp/ReachabilityCardinality12274368736608670157.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 84
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :84 after 2554
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :2554 after 5104
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :5104 after 6804
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :6804 after 8787
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :8787 after 31538
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2.3268e+06 after 2.96546e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :9.95534e+06 after 1.1115e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.8301e+07 after 1.94607e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3.19791e+07 after 3.2805e+07
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.3674e+07,0.216672,9200,386,240,3624,10113,378,7087,185,36291,0
Total reachable state count : 43674041

Verifying 1 reachability properties.
Reachability property MedleyA-PT-04-ReachabilityFireability-2024-02 does not hold.
FORMULA MedleyA-PT-04-ReachabilityFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : MedleyA-PT-04-ReachabilityFireability-2024-02

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MedleyA-PT-04-ReachabilityFireability-2024-02,0,0.225901,9460,1,0,3624,10113,469,7087,207,36291,1088
All properties solved without resorting to model-checking.
Total runtime 26379 ms.

BK_STOP 1717353004638

--------------------
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="MedleyA-PT-04"
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 MedleyA-PT-04, 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 r576-smll-171734919900031"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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