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.r083-tall-162048875900813.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FMS-PT-05000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875900813
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 104K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K Mar 28 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 28 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 10:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 10:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 18:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 18:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 16K 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 FMS-PT-05000-00
FORMULA_NAME FMS-PT-05000-01
FORMULA_NAME FMS-PT-05000-02
FORMULA_NAME FMS-PT-05000-03
FORMULA_NAME FMS-PT-05000-04
FORMULA_NAME FMS-PT-05000-05
FORMULA_NAME FMS-PT-05000-06
FORMULA_NAME FMS-PT-05000-07
FORMULA_NAME FMS-PT-05000-08
FORMULA_NAME FMS-PT-05000-09
FORMULA_NAME FMS-PT-05000-10
FORMULA_NAME FMS-PT-05000-11
FORMULA_NAME FMS-PT-05000-12
FORMULA_NAME FMS-PT-05000-13
FORMULA_NAME FMS-PT-05000-14
FORMULA_NAME FMS-PT-05000-15

=== Now, execution of the tool begins

BK_START 1620669319912

Running Version 0
[2021-05-10 17:55:21] [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-10 17:55:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 17:55:21] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2021-05-10 17:55:21] [INFO ] Transformed 22 places.
[2021-05-10 17:55:21] [INFO ] Transformed 20 transitions.
[2021-05-10 17:55:21] [INFO ] Parsed PT model containing 22 places and 20 transitions in 59 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-10 17:55:21] [INFO ] Initial state test concluded for 2 properties.
FORMULA FMS-PT-05000-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 8 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:21] [INFO ] Computed 6 place invariants in 6 ms
[2021-05-10 17:55:21] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:21] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-10 17:55:21] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:21] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-10 17:55:21] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
[2021-05-10 17:55:22] [INFO ] Flatten gal took : 18 ms
FORMULA FMS-PT-05000-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 17:55:22] [INFO ] Flatten gal took : 5 ms
[2021-05-10 17:55:22] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 100174 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=2044 ) properties (out of 23) seen :16
Running SMT prover for 7 properties.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:22] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:55:22] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-10 17:55:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 17:55:22] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-10 17:55:22] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-10 17:55:22] [INFO ] Added : 6 causal constraints over 2 iterations in 17 ms. Result :sat
[2021-05-10 17:55:22] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 17:55:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 17:55:22] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-10 17:55:22] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-10 17:55:22] [INFO ] Added : 7 causal constraints over 2 iterations in 20 ms. Result :sat
[2021-05-10 17:55:22] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 17:55:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 17:55:22] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-10 17:55:22] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-10 17:55:22] [INFO ] Added : 7 causal constraints over 2 iterations in 13 ms. Result :sat
[2021-05-10 17:55:22] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-10 17:55:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 17:55:22] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-10 17:55:22] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-10 17:55:22] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
[2021-05-10 17:55:22] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 17:55:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 17:55:22] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-10 17:55:22] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-10 17:55:22] [INFO ] Added : 9 causal constraints over 2 iterations in 14 ms. Result :sat
[2021-05-10 17:55:22] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 17:55:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 17:55:22] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-10 17:55:22] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-10 17:55:22] [INFO ] Added : 9 causal constraints over 2 iterations in 14 ms. Result :sat
[2021-05-10 17:55:22] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-10 17:55:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 17:55:22] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-10 17:55:22] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-10 17:55:22] [INFO ] Added : 7 causal constraints over 2 iterations in 10 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0||G(p1)))||G(p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 5 places and 0 transitions.
Graph (trivial) has 8 edges and 17 vertex of which 6 / 17 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 11 place count 13 transition count 15
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 19 place count 10 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 20 place count 9 transition count 10
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 21 place count 9 transition count 9
Applied a total of 21 rules in 9 ms. Remains 9 /22 variables (removed 13) and now considering 9/20 (removed 11) transitions.
// Phase 1: matrix 9 rows 9 cols
[2021-05-10 17:55:22] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 17:55:22] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2021-05-10 17:55:22] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 17:55:22] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-05-10 17:55:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2021-05-10 17:55:22] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-10 17:55:22] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/22 places, 9/20 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-05000-00 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s6 1)), p2:(OR (LT s2 1) (LT s7 1)), p1:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 24991 reset in 215 ms.
Product exploration explored 100000 steps with 24915 reset in 131 ms.
Knowledge obtained : [(NOT p0), p2, (NOT p1)]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 24950 reset in 112 ms.
Product exploration explored 100000 steps with 24917 reset in 129 ms.
[2021-05-10 17:55:23] [INFO ] Flatten gal took : 2 ms
[2021-05-10 17:55:23] [INFO ] Flatten gal took : 1 ms
[2021-05-10 17:55:23] [INFO ] Time to serialize gal into /tmp/LTL13542191984807922287.gal : 1 ms
[2021-05-10 17:55:23] [INFO ] Time to serialize properties into /tmp/LTL14821507683113566058.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/LTL13542191984807922287.gal, -t, CGAL, -LTL, /tmp/LTL14821507683113566058.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/LTL13542191984807922287.gal -t CGAL -LTL /tmp/LTL14821507683113566058.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F(("((P1wM1>=1)&&(M1>=1))")||(G("(P1s>=1)"))))||(G("((P1wP2<1)||(P2wP1<1))"))))
Formula 0 simplified : !(F("((P1wM1>=1)&&(M1>=1))" | G"(P1s>=1)") | G"((P1wP2<1)||(P2wP1<1))")
Detected timeout of ITS tools.
[2021-05-10 17:55:38] [INFO ] Flatten gal took : 1 ms
[2021-05-10 17:55:38] [INFO ] Applying decomposition
[2021-05-10 17:55:38] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7933676915795145375.txt, -o, /tmp/graph7933676915795145375.bin, -w, /tmp/graph7933676915795145375.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7933676915795145375.bin, -l, -1, -v, -w, /tmp/graph7933676915795145375.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-10 17:55:38] [INFO ] Decomposing Gal with order
[2021-05-10 17:55:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-10 17:55:38] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-10 17:55:38] [INFO ] Flatten gal took : 74 ms
[2021-05-10 17:55:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-10 17:55:38] [INFO ] Time to serialize gal into /tmp/LTL1546478808954654148.gal : 1 ms
[2021-05-10 17:55:38] [INFO ] Time to serialize properties into /tmp/LTL3158735200704683414.ltl : 0 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/LTL1546478808954654148.gal, -t, CGAL, -LTL, /tmp/LTL3158735200704683414.ltl, -c, -stutter-deadlock], 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/LTL1546478808954654148.gal -t CGAL -LTL /tmp/LTL3158735200704683414.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F(("((u1.P1wM1>=1)&&(u2.M1>=1))")||(G("(u0.P1s>=1)"))))||(G("((u0.P1wP2<1)||(u3.P2wP1<1))"))))
Formula 0 simplified : !(F("((u1.P1wM1>=1)&&(u2.M1>=1))" | G"(u0.P1s>=1)") | G"((u0.P1wP2<1)||(u3.P2wP1<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4223753312428896232
[2021-05-10 17:55:53] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4223753312428896232
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin4223753312428896232]
Compilation finished in 172 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4223753312428896232]
Link finished in 43 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (<>(((LTLAPp0==true)||[]((LTLAPp1==true))))||[]((LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin4223753312428896232]
LTSmin run took 551 ms.
FORMULA FMS-PT-05000-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FMS-PT-05000-00 finished in 32067 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0&&X(p1)) U (p2||X((G(p3) U (p2&&G(p3)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:54] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:55:54] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:54] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:55:54] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:54] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:55:54] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p3), (NOT p2), (OR (NOT p2) (AND (NOT p1) (NOT p3))), true, (OR (NOT p2) (NOT p3))]
Running random walk in product with property : FMS-PT-05000-01 automaton TGBA [mat=[[{ cond=p3, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 (NOT p1) p3), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(OR (AND (NOT p2) (NOT p0) p1) (AND (NOT p2) (NOT p1) p3)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 p3), acceptance={0} source=4 dest: 0}, { cond=(NOT p3), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p3:(GEQ s0 1), p2:(GEQ s3 1), p0:(GEQ s9 1), p1:(OR (LT s0 1) (LT s3 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 196 steps with 2 reset in 2 ms.
FORMULA FMS-PT-05000-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-05000-01 finished in 213 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0) U ((p1&&X(p0))||X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:54] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:55:54] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:54] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:55:54] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:54] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:55:54] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FMS-PT-05000-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LT s20 1), p1:(OR (LT s2 1) (LT s18 1) (LT s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FMS-PT-05000-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-05000-02 finished in 130 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(!p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:54] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:55:54] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:54] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:55:54] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:54] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:55:54] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, p1, (AND p1 (NOT p0)), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : FMS-PT-05000-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (LT s2 1) (LT s18 1)), p0:(GEQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, 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 FMS-PT-05000-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-05000-03 finished in 168 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 7 places and 0 transitions.
Graph (trivial) has 11 edges and 15 vertex of which 6 / 15 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 15 place count 11 transition count 13
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 22 place count 8 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 22 place count 8 transition count 8
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 24 place count 7 transition count 8
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 26 place count 6 transition count 7
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 6 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 27 place count 6 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 30 place count 4 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
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 33 place count 2 transition count 4
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 34 place count 2 transition count 3
Applied a total of 34 rules in 5 ms. Remains 2 /22 variables (removed 20) and now considering 3/20 (removed 17) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 17:55:54] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-10 17:55:54] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 17:55:54] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 17:55:55] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-10 17:55:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 17:55:55] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 17:55:55] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/22 places, 3/20 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-05000-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-05000-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-05000-04 finished in 85 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:55] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:55:55] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:55] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:55:55] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:55] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:55:55] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FMS-PT-05000-06 automaton TGBA [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=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s5 1) (GEQ s7 1)), p0:(GEQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FMS-PT-05000-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-05000-06 finished in 134 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 8 places and 0 transitions.
Graph (trivial) has 11 edges and 14 vertex of which 6 / 14 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 12 rules applied. Total rules applied 17 place count 10 transition count 12
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 25 place count 6 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 25 place count 6 transition count 7
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 27 place count 5 transition count 7
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 28 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 31 place count 3 transition count 5
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 3 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 33 place count 2 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 34 place count 2 transition count 3
Applied a total of 34 rules in 3 ms. Remains 2 /22 variables (removed 20) and now considering 3/20 (removed 17) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 17:55:55] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 17:55:55] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 17:55:55] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 17:55:55] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
[2021-05-10 17:55:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 17:55:55] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-10 17:55:55] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/22 places, 3/20 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-05000-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FMS-PT-05000-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-05000-08 finished in 70 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X(F(p1))&&p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:55] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:55:55] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:55] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:55:55] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:55] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:55:55] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 49 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FMS-PT-05000-09 automaton TGBA [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:(AND (LT s0 1) (LT s16 1)), p1:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 5773 reset in 224 ms.
Stack based approach found an accepted trace after 152 steps with 11 reset with depth 11 and stack size 11 in 0 ms.
FORMULA FMS-PT-05000-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-05000-09 finished in 335 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0||X((p1 U p2))) U G((p0 U (F(p3)&&X(p4))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:55] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:55:55] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:55] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:55:55] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:55] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:55:55] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 409 ms :[(OR (NOT p4) (NOT p3)), (NOT p4), (NOT p3), (AND (NOT p2) (NOT p4)), (NOT p4), (OR (AND p0 (NOT p2) (NOT p4)) (AND p1 (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2) p1), true, (NOT p2), (OR (AND p1 (NOT p4)) (AND p2 (NOT p4))), (OR (AND p0 (NOT p4)) (AND p2 (NOT p4)) (AND p1 (NOT p4))), (OR (AND p1 (NOT p2) (NOT p3) (NOT p4)) (AND p0 (NOT p2) (NOT p4))), (OR (AND p0 (NOT p4)) (AND p2 (NOT p4)) (AND p1 (NOT p4)))]
Running random walk in product with property : FMS-PT-05000-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(NOT p0), acceptance={0} source=0 dest: 4}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 (NOT p4)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p4)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p4)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p4)), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p4) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p4) (NOT p2) p1), acceptance={} source=3 dest: 8}], [{ cond=(NOT p4), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p4)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p4)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p4)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p4)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p4)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 9}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 10}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=5 dest: 11}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 12}], [{ cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p2) p1), acceptance={0} source=8 dest: 8}], [{ cond=(OR (AND (NOT p4) p2) (AND (NOT p4) p1)), acceptance={} source=9 dest: 7}], [{ cond=(NOT p0), acceptance={} source=10 dest: 9}, { cond=true, acceptance={} source=10 dest: 10}, { cond=p0, acceptance={} source=10 dest: 12}], [{ cond=(AND (NOT p3) (NOT p4) (NOT p2) p1), acceptance={} source=11 dest: 6}, { cond=(AND (NOT p0) (NOT p4) (NOT p2) (NOT p1)), acceptance={} source=11 dest: 9}, { cond=(AND p0 (NOT p4) (NOT p2) p1), acceptance={0} source=11 dest: 11}, { cond=(AND p0 (NOT p4) (NOT p2) (NOT p1)), acceptance={} source=11 dest: 12}], [{ cond=(AND (NOT p0) (NOT p4)), acceptance={} source=12 dest: 9}, { cond=(AND p0 (NOT p4)), acceptance={0} source=12 dest: 12}]], initial=0, aps=[p0:(GEQ s0 1), p3:(GEQ s19 1), p4:(GEQ s21 1), p2:(AND (GEQ s0 1) (GEQ s12 1)), p1:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 80 steps with 6 reset in 0 ms.
FORMULA FMS-PT-05000-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-05000-10 finished in 483 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:56] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-10 17:55:56] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:56] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:55:56] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:56] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:55:56] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : FMS-PT-05000-11 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(AND (GEQ s3 1) (GEQ s19 1)), p0:(OR (LT s8 1) (LT s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 2 steps with 0 reset in 0 ms.
FORMULA FMS-PT-05000-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-05000-11 finished in 168 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 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:56] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:55:56] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:56] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:55:56] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:56] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:55:56] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FMS-PT-05000-12 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s0 1), p1:(OR (GEQ s9 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FMS-PT-05000-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-05000-12 finished in 143 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(X(F((p0||G(p1)))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:56] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:55:56] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:56] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 17:55:56] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 17:55:56] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 17:55:56] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FMS-PT-05000-13 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(LT s4 1), p0:(AND (LT s20 1) (OR (LT s13 1) (LT s15 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 150 ms.
Stack based approach found an accepted trace after 50 steps with 0 reset with depth 51 and stack size 51 in 0 ms.
FORMULA FMS-PT-05000-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-05000-13 finished in 349 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 4 places and 0 transitions.
Graph (trivial) has 7 edges and 18 vertex of which 3 / 18 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 9 place count 16 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 15 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 12 place count 15 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 19 place count 11 transition count 11
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 21 place count 10 transition count 10
Applied a total of 21 rules in 3 ms. Remains 10 /22 variables (removed 12) and now considering 10/20 (removed 10) transitions.
// Phase 1: matrix 10 rows 10 cols
[2021-05-10 17:55:56] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-10 17:55:56] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-10 17:55:56] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 17:55:56] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2021-05-10 17:55:56] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-10 17:55:56] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-10 17:55:56] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/22 places, 10/20 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FMS-PT-05000-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s8 1) (GEQ s5 1)), p1:(OR (AND (GEQ s3 1) (GEQ s6 1)) (GEQ s8 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 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-05000-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-05000-14 finished in 155 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
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 6 rules applied. Total rules applied 6 place count 22 transition count 14
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 10 edges and 13 vertex of which 6 / 13 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 18 place count 9 transition count 12
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 24 place count 7 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24 place count 7 transition count 7
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 26 place count 6 transition count 7
Applied a total of 26 rules in 1 ms. Remains 6 /22 variables (removed 16) and now considering 7/20 (removed 13) transitions.
[2021-05-10 17:55:56] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 17:55:56] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 17:55:56] [INFO ] Implicit Places using invariants in 8 ms returned []
[2021-05-10 17:55:56] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 17:55:56] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 17:55:56] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2021-05-10 17:55:56] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-10 17:55:56] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 6 cols
[2021-05-10 17:55:56] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 17:55:56] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/22 places, 7/20 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-05000-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-05000-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-05000-15 finished in 156 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620669357790

--------------------
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="FMS-PT-05000"
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 FMS-PT-05000, 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 r083-tall-162048875900813"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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