Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399200287.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BridgeAndVehicles-PT-V80P20N20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399200287
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 27K Apr 13 02:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 13 02:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 698K Apr 13 02:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.6M Apr 13 02:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 15K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 206K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 604K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 30K Apr 13 04:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Apr 13 04:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Apr 13 04:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 5.7M Apr 13 04:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.5K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 3.1M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716330582578

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P20N20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-21 22:29:44] [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-21 22:29:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:29:44] [INFO ] Load time of PNML (sax parser for PT used): 258 ms
[2024-05-21 22:29:44] [INFO ] Transformed 198 places.
[2024-05-21 22:29:44] [INFO ] Transformed 3728 transitions.
[2024-05-21 22:29:44] [INFO ] Parsed PT model containing 198 places and 3728 transitions and 28830 arcs in 395 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 238 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 22:29:46] [INFO ] Flatten gal took : 696 ms
[2024-05-21 22:29:47] [INFO ] Flatten gal took : 530 ms
[2024-05-21 22:29:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6122140080752081908.gal : 101 ms
[2024-05-21 22:29:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10918970311053578956.prop : 219 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/ReachabilityCardinality6122140080752081908.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10918970311053578956.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
RANDOM walk for 40002 steps (56 resets) in 11385 ms. (3 steps per ms) remains 11/15 properties
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Loading property file /tmp/ReachabilityCardinality10918970311053578956.prop.
BEST_FIRST walk for 40000 steps (24 resets) in 11621 ms. (3 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (24 resets) in 11548 ms. (3 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (20 resets) in 12155 ms. (3 steps per ms) remains 11/11 properties
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :2 after 6
BEST_FIRST walk for 40002 steps (20 resets) in 12736 ms. (3 steps per ms) remains 11/11 properties
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :6 after 19
BEST_FIRST walk for 40003 steps (20 resets) in 2577 ms. (15 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (20 resets) in 2081 ms. (19 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (20 resets) in 2071 ms. (19 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (20 resets) in 2196 ms. (18 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (20 resets) in 1854 ms. (21 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (20 resets) in 1956 ms. (20 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (20 resets) in 1832 ms. (21 steps per ms) remains 11/11 properties
[2024-05-21 22:30:04] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 198 cols
[2024-05-21 22:30:04] [INFO ] Computed 7 invariants in 20 ms
[2024-05-21 22:30:04] [INFO ] State equation strengthened by 42 read => feed constraints.
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :19 after 42
Problem BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-00 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-05 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-06 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-07 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-09 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-10 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-11 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-13 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-14 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-15 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P20N20-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/5 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/198 variables, 2/7 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/7 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 410/608 variables, 198/205 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/608 variables, 42/247 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 0/247 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/608 variables, 0/247 constraints. Problems are: Problem set: 10 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/608 variables, and 247 constraints, problems are : Problem set: 10 solved, 1 unsolved in 800 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 198/198 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 185/189 variables, 4/4 constraints. Problems are: Problem set: 10 solved, 1 unsolved
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :42 after 132
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/4 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 408/597 variables, 189/193 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/597 variables, 42/235 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 0/235 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/606 variables, 7/242 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/606 variables, 1/243 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/606 variables, 1/244 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/606 variables, 0/244 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/608 variables, 2/246 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/608 variables, 2/248 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/608 variables, 0/248 constraints. Problems are: Problem set: 10 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/608 variables, 0/248 constraints. Problems are: Problem set: 10 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/608 variables, and 248 constraints, problems are : Problem set: 10 solved, 1 unsolved in 1617 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 198/198 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 23291ms problems are : Problem set: 10 solved, 1 unsolved
Parikh walk visited 0 properties in 155 ms.
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 3728/3728 transitions.
Graph (complete) has 1962 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.30 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 195 transition count 3727
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 195 transition count 3727
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 193 transition count 3726
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 191 transition count 3724
Applied a total of 10 rules in 1477 ms. Remains 191 /198 variables (removed 7) and now considering 3724/3728 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1488 ms. Remains : 191/198 places, 3724/3728 transitions.
RANDOM walk for 40000 steps (80 resets) in 1021 ms. (39 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (38 resets) in 812 ms. (49 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 132800 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 1
Probabilistic random walk after 132800 steps, saw 45638 distinct states, run finished after 3013 ms. (steps per millisecond=44 ) properties seen :0
[2024-05-21 22:30:33] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
// Phase 1: matrix 406 rows 191 cols
[2024-05-21 22:30:33] [INFO ] Computed 4 invariants in 13 ms
[2024-05-21 22:30:33] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/187 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/593 variables, 187/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/593 variables, 42/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/597 variables, 4/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/597 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 597/597 variables, and 237 constraints, problems are : Problem set: 0 solved, 1 unsolved in 449 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 191/191 constraints, ReadFeed: 42/42 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/187 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/593 variables, 187/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/593 variables, 42/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 4/597 variables, 4/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/597 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/597 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/597 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 597/597 variables, and 238 constraints, problems are : Problem set: 0 solved, 1 unsolved in 644 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 191/191 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1185ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 63 ms.
Support contains 4 out of 191 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 3724/3724 transitions.
Applied a total of 0 rules in 558 ms. Remains 191 /191 variables (removed 0) and now considering 3724/3724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 559 ms. Remains : 191/191 places, 3724/3724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 191/191 places, 3724/3724 transitions.
Applied a total of 0 rules in 662 ms. Remains 191 /191 variables (removed 0) and now considering 3724/3724 (removed 0) transitions.
[2024-05-21 22:30:35] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
[2024-05-21 22:30:35] [INFO ] Invariant cache hit.
[2024-05-21 22:30:36] [INFO ] Implicit Places using invariants in 464 ms returned []
[2024-05-21 22:30:36] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
[2024-05-21 22:30:36] [INFO ] Invariant cache hit.
[2024-05-21 22:30:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:30:37] [INFO ] Implicit Places using invariants and state equation in 1419 ms returned [82, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1897 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 189/191 places, 3724/3724 transitions.
Applied a total of 0 rules in 574 ms. Remains 189 /189 variables (removed 0) and now considering 3724/3724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3133 ms. Remains : 189/191 places, 3724/3724 transitions.
RANDOM walk for 40000 steps (80 resets) in 850 ms. (47 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (39 resets) in 395 ms. (101 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 148272 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 1
Probabilistic random walk after 148272 steps, saw 51031 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
[2024-05-21 22:30:41] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
// Phase 1: matrix 406 rows 189 cols
[2024-05-21 22:30:41] [INFO ] Computed 4 invariants in 23 ms
[2024-05-21 22:30:41] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/187 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/593 variables, 187/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/593 variables, 42/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/595 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/595 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/595 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 595/595 variables, and 235 constraints, problems are : Problem set: 0 solved, 1 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 189/189 constraints, ReadFeed: 42/42 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/187 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 406/593 variables, 187/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/593 variables, 42/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/593 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/593 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/595 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/595 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/595 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 595/595 variables, and 236 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1451 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 189/189 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1837ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 3724/3724 transitions.
Applied a total of 0 rules in 636 ms. Remains 189 /189 variables (removed 0) and now considering 3724/3724 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 636 ms. Remains : 189/189 places, 3724/3724 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 3724/3724 transitions.
Applied a total of 0 rules in 532 ms. Remains 189 /189 variables (removed 0) and now considering 3724/3724 (removed 0) transitions.
[2024-05-21 22:30:44] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
[2024-05-21 22:30:44] [INFO ] Invariant cache hit.
[2024-05-21 22:30:45] [INFO ] Implicit Places using invariants in 467 ms returned []
[2024-05-21 22:30:45] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
[2024-05-21 22:30:45] [INFO ] Invariant cache hit.
[2024-05-21 22:30:45] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:30:47] [INFO ] Implicit Places using invariants and state equation in 2334 ms returned []
Implicit Place search using SMT with State Equation took 2821 ms to find 0 implicit places.
[2024-05-21 22:30:47] [INFO ] Redundant transitions in 247 ms returned []
Running 3721 sub problems to find dead transitions.
[2024-05-21 22:30:47] [INFO ] Flow matrix only has 406 transitions (discarded 3318 similar events)
[2024-05-21 22:30:47] [INFO ] Invariant cache hit.
[2024-05-21 22:30:47] [INFO ] State equation strengthened by 42 read => feed constraints.
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :132 after 461
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3721 unsolved
[2024-05-21 22:32:15] [INFO ] Deduced a trap composed of 23 places in 482 ms of which 17 ms to minimize.
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 189/595 variables, and 5 constraints, problems are : Problem set: 80 solved, 3641 unsolved in 30089 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/189 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3721/3721 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 80 solved, 3641 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 4/4 constraints. Problems are: Problem set: 80 solved, 3641 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 1/5 constraints. Problems are: Problem set: 80 solved, 3641 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 189/595 variables, and 5 constraints, problems are : Problem set: 80 solved, 3641 unsolved in 30130 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/189 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3721 constraints, Known Traps: 1/1 constraints]
After SMT, in 118017ms problems are : Problem set: 80 solved, 3641 unsolved
Search for dead transitions found 80 dead transitions in 118129ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) removed 80 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 189/189 places, 3644/3724 transitions.
Applied a total of 0 rules in 909 ms. Remains 189 /189 variables (removed 0) and now considering 3644/3644 (removed 0) transitions.
[2024-05-21 22:32:47] [INFO ] Redundant transitions in 209 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 122978 ms. Remains : 189/189 places, 3644/3724 transitions.
RANDOM walk for 40000 steps (80 resets) in 1276 ms. (31 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (38 resets) in 481 ms. (82 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 171749 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 1
Probabilistic random walk after 171749 steps, saw 58907 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
[2024-05-21 22:32:50] [INFO ] Flow matrix only has 405 transitions (discarded 3239 similar events)
// Phase 1: matrix 405 rows 189 cols
[2024-05-21 22:32:50] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 22:32:50] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/187 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 405/592 variables, 187/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 41/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/592 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/594 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/594 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/594 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 594/594 variables, and 234 constraints, problems are : Problem set: 0 solved, 1 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 189/189 constraints, ReadFeed: 41/41 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 183/187 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 405/592 variables, 187/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/592 variables, 41/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/592 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/592 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/594 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/594 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/594 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 594/594 variables, and 235 constraints, problems are : Problem set: 0 solved, 1 unsolved in 938 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 189/189 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1239ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 635 ms.
Support contains 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 3644/3644 transitions.
Applied a total of 0 rules in 514 ms. Remains 189 /189 variables (removed 0) and now considering 3644/3644 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 514 ms. Remains : 189/189 places, 3644/3644 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 3644/3644 transitions.
Applied a total of 0 rules in 497 ms. Remains 189 /189 variables (removed 0) and now considering 3644/3644 (removed 0) transitions.
[2024-05-21 22:32:53] [INFO ] Flow matrix only has 405 transitions (discarded 3239 similar events)
[2024-05-21 22:32:53] [INFO ] Invariant cache hit.
[2024-05-21 22:32:53] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-21 22:32:53] [INFO ] Flow matrix only has 405 transitions (discarded 3239 similar events)
[2024-05-21 22:32:53] [INFO ] Invariant cache hit.
[2024-05-21 22:32:54] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 22:32:54] [INFO ] Implicit Places using invariants and state equation in 998 ms returned []
Implicit Place search using SMT with State Equation took 1433 ms to find 0 implicit places.
[2024-05-21 22:32:55] [INFO ] Redundant transitions in 148 ms returned []
Running 3641 sub problems to find dead transitions.
[2024-05-21 22:32:55] [INFO ] Flow matrix only has 405 transitions (discarded 3239 similar events)
[2024-05-21 22:32:55] [INFO ] Invariant cache hit.
[2024-05-21 22:32:55] [INFO ] State equation strengthened by 41 read => feed constraints.

BK_STOP 1716330782413

--------------------
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="BridgeAndVehicles-PT-V80P20N20"
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 BridgeAndVehicles-PT-V80P20N20, 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 r048-tajo-171620399200287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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