Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r081-smll-158922977800367.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FlexibleBarrier-PT-16b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r081-smll-158922977800367
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 3.5K Apr 4 19:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 4 19:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 4 07:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 4 07:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 3 21:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 3 21:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 3 13:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 3 13:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 4 01:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 4 01:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 945K Mar 24 05:37 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 FlexibleBarrier-PT-16b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-16b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589707709090

[2020-05-17 09:28:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-17 09:28:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-17 09:28:32] [INFO ] Load time of PNML (sax parser for PT used): 354 ms
[2020-05-17 09:28:32] [INFO ] Transformed 3472 places.
[2020-05-17 09:28:32] [INFO ] Transformed 4001 transitions.
[2020-05-17 09:28:32] [INFO ] Found NUPN structural information;
[2020-05-17 09:28:32] [INFO ] Parsed PT model containing 3472 places and 4001 transitions in 496 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 102 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 91 resets, run finished after 235 ms. (steps per millisecond=42 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 53 ms. (steps per millisecond=188 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 4001 rows 3472 cols
[2020-05-17 09:28:33] [INFO ] Computed 18 place invariants in 264 ms
[2020-05-17 09:28:35] [INFO ] [Real]Absence check using 18 positive place invariants in 337 ms returned sat
[2020-05-17 09:28:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 09:28:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-17 09:28:38] [INFO ] [Real]Absence check using state equation in 3446 ms returned (error "Failed to check-sat")
[2020-05-17 09:28:39] [INFO ] [Real]Absence check using 18 positive place invariants in 367 ms returned sat
[2020-05-17 09:28:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 09:28:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-17 09:28:43] [INFO ] [Real]Absence check using state equation in 3701 ms returned (error "Failed to check-sat")
[2020-05-17 09:28:44] [INFO ] [Real]Absence check using 18 positive place invariants in 374 ms returned sat
[2020-05-17 09:28:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 09:28:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-17 09:28:48] [INFO ] [Real]Absence check using state equation in 3684 ms returned (error "Failed to check-sat")
[2020-05-17 09:28:49] [INFO ] [Real]Absence check using 18 positive place invariants in 247 ms returned sat
[2020-05-17 09:28:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 09:28:53] [INFO ] [Real]Absence check using state equation in 4119 ms returned (error "Failed to check-sat")
[2020-05-17 09:28:54] [INFO ] [Real]Absence check using 18 positive place invariants in 213 ms returned unsat
[2020-05-17 09:28:55] [INFO ] [Real]Absence check using 18 positive place invariants in 391 ms returned sat
[2020-05-17 09:28:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 09:28:59] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-17 09:28:59] [INFO ] [Real]Absence check using state equation in 3622 ms returned (error "Failed to check-sat")
[2020-05-17 09:29:00] [INFO ] [Real]Absence check using 18 positive place invariants in 284 ms returned sat
[2020-05-17 09:29:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 09:29:04] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-17 09:29:04] [INFO ] [Real]Absence check using state equation in 3891 ms returned (error "Failed to check-sat")
[2020-05-17 09:29:05] [INFO ] [Real]Absence check using 18 positive place invariants in 272 ms returned unsat
[2020-05-17 09:29:06] [INFO ] [Real]Absence check using 18 positive place invariants in 371 ms returned sat
[2020-05-17 09:29:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 09:29:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-17 09:29:10] [INFO ] [Real]Absence check using state equation in 3733 ms returned (error "Failed to check-sat")
[2020-05-17 09:29:11] [INFO ] [Real]Absence check using 18 positive place invariants in 332 ms returned unsat
[2020-05-17 09:29:12] [INFO ] [Real]Absence check using 18 positive place invariants in 257 ms returned sat
[2020-05-17 09:29:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 09:29:16] [INFO ] [Real]Absence check using state equation in 4214 ms returned sat
[2020-05-17 09:29:25] [INFO ] Deduced a trap composed of 14 places in 8910 ms
[2020-05-17 09:29:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s2327 s3460 s3461 s3462 s3463 s3464 s3465 s3466 s3467 s3468 s3469 s3470 s3471) 0)") while checking expression at index 10
[2020-05-17 09:29:26] [INFO ] [Real]Absence check using 18 positive place invariants in 252 ms returned sat
[2020-05-17 09:29:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 09:29:30] [INFO ] [Real]Absence check using state equation in 4104 ms returned (error "Solver has unexpectedly terminated")
[2020-05-17 09:29:32] [INFO ] [Real]Absence check using 18 positive place invariants in 255 ms returned sat
[2020-05-17 09:29:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 09:29:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (= s489 (- t3765 t2943))") while checking expression at index 12
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 53 out of 3472 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3472/3472 places, 4001/4001 transitions.
Graph (trivial) has 2807 edges and 3472 vertex of which 72 / 3472 are part of one of the 12 SCC in 18 ms
Free SCC test removed 60 places
Drop transitions removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Performed 624 Post agglomeration using F-continuation condition.Transition count delta: 624
Iterating post reduction 0 with 696 rules applied. Total rules applied 697 place count 3412 transition count 3305
Reduce places removed 624 places and 0 transitions.
Iterating post reduction 1 with 624 rules applied. Total rules applied 1321 place count 2788 transition count 3305
Performed 450 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 450 Pre rules applied. Total rules applied 1321 place count 2788 transition count 2855
Deduced a syphon composed of 450 places in 4 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 2 with 900 rules applied. Total rules applied 2221 place count 2338 transition count 2855
Symmetric choice reduction at 2 with 1362 rule applications. Total rules 3583 place count 2338 transition count 2855
Deduced a syphon composed of 1362 places in 9 ms
Reduce places removed 1362 places and 1362 transitions.
Iterating global reduction 2 with 2724 rules applied. Total rules applied 6307 place count 976 transition count 1493
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 6309 place count 976 transition count 1491
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6310 place count 975 transition count 1491
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 6310 place count 975 transition count 1483
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 6326 place count 967 transition count 1483
Symmetric choice reduction at 4 with 211 rule applications. Total rules 6537 place count 967 transition count 1483
Deduced a syphon composed of 211 places in 5 ms
Reduce places removed 211 places and 211 transitions.
Iterating global reduction 4 with 422 rules applied. Total rules applied 6959 place count 756 transition count 1272
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Iterating post reduction 4 with 201 rules applied. Total rules applied 7160 place count 756 transition count 1071
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 2 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 5 with 186 rules applied. Total rules applied 7346 place count 663 transition count 978
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 7352 place count 660 transition count 978
Free-agglomeration rule applied 220 times.
Iterating global reduction 5 with 220 rules applied. Total rules applied 7572 place count 660 transition count 758
Reduce places removed 220 places and 0 transitions.
Iterating post reduction 5 with 220 rules applied. Total rules applied 7792 place count 440 transition count 758
Symmetric choice reduction at 6 with 27 rule applications. Total rules 7819 place count 440 transition count 758
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 27 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 7873 place count 413 transition count 731
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 7900 place count 413 transition count 704
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 7903 place count 413 transition count 704
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 7915 place count 413 transition count 692
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 7916 place count 412 transition count 691
Applied a total of 7916 rules in 1370 ms. Remains 412 /3472 variables (removed 3060) and now considering 691/4001 (removed 3310) transitions.
Finished structural reductions, in 1 iterations. Remains : 412/3472 places, 691/4001 transitions.
Incomplete random walk after 1000000 steps, including 8782 resets, run finished after 4897 ms. (steps per millisecond=204 ) properties seen :[0, 1, 1, 0, 0, 0, 1, 1, 1, 1]
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 40 resets, run finished after 568 ms. (steps per millisecond=1760 ) properties seen :[1, 0, 0, 0]
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 980 resets, run finished after 1359 ms. (steps per millisecond=735 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 949 resets, run finished after 1277 ms. (steps per millisecond=783 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 43 resets, run finished after 895 ms. (steps per millisecond=1117 ) properties seen :[0, 0, 0]
[2020-05-17 09:29:46] [INFO ] Flow matrix only has 665 transitions (discarded 26 similar events)
// Phase 1: matrix 665 rows 412 cols
[2020-05-17 09:29:46] [INFO ] Computed 18 place invariants in 8 ms
[2020-05-17 09:29:46] [INFO ] [Real]Absence check using 18 positive place invariants in 33 ms returned sat
[2020-05-17 09:29:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 09:29:47] [INFO ] [Real]Absence check using state equation in 829 ms returned sat
[2020-05-17 09:29:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-17 09:29:47] [INFO ] [Real]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-05-17 09:29:47] [INFO ] Deduced a trap composed of 219 places in 367 ms
[2020-05-17 09:29:48] [INFO ] Deduced a trap composed of 217 places in 367 ms
[2020-05-17 09:29:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 857 ms
[2020-05-17 09:29:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 09:29:48] [INFO ] [Nat]Absence check using 18 positive place invariants in 49 ms returned sat
[2020-05-17 09:29:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 09:29:49] [INFO ] [Nat]Absence check using state equation in 1008 ms returned sat
[2020-05-17 09:29:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-05-17 09:29:49] [INFO ] Deduced a trap composed of 219 places in 331 ms
[2020-05-17 09:29:50] [INFO ] Deduced a trap composed of 217 places in 373 ms
[2020-05-17 09:29:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 829 ms
[2020-05-17 09:29:50] [INFO ] Computed and/alt/rep : 679/1795/653 causal constraints in 100 ms.
[2020-05-17 09:29:52] [INFO ] Added : 202 causal constraints over 41 iterations in 2363 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
[2020-05-17 09:29:52] [INFO ] [Real]Absence check using 18 positive place invariants in 28 ms returned sat
[2020-05-17 09:29:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 09:29:53] [INFO ] [Real]Absence check using state equation in 801 ms returned sat
[2020-05-17 09:29:53] [INFO ] [Real]Added 1 Read/Feed constraints in 7 ms returned sat
[2020-05-17 09:29:53] [INFO ] Computed and/alt/rep : 679/1795/653 causal constraints in 79 ms.
[2020-05-17 09:29:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 09:29:54] [INFO ] [Nat]Absence check using 18 positive place invariants in 57 ms returned sat
[2020-05-17 09:29:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 09:29:55] [INFO ] [Nat]Absence check using state equation in 1042 ms returned sat
[2020-05-17 09:29:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2020-05-17 09:29:55] [INFO ] Computed and/alt/rep : 679/1795/653 causal constraints in 68 ms.
[2020-05-17 09:29:57] [INFO ] Added : 201 causal constraints over 41 iterations in 2604 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2020-05-17 09:29:58] [INFO ] [Real]Absence check using 18 positive place invariants in 26 ms returned sat
[2020-05-17 09:29:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 09:29:58] [INFO ] [Real]Absence check using state equation in 660 ms returned sat
[2020-05-17 09:29:58] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-05-17 09:29:58] [INFO ] Computed and/alt/rep : 679/1795/653 causal constraints in 69 ms.
[2020-05-17 09:29:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 09:29:59] [INFO ] [Nat]Absence check using 18 positive place invariants in 45 ms returned sat
[2020-05-17 09:29:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 09:29:59] [INFO ] [Nat]Absence check using state equation in 746 ms returned sat
[2020-05-17 09:29:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2020-05-17 09:29:59] [INFO ] Computed and/alt/rep : 679/1795/653 causal constraints in 67 ms.
[2020-05-17 09:30:01] [INFO ] Added : 180 causal constraints over 36 iterations in 1839 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
Incomplete Parikh walk after 41400 steps, including 552 resets, run finished after 460 ms. (steps per millisecond=90 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 47200 steps, including 591 resets, run finished after 402 ms. (steps per millisecond=117 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 40100 steps, including 552 resets, run finished after 212 ms. (steps per millisecond=189 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 25 out of 412 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 412/412 places, 691/691 transitions.
Graph (trivial) has 73 edges and 412 vertex of which 4 / 412 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 410 transition count 679
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 21 place count 402 transition count 679
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 21 place count 402 transition count 677
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 400 transition count 677
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 41 place count 400 transition count 661
Symmetric choice reduction at 3 with 23 rule applications. Total rules 64 place count 400 transition count 661
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 23 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 110 place count 377 transition count 638
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 111 place count 377 transition count 637
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 129 place count 368 transition count 628
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 130 place count 368 transition count 627
Symmetric choice reduction at 5 with 6 rule applications. Total rules 136 place count 368 transition count 627
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 148 place count 362 transition count 621
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 153 place count 362 transition count 616
Free-agglomeration rule applied 36 times.
Iterating global reduction 6 with 36 rules applied. Total rules applied 189 place count 362 transition count 580
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2.t3.t4.t3464.t2995.t2996 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 79 edges and 324 vertex of which 26 / 324 are part of one of the 12 SCC in 1 ms
Free SCC test removed 14 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 5 rules applied. Total rules applied 194 place count 310 transition count 576
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 26 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 223 place count 309 transition count 548
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 15 Pre rules applied. Total rules applied 223 place count 309 transition count 533
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 8 with 30 rules applied. Total rules applied 253 place count 294 transition count 533
Symmetric choice reduction at 8 with 17 rule applications. Total rules 270 place count 294 transition count 533
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 17 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 304 place count 277 transition count 516
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 321 place count 277 transition count 499
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 9 with 38 rules applied. Total rules applied 359 place count 258 transition count 480
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 361 place count 257 transition count 480
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 363 place count 257 transition count 478
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 10 with 14 rules applied. Total rules applied 377 place count 257 transition count 464
Free-agglomeration rule applied 12 times.
Iterating global reduction 10 with 12 rules applied. Total rules applied 389 place count 257 transition count 452
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 10 with 37 rules applied. Total rules applied 426 place count 241 transition count 431
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 438 place count 235 transition count 425
Symmetric choice reduction at 12 with 44 rule applications. Total rules 482 place count 235 transition count 425
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 44 transitions.
Iterating global reduction 12 with 88 rules applied. Total rules applied 570 place count 191 transition count 381
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 12 with 44 rules applied. Total rules applied 614 place count 191 transition count 337
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 615 place count 191 transition count 337
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 13 with 14 rules applied. Total rules applied 629 place count 191 transition count 323
Free-agglomeration rule applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 630 place count 191 transition count 322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 631 place count 190 transition count 322
Applied a total of 631 rules in 172 ms. Remains 190 /412 variables (removed 222) and now considering 322/691 (removed 369) transitions.
Finished structural reductions, in 1 iterations. Remains : 190/412 places, 322/691 transitions.
Incomplete random walk after 1000000 steps, including 50619 resets, run finished after 3739 ms. (steps per millisecond=267 ) properties seen :[0, 1, 0]
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2906 resets, run finished after 1191 ms. (steps per millisecond=839 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 459 resets, run finished after 590 ms. (steps per millisecond=1694 ) properties seen :[0, 0]
// Phase 1: matrix 322 rows 190 cols
[2020-05-17 09:30:08] [INFO ] Computed 13 place invariants in 3 ms
[2020-05-17 09:30:08] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2020-05-17 09:30:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 09:30:08] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2020-05-17 09:30:09] [INFO ] Deduced a trap composed of 134 places in 129 ms
[2020-05-17 09:30:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2020-05-17 09:30:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 09:30:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2020-05-17 09:30:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 09:30:09] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2020-05-17 09:30:09] [INFO ] Deduced a trap composed of 134 places in 137 ms
[2020-05-17 09:30:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2020-05-17 09:30:09] [INFO ] Computed and/alt/rep : 315/714/315 causal constraints in 32 ms.
[2020-05-17 09:30:09] [INFO ] Added : 72 causal constraints over 15 iterations in 351 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2020-05-17 09:30:10] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2020-05-17 09:30:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-17 09:30:10] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2020-05-17 09:30:10] [INFO ] Computed and/alt/rep : 315/714/315 causal constraints in 30 ms.
[2020-05-17 09:30:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-17 09:30:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 17 ms returned sat
[2020-05-17 09:30:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-17 09:30:10] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2020-05-17 09:30:10] [INFO ] Computed and/alt/rep : 315/714/315 causal constraints in 20 ms.
[2020-05-17 09:30:10] [INFO ] Added : 74 causal constraints over 15 iterations in 317 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
Incomplete Parikh walk after 15000 steps, including 841 resets, run finished after 71 ms. (steps per millisecond=211 ) properties seen :[0, 1] could not realise parikh vector
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 14600 steps, including 877 resets, run finished after 67 ms. (steps per millisecond=217 ) properties seen :[0] could not realise parikh vector
Support contains 10 out of 190 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 190/190 places, 322/322 transitions.
Graph (trivial) has 167 edges and 190 vertex of which 8 / 190 are part of one of the 3 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 185 transition count 309
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 17 place count 182 transition count 309
Symmetric choice reduction at 2 with 3 rule applications. Total rules 20 place count 182 transition count 309
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 179 transition count 306
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t2107.t2592.t3814.t2539.t2540.t2247 and 1 places that fell out of Prefix Of Interest.
Iterating global reduction 2 with 7 rules applied. Total rules applied 33 place count 169 transition count 299
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t1527.t2576.t3806.t2539.t2540.t1524.t1525 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 3 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 149 edges and 168 vertex of which 6 / 168 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 2 with 6 rules applied. Total rules applied 39 place count 163 transition count 294
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 49 place count 163 transition count 284
Symmetric choice reduction at 4 with 41 rule applications. Total rules 90 place count 163 transition count 284
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 41 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 172 place count 122 transition count 243
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 4 with 41 rules applied. Total rules applied 213 place count 122 transition count 202
Free-agglomeration rule applied 97 times with reduction of 1 identical transitions.
Iterating global reduction 5 with 97 rules applied. Total rules applied 310 place count 122 transition count 104
Reduce places removed 98 places and 0 transitions.
Drop transitions removed 53 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 5 with 154 rules applied. Total rules applied 464 place count 24 transition count 48
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 465 place count 24 transition count 48
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 466 place count 24 transition count 47
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 485 place count 24 transition count 28
Discarding 2 places :
Also discarding 0 output transitions
Graph (complete) has 51 edges and 24 vertex of which 22 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Iterating post reduction 7 with 1 rules applied. Total rules applied 486 place count 22 transition count 28
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 488 place count 22 transition count 26
Applied a total of 488 rules in 36 ms. Remains 22 /190 variables (removed 168) and now considering 26/322 (removed 296) transitions.
Finished structural reductions, in 1 iterations. Remains : 22/190 places, 26/322 transitions.
Finished random walk after 55054 steps, including 0 resets, run visited all 1 properties in 96 ms. (steps per millisecond=573 )
FORMULA FlexibleBarrier-PT-16b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589707812187

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-16b"
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"

# 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-4028"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-16b, 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 r081-smll-158922977800367"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-16b.tgz
mv FlexibleBarrier-PT-16b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;