Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 14:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 14:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 11 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 13 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rwxr-xr-x 1 mcc users 60K May 18 16:42 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 IOTPpurchase-PT-C03M03P03D03-LTLFireability-00
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-01
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-02
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-03
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-04
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-05
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-06
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-07
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-08
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-09
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-10
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-11
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-12
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-13
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-14
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716715938830

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IOTPpurchase-PT-C03M03P03D03
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-26 09:32:22] [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]
[2024-05-26 09:32:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 09:32:22] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-05-26 09:32:22] [INFO ] Transformed 111 places.
[2024-05-26 09:32:22] [INFO ] Transformed 45 transitions.
[2024-05-26 09:32:22] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 262 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 19 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 88 transition count 45
Applied a total of 23 rules in 30 ms. Remains 88 /111 variables (removed 23) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 88 cols
[2024-05-26 09:32:22] [INFO ] Computed 44 invariants in 13 ms
[2024-05-26 09:32:23] [INFO ] Implicit Places using invariants in 351 ms returned [13, 21, 29]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 416 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 85/111 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 451 ms. Remains : 85/111 places, 45/45 transitions.
Support contains 53 out of 85 places after structural reductions.
[2024-05-26 09:32:23] [INFO ] Flatten gal took : 49 ms
[2024-05-26 09:32:23] [INFO ] Flatten gal took : 22 ms
[2024-05-26 09:32:23] [INFO ] Input system was already deterministic with 45 transitions.
Support contains 52 out of 85 places (down from 53) after GAL structural reductions.
Finished random walk after 1037 steps, including 0 resets, run visited all 23 properties in 109 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 1 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-06 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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((((!p2 U (p3||G(!p2)))||p1)&&p0))))'
Support contains 9 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 16 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 65 transition count 39
Reduce places removed 10 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 17 rules applied. Total rules applied 27 place count 55 transition count 32
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 34 place count 48 transition count 32
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 34 place count 48 transition count 22
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 58 place count 34 transition count 22
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 58 place count 34 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 62 place count 32 transition count 20
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 7 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 74 place count 25 transition count 15
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 24 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 75 place count 24 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 77 place count 23 transition count 14
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 4 with 5 rules applied. Total rules applied 82 place count 20 transition count 12
Applied a total of 82 rules in 30 ms. Remains 20 /85 variables (removed 65) and now considering 12/45 (removed 33) transitions.
// Phase 1: matrix 12 rows 20 cols
[2024-05-26 09:32:24] [INFO ] Computed 9 invariants in 2 ms
[2024-05-26 09:32:24] [INFO ] Implicit Places using invariants in 67 ms returned [2, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 69 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/85 places, 12/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 101 ms. Remains : 18/85 places, 12/45 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 388 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3)))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (AND p3 p0) (AND p1 p0)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p3) p2 (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p3 p0), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p3) p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p3:(AND (LT s13 1) (NOT (AND (GEQ s7 1) (GEQ s11 1)))), p0:(AND (GEQ s2 1) (GEQ s5 1) (GEQ s9 1) (GEQ s17 1)), p1:(OR (LT s8 1) (LT s14 1)), p2:(AND (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 633 ms.
Stack based approach found an accepted trace after 45 steps with 0 reset with depth 46 and stack size 46 in 1 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-01 finished in 1234 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 5 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 14 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 67 transition count 45
Applied a total of 18 rules in 7 ms. Remains 67 /85 variables (removed 18) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 67 cols
[2024-05-26 09:32:25] [INFO ] Computed 23 invariants in 10 ms
[2024-05-26 09:32:25] [INFO ] Implicit Places using invariants in 148 ms returned [15, 22]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 151 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/85 places, 45/45 transitions.
Applied a total of 0 rules in 7 ms. Remains 65 /65 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 165 ms. Remains : 65/85 places, 45/45 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LT s2 1), p0:(AND (GEQ s13 1) (GEQ s17 1) (GEQ s20 1) (GEQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 65 steps with 0 reset in 1 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-03 finished in 367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G((p1 U p2)))&&p0))))'
Support contains 11 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 12 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 70 transition count 45
Applied a total of 15 rules in 5 ms. Remains 70 /85 variables (removed 15) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 70 cols
[2024-05-26 09:32:25] [INFO ] Computed 26 invariants in 2 ms
[2024-05-26 09:32:26] [INFO ] Implicit Places using invariants in 116 ms returned [17, 24]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 118 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/85 places, 45/45 transitions.
Applied a total of 0 rules in 6 ms. Remains 68 /68 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 130 ms. Remains : 68/85 places, 45/45 transitions.
Stuttering acceptance computed with spot in 333 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s12 1) (GEQ s13 1) (GEQ s14 1) (GEQ s17 1) (GEQ s22 1) (GEQ s40 1)), p2:(AND (GEQ s5 1) (GEQ s12 1) (GEQ s13 1) (GEQ s14 1) (GEQ s...], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-04 finished in 491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0 U (p1||G(!p0))))))'
Support contains 7 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 14 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 67 transition count 45
Applied a total of 18 rules in 6 ms. Remains 67 /85 variables (removed 18) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 67 cols
[2024-05-26 09:32:26] [INFO ] Computed 23 invariants in 1 ms
[2024-05-26 09:32:26] [INFO ] Implicit Places using invariants in 114 ms returned [15, 22]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 116 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/85 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 65 /65 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 127 ms. Remains : 65/85 places, 45/45 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s33 1) (GEQ s54 1))) (NOT (AND (GEQ s13 1) (GEQ s17 1) (GEQ s20 1) (GEQ s28 1) (GEQ s52 1)))), p0:(AND (GEQ s33 1) (GEQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 420 ms.
Product exploration explored 100000 steps with 50000 reset in 338 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 p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-05 finished in 1172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!p0)||(!p0&&F((!p1||G(F(!p1))))))))'
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 17 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 65 transition count 45
Applied a total of 20 rules in 5 ms. Remains 65 /85 variables (removed 20) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2024-05-26 09:32:27] [INFO ] Computed 21 invariants in 2 ms
[2024-05-26 09:32:27] [INFO ] Implicit Places using invariants in 74 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 75 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/85 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83 ms. Remains : 63/85 places, 45/45 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, p1, p0, p0, (AND p1 p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GEQ s15 1) (GEQ s16 1)), p0:(AND (GEQ s20 1) (GEQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 150 ms.
Product exploration explored 100000 steps with 50000 reset in 142 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 p0) p1))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-08 finished in 570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G((p0||F(p1))))||(X(p3)&&p2))))'
Support contains 7 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 15 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 67 transition count 45
Applied a total of 18 rules in 4 ms. Remains 67 /85 variables (removed 18) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 67 cols
[2024-05-26 09:32:28] [INFO ] Computed 23 invariants in 3 ms
[2024-05-26 09:32:28] [INFO ] Implicit Places using invariants in 83 ms returned [16, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 86 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 65/85 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 95 ms. Remains : 65/85 places, 45/45 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s6 1) (GEQ s20 1) (GEQ s57 1)), p0:(AND (GEQ s22 1) (GEQ s24 1)), p1:(OR (AND (GEQ s6 1) (GEQ s20 1) (GEQ s57 1)) (AND (GEQ s11 1) (GEQ s14 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][false, false, false, false]]
Product exploration explored 100000 steps with 5169 reset in 245 ms.
Product exploration explored 100000 steps with 5184 reset in 277 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 p2) (NOT p0) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT p2))), true, (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))))]
Knowledge based reduction with 9 factoid took 287 ms. Reduced automaton from 4 states, 8 edges and 4 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 23 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT p2))), true, (X (X (NOT p1))), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 9 factoid took 366 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 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 45 rows 65 cols
[2024-05-26 09:32:30] [INFO ] Computed 21 invariants in 1 ms
[2024-05-26 09:32:30] [INFO ] [Real]Absence check using 16 positive place invariants in 11 ms returned sat
[2024-05-26 09:32:30] [INFO ] [Real]Absence check using 16 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-26 09:32:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 09:32:30] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-26 09:32:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 09:32:30] [INFO ] [Nat]Absence check using 16 positive place invariants in 10 ms returned sat
[2024-05-26 09:32:30] [INFO ] [Nat]Absence check using 16 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-26 09:32:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 09:32:30] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-26 09:32:30] [INFO ] Computed and/alt/rep : 44/48/44 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-26 09:32:30] [INFO ] Added : 41 causal constraints over 9 iterations in 152 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 7 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 65 /65 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-05-26 09:32:30] [INFO ] Invariant cache hit.
[2024-05-26 09:32:30] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-26 09:32:30] [INFO ] Invariant cache hit.
[2024-05-26 09:32:30] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-26 09:32:30] [INFO ] Invariant cache hit.
[2024-05-26 09:32:31] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 313 ms. Remains : 65/65 places, 45/45 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 (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 188 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 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 24 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 4 factoid took 251 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 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-26 09:32:32] [INFO ] Invariant cache hit.
[2024-05-26 09:32:32] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-26 09:32:32] [INFO ] [Real]Absence check using 16 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-26 09:32:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 09:32:32] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-26 09:32:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 09:32:32] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-05-26 09:32:32] [INFO ] [Nat]Absence check using 16 positive and 5 generalized place invariants in 4 ms returned sat
[2024-05-26 09:32:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-26 09:32:32] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-26 09:32:32] [INFO ] Computed and/alt/rep : 44/48/44 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-26 09:32:32] [INFO ] Added : 0 causal constraints over 0 iterations in 20 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 5186 reset in 212 ms.
Product exploration explored 100000 steps with 5213 reset in 259 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 7 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 45/45 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 65 transition count 45
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 7 place count 65 transition count 45
Deduced a syphon composed of 20 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 20 place count 65 transition count 45
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 26 place count 65 transition count 45
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 26 rules in 21 ms. Remains 65 /65 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-05-26 09:32:33] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 45 rows 65 cols
[2024-05-26 09:32:33] [INFO ] Computed 21 invariants in 2 ms
[2024-05-26 09:32:33] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/65 places, 45/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 65/65 places, 45/45 transitions.
Built C files in :
/tmp/ltsmin14694653264763523256
[2024-05-26 09:32:33] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14694653264763523256
Running compilation step : cd /tmp/ltsmin14694653264763523256;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 453 ms.
Running link step : cd /tmp/ltsmin14694653264763523256;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin14694653264763523256;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10636609498069558811.hoa' '--buchi-type=spotba'
LTSmin run took 5737 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-09 finished in 11649 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 17 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 64 transition count 36
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 27 rules applied. Total rules applied 40 place count 49 transition count 24
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 52 place count 37 transition count 24
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 52 place count 37 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 69 place count 27 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 69 place count 27 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 26 transition count 16
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 8 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 85 place count 18 transition count 10
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 3 with 2 rules applied. Total rules applied 87 place count 17 transition count 9
Applied a total of 87 rules in 11 ms. Remains 17 /85 variables (removed 68) and now considering 9/45 (removed 36) transitions.
// Phase 1: matrix 9 rows 17 cols
[2024-05-26 09:32:39] [INFO ] Computed 9 invariants in 0 ms
[2024-05-26 09:32:39] [INFO ] Implicit Places using invariants in 32 ms returned [1, 2, 5, 7]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 33 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/85 places, 9/45 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 11 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 11 transition count 6
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 9 transition count 6
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 10 place count 7 transition count 5
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 4 with 2 rules applied. Total rules applied 12 place count 6 transition count 4
Applied a total of 12 rules in 2 ms. Remains 6 /13 variables (removed 7) and now considering 4/9 (removed 5) transitions.
// Phase 1: matrix 4 rows 6 cols
[2024-05-26 09:32:39] [INFO ] Computed 3 invariants in 0 ms
[2024-05-26 09:32:39] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-26 09:32:39] [INFO ] Invariant cache hit.
[2024-05-26 09:32:39] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/85 places, 4/45 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 93 ms. Remains : 6/85 places, 4/45 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s3 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 120 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-10 finished in 262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0 U (F(G(p1)) U p2))))))'
Support contains 10 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 14 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 67 transition count 45
Applied a total of 18 rules in 2 ms. Remains 67 /85 variables (removed 18) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 67 cols
[2024-05-26 09:32:40] [INFO ] Computed 23 invariants in 3 ms
[2024-05-26 09:32:40] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-26 09:32:40] [INFO ] Invariant cache hit.
[2024-05-26 09:32:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-26 09:32:40] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-05-26 09:32:40] [INFO ] Invariant cache hit.
[2024-05-26 09:32:40] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 67/85 places, 45/45 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197 ms. Remains : 67/85 places, 45/45 transitions.
Stuttering acceptance computed with spot in 347 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s17 1) (GEQ s29 1) (GEQ s53 1)), p0:(AND (GEQ s32 1) (GEQ s44 1) (GEQ s5 1) (GEQ s13 1) (GEQ s14 1) (GEQ s22 1) (GEQ s64 1)), p1:(AND (GEQ s3...], 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 245 ms.
Stack based approach found an accepted trace after 193 steps with 0 reset with depth 194 and stack size 194 in 1 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-13 finished in 815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(F(p1)))))'
Support contains 3 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 45/45 transitions.
Ensure Unique test removed 17 places
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 65 transition count 45
Applied a total of 20 rules in 3 ms. Remains 65 /85 variables (removed 20) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 65 cols
[2024-05-26 09:32:40] [INFO ] Computed 21 invariants in 1 ms
[2024-05-26 09:32:41] [INFO ] Implicit Places using invariants in 91 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 93 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/85 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101 ms. Remains : 63/85 places, 45/45 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : IOTPpurchase-PT-C03M03P03D03-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s50 1), p1:(AND (GEQ s8 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1192 reset in 208 ms.
Product exploration explored 100000 steps with 1193 reset in 427 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 p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 98 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 5 factoid took 192 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 45 rows 63 cols
[2024-05-26 09:32:42] [INFO ] Computed 19 invariants in 1 ms
[2024-05-26 09:32:42] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-26 09:32:42] [INFO ] [Real]Absence check using 15 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-26 09:32:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 09:32:42] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-26 09:32:42] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-26 09:32:42] [INFO ] Added : 24 causal constraints over 5 iterations in 72 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-26 09:32:42] [INFO ] Invariant cache hit.
[2024-05-26 09:32:42] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-26 09:32:42] [INFO ] [Real]Absence check using 15 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-26 09:32:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 09:32:42] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-26 09:32:42] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-26 09:32:42] [INFO ] Added : 32 causal constraints over 7 iterations in 102 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-05-26 09:32:42] [INFO ] Invariant cache hit.
[2024-05-26 09:32:42] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-26 09:32:42] [INFO ] Invariant cache hit.
[2024-05-26 09:32:43] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-05-26 09:32:43] [INFO ] Invariant cache hit.
[2024-05-26 09:32:43] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 289 ms. Remains : 63/63 places, 45/45 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 (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 77 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=25 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 5 factoid took 185 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-26 09:32:43] [INFO ] Invariant cache hit.
[2024-05-26 09:32:43] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-05-26 09:32:43] [INFO ] [Real]Absence check using 15 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-26 09:32:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 09:32:44] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-26 09:32:44] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-26 09:32:44] [INFO ] Added : 24 causal constraints over 5 iterations in 72 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-26 09:32:44] [INFO ] Invariant cache hit.
[2024-05-26 09:32:44] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2024-05-26 09:32:44] [INFO ] [Real]Absence check using 15 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-26 09:32:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-26 09:32:44] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-26 09:32:44] [INFO ] Computed and/alt/rep : 44/46/44 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-26 09:32:44] [INFO ] Added : 32 causal constraints over 7 iterations in 96 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1198 reset in 198 ms.
Product exploration explored 100000 steps with 1188 reset in 237 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 45/45 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 63 transition count 45
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 8 place count 63 transition count 45
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 23 place count 63 transition count 45
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 63 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 62 transition count 44
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 62 transition count 44
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 31 rules in 18 ms. Remains 62 /63 variables (removed 1) and now considering 44/45 (removed 1) transitions.
[2024-05-26 09:32:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 44 rows 62 cols
[2024-05-26 09:32:45] [INFO ] Computed 19 invariants in 1 ms
[2024-05-26 09:32:45] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 62/63 places, 44/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119 ms. Remains : 62/63 places, 44/45 transitions.
Built C files in :
/tmp/ltsmin9330886844370668107
[2024-05-26 09:32:45] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9330886844370668107
Running compilation step : cd /tmp/ltsmin9330886844370668107;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 249 ms.
Running link step : cd /tmp/ltsmin9330886844370668107;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin9330886844370668107;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4253699910427316343.hoa' '--buchi-type=spotba'
LTSmin run took 596 ms.
FORMULA IOTPpurchase-PT-C03M03P03D03-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property IOTPpurchase-PT-C03M03P03D03-LTLFireability-15 finished in 5278 ms.
All properties solved by simple procedures.
Total runtime 23925 ms.

BK_STOP 1716715967516

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="IOTPpurchase-PT-C03M03P03D03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is IOTPpurchase-PT-C03M03P03D03, 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 r219-smll-171649598200233"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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