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.r311-tall-171662336700500.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 greatspnxred
Input is Railroad-PT-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662336700500
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 14:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 12 14:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 13:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 13:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.4M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716758825045

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Railroad-PT-050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 21:27:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 21:27:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 21:27:06] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2024-05-26 21:27:06] [INFO ] Transformed 518 places.
[2024-05-26 21:27:06] [INFO ] Transformed 2756 transitions.
[2024-05-26 21:27:06] [INFO ] Found NUPN structural information;
[2024-05-26 21:27:06] [INFO ] Parsed PT model containing 518 places and 2756 transitions and 16378 arcs in 324 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 151 places in 33 ms
Reduce places removed 151 places and 50 transitions.
FORMULA Railroad-PT-050-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-050-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 2706/2706 transitions.
Ensure Unique test removed 52 places
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 315 transition count 2706
Applied a total of 52 rules in 84 ms. Remains 315 /367 variables (removed 52) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 315 cols
[2024-05-26 21:27:06] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-26 21:27:07] [INFO ] Implicit Places using invariants in 420 ms returned []
// Phase 1: matrix 2706 rows 315 cols
[2024-05-26 21:27:07] [INFO ] Invariants computation overflowed in 10 ms
[2024-05-26 21:27:09] [INFO ] Implicit Places using invariants and state equation in 1824 ms returned [0, 1, 6, 7, 8, 11, 12, 17, 18, 19, 24, 25, 26, 29, 35, 137, 138, 144, 145, 146, 148, 149, 151, 156, 157, 159, 163, 164, 165, 167, 168, 170, 172, 175, 228, 231, 235, 245, 246, 247, 248, 252, 265, 269, 271, 273, 275, 277, 278, 279, 281, 291, 294, 301, 302]
Discarding 55 places :
Implicit Place search using SMT with State Equation took 2286 ms to find 55 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 260/367 places, 2706/2706 transitions.
Applied a total of 0 rules in 14 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2406 ms. Remains : 260/367 places, 2706/2706 transitions.
Support contains 44 out of 260 places after structural reductions.
[2024-05-26 21:27:09] [INFO ] Flatten gal took : 245 ms
[2024-05-26 21:27:09] [INFO ] Flatten gal took : 163 ms
[2024-05-26 21:27:10] [INFO ] Input system was already deterministic with 2706 transitions.
Support contains 39 out of 260 places (down from 44) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 24 to 23
RANDOM walk for 40000 steps (8 resets) in 2838 ms. (14 steps per ms) remains 12/23 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 6/7 properties
// Phase 1: matrix 2706 rows 260 cols
[2024-05-26 21:27:11] [INFO ] Invariants computation overflowed in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1012/1029 variables, 17/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1029 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 4 (OVERLAPS) 1801/2830 variables, 149/183 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2830 variables, 149/332 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-26 21:27:12] [INFO ] Deduced a trap composed of 4 places in 311 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2830 variables, 1/333 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2830 variables, 0/333 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 136/2966 variables, 94/427 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2966 variables, 94/521 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-26 21:27:13] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2966 variables, 1/522 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2966 variables, 0/522 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/2966 variables, 0/522 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2966/2966 variables, and 522 constraints, problems are : Problem set: 2 solved, 4 unsolved in 3063 ms.
Refiners :[Domain max(s): 260/260 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 535/544 variables, 9/18 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/544 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2278/2822 variables, 153/171 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2822 variables, 153/324 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2822 variables, 4/328 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2822 variables, 1/329 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2822 variables, 0/329 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 144/2966 variables, 98/427 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2966 variables, 98/525 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2966 variables, 1/526 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2966 variables, 0/526 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/2966 variables, 0/526 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2966/2966 variables, and 526 constraints, problems are : Problem set: 2 solved, 4 unsolved in 2056 ms.
Refiners :[Domain max(s): 260/260 constraints, State Equation: 260/260 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 5264ms problems are : Problem set: 2 solved, 4 unsolved
Finished Parikh walk after 169 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=56 )
Parikh walk visited 4 properties in 1497 ms.
FORMULA Railroad-PT-050-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA Railroad-PT-050-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(p1)))'
Support contains 5 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Applied a total of 0 rules in 16 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 260 cols
[2024-05-26 21:27:18] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-26 21:27:18] [INFO ] Implicit Places using invariants in 267 ms returned []
// Phase 1: matrix 2706 rows 260 cols
[2024-05-26 21:27:18] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-26 21:27:20] [INFO ] Implicit Places using invariants and state equation in 1315 ms returned []
Implicit Place search using SMT with State Equation took 1586 ms to find 0 implicit places.
Running 2656 sub problems to find dead transitions.
// Phase 1: matrix 2706 rows 260 cols
[2024-05-26 21:27:20] [INFO ] Invariants computation overflowed in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 2 (OVERLAPS) 2706/2916 variables, 210/420 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
[2024-05-26 21:27:55] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 2 ms to minimize.
[2024-05-26 21:27:58] [INFO ] Deduced a trap composed of 5 places in 328 ms of which 1 ms to minimize.
[2024-05-26 21:27:59] [INFO ] Deduced a trap composed of 5 places in 266 ms of which 2 ms to minimize.
SMT process timed out in 39051ms, After SMT, problems are : Problem set: 0 solved, 2656 unsolved
Search for dead transitions found 0 dead transitions in 39080ms
Finished structural reductions in LTL mode , in 1 iterations and 40711 ms. Remains : 260/260 places, 2706/2706 transitions.
Stuttering acceptance computed with spot in 309 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Railroad-PT-050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Railroad-PT-050-LTLFireability-00 finished in 41097 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 3 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Applied a total of 0 rules in 21 ms. Remains 260 /260 variables (removed 0) and now considering 2706/2706 (removed 0) transitions.
// Phase 1: matrix 2706 rows 260 cols
[2024-05-26 21:27:59] [INFO ] Invariants computation overflowed in 6 ms
[2024-05-26 21:28:00] [INFO ] Implicit Places using invariants in 352 ms returned []
// Phase 1: matrix 2706 rows 260 cols
[2024-05-26 21:28:00] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-26 21:28:01] [INFO ] Implicit Places using invariants and state equation in 1268 ms returned []
Implicit Place search using SMT with State Equation took 1623 ms to find 0 implicit places.
Running 2656 sub problems to find dead transitions.
// Phase 1: matrix 2706 rows 260 cols
[2024-05-26 21:28:01] [INFO ] Invariants computation overflowed in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 2 (OVERLAPS) 2706/2916 variables, 210/420 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
[2024-05-26 21:28:36] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 0 ms to minimize.
[2024-05-26 21:28:39] [INFO ] Deduced a trap composed of 5 places in 324 ms of which 3 ms to minimize.
[2024-05-26 21:28:40] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2916/2966 variables, and 423 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30065 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 210/260 constraints, PredecessorRefiner: 2656/2656 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2656 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 3 (OVERLAPS) 2706/2916 variables, 210/423 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2916 variables, 105/528 constraints. Problems are: Problem set: 0 solved, 2656 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2916/2966 variables, and 528 constraints, problems are : Problem set: 0 solved, 2656 unsolved in 30048 ms.
Refiners :[Domain max(s): 210/260 constraints, State Equation: 210/260 constraints, PredecessorRefiner: 105/2656 constraints, Known Traps: 3/3 constraints]
After SMT, in 69312ms problems are : Problem set: 0 solved, 2656 unsolved
Search for dead transitions found 0 dead transitions in 69340ms
Finished structural reductions in LTL mode , in 1 iterations and 71000 ms. Remains : 260/260 places, 2706/2706 transitions.
Stuttering acceptance computed with spot in 65 ms :[p0, p0]
Running random walk in product with property : Railroad-PT-050-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 715 ms.
Product exploration explored 100000 steps with 50000 reset in 695 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 24 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Railroad-PT-050-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Railroad-PT-050-LTLFireability-03 finished in 72548 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 5 out of 260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 2704
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 4 place count 258 transition count 2654
Deduced a syphon composed of 50 places in 4 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 104 place count 208 transition count 2654
Applied a total of 104 rules in 767 ms. Remains 208 /260 variables (removed 52) and now considering 2654/2706 (removed 52) transitions.
// Phase 1: matrix 2654 rows 208 cols
[2024-05-26 21:29:12] [INFO ] Invariants computation overflowed in 5 ms
[2024-05-26 21:29:13] [INFO ] Implicit Places using invariants in 260 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2024-05-26 21:29:13] [INFO ] Invariants computation overflowed in 5 ms
[2024-05-26 21:29:14] [INFO ] Implicit Places using invariants and state equation in 1107 ms returned []
Implicit Place search using SMT with State Equation took 1402 ms to find 0 implicit places.
[2024-05-26 21:29:14] [INFO ] Redundant transitions in 147 ms returned []
Running 2604 sub problems to find dead transitions.
// Phase 1: matrix 2654 rows 208 cols
[2024-05-26 21:29:14] [INFO ] Invariants computation overflowed in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 2 (OVERLAPS) 2654/2812 variables, 158/316 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
[2024-05-26 21:29:49] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2812/2862 variables, and 317 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30057 ms.
Refiners :[Domain max(s): 158/208 constraints, State Equation: 158/208 constraints, PredecessorRefiner: 2604/2604 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 3 (OVERLAPS) 2654/2812 variables, 158/317 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2812 variables, 53/370 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2812/2862 variables, and 370 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30062 ms.
Refiners :[Domain max(s): 158/208 constraints, State Equation: 158/208 constraints, PredecessorRefiner: 53/2604 constraints, Known Traps: 1/1 constraints]
After SMT, in 69071ms problems are : Problem set: 0 solved, 2604 unsolved
Search for dead transitions found 0 dead transitions in 69110ms
Starting structural reductions in SI_LTL mode, iteration 1 : 208/260 places, 2654/2706 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71446 ms. Remains : 208/260 places, 2654/2706 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Railroad-PT-050-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 1086 ms.
Product exploration explored 100000 steps with 0 reset in 1176 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
RANDOM walk for 35936 steps (7 resets) in 616 ms. (58 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
Support contains 3 out of 208 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 2654/2654 transitions.
Applied a total of 0 rules in 578 ms. Remains 208 /208 variables (removed 0) and now considering 2654/2654 (removed 0) transitions.
// Phase 1: matrix 2654 rows 208 cols
[2024-05-26 21:30:27] [INFO ] Invariants computation overflowed in 10 ms
[2024-05-26 21:30:27] [INFO ] Implicit Places using invariants in 260 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2024-05-26 21:30:27] [INFO ] Invariants computation overflowed in 7 ms
[2024-05-26 21:30:28] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned []
Implicit Place search using SMT with State Equation took 1368 ms to find 0 implicit places.
[2024-05-26 21:30:28] [INFO ] Redundant transitions in 166 ms returned []
Running 2604 sub problems to find dead transitions.
// Phase 1: matrix 2654 rows 208 cols
[2024-05-26 21:30:28] [INFO ] Invariants computation overflowed in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 2 (OVERLAPS) 2654/2812 variables, 158/316 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
[2024-05-26 21:31:03] [INFO ] Deduced a trap composed of 51 places in 61 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2812/2862 variables, and 317 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30045 ms.
Refiners :[Domain max(s): 158/208 constraints, State Equation: 158/208 constraints, PredecessorRefiner: 2604/2604 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 3 (OVERLAPS) 2654/2812 variables, 158/317 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2812 variables, 53/370 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2812/2862 variables, and 370 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30117 ms.
Refiners :[Domain max(s): 158/208 constraints, State Equation: 158/208 constraints, PredecessorRefiner: 53/2604 constraints, Known Traps: 1/1 constraints]
After SMT, in 68719ms problems are : Problem set: 0 solved, 2604 unsolved
Search for dead transitions found 0 dead transitions in 68741ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 70867 ms. Remains : 208/208 places, 2654/2654 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
RANDOM walk for 31993 steps (6 resets) in 424 ms. (75 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 934 ms.
Product exploration explored 100000 steps with 0 reset in 1011 ms.
Support contains 3 out of 208 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 208/208 places, 2654/2654 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 208 transition count 2653
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 207 transition count 2653
Applied a total of 2 rules in 428 ms. Remains 207 /208 variables (removed 1) and now considering 2653/2654 (removed 1) transitions.
// Phase 1: matrix 2653 rows 207 cols
[2024-05-26 21:31:40] [INFO ] Invariants computation overflowed in 12 ms
[2024-05-26 21:31:40] [INFO ] Implicit Places using invariants in 272 ms returned []
// Phase 1: matrix 2653 rows 207 cols
[2024-05-26 21:31:40] [INFO ] Invariants computation overflowed in 5 ms
[2024-05-26 21:31:42] [INFO ] Implicit Places using invariants and state equation in 1188 ms returned []
Implicit Place search using SMT with State Equation took 1461 ms to find 0 implicit places.
[2024-05-26 21:31:42] [INFO ] Redundant transitions in 75 ms returned []
Running 2603 sub problems to find dead transitions.
// Phase 1: matrix 2653 rows 207 cols
[2024-05-26 21:31:42] [INFO ] Invariants computation overflowed in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 2 (OVERLAPS) 2653/2810 variables, 157/314 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
[2024-05-26 21:32:16] [INFO ] Deduced a trap composed of 51 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2810/2860 variables, and 315 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30041 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 157/207 constraints, PredecessorRefiner: 2603/2603 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 3 (OVERLAPS) 2653/2810 variables, 157/315 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2810 variables, 52/367 constraints. Problems are: Problem set: 0 solved, 2603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2810/2860 variables, and 367 constraints, problems are : Problem set: 0 solved, 2603 unsolved in 30055 ms.
Refiners :[Domain max(s): 157/207 constraints, State Equation: 157/207 constraints, PredecessorRefiner: 52/2603 constraints, Known Traps: 1/1 constraints]
After SMT, in 68989ms problems are : Problem set: 0 solved, 2603 unsolved
Search for dead transitions found 0 dead transitions in 69011ms
Starting structural reductions in SI_LTL mode, iteration 1 : 207/208 places, 2653/2654 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70994 ms. Remains : 207/208 places, 2653/2654 transitions.
Treatment of property Railroad-PT-050-LTLFireability-04 finished in 219279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 5 out of 260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 260/260 places, 2706/2706 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 260 transition count 2704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 258 transition count 2704
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 50 Pre rules applied. Total rules applied 4 place count 258 transition count 2654
Deduced a syphon composed of 50 places in 3 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 104 place count 208 transition count 2654
Applied a total of 104 rules in 534 ms. Remains 208 /260 variables (removed 52) and now considering 2654/2706 (removed 52) transitions.
// Phase 1: matrix 2654 rows 208 cols
[2024-05-26 21:32:52] [INFO ] Invariants computation overflowed in 8 ms
[2024-05-26 21:32:52] [INFO ] Implicit Places using invariants in 249 ms returned []
// Phase 1: matrix 2654 rows 208 cols
[2024-05-26 21:32:52] [INFO ] Invariants computation overflowed in 7 ms
[2024-05-26 21:32:53] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 1298 ms to find 0 implicit places.
[2024-05-26 21:32:53] [INFO ] Redundant transitions in 83 ms returned []
Running 2604 sub problems to find dead transitions.
// Phase 1: matrix 2654 rows 208 cols
[2024-05-26 21:32:53] [INFO ] Invariants computation overflowed in 7 ms
(s1 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 158/158 constraints. Problems are: Problem set: 0 solved, 2604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 158/2862 variables, and 158 constraints, problems are : Problem set: 0 solved, 2604 unsolved in 30260 ms.
Refiners :[Domain max(s): 158/208 constraints, State Equation: 0/208 constraints, PredecessorRefiner: 2604/2604 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2604 unsolved
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Railroad-PT-050

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 518
TRANSITIONS: 2756
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 16378
NUPN UNITS: 107
LOADING TIME: 1.997

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.09
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 2.493
OK.
----------------------------------------------------------------------
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: 839
MODEL NAME: /home/mcc/execution/model
518 places, 2756 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
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.

BK_TIME_CONFINEMENT_REACHED

--------------------
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 LTLFireability -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="Railroad-PT-050"
export BK_EXAMINATION="LTLFireability"
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 Railroad-PT-050, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r311-tall-171662336700500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Railroad-PT-050.tgz
mv Railroad-PT-050 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;