Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r261-smll-167863536600604.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Peterson-PT-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536600604
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 876K
-rw-r--r-- 1 mcc users 13K Feb 25 22:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 22:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Feb 25 22:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 124K Feb 25 22:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.2K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Feb 25 22:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Feb 25 22:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 33K Feb 25 22:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 185K Feb 25 22:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 100K Mar 5 18:23 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 Peterson-PT-2-LTLFireability-00
FORMULA_NAME Peterson-PT-2-LTLFireability-01
FORMULA_NAME Peterson-PT-2-LTLFireability-02
FORMULA_NAME Peterson-PT-2-LTLFireability-03
FORMULA_NAME Peterson-PT-2-LTLFireability-04
FORMULA_NAME Peterson-PT-2-LTLFireability-05
FORMULA_NAME Peterson-PT-2-LTLFireability-06
FORMULA_NAME Peterson-PT-2-LTLFireability-07
FORMULA_NAME Peterson-PT-2-LTLFireability-08
FORMULA_NAME Peterson-PT-2-LTLFireability-09
FORMULA_NAME Peterson-PT-2-LTLFireability-10
FORMULA_NAME Peterson-PT-2-LTLFireability-11
FORMULA_NAME Peterson-PT-2-LTLFireability-12
FORMULA_NAME Peterson-PT-2-LTLFireability-13
FORMULA_NAME Peterson-PT-2-LTLFireability-14
FORMULA_NAME Peterson-PT-2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679043824631

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-2
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-17 09:03:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-17 09:03:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 09:03:47] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2023-03-17 09:03:47] [INFO ] Transformed 102 places.
[2023-03-17 09:03:47] [INFO ] Transformed 126 transitions.
[2023-03-17 09:03:47] [INFO ] Found NUPN structural information;
[2023-03-17 09:03:47] [INFO ] Parsed PT model containing 102 places and 126 transitions and 384 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Peterson-PT-2-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-2-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 18 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-17 09:03:47] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2023-03-17 09:03:47] [INFO ] Computed 11 place invariants in 14 ms
[2023-03-17 09:03:48] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-17 09:03:48] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-17 09:03:48] [INFO ] Invariant cache hit.
[2023-03-17 09:03:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 09:03:48] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
[2023-03-17 09:03:48] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-17 09:03:48] [INFO ] Invariant cache hit.
[2023-03-17 09:03:48] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1016 ms. Remains : 102/102 places, 126/126 transitions.
Support contains 57 out of 102 places after structural reductions.
[2023-03-17 09:03:48] [INFO ] Flatten gal took : 62 ms
[2023-03-17 09:03:49] [INFO ] Flatten gal took : 28 ms
[2023-03-17 09:03:49] [INFO ] Input system was already deterministic with 126 transitions.
Support contains 55 out of 102 places (down from 57) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 757 ms. (steps per millisecond=13 ) properties (out of 24) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-17 09:03:50] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-17 09:03:50] [INFO ] Invariant cache hit.
[2023-03-17 09:03:50] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 09:03:50] [INFO ] [Real]Absence check using 8 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-17 09:03:50] [INFO ] After 99ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-17 09:03:50] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 09:03:50] [INFO ] After 26ms SMT Verify possible using 22 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-17 09:03:50] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-17 09:03:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-17 09:03:50] [INFO ] [Nat]Absence check using 8 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-17 09:03:50] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-17 09:03:50] [INFO ] After 34ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-17 09:03:50] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 12 ms to minimize.
[2023-03-17 09:03:50] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2023-03-17 09:03:51] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2023-03-17 09:03:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 237 ms
[2023-03-17 09:03:51] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 3 ms to minimize.
[2023-03-17 09:03:51] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 0 ms to minimize.
[2023-03-17 09:03:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 168 ms
[2023-03-17 09:03:51] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2023-03-17 09:03:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-17 09:03:51] [INFO ] After 592ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-17 09:03:51] [INFO ] After 830ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 46 ms.
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 102 transition count 96
Reduce places removed 30 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 72 transition count 94
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 70 transition count 94
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 64 place count 70 transition count 76
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 100 place count 52 transition count 76
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 108 place count 48 transition count 72
Applied a total of 108 rules in 40 ms. Remains 48 /102 variables (removed 54) and now considering 72/126 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 48/102 places, 72/126 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Finished probabilistic random walk after 3702 steps, run visited all 4 properties in 50 ms. (steps per millisecond=74 )
Probabilistic random walk after 3702 steps, saw 983 distinct states, run finished after 50 ms. (steps per millisecond=74 ) properties seen :4
FORMULA Peterson-PT-2-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)&&p0))))'
Support contains 18 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-17 09:03:52] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-17 09:03:52] [INFO ] Invariant cache hit.
[2023-03-17 09:03:52] [INFO ] Implicit Places using invariants in 134 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 137 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 386 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-2-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s32 0) (EQ s33 0) (EQ s34 0) (EQ s35 0) (EQ s37 0) (EQ s36 0) (EQ s39 0) (EQ s38 0) (EQ s40 0) (EQ s43 0) (EQ s23 0) (EQ s25 0) (EQ s26 0) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 711 ms.
Product exploration explored 100000 steps with 33333 reset in 550 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-2-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-2-LTLFireability-03 finished in 2073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0) U X(G(p1)))))'
Support contains 18 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-17 09:03:54] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-17 09:03:54] [INFO ] Invariant cache hit.
[2023-03-17 09:03:54] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-17 09:03:54] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-17 09:03:54] [INFO ] Invariant cache hit.
[2023-03-17 09:03:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 09:03:54] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-17 09:03:54] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-17 09:03:54] [INFO ] Invariant cache hit.
[2023-03-17 09:03:54] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 383 ms. Remains : 102/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : Peterson-PT-2-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (EQ s89 1) (EQ s99 1)) (AND (EQ s89 1) (EQ s100 1)) (AND (EQ s79 1) (EQ s99 1)) (AND (EQ s79 1) (EQ s100 1)) (AND (EQ s86 1) (EQ s96 1)) (AND ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 10107 reset in 452 ms.
Stack based approach found an accepted trace after 544 steps with 71 reset with depth 75 and stack size 75 in 6 ms.
FORMULA Peterson-PT-2-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-05 finished in 1041 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Support contains 15 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 102 transition count 91
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 67 transition count 91
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 70 place count 67 transition count 75
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 102 place count 51 transition count 75
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 108 place count 48 transition count 72
Applied a total of 108 rules in 20 ms. Remains 48 /102 variables (removed 54) and now considering 72/126 (removed 54) transitions.
[2023-03-17 09:03:55] [INFO ] Flow matrix only has 66 transitions (discarded 6 similar events)
// Phase 1: matrix 66 rows 48 cols
[2023-03-17 09:03:55] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-17 09:03:55] [INFO ] Implicit Places using invariants in 66 ms returned [34, 36, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 67 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/102 places, 72/126 transitions.
Applied a total of 0 rules in 6 ms. Remains 45 /45 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 93 ms. Remains : 45/102 places, 72/126 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s12 1) (EQ s13 1) (EQ s15 1)), p1:(OR (AND (EQ s30 1) (EQ s35 1)) (AND (EQ s28 1) (EQ s36 1)) (AND (EQ s29 1) (EQ s37 1)) (AND (EQ s31 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 7770 reset in 324 ms.
Stack based approach found an accepted trace after 9 steps with 1 reset with depth 5 and stack size 5 in 0 ms.
FORMULA Peterson-PT-2-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-06 finished in 613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(p0)) U (p1 U p2))&&X(F(p1))))'
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 7 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-17 09:03:56] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2023-03-17 09:03:56] [INFO ] Computed 11 place invariants in 7 ms
[2023-03-17 09:03:56] [INFO ] Implicit Places using invariants in 117 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 120 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 7 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 134 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 329 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s65 1) (EQ s88 1)), p1:(AND (EQ s48 1) (EQ s51 1)), p0:(AND (EQ s88 1) (EQ s94 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-2-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-LTLFireability-09 finished in 498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||(p0 U p1)) U (!p0 U (p1||G(!p0)))))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 102 transition count 94
Reduce places removed 32 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 66 place count 70 transition count 92
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 68 transition count 92
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 68 place count 68 transition count 74
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 104 place count 50 transition count 74
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 114 place count 45 transition count 69
Applied a total of 114 rules in 22 ms. Remains 45 /102 variables (removed 57) and now considering 69/126 (removed 57) transitions.
[2023-03-17 09:03:56] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
// Phase 1: matrix 63 rows 45 cols
[2023-03-17 09:03:56] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-17 09:03:56] [INFO ] Implicit Places using invariants in 87 ms returned [34, 36, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 89 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/102 places, 69/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 42 /42 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 118 ms. Remains : 42/102 places, 69/126 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) p0), true, (AND (NOT p1) p0)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(EQ s32 1), p0:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 210 ms.
Product exploration explored 100000 steps with 0 reset in 357 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 333 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-17 09:03:58] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
// Phase 1: matrix 63 rows 42 cols
[2023-03-17 09:03:58] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-17 09:03:58] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 09:03:58] [INFO ] After 33ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 09:03:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 09:03:58] [INFO ] After 26ms SMT Verify possible using 22 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:03:58] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:03:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-17 09:03:58] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 09:03:58] [INFO ] After 8ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 09:03:58] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2023-03-17 09:03:58] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2023-03-17 09:03:58] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2023-03-17 09:03:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 117 ms
[2023-03-17 09:03:58] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-17 09:03:58] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 42/42 places, 69/69 transitions.
Applied a total of 0 rules in 5 ms. Remains 42 /42 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 42/42 places, 69/69 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1942 steps, run visited all 1 properties in 11 ms. (steps per millisecond=176 )
Probabilistic random walk after 1942 steps, saw 512 distinct states, run finished after 11 ms. (steps per millisecond=176 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 413 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 125 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 69/69 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2023-03-17 09:03:59] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
[2023-03-17 09:03:59] [INFO ] Invariant cache hit.
[2023-03-17 09:03:59] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-17 09:03:59] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
[2023-03-17 09:03:59] [INFO ] Invariant cache hit.
[2023-03-17 09:03:59] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 09:03:59] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2023-03-17 09:03:59] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
[2023-03-17 09:03:59] [INFO ] Invariant cache hit.
[2023-03-17 09:03:59] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 360 ms. Remains : 42/42 places, 69/69 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 334 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 09:04:00] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
[2023-03-17 09:04:00] [INFO ] Invariant cache hit.
[2023-03-17 09:04:00] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-17 09:04:00] [INFO ] After 31ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 09:04:00] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 09:04:00] [INFO ] After 12ms SMT Verify possible using 22 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:04:00] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:04:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-17 09:04:00] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 09:04:00] [INFO ] After 8ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 09:04:00] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 3 ms to minimize.
[2023-03-17 09:04:00] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2023-03-17 09:04:00] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2023-03-17 09:04:00] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2023-03-17 09:04:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 176 ms
[2023-03-17 09:04:00] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-17 09:04:00] [INFO ] After 272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 42/42 places, 69/69 transitions.
Applied a total of 0 rules in 4 ms. Remains 42 /42 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 42/42 places, 69/69 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1942 steps, run visited all 1 properties in 12 ms. (steps per millisecond=161 )
Probabilistic random walk after 1942 steps, saw 512 distinct states, run finished after 12 ms. (steps per millisecond=161 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 297 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 131 ms.
Product exploration explored 100000 steps with 2 reset in 187 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 119 ms :[true, (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 69/69 transitions.
Applied a total of 0 rules in 3 ms. Remains 42 /42 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2023-03-17 09:04:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-17 09:04:02] [INFO ] Flow matrix only has 63 transitions (discarded 6 similar events)
[2023-03-17 09:04:02] [INFO ] Invariant cache hit.
[2023-03-17 09:04:02] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 42/42 places, 69/69 transitions.
Built C files in :
/tmp/ltsmin9119008058073666183
[2023-03-17 09:04:02] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9119008058073666183
Running compilation step : cd /tmp/ltsmin9119008058073666183;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 534 ms.
Running link step : cd /tmp/ltsmin9119008058073666183;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin9119008058073666183;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15978769184524975594.hoa' '--buchi-type=spotba'
LTSmin run took 956 ms.
FORMULA Peterson-PT-2-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Peterson-PT-2-LTLFireability-10 finished in 6979 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p0&&F(!p1)) U (G((!p0&&F(!p1)))||(F(!p1)&&p2))))))'
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 102 transition count 94
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 65 place count 70 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 69 transition count 93
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 66 place count 69 transition count 76
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 100 place count 52 transition count 76
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 112 place count 46 transition count 70
Applied a total of 112 rules in 15 ms. Remains 46 /102 variables (removed 56) and now considering 70/126 (removed 56) transitions.
[2023-03-17 09:04:03] [INFO ] Flow matrix only has 64 transitions (discarded 6 similar events)
// Phase 1: matrix 64 rows 46 cols
[2023-03-17 09:04:03] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-17 09:04:03] [INFO ] Implicit Places using invariants in 66 ms returned [35, 37, 38]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 67 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/102 places, 70/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 86 ms. Remains : 43/102 places, 70/126 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR p1 (AND p0 (NOT p2))), (OR p1 (AND p0 (NOT p2))), p1]
Running random walk in product with property : Peterson-PT-2-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(OR (AND p2 p1) (AND p1 (NOT p0))), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p2 p1) (AND p1 (NOT p0))), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (NOT (AND (EQ s20 1) (EQ s26 1))) (NEQ s29 1)), p0:(AND (EQ s20 1) (EQ s26 1)), p1:(AND (EQ s21 1) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2340 reset in 291 ms.
Stack based approach found an accepted trace after 145 steps with 4 reset with depth 25 and stack size 22 in 1 ms.
FORMULA Peterson-PT-2-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-11 finished in 532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((F(G(!p0)) U p1))))))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-17 09:04:04] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2023-03-17 09:04:04] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-17 09:04:04] [INFO ] Implicit Places using invariants in 110 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 111 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 5 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 123 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 290 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), p0, (NOT p1)]
Running random walk in product with property : Peterson-PT-2-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s35 1), p0:(AND (EQ s15 1) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 99 ms.
Product exploration explored 100000 steps with 0 reset in 119 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 328 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), p0, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-17 09:04:05] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 99 cols
[2023-03-17 09:04:05] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-17 09:04:05] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 09:04:05] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:04:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-17 09:04:05] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 09:04:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-17 09:04:05] [INFO ] After 10ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 09:04:05] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2023-03-17 09:04:05] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2023-03-17 09:04:05] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2023-03-17 09:04:05] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2023-03-17 09:04:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 231 ms
[2023-03-17 09:04:05] [INFO ] After 251ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-17 09:04:05] [INFO ] After 393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 126/126 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 99 transition count 93
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 66 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 65 transition count 92
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 68 place count 65 transition count 74
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 104 place count 47 transition count 74
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 114 place count 42 transition count 69
Applied a total of 114 rules in 10 ms. Remains 42 /99 variables (removed 57) and now considering 69/126 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 42/99 places, 69/126 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3390 steps, run visited all 1 properties in 10 ms. (steps per millisecond=339 )
Probabilistic random walk after 3390 steps, saw 901 distinct states, run finished after 11 ms. (steps per millisecond=308 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 2 factoid took 186 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), p0, (NOT p1)]
Stuttering acceptance computed with spot in 286 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), p0, (NOT p1)]
[2023-03-17 09:04:06] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-17 09:04:06] [INFO ] Invariant cache hit.
[2023-03-17 09:04:06] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F p0), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-2-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-2-LTLFireability-12 finished in 2726 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)&&F(p2)))'
Support contains 6 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-17 09:04:06] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
// Phase 1: matrix 120 rows 102 cols
[2023-03-17 09:04:07] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-17 09:04:07] [INFO ] Implicit Places using invariants in 92 ms returned [87, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 95 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 100/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101 ms. Remains : 100/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : Peterson-PT-2-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s68 1) (EQ s90 1)), p2:(AND (EQ s47 1) (EQ s49 1)), p0:(AND (EQ s48 1) (EQ s85 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 612 steps with 6 reset in 2 ms.
FORMULA Peterson-PT-2-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-2-LTLFireability-13 finished in 322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(G(p0))&&(X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))))'
Support contains 5 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-17 09:04:07] [INFO ] Flow matrix only has 120 transitions (discarded 6 similar events)
[2023-03-17 09:04:07] [INFO ] Invariant cache hit.
[2023-03-17 09:04:07] [INFO ] Implicit Places using invariants in 93 ms returned [85, 87, 88]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 95 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/102 places, 126/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 99 /99 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101 ms. Remains : 99/102 places, 126/126 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1, p1]
Running random walk in product with property : Peterson-PT-2-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s61 1) (EQ s89 1)), p0:(EQ s24 0), p1:(AND (EQ s66 1) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 3 reset in 147 ms.
Stack based approach found an accepted trace after 123 steps with 0 reset with depth 124 and stack size 123 in 0 ms.
FORMULA Peterson-PT-2-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-2-LTLFireability-15 finished in 537 ms.
All properties solved by simple procedures.
Total runtime 20703 ms.

BK_STOP 1679043848855

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-2"
export BK_EXAMINATION="LTLFireability"
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-5348"
echo " Executing tool itstools"
echo " Input is Peterson-PT-2, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r261-smll-167863536600604"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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