fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r102-smll-162075331200165
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for GPPP-PT-C0001N0000000001

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
305.947 18214.00 33843.00 416.10 FFFFFFFFTTFFFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 88K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 28 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 28 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 11:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 11:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Mar 22 19:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 19:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 17 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1 May 5 16:51 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0001N0000000001-00
FORMULA_NAME GPPP-PT-C0001N0000000001-01
FORMULA_NAME GPPP-PT-C0001N0000000001-02
FORMULA_NAME GPPP-PT-C0001N0000000001-03
FORMULA_NAME GPPP-PT-C0001N0000000001-04
FORMULA_NAME GPPP-PT-C0001N0000000001-05
FORMULA_NAME GPPP-PT-C0001N0000000001-06
FORMULA_NAME GPPP-PT-C0001N0000000001-07
FORMULA_NAME GPPP-PT-C0001N0000000001-08
FORMULA_NAME GPPP-PT-C0001N0000000001-09
FORMULA_NAME GPPP-PT-C0001N0000000001-10
FORMULA_NAME GPPP-PT-C0001N0000000001-11
FORMULA_NAME GPPP-PT-C0001N0000000001-12
FORMULA_NAME GPPP-PT-C0001N0000000001-13
FORMULA_NAME GPPP-PT-C0001N0000000001-14
FORMULA_NAME GPPP-PT-C0001N0000000001-15

=== Now, execution of the tool begins

BK_START 1621196472826

