Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102700543.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is FlexibleBarrier-PT-20b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102700543
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.5M May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2025-00
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2025-01
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2025-02
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2025-03
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2025-04
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2025-05
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2025-06
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2025-07
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2025-08
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2025-09
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2025-10
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2025-11
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2025-12
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2025-13
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2025-14
FORMULA_NAME FlexibleBarrier-PT-20b-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748986245775

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-20b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-03 21:30:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 21:30:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 21:30:48] [INFO ] Load time of PNML (sax parser for PT used): 478 ms
[2025-06-03 21:30:48] [INFO ] Transformed 5372 places.
[2025-06-03 21:30:48] [INFO ] Transformed 6193 transitions.
[2025-06-03 21:30:48] [INFO ] Found NUPN structural information;
[2025-06-03 21:30:48] [INFO ] Parsed PT model containing 5372 places and 6193 transitions and 15575 arcs in 711 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (297 resets) in 3160 ms. (12 steps per ms) remains 15/16 properties
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 157 ms. (25 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (7 resets) in 104 ms. (38 steps per ms) remains 15/15 properties
[2025-06-03 21:30:50] [INFO ] Flatten gal took : 955 ms
[2025-06-03 21:30:51] [INFO ] Flatten gal took : 471 ms
[2025-06-03 21:30:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14272195963838677533.gal : 156 ms
[2025-06-03 21:30:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10492609320893338364.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14272195963838677533.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10492609320893338364.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10492609320893338364.prop.
Interrupted probabilistic random walk after 82859 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 15
Probabilistic random walk after 82859 steps, saw 51354 distinct states, run finished after 3010 ms. (steps per millisecond=27 ) properties seen :0
// Phase 1: matrix 6193 rows 5372 cols
[2025-06-03 21:30:53] [INFO ] Computed 22 invariants in 300 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 255/255 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem FlexibleBarrier-PT-20b-ReachabilityFireability-2025-01 is UNSAT
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2025-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem FlexibleBarrier-PT-20b-ReachabilityFireability-2025-06 is UNSAT
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2025-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem FlexibleBarrier-PT-20b-ReachabilityFireability-2025-11 is UNSAT
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2025-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 5117/5372 variables, 22/277 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5372 variables, 5117/5394 constraints. Problems are: Problem set: 3 solved, 12 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5372/11565 variables, and 5394 constraints, problems are : Problem set: 3 solved, 12 unsolved in 5051 ms.
Refiners :[Domain max(s): 5372/5372 constraints, Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/5372 constraints, PredecessorRefiner: 15/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 12 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 180/180 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/180 variables, 0/180 constraints. Problems are: Problem set: 3 solved, 12 unsolved
Problem FlexibleBarrier-PT-20b-ReachabilityFireability-2025-14 is UNSAT
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2025-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 5192/5372 variables, 22/202 constraints. Problems are: Problem set: 4 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5372 variables, 5192/5394 constraints. Problems are: Problem set: 4 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 21:31:02] [INFO ] Deduced a trap composed of 112 places in 367 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 21:31:13] [INFO ] Deduced a trap composed of 1835 places in 9899 ms of which 5139 ms to minimize.
SMT process timed out in 20355ms, After SMT, problems are : Problem set: 4 solved, 11 unsolved
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 176 out of 5372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Graph (trivial) has 3784 edges and 5372 vertex of which 24 / 5372 are part of one of the 4 SCC in 19 ms
Free SCC test removed 20 places
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 853 transitions
Trivial Post-agglo rules discarded 853 transitions
Performed 853 trivial Post agglomeration. Transition count delta: 853
Iterating post reduction 0 with 853 rules applied. Total rules applied 854 place count 5352 transition count 5316
Reduce places removed 853 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 1 with 883 rules applied. Total rules applied 1737 place count 4499 transition count 5286
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 1767 place count 4469 transition count 5286
Performed 738 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 738 Pre rules applied. Total rules applied 1767 place count 4469 transition count 4548
Deduced a syphon composed of 738 places in 5 ms
Reduce places removed 738 places and 0 transitions.
Iterating global reduction 3 with 1476 rules applied. Total rules applied 3243 place count 3731 transition count 4548
Discarding 2120 places :
Symmetric choice reduction at 3 with 2120 rule applications. Total rules 5363 place count 1611 transition count 2428
Iterating global reduction 3 with 2120 rules applied. Total rules applied 7483 place count 1611 transition count 2428
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7484 place count 1611 transition count 2427
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 7484 place count 1611 transition count 2420
Deduced a syphon composed of 7 places in 8 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 7498 place count 1604 transition count 2420
Discarding 299 places :
Symmetric choice reduction at 4 with 299 rule applications. Total rules 7797 place count 1305 transition count 2121
Iterating global reduction 4 with 299 rules applied. Total rules applied 8096 place count 1305 transition count 2121
Ensure Unique test removed 281 transitions
Reduce isomorphic transitions removed 281 transitions.
Iterating post reduction 4 with 281 rules applied. Total rules applied 8377 place count 1305 transition count 1840
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 5 with 300 rules applied. Total rules applied 8677 place count 1155 transition count 1690
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 8707 place count 1140 transition count 1690
Free-agglomeration rule applied 133 times.
Iterating global reduction 5 with 133 rules applied. Total rules applied 8840 place count 1140 transition count 1557
Reduce places removed 133 places and 0 transitions.
Iterating post reduction 5 with 133 rules applied. Total rules applied 8973 place count 1007 transition count 1557
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 8982 place count 1007 transition count 1548
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 6 with 16 rules applied. Total rules applied 8998 place count 1007 transition count 1548
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 8999 place count 1007 transition count 1548
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 9000 place count 1006 transition count 1547
Applied a total of 9000 rules in 2221 ms. Remains 1006 /5372 variables (removed 4366) and now considering 1547/6193 (removed 4646) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2233 ms. Remains : 1006/5372 places, 1547/6193 transitions.
RANDOM walk for 40000 steps (723 resets) in 1276 ms. (31 steps per ms) remains 9/11 properties
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (27 resets) in 315 ms. (126 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (29 resets) in 160 ms. (248 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (29 resets) in 113 ms. (350 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (29 resets) in 393 ms. (101 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (25 resets) in 225 ms. (177 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (23 resets) in 117 ms. (339 steps per ms) remains 8/9 properties
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (26 resets) in 169 ms. (235 steps per ms) remains 7/8 properties
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (27 resets) in 146 ms. (272 steps per ms) remains 6/7 properties
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (27 resets) in 152 ms. (261 steps per ms) remains 6/6 properties
[2025-06-03 21:31:16] [INFO ] Flow matrix only has 1529 transitions (discarded 18 similar events)
// Phase 1: matrix 1529 rows 1006 cols
[2025-06-03 21:31:16] [INFO ] Computed 22 invariants in 41 ms
[2025-06-03 21:31:16] [INFO ] State equation strengthened by 76 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 875/976 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/976 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 30/1006 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1006 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1529/2535 variables, 1006/1028 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2535 variables, 76/1104 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2535 variables, 0/1104 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/2535 variables, 0/1104 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2535/2535 variables, and 1104 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1732 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 1006/1006 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 875/976 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 21:31:19] [INFO ] Deduced a trap composed of 104 places in 408 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 5
[2025-06-03 21:31:20] [INFO ] Deduced a trap composed of 431 places in 1016 ms of which 245 ms to minimize.
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :5 after 10
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :10 after 19
[2025-06-03 21:31:21] [INFO ] Deduced a trap composed of 433 places in 925 ms of which 322 ms to minimize.
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :19 after 68
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :68 after 2324
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :2324 after 110659
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :110659 after 2.54917e+08
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :2.54917e+08 after 1.35321e+15
[2025-06-03 21:31:22] [INFO ] Deduced a trap composed of 436 places in 986 ms of which 257 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :1.35321e+15 after 7.94424e+26
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :7.94424e+26 after 4.4807e+33
[2025-06-03 21:31:23] [INFO ] Deduced a trap composed of 438 places in 961 ms of which 269 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/976 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 21:31:23] [INFO ] Deduced a trap composed of 109 places in 259 ms of which 38 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/976 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 21:31:24] [INFO ] Deduced a trap composed of 411 places in 1072 ms of which 253 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/976 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/976 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 30/1006 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 21:31:26] [INFO ] Deduced a trap composed of 437 places in 1042 ms of which 268 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 21:31:26] [INFO ] Deduced a trap composed of 97 places in 270 ms of which 37 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1006 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1006 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1529/2535 variables, 1006/1037 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2535 variables, 76/1113 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2535 variables, 3/1116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2535 variables, 0/1116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/2535 variables, 0/1116 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2535/2535 variables, and 1116 constraints, problems are : Problem set: 0 solved, 6 unsolved in 11307 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 1006/1006 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13137ms problems are : Problem set: 0 solved, 6 unsolved
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2025-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2025-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 1682 ms.
Support contains 99 out of 1006 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1006/1006 places, 1547/1547 transitions.
Graph (trivial) has 199 edges and 1006 vertex of which 12 / 1006 are part of one of the 6 SCC in 2 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 1000 transition count 1523
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 988 transition count 1522
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 987 transition count 1522
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 27 place count 987 transition count 1520
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 31 place count 985 transition count 1520
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 60 place count 956 transition count 1491
Iterating global reduction 3 with 29 rules applied. Total rules applied 89 place count 956 transition count 1491
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 96 place count 956 transition count 1484
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 142 place count 933 transition count 1461
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 145 place count 933 transition count 1458
Discarding 22 places :
Symmetric choice reduction at 5 with 22 rule applications. Total rules 167 place count 911 transition count 1436
Iterating global reduction 5 with 22 rules applied. Total rules applied 189 place count 911 transition count 1436
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 211 place count 911 transition count 1414
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 216 place count 911 transition count 1409
Free-agglomeration rule applied 114 times with reduction of 1 identical transitions.
Iterating global reduction 6 with 114 rules applied. Total rules applied 330 place count 911 transition count 1294
Reduce places removed 114 places and 0 transitions.
Iterating post reduction 6 with 114 rules applied. Total rules applied 444 place count 797 transition count 1294
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 450 place count 791 transition count 1288
Iterating global reduction 7 with 6 rules applied. Total rules applied 456 place count 791 transition count 1288
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 462 place count 791 transition count 1282
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 470 place count 791 transition count 1274
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 471 place count 791 transition count 1274
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 472 place count 790 transition count 1273
Applied a total of 472 rules in 548 ms. Remains 790 /1006 variables (removed 216) and now considering 1273/1547 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 548 ms. Remains : 790/1006 places, 1273/1547 transitions.
RANDOM walk for 40000 steps (541 resets) in 642 ms. (62 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (27 resets) in 243 ms. (163 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (27 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (29 resets) in 334 ms. (119 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (29 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 190040 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 4
Probabilistic random walk after 190040 steps, saw 59927 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2025-06-03 21:31:35] [INFO ] Flow matrix only has 1249 transitions (discarded 24 similar events)
// Phase 1: matrix 1249 rows 790 cols
[2025-06-03 21:31:35] [INFO ] Computed 22 invariants in 45 ms
[2025-06-03 21:31:35] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 685/784 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/784 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1249/2033 variables, 784/805 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2033 variables, 1/806 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2033 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 6/2039 variables, 6/812 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2039 variables, 1/813 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2039 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/2039 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2039/2039 variables, and 813 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1168 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 790/790 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 685/784 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 21:31:37] [INFO ] Deduced a trap composed of 408 places in 927 ms of which 192 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/784 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 21:31:38] [INFO ] Deduced a trap composed of 410 places in 817 ms of which 213 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/784 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/784 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1249/2033 variables, 784/807 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2033 variables, 1/808 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2033 variables, 0/808 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 6/2039 variables, 6/814 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2039 variables, 1/815 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2039 variables, 1/816 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 21:31:41] [INFO ] Deduced a trap composed of 387 places in 740 ms of which 202 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-03 21:31:41] [INFO ] Deduced a trap composed of 389 places in 694 ms of which 180 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2039 variables, 2/818 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2039 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/2039 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2039/2039 variables, and 818 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6810 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 790/790 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8116ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2025-05 FALSE TECHNIQUES PARIKH_WALK
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2025-13 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 714 ms.
Support contains 41 out of 790 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 1273/1273 transitions.
Graph (trivial) has 516 edges and 790 vertex of which 11 / 790 are part of one of the 5 SCC in 2 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 784 transition count 1247
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 769 transition count 1247
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 31 place count 769 transition count 1246
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 33 place count 768 transition count 1246
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 56 place count 745 transition count 1223
Iterating global reduction 2 with 23 rules applied. Total rules applied 79 place count 745 transition count 1223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 82 place count 745 transition count 1220
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 124 place count 724 transition count 1199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 127 place count 724 transition count 1196
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 137 place count 714 transition count 1186
Iterating global reduction 4 with 10 rules applied. Total rules applied 147 place count 714 transition count 1186
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 157 place count 714 transition count 1176
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 165 place count 710 transition count 1174
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 180 place count 710 transition count 1159
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 195 place count 710 transition count 1144
Free-agglomeration rule applied 434 times.
Iterating global reduction 6 with 434 rules applied. Total rules applied 629 place count 710 transition count 710
Reduce places removed 434 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 143 transitions
Reduce isomorphic transitions removed 143 transitions.
Iterating post reduction 6 with 577 rules applied. Total rules applied 1206 place count 276 transition count 567
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1207 place count 276 transition count 566
Applied a total of 1207 rules in 514 ms. Remains 276 /790 variables (removed 514) and now considering 566/1273 (removed 707) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 515 ms. Remains : 276/790 places, 566/1273 transitions.
RANDOM walk for 40000 steps (301 resets) in 401 ms. (99 steps per ms) remains 1/2 properties
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 25950 steps (16 resets) in 122 ms. (210 steps per ms) remains 0/1 properties
FORMULA FlexibleBarrier-PT-20b-ReachabilityFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 57240 ms.

BK_STOP 1748986305067

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-20b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-20b, 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 r086-smll-174860102700543"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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