Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.4M
-rw-r--r-- 1 mcc users 191K Feb 26 04:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 715K Feb 26 04:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 206K Feb 26 03:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 693K Feb 26 03:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 105K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 280K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 58K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 156K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 479K Feb 26 04:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.8M Feb 26 04:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 273K Feb 26 04:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 930K Feb 26 04:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 41K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 534K Mar 5 18:22 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 BART-PT-002-LTLFireability-00
FORMULA_NAME BART-PT-002-LTLFireability-01
FORMULA_NAME BART-PT-002-LTLFireability-02
FORMULA_NAME BART-PT-002-LTLFireability-03
FORMULA_NAME BART-PT-002-LTLFireability-04
FORMULA_NAME BART-PT-002-LTLFireability-05
FORMULA_NAME BART-PT-002-LTLFireability-06
FORMULA_NAME BART-PT-002-LTLFireability-07
FORMULA_NAME BART-PT-002-LTLFireability-08
FORMULA_NAME BART-PT-002-LTLFireability-09
FORMULA_NAME BART-PT-002-LTLFireability-10
FORMULA_NAME BART-PT-002-LTLFireability-11
FORMULA_NAME BART-PT-002-LTLFireability-12
FORMULA_NAME BART-PT-002-LTLFireability-13
FORMULA_NAME BART-PT-002-LTLFireability-14
FORMULA_NAME BART-PT-002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678526085549

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-002
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 09:14:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 09:14:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 09:14:47] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2023-03-11 09:14:47] [INFO ] Transformed 474 places.
[2023-03-11 09:14:47] [INFO ] Transformed 404 transitions.
[2023-03-11 09:14:47] [INFO ] Found NUPN structural information;
[2023-03-11 09:14:47] [INFO ] Parsed PT model containing 474 places and 404 transitions and 3240 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 210 places and 0 transitions.
FORMULA BART-PT-002-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-PT-002-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 264 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 10 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
// Phase 1: matrix 404 rows 264 cols
[2023-03-11 09:14:47] [INFO ] Computed 2 place invariants in 13 ms
[2023-03-11 09:14:47] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-11 09:14:47] [INFO ] Invariant cache hit.
[2023-03-11 09:14:48] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2023-03-11 09:14:48] [INFO ] Invariant cache hit.
[2023-03-11 09:14:48] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 695 ms. Remains : 264/264 places, 404/404 transitions.
Support contains 264 out of 264 places after structural reductions.
[2023-03-11 09:14:48] [INFO ] Flatten gal took : 62 ms
[2023-03-11 09:14:48] [INFO ] Flatten gal took : 24 ms
[2023-03-11 09:14:48] [INFO ] Input system was already deterministic with 404 transitions.
Finished random walk after 2758 steps, including 0 resets, run visited all 25 properties in 64 ms. (steps per millisecond=43 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 178 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 264 transition count 400
Reduce places removed 4 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 22 rules applied. Total rules applied 26 place count 260 transition count 382
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 44 place count 242 transition count 382
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 44 place count 242 transition count 374
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 60 place count 234 transition count 374
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 72 place count 222 transition count 362
Iterating global reduction 3 with 12 rules applied. Total rules applied 84 place count 222 transition count 362
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 86 place count 222 transition count 360
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 92 place count 216 transition count 354
Iterating global reduction 4 with 6 rules applied. Total rules applied 98 place count 216 transition count 354
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 104 place count 210 transition count 348
Iterating global reduction 4 with 6 rules applied. Total rules applied 110 place count 210 transition count 348
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 116 place count 204 transition count 342
Iterating global reduction 4 with 6 rules applied. Total rules applied 122 place count 204 transition count 342
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 126 place count 200 transition count 338
Iterating global reduction 4 with 4 rules applied. Total rules applied 130 place count 200 transition count 338
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 134 place count 196 transition count 334
Iterating global reduction 4 with 4 rules applied. Total rules applied 138 place count 196 transition count 334
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 140 place count 194 transition count 332
Iterating global reduction 4 with 2 rules applied. Total rules applied 142 place count 194 transition count 332
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 166 place count 182 transition count 320
Applied a total of 166 rules in 63 ms. Remains 182 /264 variables (removed 82) and now considering 320/404 (removed 84) transitions.
// Phase 1: matrix 320 rows 182 cols
[2023-03-11 09:14:49] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 09:14:49] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-11 09:14:49] [INFO ] Invariant cache hit.
[2023-03-11 09:14:49] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2023-03-11 09:14:49] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-11 09:14:49] [INFO ] Invariant cache hit.
[2023-03-11 09:14:49] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 182/264 places, 320/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 357 ms. Remains : 182/264 places, 320/404 transitions.
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BART-PT-002-LTLFireability-00 automaton TGBA Formula[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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s2 1) (EQ s3 1)), p1:(AND (NEQ s129 1) (NEQ s59 1) (NEQ s78 1) (NEQ s61 1) (NEQ s127 1) (NEQ s142 1) (NEQ s80 1) (NEQ s125 1) (NEQ s171 1) (NEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 697 ms.
Stack based approach found an accepted trace after 82 steps with 6 reset with depth 29 and stack size 29 in 2 ms.
FORMULA BART-PT-002-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-002-LTLFireability-00 finished in 1368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 154 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 5 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
// Phase 1: matrix 404 rows 264 cols
[2023-03-11 09:14:50] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-11 09:14:50] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-11 09:14:50] [INFO ] Invariant cache hit.
[2023-03-11 09:14:50] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-11 09:14:50] [INFO ] Invariant cache hit.
[2023-03-11 09:14:51] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 388 ms. Remains : 264/264 places, 404/404 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-002-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s92 1) (EQ s98 1) (EQ s242 1) (EQ s8 1) (EQ s172 1) (EQ s157 1) (EQ s91 1) (EQ s178 1) (EQ s83 1) (EQ s163 1) (EQ s171 1) (EQ s84 1) (EQ s9 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][false, false, false]]
Product exploration explored 100000 steps with 33088 reset in 455 ms.
Product exploration explored 100000 steps with 33093 reset in 386 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 : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 457 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 116 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-11 09:14:52] [INFO ] Invariant cache hit.
[2023-03-11 09:14:53] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-11 09:14:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:14:54] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2023-03-11 09:14:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:14:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-11 09:14:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:14:54] [INFO ] [Nat]Absence check using state equation in 189 ms returned sat
[2023-03-11 09:14:55] [INFO ] Computed and/alt/rep : 332/540/332 causal constraints (skipped 0 transitions) in 26 ms.
[2023-03-11 09:14:57] [INFO ] Added : 332 causal constraints over 67 iterations in 2153 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 154 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 12 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2023-03-11 09:14:57] [INFO ] Invariant cache hit.
[2023-03-11 09:14:57] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-11 09:14:57] [INFO ] Invariant cache hit.
[2023-03-11 09:14:57] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2023-03-11 09:14:57] [INFO ] Invariant cache hit.
[2023-03-11 09:14:57] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 489 ms. Remains : 264/264 places, 404/404 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 : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 119 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-11 09:14:58] [INFO ] Invariant cache hit.
[2023-03-11 09:14:59] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-11 09:14:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 09:14:59] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2023-03-11 09:14:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 09:15:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-11 09:15:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 09:15:00] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2023-03-11 09:15:00] [INFO ] Computed and/alt/rep : 332/540/332 causal constraints (skipped 0 transitions) in 32 ms.
[2023-03-11 09:15:03] [INFO ] Added : 332 causal constraints over 67 iterations in 3159 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33082 reset in 402 ms.
Product exploration explored 100000 steps with 33079 reset in 406 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 154 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 264 transition count 404
Deduced a syphon composed of 48 places in 0 ms
Applied a total of 48 rules in 41 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2023-03-11 09:15:05] [INFO ] Redundant transitions in 17 ms returned []
// Phase 1: matrix 404 rows 264 cols
[2023-03-11 09:15:05] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-11 09:15:05] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 264/264 places, 404/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 322 ms. Remains : 264/264 places, 404/404 transitions.
Built C files in :
/tmp/ltsmin10305114282646195068
[2023-03-11 09:15:05] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10305114282646195068
Running compilation step : cd /tmp/ltsmin10305114282646195068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 682 ms.
Running link step : cd /tmp/ltsmin10305114282646195068;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin10305114282646195068;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12794964186850086464.hoa' '--buchi-type=spotba'
LTSmin run took 488 ms.
FORMULA BART-PT-002-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-PT-002-LTLFireability-01 finished in 16187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)&&p0))))'
Support contains 154 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 4 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
// Phase 1: matrix 404 rows 264 cols
[2023-03-11 09:15:06] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 09:15:06] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-11 09:15:06] [INFO ] Invariant cache hit.
[2023-03-11 09:15:07] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-11 09:15:07] [INFO ] Invariant cache hit.
[2023-03-11 09:15:07] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 380 ms. Remains : 264/264 places, 404/404 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-002-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s92 1) (NEQ s98 1) (NEQ s242 1) (NEQ s8 1) (NEQ s172 1) (NEQ s157 1) (NEQ s91 1) (NEQ s178 1) (NEQ s83 1) (NEQ s163 1) (NEQ s171 1) (NEQ s84 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5480 reset in 481 ms.
Stack based approach found an accepted trace after 58 steps with 4 reset with depth 8 and stack size 8 in 0 ms.
FORMULA BART-PT-002-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-002-LTLFireability-02 finished in 1000 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((X(p0)&&X(F(X((X(p1) U p2))))))))'
Support contains 20 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 218 transition count 358
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 218 transition count 358
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 130 place count 180 transition count 320
Iterating global reduction 0 with 38 rules applied. Total rules applied 168 place count 180 transition count 320
Applied a total of 168 rules in 23 ms. Remains 180 /264 variables (removed 84) and now considering 320/404 (removed 84) transitions.
// Phase 1: matrix 320 rows 180 cols
[2023-03-11 09:15:07] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-11 09:15:07] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-11 09:15:07] [INFO ] Invariant cache hit.
[2023-03-11 09:15:08] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-11 09:15:08] [INFO ] Invariant cache hit.
[2023-03-11 09:15:08] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/264 places, 320/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 437 ms. Remains : 180/264 places, 320/404 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : BART-PT-002-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p2:(OR (EQ s0 1) (EQ s0 1) (EQ s1 1) (EQ s0 1) (EQ s1 1) (EQ s0 1) (EQ s1 1) (EQ s0 1) (EQ s0 1) (EQ s0 1) (EQ s1 1) (EQ s0 1) (EQ s1 1) (EQ s1 1) (EQ s1 ...], 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][false, false, false, false]]
Product exploration explored 100000 steps with 5192 reset in 218 ms.
Product exploration explored 100000 steps with 5207 reset in 167 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 p2 p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 154 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
Finished random walk after 6 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p2 p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p2)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 148 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 215 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
Support contains 20 out of 180 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 320/320 transitions.
Applied a total of 0 rules in 7 ms. Remains 180 /180 variables (removed 0) and now considering 320/320 (removed 0) transitions.
[2023-03-11 09:15:09] [INFO ] Invariant cache hit.
[2023-03-11 09:15:09] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-11 09:15:09] [INFO ] Invariant cache hit.
[2023-03-11 09:15:09] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2023-03-11 09:15:10] [INFO ] Invariant cache hit.
[2023-03-11 09:15:10] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 318 ms. Remains : 180/180 places, 320/320 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 p2 p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
Finished random walk after 13 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p2 p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p2)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 167 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 272 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 286 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 5215 reset in 186 ms.
Product exploration explored 100000 steps with 5217 reset in 151 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 228 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
Support contains 20 out of 180 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 180/180 places, 320/320 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 180 transition count 320
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 22 place count 180 transition count 320
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 32 place count 180 transition count 320
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 178 transition count 318
Deduced a syphon composed of 30 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 178 transition count 318
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 70 places in 1 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 76 place count 178 transition count 320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 78 place count 178 transition count 318
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 116 place count 140 transition count 280
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 154 place count 140 transition count 280
Performed 66 Post agglomeration using F-continuation condition with reduction of 96 identical transitions.
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 2 with 66 rules applied. Total rules applied 220 place count 140 transition count 1204
Ensure Unique test removed 562 transitions
Reduce isomorphic transitions removed 562 transitions.
Iterating post reduction 2 with 562 rules applied. Total rules applied 782 place count 140 transition count 642
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 832 place count 90 transition count 202
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 3 with 50 rules applied. Total rules applied 882 place count 90 transition count 202
Deduced a syphon composed of 48 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 884 place count 90 transition count 200
Deduced a syphon composed of 48 places in 0 ms
Applied a total of 884 rules in 60 ms. Remains 90 /180 variables (removed 90) and now considering 200/320 (removed 120) transitions.
[2023-03-11 09:15:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 200 rows 90 cols
[2023-03-11 09:15:12] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 09:15:12] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/180 places, 200/320 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 176 ms. Remains : 90/180 places, 200/320 transitions.
Built C files in :
/tmp/ltsmin17613140552506504180
[2023-03-11 09:15:12] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17613140552506504180
Running compilation step : cd /tmp/ltsmin17613140552506504180;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 414 ms.
Running link step : cd /tmp/ltsmin17613140552506504180;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin17613140552506504180;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3420530091602109506.hoa' '--buchi-type=spotba'
LTSmin run took 354 ms.
FORMULA BART-PT-002-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-PT-002-LTLFireability-03 finished in 5185 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p1))&&p0)))'
Support contains 138 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 258 transition count 398
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 258 transition count 398
Applied a total of 12 rules in 9 ms. Remains 258 /264 variables (removed 6) and now considering 398/404 (removed 6) transitions.
// Phase 1: matrix 398 rows 258 cols
[2023-03-11 09:15:13] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 09:15:13] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-11 09:15:13] [INFO ] Invariant cache hit.
[2023-03-11 09:15:13] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2023-03-11 09:15:13] [INFO ] Invariant cache hit.
[2023-03-11 09:15:13] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 258/264 places, 398/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 300 ms. Remains : 258/264 places, 398/404 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : BART-PT-002-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (EQ s86 1) (EQ s92 1) (EQ s236 1) (EQ s8 1) (EQ s166 1) (EQ s151 1) (EQ s85 1) (EQ s172 1) (EQ s77 1) (EQ s157 1) (EQ s165 1) (EQ s78 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 194 ms.
Stack based approach found an accepted trace after 99 steps with 0 reset with depth 100 and stack size 100 in 0 ms.
FORMULA BART-PT-002-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-002-LTLFireability-04 finished in 606 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p1&&F(p2)))||G(p1)||p0)))'
Support contains 244 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Applied a total of 0 rules in 1 ms. Remains 264 /264 variables (removed 0) and now considering 404/404 (removed 0) transitions.
// Phase 1: matrix 404 rows 264 cols
[2023-03-11 09:15:13] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-11 09:15:13] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-11 09:15:13] [INFO ] Invariant cache hit.
[2023-03-11 09:15:13] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2023-03-11 09:15:13] [INFO ] Invariant cache hit.
[2023-03-11 09:15:14] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 499 ms. Remains : 264/264 places, 404/404 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : BART-PT-002-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(AND (EQ s201 0) (EQ s109 0) (EQ s134 0) (EQ s111 0) (EQ s199 0) (EQ s220 0) (EQ s136 0) (EQ s197 0) (EQ s253 0) (EQ s223 0) (EQ s44 0) (EQ s251 0) (EQ...], 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 39219 reset in 468 ms.
Stack based approach found an accepted trace after 175 steps with 50 reset with depth 76 and stack size 76 in 1 ms.
FORMULA BART-PT-002-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-002-LTLFireability-05 finished in 1205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&X(X(X(G(p1))))))))'
Support contains 20 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 218 transition count 358
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 218 transition count 358
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 130 place count 180 transition count 320
Iterating global reduction 0 with 38 rules applied. Total rules applied 168 place count 180 transition count 320
Applied a total of 168 rules in 6 ms. Remains 180 /264 variables (removed 84) and now considering 320/404 (removed 84) transitions.
// Phase 1: matrix 320 rows 180 cols
[2023-03-11 09:15:14] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-11 09:15:14] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-11 09:15:14] [INFO ] Invariant cache hit.
[2023-03-11 09:15:15] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-03-11 09:15:15] [INFO ] Invariant cache hit.
[2023-03-11 09:15:15] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/264 places, 320/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 316 ms. Remains : 180/264 places, 320/404 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : BART-PT-002-LTLFireability-06 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=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 6}, { cond=(NOT p1), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s2 0) (EQ s3 0)), p1:(OR (EQ s14 1) (EQ s54 1) (EQ s55 1) (EQ s24 1) (EQ s15 1) (EQ s49 1) (EQ s60 1) (EQ s48 1) (EQ s61 1) (EQ s67 1) (EQ s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA BART-PT-002-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-06 finished in 647 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((G(p0) U p1))||G(F(p2)))))'
Support contains 3 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Graph (trivial) has 398 edges and 264 vertex of which 257 / 264 are part of one of the 2 SCC in 5 ms
Free SCC test removed 255 places
Ensure Unique test removed 392 transitions
Reduce isomorphic transitions removed 392 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 7 transition count 10
Applied a total of 4 rules in 8 ms. Remains 7 /264 variables (removed 257) and now considering 10/404 (removed 394) transitions.
// Phase 1: matrix 10 rows 7 cols
[2023-03-11 09:15:15] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 09:15:15] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-11 09:15:15] [INFO ] Invariant cache hit.
[2023-03-11 09:15:15] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-11 09:15:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 09:15:15] [INFO ] Invariant cache hit.
[2023-03-11 09:15:15] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/264 places, 10/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 7/264 places, 10/404 transitions.
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BART-PT-002-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s4 0), p1:(EQ s0 1), p0:(NEQ s2 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA BART-PT-002-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-08 finished in 345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(G(p1)))))'
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Graph (trivial) has 398 edges and 264 vertex of which 132 / 264 are part of one of the 1 SCC in 0 ms
Free SCC test removed 131 places
Ensure Unique test removed 201 transitions
Reduce isomorphic transitions removed 201 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 132 transition count 140
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 69 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 129 place count 68 transition count 139
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 129 place count 68 transition count 135
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 137 place count 64 transition count 135
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 143 place count 58 transition count 129
Iterating global reduction 3 with 6 rules applied. Total rules applied 149 place count 58 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 150 place count 58 transition count 128
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 154 place count 54 transition count 124
Iterating global reduction 4 with 4 rules applied. Total rules applied 158 place count 54 transition count 124
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 161 place count 51 transition count 121
Iterating global reduction 4 with 3 rules applied. Total rules applied 164 place count 51 transition count 121
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 167 place count 48 transition count 118
Iterating global reduction 4 with 3 rules applied. Total rules applied 170 place count 48 transition count 118
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 172 place count 46 transition count 116
Iterating global reduction 4 with 2 rules applied. Total rules applied 174 place count 46 transition count 116
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 176 place count 44 transition count 114
Iterating global reduction 4 with 2 rules applied. Total rules applied 178 place count 44 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 179 place count 43 transition count 113
Iterating global reduction 4 with 1 rules applied. Total rules applied 180 place count 43 transition count 113
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 194 place count 36 transition count 106
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 198 place count 36 transition count 102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 202 place count 34 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 206 place count 34 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 210 place count 32 transition count 94
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 214 place count 32 transition count 90
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 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 218 place count 30 transition count 88
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 222 place count 30 transition count 84
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 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 226 place count 28 transition count 82
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 230 place count 28 transition count 78
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 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 234 place count 26 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 238 place count 26 transition count 72
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 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 242 place count 24 transition count 70
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 246 place count 24 transition count 66
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 11 with 2 rules applied. Total rules applied 248 place count 23 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 250 place count 23 transition count 63
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 12 with 2 rules applied. Total rules applied 252 place count 22 transition count 62
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 254 place count 22 transition count 60
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 13 with 2 rules applied. Total rules applied 256 place count 21 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 258 place count 21 transition count 57
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 14 with 2 rules applied. Total rules applied 260 place count 20 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 262 place count 20 transition count 54
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 15 with 2 rules applied. Total rules applied 264 place count 19 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 266 place count 19 transition count 51
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 16 with 2 rules applied. Total rules applied 268 place count 18 transition count 50
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 270 place count 18 transition count 48
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 17 with 2 rules applied. Total rules applied 272 place count 17 transition count 47
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 274 place count 17 transition count 45
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 18 with 2 rules applied. Total rules applied 276 place count 16 transition count 44
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 278 place count 16 transition count 42
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 19 with 2 rules applied. Total rules applied 280 place count 15 transition count 41
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 282 place count 15 transition count 39
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 20 with 2 rules applied. Total rules applied 284 place count 14 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 286 place count 14 transition count 36
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 21 with 2 rules applied. Total rules applied 288 place count 13 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 290 place count 13 transition count 33
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 22 with 2 rules applied. Total rules applied 292 place count 12 transition count 32
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 294 place count 12 transition count 30
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 23 with 2 rules applied. Total rules applied 296 place count 11 transition count 29
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 298 place count 11 transition count 27
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 24 with 2 rules applied. Total rules applied 300 place count 10 transition count 26
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 302 place count 10 transition count 24
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 25 with 2 rules applied. Total rules applied 304 place count 9 transition count 23
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 25 with 2 rules applied. Total rules applied 306 place count 9 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 26 with 2 rules applied. Total rules applied 308 place count 8 transition count 20
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 26 with 2 rules applied. Total rules applied 310 place count 8 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 27 with 2 rules applied. Total rules applied 312 place count 7 transition count 17
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 27 with 2 rules applied. Total rules applied 314 place count 7 transition count 15
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 28 with 2 rules applied. Total rules applied 316 place count 6 transition count 14
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 318 place count 6 transition count 12
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 29 with 2 rules applied. Total rules applied 320 place count 5 transition count 11
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 322 place count 5 transition count 9
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 30 with 2 rules applied. Total rules applied 324 place count 5 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 30 with 1 Pre rules applied. Total rules applied 324 place count 5 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 30 with 2 rules applied. Total rules applied 326 place count 4 transition count 6
Applied a total of 326 rules in 30 ms. Remains 4 /264 variables (removed 260) and now considering 6/404 (removed 398) transitions.
// Phase 1: matrix 6 rows 4 cols
[2023-03-11 09:15:15] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 09:15:15] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-11 09:15:15] [INFO ] Invariant cache hit.
[2023-03-11 09:15:15] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-11 09:15:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 09:15:15] [INFO ] Invariant cache hit.
[2023-03-11 09:15:15] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/264 places, 6/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 4/264 places, 6/404 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BART-PT-002-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s3 0), p1:(EQ s1 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA BART-PT-002-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-09 finished in 268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&F((p1||G(F(p2)))))))))'
Support contains 3 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 201 transition count 341
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 201 transition count 341
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 179 place count 148 transition count 288
Iterating global reduction 0 with 53 rules applied. Total rules applied 232 place count 148 transition count 288
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 239 place count 141 transition count 281
Iterating global reduction 0 with 7 rules applied. Total rules applied 246 place count 141 transition count 281
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 251 place count 136 transition count 276
Iterating global reduction 0 with 5 rules applied. Total rules applied 256 place count 136 transition count 276
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 261 place count 131 transition count 271
Iterating global reduction 0 with 5 rules applied. Total rules applied 266 place count 131 transition count 271
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 271 place count 126 transition count 266
Iterating global reduction 0 with 5 rules applied. Total rules applied 276 place count 126 transition count 266
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 281 place count 121 transition count 261
Iterating global reduction 0 with 5 rules applied. Total rules applied 286 place count 121 transition count 261
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 291 place count 116 transition count 256
Iterating global reduction 0 with 5 rules applied. Total rules applied 296 place count 116 transition count 256
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 300 place count 112 transition count 252
Iterating global reduction 0 with 4 rules applied. Total rules applied 304 place count 112 transition count 252
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 308 place count 108 transition count 248
Iterating global reduction 0 with 4 rules applied. Total rules applied 312 place count 108 transition count 248
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 314 place count 106 transition count 246
Iterating global reduction 0 with 2 rules applied. Total rules applied 316 place count 106 transition count 246
Applied a total of 316 rules in 38 ms. Remains 106 /264 variables (removed 158) and now considering 246/404 (removed 158) transitions.
// Phase 1: matrix 246 rows 106 cols
[2023-03-11 09:15:16] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-11 09:15:16] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-11 09:15:16] [INFO ] Invariant cache hit.
[2023-03-11 09:15:16] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2023-03-11 09:15:16] [INFO ] Invariant cache hit.
[2023-03-11 09:15:16] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 106/264 places, 246/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 285 ms. Remains : 106/264 places, 246/404 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BART-PT-002-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s26 0), p1:(EQ s1 1), p2:(EQ s2 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 249 steps with 8 reset in 4 ms.
FORMULA BART-PT-002-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-10 finished in 629 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&F(p1))))))'
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 202 transition count 342
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 202 transition count 342
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 176 place count 150 transition count 290
Iterating global reduction 0 with 52 rules applied. Total rules applied 228 place count 150 transition count 290
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 236 place count 142 transition count 282
Iterating global reduction 0 with 8 rules applied. Total rules applied 244 place count 142 transition count 282
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 250 place count 136 transition count 276
Iterating global reduction 0 with 6 rules applied. Total rules applied 256 place count 136 transition count 276
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 261 place count 131 transition count 271
Iterating global reduction 0 with 5 rules applied. Total rules applied 266 place count 131 transition count 271
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 271 place count 126 transition count 266
Iterating global reduction 0 with 5 rules applied. Total rules applied 276 place count 126 transition count 266
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 281 place count 121 transition count 261
Iterating global reduction 0 with 5 rules applied. Total rules applied 286 place count 121 transition count 261
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 291 place count 116 transition count 256
Iterating global reduction 0 with 5 rules applied. Total rules applied 296 place count 116 transition count 256
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 299 place count 113 transition count 253
Iterating global reduction 0 with 3 rules applied. Total rules applied 302 place count 113 transition count 253
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 305 place count 110 transition count 250
Iterating global reduction 0 with 3 rules applied. Total rules applied 308 place count 110 transition count 250
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 309 place count 109 transition count 249
Iterating global reduction 0 with 1 rules applied. Total rules applied 310 place count 109 transition count 249
Applied a total of 310 rules in 16 ms. Remains 109 /264 variables (removed 155) and now considering 249/404 (removed 155) transitions.
// Phase 1: matrix 249 rows 109 cols
[2023-03-11 09:15:16] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 09:15:16] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-11 09:15:16] [INFO ] Invariant cache hit.
[2023-03-11 09:15:16] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-11 09:15:16] [INFO ] Invariant cache hit.
[2023-03-11 09:15:17] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/264 places, 249/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 297 ms. Remains : 109/264 places, 249/404 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : BART-PT-002-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s18 1) (EQ s61 1)), p1:(EQ s61 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BART-PT-002-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-12 finished in 471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0 U (G(p0)||(p0&&G(p1))))))))'
Support contains 2 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 200 transition count 340
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 200 transition count 340
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 182 place count 146 transition count 286
Iterating global reduction 0 with 54 rules applied. Total rules applied 236 place count 146 transition count 286
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 244 place count 138 transition count 278
Iterating global reduction 0 with 8 rules applied. Total rules applied 252 place count 138 transition count 278
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 258 place count 132 transition count 272
Iterating global reduction 0 with 6 rules applied. Total rules applied 264 place count 132 transition count 272
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 270 place count 126 transition count 266
Iterating global reduction 0 with 6 rules applied. Total rules applied 276 place count 126 transition count 266
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 282 place count 120 transition count 260
Iterating global reduction 0 with 6 rules applied. Total rules applied 288 place count 120 transition count 260
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 294 place count 114 transition count 254
Iterating global reduction 0 with 6 rules applied. Total rules applied 300 place count 114 transition count 254
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 306 place count 108 transition count 248
Iterating global reduction 0 with 6 rules applied. Total rules applied 312 place count 108 transition count 248
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 316 place count 104 transition count 244
Iterating global reduction 0 with 4 rules applied. Total rules applied 320 place count 104 transition count 244
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 324 place count 100 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 328 place count 100 transition count 240
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 330 place count 98 transition count 238
Iterating global reduction 0 with 2 rules applied. Total rules applied 332 place count 98 transition count 238
Applied a total of 332 rules in 9 ms. Remains 98 /264 variables (removed 166) and now considering 238/404 (removed 166) transitions.
// Phase 1: matrix 238 rows 98 cols
[2023-03-11 09:15:17] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 09:15:17] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-11 09:15:17] [INFO ] Invariant cache hit.
[2023-03-11 09:15:17] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2023-03-11 09:15:17] [INFO ] Invariant cache hit.
[2023-03-11 09:15:17] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/264 places, 238/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 270 ms. Remains : 98/264 places, 238/404 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BART-PT-002-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s17 1), p0:(EQ s1 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 134 ms.
Stack based approach found an accepted trace after 99 steps with 0 reset with depth 100 and stack size 97 in 0 ms.
FORMULA BART-PT-002-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-002-LTLFireability-14 finished in 542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))&&(G(p1)||F(p2))))'
Support contains 4 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 404/404 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 202 transition count 342
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 202 transition count 342
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 176 place count 150 transition count 290
Iterating global reduction 0 with 52 rules applied. Total rules applied 228 place count 150 transition count 290
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 235 place count 143 transition count 283
Iterating global reduction 0 with 7 rules applied. Total rules applied 242 place count 143 transition count 283
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 247 place count 138 transition count 278
Iterating global reduction 0 with 5 rules applied. Total rules applied 252 place count 138 transition count 278
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 256 place count 134 transition count 274
Iterating global reduction 0 with 4 rules applied. Total rules applied 260 place count 134 transition count 274
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 264 place count 130 transition count 270
Iterating global reduction 0 with 4 rules applied. Total rules applied 268 place count 130 transition count 270
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 272 place count 126 transition count 266
Iterating global reduction 0 with 4 rules applied. Total rules applied 276 place count 126 transition count 266
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 280 place count 122 transition count 262
Iterating global reduction 0 with 4 rules applied. Total rules applied 284 place count 122 transition count 262
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 288 place count 118 transition count 258
Iterating global reduction 0 with 4 rules applied. Total rules applied 292 place count 118 transition count 258
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 296 place count 114 transition count 254
Iterating global reduction 0 with 4 rules applied. Total rules applied 300 place count 114 transition count 254
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 302 place count 112 transition count 252
Iterating global reduction 0 with 2 rules applied. Total rules applied 304 place count 112 transition count 252
Applied a total of 304 rules in 21 ms. Remains 112 /264 variables (removed 152) and now considering 252/404 (removed 152) transitions.
// Phase 1: matrix 252 rows 112 cols
[2023-03-11 09:15:17] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 09:15:17] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-11 09:15:17] [INFO ] Invariant cache hit.
[2023-03-11 09:15:17] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-11 09:15:17] [INFO ] Invariant cache hit.
[2023-03-11 09:15:18] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 112/264 places, 252/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 313 ms. Remains : 112/264 places, 252/404 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p0), true]
Running random walk in product with property : BART-PT-002-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s49 0) (EQ s26 0)), p2:(EQ s44 1), p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BART-PT-002-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-002-LTLFireability-15 finished in 487 ms.
All properties solved by simple procedures.
Total runtime 30903 ms.

BK_STOP 1678526118344

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BART-PT-002"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is BART-PT-002, 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 r005-oct2-167813593600756"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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