Running Version 0
[2021-05-16 20:21:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-16 20:21:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 20:21:15] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2021-05-16 20:21:15] [INFO ] Transformed 33 places.
[2021-05-16 20:21:15] [INFO ] Transformed 22 transitions.
[2021-05-16 20:21:15] [INFO ] Parsed PT model containing 33 places and 22 transitions in 98 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 20:21:15] [INFO ] Initial state test concluded for 2 properties.
FORMULA GPPP-PT-C0001N0000000001-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 33 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 27 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2021-05-16 20:21:16] [INFO ] Computed 13 place invariants in 9 ms
[2021-05-16 20:21:16] [INFO ] Dead Transitions using invariants and state equation in 248 ms returned []
// Phase 1: matrix 22 rows 33 cols
[2021-05-16 20:21:16] [INFO ] Computed 13 place invariants in 5 ms
[2021-05-16 20:21:16] [INFO ] Implicit Places using invariants in 55 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:21:16] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 20:21:16] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Starting structural reductions, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:21:16] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 20:21:16] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/33 places, 22/22 transitions.
[2021-05-16 20:21:16] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-16 20:21:16] [INFO ] Flatten gal took : 34 ms
FORMULA GPPP-PT-C0001N0000000001-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000001-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 20:21:16] [INFO ] Flatten gal took : 10 ms
[2021-05-16 20:21:16] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 331 ms. (steps per millisecond=302 ) properties (out of 18) seen :17
Running SMT prover for 1 properties.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:21:17] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 20:21:17] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2021-05-16 20:21:17] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2021-05-16 20:21:17] [INFO ] Initial state test concluded for 1 properties.
FORMULA GPPP-PT-C0001N0000000001-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0))||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:21:17] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 20:21:17] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:21:17] [INFO ] Computed 12 place invariants in 9 ms
[2021-05-16 20:21:17] [INFO ] Implicit Places using invariants in 76 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 78 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 20:21:17] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-16 20:21:17] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 20:21:17] [INFO ] Computed 10 place invariants in 8 ms
[2021-05-16 20:21:17] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 386 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000001-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s15 1) (AND (GEQ s6 1) (GEQ s26 2))), p0:(GEQ s17 1)], nbAcceptance=1, 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 2797 reset in 462 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 1 ms.
FORMULA GPPP-PT-C0001N0000000001-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000001-00 finished in 1235 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(p1)&&p0) U X(X(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:21:18] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 20:21:18] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:21:18] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:21:18] [INFO ] Implicit Places using invariants in 76 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 78 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 20:21:18] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:21:18] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 20:21:18] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-16 20:21:18] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p2)]
Running random walk in product with property : GPPP-PT-C0001N0000000001-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=4, aps=[p1:(OR (LT s2 2) (LT s13 1) (LT s25 1)), p2:(GEQ s10 1), p0:(AND (GEQ s7 1) (GEQ s11 1) (OR (LT s2 2) (LT s13 1) (LT s25 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000001-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000001-01 finished in 572 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||G(F(!p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 32 transition count 21
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 31 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 29 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 27 transition count 19
Applied a total of 8 rules in 22 ms. Remains 27 /32 variables (removed 5) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 27 cols
[2021-05-16 20:21:19] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-16 20:21:19] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
// Phase 1: matrix 19 rows 27 cols
[2021-05-16 20:21:19] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 20:21:19] [INFO ] Implicit Places using invariants in 47 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
[2021-05-16 20:21:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 19 rows 26 cols
[2021-05-16 20:21:19] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-16 20:21:19] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Starting structural reductions, iteration 1 : 26/32 places, 19/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 25 transition count 18
Applied a total of 2 rules in 7 ms. Remains 25 /26 variables (removed 1) and now considering 18/19 (removed 1) transitions.
// Phase 1: matrix 18 rows 25 cols
[2021-05-16 20:21:19] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 20:21:19] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 18 rows 25 cols
[2021-05-16 20:21:19] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 20:21:19] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 25/32 places, 18/22 transitions.
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) p1), p1, p1]
Running random walk in product with property : GPPP-PT-C0001N0000000001-04 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s13 1) (GEQ s15 1)), p1:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 6431 reset in 247 ms.
Stack based approach found an accepted trace after 146 steps with 9 reset with depth 13 and stack size 13 in 1 ms.
FORMULA GPPP-PT-C0001N0000000001-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000001-04 finished in 807 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G((p1&&F(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:21:19] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 20:21:19] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:21:19] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 20:21:20] [INFO ] Implicit Places using invariants in 41 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 20:21:20] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:21:20] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 20:21:20] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:21:20] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : GPPP-PT-C0001N0000000001-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s12 1)), p1:(GEQ s17 1), p2:(OR (GEQ s17 1) (AND (GEQ s0 1) (GEQ s12 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 1 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000001-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000001-05 finished in 444 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0 U X(X((p0 U (p1||G(p0))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:21:20] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 20:21:20] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:21:20] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:21:20] [INFO ] Implicit Places using invariants in 47 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 20:21:20] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:21:20] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 20:21:20] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-16 20:21:20] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : GPPP-PT-C0001N0000000001-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s23 1)), p1:(AND (OR (LT s0 1) (LT s23 1)) (OR (LT s9 1) (LT s10 1) (LT s28 7)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000001-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000001-06 finished in 347 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(p0) U G(p1))||X(F((p1&&X(!p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:21:20] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:21:20] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:21:20] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:21:20] [INFO ] Implicit Places using invariants in 45 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 47 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 20:21:20] [INFO ] Computed 10 place invariants in 4 ms
[2021-05-16 20:21:20] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 20:21:20] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:21:20] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 420 ms :[(NOT p1), (OR (NOT p1) p2), (NOT p1), (AND p1 p2 (NOT p0)), (NOT p1), p2, (AND (NOT p1) p2), (AND (NOT p1) p2), (AND p1 (NOT p0) p2)]
Running random walk in product with property : GPPP-PT-C0001N0000000001-07 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND p1 p0), acceptance={} source=2 dest: 7}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p1 p0), acceptance={} source=3 dest: 8}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 1}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=7 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=7 dest: 6}, { cond=(AND p1 p0 p2), acceptance={} source=7 dest: 7}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=8 dest: 5}, { cond=(AND p1 p0 p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(GEQ s10 1), p0:(GEQ s5 2), p2:(OR (LT s0 1) (LT s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1747 reset in 187 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA GPPP-PT-C0001N0000000001-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000001-07 finished in 829 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:21:21] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 20:21:21] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:21:21] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 20:21:21] [INFO ] Implicit Places using invariants in 49 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 20:21:21] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:21:21] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 20:21:21] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-16 20:21:21] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 92 ms :[p0, p0]
Running random walk in product with property : GPPP-PT-C0001N0000000001-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s10 1)], 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 50000 reset in 124 ms.
Product exploration explored 100000 steps with 50000 reset in 178 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[p0, p0]
Product exploration explored 100000 steps with 50000 reset in 119 ms.
Product exploration explored 100000 steps with 50000 reset in 150 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 89 ms :[p0, p0]
Support contains 1 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 22/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 30 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 30 transition count 22
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 29 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 29 transition count 21
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 29 transition count 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 28 transition count 20
Deduced a syphon composed of 4 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 28 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 28 transition count 20
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 11 rules in 18 ms. Remains 28 /30 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 28 cols
[2021-05-16 20:21:22] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-16 20:21:22] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
[2021-05-16 20:21:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 28 cols
[2021-05-16 20:21:22] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-16 20:21:22] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 20/22 transitions.
Product exploration explored 100000 steps with 50000 reset in 535 ms.
Product exploration explored 100000 steps with 50000 reset in 485 ms.
[2021-05-16 20:21:24] [INFO ] Flatten gal took : 9 ms
[2021-05-16 20:21:24] [INFO ] Flatten gal took : 8 ms
[2021-05-16 20:21:24] [INFO ] Time to serialize gal into /tmp/LTL5819536291382649535.gal : 3 ms
[2021-05-16 20:21:24] [INFO ] Time to serialize properties into /tmp/LTL2945286689320120818.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5819536291382649535.gal, -t, CGAL, -LTL, /tmp/LTL2945286689320120818.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5819536291382649535.gal -t CGAL -LTL /tmp/LTL2945286689320120818.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(GAP<1)"))))
Formula 0 simplified : !XF"(GAP<1)"
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/21/1/22
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
42 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.45779,23472,1,0,46,28381,68,25,947,20371,56
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPPP-PT-C0001N0000000001-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property GPPP-PT-C0001N0000000001-08 finished in 3040 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:21:24] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:21:24] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:21:24] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 20:21:24] [INFO ] Implicit Places using invariants in 61 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 63 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 20:21:24] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:21:24] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 20:21:24] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:21:24] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 62 ms :[p0, p0]
Running random walk in product with property : GPPP-PT-C0001N0000000001-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s10 1)], 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 50000 reset in 85 ms.
Product exploration explored 100000 steps with 50000 reset in 78 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[p0, p0]
Product exploration explored 100000 steps with 50000 reset in 64 ms.
Product exploration explored 100000 steps with 50000 reset in 78 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 93 ms :[p0, p0]
Support contains 1 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 22/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 30 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 30 transition count 22
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 29 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 29 transition count 21
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 29 transition count 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 28 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 28 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 28 transition count 20
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 11 rules in 11 ms. Remains 28 /30 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 28 cols
[2021-05-16 20:21:25] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:21:25] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
[2021-05-16 20:21:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 28 cols
[2021-05-16 20:21:25] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:21:25] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 20/22 transitions.
Product exploration explored 100000 steps with 50000 reset in 368 ms.
Product exploration explored 100000 steps with 50000 reset in 354 ms.
[2021-05-16 20:21:26] [INFO ] Flatten gal took : 5 ms
[2021-05-16 20:21:26] [INFO ] Flatten gal took : 4 ms
[2021-05-16 20:21:26] [INFO ] Time to serialize gal into /tmp/LTL17603468349753711333.gal : 2 ms
[2021-05-16 20:21:26] [INFO ] Time to serialize properties into /tmp/LTL245704310996107248.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17603468349753711333.gal, -t, CGAL, -LTL, /tmp/LTL245704310996107248.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17603468349753711333.gal -t CGAL -LTL /tmp/LTL245704310996107248.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(GAP<1)"))))
Formula 0 simplified : !XF"(GAP<1)"
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/21/1/22
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
26 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.275155,23672,1,0,46,28381,68,25,947,20385,56
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPPP-PT-C0001N0000000001-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property GPPP-PT-C0001N0000000001-09 finished in 2159 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 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:21:26] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 20:21:26] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:21:26] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:21:26] [INFO ] Implicit Places using invariants in 39 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 20:21:26] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-16 20:21:26] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 20:21:26] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:21:26] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPPP-PT-C0001N0000000001-10 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:(AND (GEQ s3 1) (GEQ s4 1))], 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 12014 reset in 158 ms.
Stack based approach found an accepted trace after 131 steps with 16 reset with depth 7 and stack size 7 in 0 ms.
FORMULA GPPP-PT-C0001N0000000001-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000001-10 finished in 458 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))||F(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:21:27] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 20:21:27] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
// Phase 1: matrix 22 rows 32 cols
[2021-05-16 20:21:27] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 20:21:27] [INFO ] Implicit Places using invariants in 42 ms returned [2, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 20:21:27] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:21:27] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Starting structural reductions, iteration 1 : 30/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 30 cols
[2021-05-16 20:21:27] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:21:27] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 2 iterations. Remains : 30/32 places, 22/22 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPPP-PT-C0001N0000000001-11 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s15 1), p0:(AND (GEQ s7 1) (GEQ s11 1))], 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 7173 reset in 168 ms.
Product exploration explored 100000 steps with 7149 reset in 196 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 7265 reset in 167 ms.
Product exploration explored 100000 steps with 7221 reset in 194 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 30 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 30/30 places, 22/22 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 22
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 30 transition count 22
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 30 transition count 22
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 29 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 29 transition count 21
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 29 transition count 21
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 28 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 28 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 28 transition count 20
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 11 rules in 11 ms. Remains 28 /30 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 28 cols
[2021-05-16 20:21:28] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-16 20:21:28] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
[2021-05-16 20:21:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 28 cols
[2021-05-16 20:21:28] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:21:28] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/30 places, 20/22 transitions.
Stuttering criterion allowed to conclude after 412 steps with 30 reset in 5 ms.
FORMULA GPPP-PT-C0001N0000000001-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000001-11 finished in 1654 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((G(p0) U p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 32 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 31 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 31 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 30 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 28 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 26 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 25 transition count 17
Applied a total of 12 rules in 14 ms. Remains 25 /32 variables (removed 7) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 25 cols
[2021-05-16 20:21:28] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:21:28] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
// Phase 1: matrix 17 rows 25 cols
[2021-05-16 20:21:28] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-16 20:21:28] [INFO ] Implicit Places using invariants in 41 ms returned [2, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
[2021-05-16 20:21:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 23 cols
[2021-05-16 20:21:28] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-16 20:21:28] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 23/32 places, 17/22 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 19 transition count 14
Applied a total of 7 rules in 5 ms. Remains 19 /23 variables (removed 4) and now considering 14/17 (removed 3) transitions.
// Phase 1: matrix 14 rows 19 cols
[2021-05-16 20:21:28] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-16 20:21:29] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 14 rows 19 cols
[2021-05-16 20:21:29] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-16 20:21:29] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 19/32 places, 14/22 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPPP-PT-C0001N0000000001-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s16 1)), p0:(GEQ s10 1)], nbAcceptance=2, 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 258 reset in 414 ms.
Stack based approach found an accepted trace after 42 steps with 0 reset with depth 43 and stack size 43 in 0 ms.
FORMULA GPPP-PT-C0001N0000000001-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000001-14 finished in 794 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(F((p1||G((F(!p3)&&p2)))))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 32 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 32/32 places, 22/22 transitions.
Graph (trivial) has 2 edges and 32 vertex of which 2 / 32 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 28 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 9 place count 26 transition count 18
Applied a total of 9 rules in 18 ms. Remains 26 /32 variables (removed 6) and now considering 18/22 (removed 4) transitions.
// Phase 1: matrix 18 rows 26 cols
[2021-05-16 20:21:29] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:21:29] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
// Phase 1: matrix 18 rows 26 cols
[2021-05-16 20:21:29] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 20:21:29] [INFO ] Implicit Places using invariants in 34 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
[2021-05-16 20:21:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 25 cols
[2021-05-16 20:21:29] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-16 20:21:29] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 25/32 places, 18/22 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2021-05-16 20:21:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 25 cols
[2021-05-16 20:21:29] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-16 20:21:29] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 2 iterations. Remains : 25/32 places, 18/22 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (AND (NOT p1) (NOT p0) p3)]
Running random walk in product with property : GPPP-PT-C0001N0000000001-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p3 p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p3 p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p3 (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s0 7) (GEQ s17 7)), p1:(AND (GEQ s11 1) (GEQ s14 1)), p0:(GEQ s13 1), p3:(OR (LT s0 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA GPPP-PT-C0001N0000000001-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPPP-PT-C0001N0000000001-15 finished in 383 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621196491040

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="GPPP-PT-C0001N0000000001"
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-4028"
echo " Executing tool itstools"
echo " Input is GPPP-PT-C0001N0000000001, 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 r102-smll-162075331200165"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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