Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089416100668.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-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 RefineWMG-PT-025026, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089416100668
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 56K May 5 16:51 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 RefineWMG-PT-025026-00
FORMULA_NAME RefineWMG-PT-025026-01
FORMULA_NAME RefineWMG-PT-025026-02
FORMULA_NAME RefineWMG-PT-025026-03
FORMULA_NAME RefineWMG-PT-025026-04
FORMULA_NAME RefineWMG-PT-025026-05
FORMULA_NAME RefineWMG-PT-025026-06
FORMULA_NAME RefineWMG-PT-025026-07
FORMULA_NAME RefineWMG-PT-025026-08
FORMULA_NAME RefineWMG-PT-025026-09
FORMULA_NAME RefineWMG-PT-025026-10
FORMULA_NAME RefineWMG-PT-025026-11
FORMULA_NAME RefineWMG-PT-025026-12
FORMULA_NAME RefineWMG-PT-025026-13
FORMULA_NAME RefineWMG-PT-025026-14
FORMULA_NAME RefineWMG-PT-025026-15

=== Now, execution of the tool begins

BK_START 1621262822278

Running Version 0
[2021-05-17 14:47:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 14:47:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:47:03] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2021-05-17 14:47:03] [INFO ] Transformed 129 places.
[2021-05-17 14:47:03] [INFO ] Transformed 103 transitions.
[2021-05-17 14:47:03] [INFO ] Parsed PT model containing 129 places and 103 transitions in 72 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 14:47:03] [INFO ] Initial state test concluded for 4 properties.
FORMULA RefineWMG-PT-025026-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 11 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:03] [INFO ] Computed 52 place invariants in 10 ms
[2021-05-17 14:47:04] [INFO ] Dead Transitions using invariants and state equation in 149 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:04] [INFO ] Computed 52 place invariants in 5 ms
[2021-05-17 14:47:04] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:04] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:47:04] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:04] [INFO ] Computed 52 place invariants in 3 ms
[2021-05-17 14:47:04] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
[2021-05-17 14:47:04] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 14:47:04] [INFO ] Flatten gal took : 30 ms
FORMULA RefineWMG-PT-025026-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-025026-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:47:04] [INFO ] Flatten gal took : 12 ms
[2021-05-17 14:47:04] [INFO ] Input system was already deterministic with 103 transitions.
Incomplete random walk after 100004 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=751 ) properties (out of 19) seen :16
Running SMT prover for 3 properties.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:04] [INFO ] Computed 52 place invariants in 3 ms
[2021-05-17 14:47:04] [INFO ] [Real]Absence check using 52 positive place invariants in 12 ms returned sat
[2021-05-17 14:47:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:47:04] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-17 14:47:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:47:04] [INFO ] [Nat]Absence check using 52 positive place invariants in 5 ms returned sat
[2021-05-17 14:47:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:47:04] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2021-05-17 14:47:04] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 14:47:04] [INFO ] Added : 55 causal constraints over 11 iterations in 89 ms. Result :sat
[2021-05-17 14:47:04] [INFO ] [Real]Absence check using 52 positive place invariants in 6 ms returned sat
[2021-05-17 14:47:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:47:04] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-17 14:47:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:47:05] [INFO ] [Nat]Absence check using 52 positive place invariants in 10 ms returned sat
[2021-05-17 14:47:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:47:05] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2021-05-17 14:47:05] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-17 14:47:05] [INFO ] Added : 56 causal constraints over 12 iterations in 108 ms. Result :sat
[2021-05-17 14:47:05] [INFO ] [Real]Absence check using 52 positive place invariants in 6 ms returned sat
[2021-05-17 14:47:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:47:05] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2021-05-17 14:47:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:47:05] [INFO ] [Nat]Absence check using 52 positive place invariants in 8 ms returned sat
[2021-05-17 14:47:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:47:05] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2021-05-17 14:47:05] [INFO ] Computed and/alt/rep : 77/102/77 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-17 14:47:05] [INFO ] Added : 52 causal constraints over 11 iterations in 70 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||(p1&&X(G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 8 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:05] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:47:05] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:05] [INFO ] Computed 52 place invariants in 5 ms
[2021-05-17 14:47:05] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:05] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:47:05] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:05] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:47:05] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 299 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-025026-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 s118), p1:(GT s53 s21), p2:(LEQ s111 s33)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 592 reset in 435 ms.
Stack based approach found an accepted trace after 54 steps with 1 reset with depth 8 and stack size 8 in 1 ms.
FORMULA RefineWMG-PT-025026-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-00 finished in 1002 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 13 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:06] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:47:06] [INFO ] Dead Transitions using invariants and state equation in 102 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:06] [INFO ] Computed 52 place invariants in 9 ms
[2021-05-17 14:47:06] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:06] [INFO ] Computed 52 place invariants in 2 ms
[2021-05-17 14:47:06] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:06] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:47:06] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : RefineWMG-PT-025026-01 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ 2 s25), p0:(LEQ 1 s72)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22 reset in 465 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA RefineWMG-PT-025026-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-01 finished in 921 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 73 edges and 129 vertex of which 50 / 129 are part of one of the 25 SCC in 3 ms
Free SCC test removed 25 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 79 transition count 54
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 1 with 69 rules applied. Total rules applied 94 place count 33 transition count 31
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 19 rules applied. Total rules applied 113 place count 33 transition count 12
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 20 rules applied. Total rules applied 133 place count 14 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 134 place count 13 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 134 place count 13 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 138 place count 11 transition count 9
Applied a total of 138 rules in 19 ms. Remains 11 /129 variables (removed 118) and now considering 9/103 (removed 94) transitions.
// Phase 1: matrix 9 rows 11 cols
[2021-05-17 14:47:07] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:47:07] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
// Phase 1: matrix 9 rows 11 cols
[2021-05-17 14:47:07] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:47:07] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 9 rows 11 cols
[2021-05-17 14:47:07] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:47:07] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-05-17 14:47:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 11 cols
[2021-05-17 14:47:07] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:47:07] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 11/129 places, 9/103 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-025026-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s7 s9), p1:(GT 3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-025026-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-03 finished in 186 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 8 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:07] [INFO ] Computed 52 place invariants in 0 ms
[2021-05-17 14:47:07] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:07] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:47:07] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:07] [INFO ] Computed 52 place invariants in 2 ms
[2021-05-17 14:47:07] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:07] [INFO ] Computed 52 place invariants in 3 ms
[2021-05-17 14:47:07] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : RefineWMG-PT-025026-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 s80), p0:(GT s82 s33)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 397 reset in 468 ms.
Stack based approach found an accepted trace after 20 steps with 1 reset with depth 19 and stack size 19 in 0 ms.
FORMULA RefineWMG-PT-025026-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-05 finished in 897 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 6 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:08] [INFO ] Computed 52 place invariants in 0 ms
[2021-05-17 14:47:08] [INFO ] Dead Transitions using invariants and state equation in 94 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:08] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:47:08] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:08] [INFO ] Computed 52 place invariants in 4 ms
[2021-05-17 14:47:08] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:08] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:47:08] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025026-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT s5 s63)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 490 ms.
Stack based approach found an accepted trace after 60 steps with 0 reset with depth 61 and stack size 61 in 1 ms.
FORMULA RefineWMG-PT-025026-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-06 finished in 954 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||X((G(p1) U (p0&&G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 129 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:09] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:47:09] [INFO ] Dead Transitions using invariants and state equation in 84 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:09] [INFO ] Computed 52 place invariants in 2 ms
[2021-05-17 14:47:09] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:09] [INFO ] Computed 52 place invariants in 11 ms
[2021-05-17 14:47:09] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:09] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:47:09] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025026-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s126 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 322 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA RefineWMG-PT-025026-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-09 finished in 752 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 75 edges and 129 vertex of which 50 / 129 are part of one of the 25 SCC in 0 ms
Free SCC test removed 25 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 79 transition count 54
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 1 with 75 rules applied. Total rules applied 100 place count 29 transition count 29
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 21 rules applied. Total rules applied 121 place count 29 transition count 8
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 22 rules applied. Total rules applied 143 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 144 place count 7 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 144 place count 7 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 146 place count 6 transition count 6
Applied a total of 146 rules in 9 ms. Remains 6 /129 variables (removed 123) and now considering 6/103 (removed 97) transitions.
// Phase 1: matrix 6 rows 6 cols
[2021-05-17 14:47:10] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-17 14:47:10] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-17 14:47:10] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-17 14:47:10] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-17 14:47:10] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-17 14:47:10] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-05-17 14:47:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-17 14:47:10] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-17 14:47:10] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/129 places, 6/103 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-025026-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 2 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-10 finished in 133 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&(p1 U G(p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Graph (trivial) has 69 edges and 129 vertex of which 46 / 129 are part of one of the 23 SCC in 0 ms
Free SCC test removed 23 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 83 transition count 58
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 1 with 69 rules applied. Total rules applied 92 place count 37 transition count 35
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 13 rules applied. Total rules applied 105 place count 37 transition count 22
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 14 rules applied. Total rules applied 119 place count 24 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 120 place count 23 transition count 21
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 120 place count 23 transition count 16
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 130 place count 18 transition count 16
Applied a total of 130 rules in 6 ms. Remains 18 /129 variables (removed 111) and now considering 16/103 (removed 87) transitions.
// Phase 1: matrix 16 rows 18 cols
[2021-05-17 14:47:10] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 14:47:10] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
// Phase 1: matrix 16 rows 18 cols
[2021-05-17 14:47:10] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 14:47:10] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 16 rows 18 cols
[2021-05-17 14:47:10] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-17 14:47:10] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2021-05-17 14:47:10] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 16 rows 18 cols
[2021-05-17 14:47:10] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-17 14:47:10] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18/129 places, 16/103 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-025026-14 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ s8 s13), p1:(LEQ 1 s5), p0:(LEQ s16 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-025026-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-14 finished in 183 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((G(F(p0))||(F(p0)&&(p1 U G(p2))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 129/129 places, 103/103 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:10] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:47:10] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:10] [INFO ] Computed 52 place invariants in 10 ms
[2021-05-17 14:47:10] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:10] [INFO ] Computed 52 place invariants in 4 ms
[2021-05-17 14:47:10] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
// Phase 1: matrix 103 rows 129 cols
[2021-05-17 14:47:10] [INFO ] Computed 52 place invariants in 1 ms
[2021-05-17 14:47:10] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 1 iterations. Remains : 129/129 places, 103/103 transitions.
Stuttering acceptance computed with spot in 319 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-025026-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(LEQ 2 s7), p1:(LEQ 2 s90), p0:(AND (GT 1 s55) (LEQ s128 s46))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14 reset in 440 ms.
Stack based approach found an accepted trace after 10717 steps with 0 reset with depth 10718 and stack size 275 in 78 ms.
FORMULA RefineWMG-PT-025026-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-025026-15 finished in 1147 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621262831890

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="RefineWMG-PT-025026"
export BK_EXAMINATION="LTLCardinality"
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-4028"
echo " Executing tool itstools"
echo " Input is RefineWMG-PT-025026, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r178-tajo-162089416100668"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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