Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620397300023.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 greatspnxred
Input is BridgeAndVehicles-COL-V20P10N10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397300023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 9.2K Apr 13 01:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 13 01:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 01:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 13 01:23 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 4.5K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 01:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 13 01:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 01:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 13 01:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 39K 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-COL-V20P10N10-ReachabilityFireability-2024-00
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-01
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-02
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-03
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-04
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-05
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-06
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-07
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-08
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-09
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-10
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-11
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-12
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-13
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-14
FORMULA_NAME BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716275384742

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V20P10N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 07:09:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 07:09:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 07:09:46] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-21 07:09:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 07:09:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 628 ms
[2024-05-21 07:09:47] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 68 PT places and 19578.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Reduction of identical properties reduced properties to check from 16 to 14
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 07:09:47] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 5 ms.
[2024-05-21 07:09:47] [INFO ] Skeletonized 12 HLPN properties in 1 ms.
All 12 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Arc [1:1*[(MOD (ADD $cA 1) 21)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 21) 21) 21)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 11)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-05-21 07:09:47] [INFO ] Unfolded HLPN to a Petri net with 68 places and 548 transitions 4070 arcs in 54 ms.
[2024-05-21 07:09:47] [INFO ] Unfolded 12 HLPN properties in 1 ms.
RANDOM walk for 40000 steps (224 resets) in 3220 ms. (12 steps per ms) remains 6/12 properties
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (104 resets) in 2888 ms. (13 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (96 resets) in 2269 ms. (17 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (68 resets) in 967 ms. (41 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (107 resets) in 1829 ms. (21 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (98 resets) in 1888 ms. (21 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (96 resets) in 372 ms. (107 steps per ms) remains 6/6 properties
[2024-05-21 07:09:50] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2024-05-21 07:09:51] [INFO ] Computed 7 invariants in 7 ms
[2024-05-21 07:09:51] [INFO ] State equation strengthened by 22 read => feed constraints.
Problem BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-14 is UNSAT
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-00 is UNSAT
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-04 is UNSAT
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-11 is UNSAT
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-15 is UNSAT
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/68 variables, 2/7 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 130/198 variables, 68/75 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 22/97 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/97 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/198 variables, 0/97 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 97 constraints, problems are : Problem set: 5 solved, 1 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 68/68 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 12/68 variables, 5/7 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 130/198 variables, 68/75 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 22/97 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 1/98 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/98 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-05-21 07:09:53] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 11 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/198 variables, 1/99 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/99 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/198 variables, 0/99 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 99 constraints, problems are : Problem set: 5 solved, 1 unsolved in 1372 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 68/68 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 3246ms problems are : Problem set: 5 solved, 1 unsolved
Parikh walk visited 0 properties in 130 ms.
Support contains 56 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 562 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 70 ms. Remains 66 /68 variables (removed 2) and now considering 548/548 (removed 0) transitions.
Running 545 sub problems to find dead transitions.
[2024-05-21 07:09:54] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 66 cols
[2024-05-21 07:09:54] [INFO ] Computed 5 invariants in 7 ms
[2024-05-21 07:09:54] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-05-21 07:09:57] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-05-21 07:09:58] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
[2024-05-21 07:09:58] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/8 constraints. Problems are: Problem set: 40 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 40 solved, 505 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 3 (OVERLAPS) 130/196 variables, 66/74 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 22/96 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/96 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 6 (OVERLAPS) 0/196 variables, 0/96 constraints. Problems are: Problem set: 42 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 96 constraints, problems are : Problem set: 42 solved, 503 unsolved in 11947 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 66/66 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 42 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/8 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 130/196 variables, 66/74 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 22/96 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 503/599 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/599 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/599 constraints. Problems are: Problem set: 42 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 599 constraints, problems are : Problem set: 42 solved, 503 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 66/66 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 503/545 constraints, Known Traps: 3/3 constraints]
After SMT, in 33268ms problems are : Problem set: 42 solved, 503 unsolved
Search for dead transitions found 42 dead transitions in 33281ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 42 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 66/68 places, 506/548 transitions.
Applied a total of 0 rules in 47 ms. Remains 66 /66 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33421 ms. Remains : 66/68 places, 506/548 transitions.
RANDOM walk for 40000 steps (224 resets) in 493 ms. (80 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (71 resets) in 1183 ms. (33 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 667065 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :0 out of 1
Probabilistic random walk after 667065 steps, saw 163244 distinct states, run finished after 3005 ms. (steps per millisecond=221 ) properties seen :0
[2024-05-21 07:10:31] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 66 cols
[2024-05-21 07:10:31] [INFO ] Computed 7 invariants in 4 ms
[2024-05-21 07:10:31] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/64 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 07:10:31] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 126/190 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/192 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 94 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/64 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 126/190 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/190 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/192 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/192 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1160 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1523ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 56 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 506/506 transitions.
Applied a total of 0 rules in 17 ms. Remains 66 /66 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 66/66 places, 506/506 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 506/506 transitions.
Applied a total of 0 rules in 67 ms. Remains 66 /66 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-21 07:10:32] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 07:10:32] [INFO ] Invariant cache hit.
[2024-05-21 07:10:33] [INFO ] Implicit Places using invariants in 97 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 116 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 65/66 places, 506/506 transitions.
Applied a total of 0 rules in 29 ms. Remains 65 /65 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 215 ms. Remains : 65/66 places, 506/506 transitions.
RANDOM walk for 40000 steps (224 resets) in 348 ms. (114 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (69 resets) in 862 ms. (46 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 798923 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :0 out of 1
Probabilistic random walk after 798923 steps, saw 194168 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :0
[2024-05-21 07:10:36] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 65 cols
[2024-05-21 07:10:36] [INFO ] Computed 6 invariants in 9 ms
[2024-05-21 07:10:36] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/63 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 126/189 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/191 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 245 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 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/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/63 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 126/189 variables, 63/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 07:10:37] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/191 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/191 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 93 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1422 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1763ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 101 ms.
Support contains 56 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 506/506 transitions.
Applied a total of 0 rules in 17 ms. Remains 65 /65 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 65/65 places, 506/506 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 506/506 transitions.
Applied a total of 0 rules in 16 ms. Remains 65 /65 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-05-21 07:10:38] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 07:10:38] [INFO ] Invariant cache hit.
[2024-05-21 07:10:38] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 07:10:38] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 07:10:38] [INFO ] Invariant cache hit.
[2024-05-21 07:10:38] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 07:10:38] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-05-21 07:10:38] [INFO ] Redundant transitions in 28 ms returned []
Running 503 sub problems to find dead transitions.
[2024-05-21 07:10:38] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-05-21 07:10:38] [INFO ] Invariant cache hit.
[2024-05-21 07:10:38] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 07:10:40] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 126/191 variables, 65/72 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 07:10:44] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 3 ms to minimize.
[2024-05-21 07:10:45] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 94 constraints, problems are : Problem set: 0 solved, 503 unsolved in 10970 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 126/191 variables, 65/74 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 503/597 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-21 07:10:59] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (OVERLAPS) 0/191 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 598 constraints, problems are : Problem set: 0 solved, 503 unsolved in 27183 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
After SMT, in 39054ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 39060ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39322 ms. Remains : 65/65 places, 506/506 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 380 transitions
Reduce isomorphic transitions removed 380 transitions.
Iterating post reduction 0 with 380 rules applied. Total rules applied 380 place count 65 transition count 126
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 384 place count 63 transition count 124
Applied a total of 384 rules in 26 ms. Remains 63 /65 variables (removed 2) and now considering 124/506 (removed 382) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 124 rows 63 cols
[2024-05-21 07:11:17] [INFO ] Computed 6 invariants in 3 ms
[2024-05-21 07:11:18] [INFO ] [Real]Absence check using 6 positive place invariants in 45 ms returned sat
[2024-05-21 07:11:18] [INFO ] After 543ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 07:11:18] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-21 07:11:18] [INFO ] After 447ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-21 07:11:19] [INFO ] After 921ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-21 07:11:19] [INFO ] After 1412ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2074 ms.
[2024-05-21 07:11:19] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 12 ms.
[2024-05-21 07:11:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 65 places, 506 transitions and 3700 arcs took 27 ms.
[2024-05-21 07:11:20] [INFO ] Flatten gal took : 84 ms
Total runtime 94129 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-COL-V20P10N10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/417/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 65
TRANSITIONS: 506
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.027s, Sys 0.002s]


SAVING FILE /home/mcc/execution/417/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 655
MODEL NAME: /home/mcc/execution/417/model
65 places, 506 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BridgeAndVehicles-COL-V20P10N10-ReachabilityFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716275482049

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

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-COL-V20P10N10"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BridgeAndVehicles-COL-V20P10N10, 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 r047-tajo-171620397300023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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