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.r009-oct2-167813598100612.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 ltsminxred
Input is AutonomousCar-PT-06a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598100612
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 6.6K Feb 25 12:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 12:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 12:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 163K Feb 25 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 177K 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 AutonomousCar-PT-06a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-06a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678637867912

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-06a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:17:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:17:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:17:50] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2023-03-12 16:17:50] [INFO ] Transformed 65 places.
[2023-03-12 16:17:50] [INFO ] Transformed 417 transitions.
[2023-03-12 16:17:50] [INFO ] Found NUPN structural information;
[2023-03-12 16:17:50] [INFO ] Parsed PT model containing 65 places and 417 transitions and 3356 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 159 transitions
Reduce redundant transitions removed 159 transitions.
FORMULA AutonomousCar-PT-06a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-06a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 62 transition count 243
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 62 transition count 243
Applied a total of 6 rules in 20 ms. Remains 62 /65 variables (removed 3) and now considering 243/258 (removed 15) transitions.
// Phase 1: matrix 243 rows 62 cols
[2023-03-12 16:17:51] [INFO ] Computed 10 place invariants in 12 ms
[2023-03-12 16:17:51] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-03-12 16:17:51] [INFO ] Invariant cache hit.
[2023-03-12 16:17:51] [INFO ] State equation strengthened by 135 read => feed constraints.
[2023-03-12 16:17:51] [INFO ] Implicit Places using invariants and state equation in 278 ms returned [58, 60]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 608 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/65 places, 243/258 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 632 ms. Remains : 60/65 places, 243/258 transitions.
Support contains 36 out of 60 places after structural reductions.
[2023-03-12 16:17:52] [INFO ] Flatten gal took : 56 ms
[2023-03-12 16:17:52] [INFO ] Flatten gal took : 28 ms
[2023-03-12 16:17:52] [INFO ] Input system was already deterministic with 243 transitions.
Incomplete random walk after 10000 steps, including 575 resets, run finished after 524 ms. (steps per millisecond=19 ) properties (out of 32) seen :23
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 243 rows 60 cols
[2023-03-12 16:17:52] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-12 16:17:52] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 16:17:53] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 16:17:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 16:17:53] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 16:17:53] [INFO ] State equation strengthened by 135 read => feed constraints.
[2023-03-12 16:17:53] [INFO ] After 130ms SMT Verify possible using 135 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 16:17:53] [INFO ] After 299ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-12 16:17:53] [INFO ] After 615ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 13 ms.
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 243/243 transitions.
Graph (complete) has 502 edges and 60 vertex of which 59 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 59 transition count 231
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 20 place count 51 transition count 231
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 51 transition count 230
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 50 transition count 230
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 48 transition count 222
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 48 transition count 222
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 32 place count 45 transition count 219
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 38 place count 45 transition count 213
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 80 place count 39 transition count 177
Applied a total of 80 rules in 62 ms. Remains 39 /60 variables (removed 21) and now considering 177/243 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 39/60 places, 177/243 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 177 rows 39 cols
[2023-03-12 16:17:53] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-12 16:17:53] [INFO ] [Real]Absence check using 10 positive place invariants in 10 ms returned sat
[2023-03-12 16:17:53] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:17:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2023-03-12 16:17:54] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:17:54] [INFO ] State equation strengthened by 91 read => feed constraints.
[2023-03-12 16:17:54] [INFO ] After 18ms SMT Verify possible using 91 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:17:54] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-12 16:17:54] [INFO ] After 138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 177/177 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 37 transition count 163
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 37 transition count 163
Applied a total of 4 rules in 8 ms. Remains 37 /39 variables (removed 2) and now considering 163/177 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 37/39 places, 163/177 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21670 steps, run visited all 1 properties in 45 ms. (steps per millisecond=481 )
Probabilistic random walk after 21670 steps, saw 3924 distinct states, run finished after 46 ms. (steps per millisecond=471 ) properties seen :1
Computed a total of 3 stabilizing places and 2 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' '!(F(G(p0)))'
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 60 transition count 236
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 53 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 52 transition count 235
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 52 transition count 234
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 51 transition count 234
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 22 place count 47 transition count 206
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 47 transition count 206
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 3 with 4 rules applied. Total rules applied 30 place count 45 transition count 204
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 44 transition count 204
Applied a total of 32 rules in 42 ms. Remains 44 /60 variables (removed 16) and now considering 204/243 (removed 39) transitions.
// Phase 1: matrix 204 rows 44 cols
[2023-03-12 16:17:54] [INFO ] Computed 8 place invariants in 13 ms
[2023-03-12 16:17:55] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-12 16:17:55] [INFO ] Invariant cache hit.
[2023-03-12 16:17:55] [INFO ] State equation strengthened by 113 read => feed constraints.
[2023-03-12 16:17:55] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
[2023-03-12 16:17:55] [INFO ] Redundant transitions in 49 ms returned []
[2023-03-12 16:17:55] [INFO ] Invariant cache hit.
[2023-03-12 16:17:56] [INFO ] Dead Transitions using invariants and state equation in 429 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/60 places, 204/243 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1189 ms. Remains : 44/60 places, 204/243 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s6 1) (EQ s32 1) (EQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-01 finished in 1567 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0||G(p1)) U X(p2)) U p3))'
Support contains 13 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 57 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 57 transition count 222
Applied a total of 6 rules in 2 ms. Remains 57 /60 variables (removed 3) and now considering 222/243 (removed 21) transitions.
// Phase 1: matrix 222 rows 57 cols
[2023-03-12 16:17:56] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 16:17:56] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-12 16:17:56] [INFO ] Invariant cache hit.
[2023-03-12 16:17:56] [INFO ] State equation strengthened by 117 read => feed constraints.
[2023-03-12 16:17:56] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2023-03-12 16:17:56] [INFO ] Invariant cache hit.
[2023-03-12 16:17:56] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 222/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 382 ms. Remains : 57/60 places, 222/243 transitions.
Stuttering acceptance computed with spot in 253 ms :[(NOT p3), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p0) p1), acceptance={0} source=0 dest: 2}, { cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1)), acceptance={0} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(AND (EQ s15 1) (EQ s19 1) (EQ s28 1) (EQ s32 1) (EQ s40 1) (EQ s44 1) (EQ s53 1)), p0:(AND (EQ s1 1) (EQ s8 1) (EQ s39 1) (EQ s52 1)), p1:(AND (EQ s15...], 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 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-02 finished in 686 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((G(p1) U X(p2)))))))'
Support contains 15 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 57 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 57 transition count 222
Applied a total of 6 rules in 4 ms. Remains 57 /60 variables (removed 3) and now considering 222/243 (removed 21) transitions.
// Phase 1: matrix 222 rows 57 cols
[2023-03-12 16:17:56] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-12 16:17:57] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-12 16:17:57] [INFO ] Invariant cache hit.
[2023-03-12 16:17:57] [INFO ] State equation strengthened by 117 read => feed constraints.
[2023-03-12 16:17:57] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2023-03-12 16:17:57] [INFO ] Invariant cache hit.
[2023-03-12 16:17:57] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 222/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 483 ms. Remains : 57/60 places, 222/243 transitions.
Stuttering acceptance computed with spot in 551 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={0, 1} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=1 dest: 3}, { cond=p1, acceptance={0, 1} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 5}, { cond=(AND p0 p1), acceptance={1} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=3 dest: 7}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=3 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=6 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=6 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=7 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=7 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=7 dest: 7}, { cond=(AND p0 p1), acceptance={1} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=8 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=8 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=8 dest: 5}, { cond=(AND p0 p1), acceptance={1} source=8 dest: 6}, { cond=p1, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(OR (NEQ s1 1) (NEQ s2 1) (NEQ s44 1) (NEQ s52 1)), p1:(AND (EQ s13 1) (EQ s21 1) (EQ s25 1) (EQ s33 1) (EQ s37 1) (EQ s43 1) (EQ s53 1)), p2:(AND (EQ ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-03 finished in 1077 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||X((G(p2)&&p1))) U p3))'
Support contains 8 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 58 transition count 229
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 58 transition count 229
Applied a total of 4 rules in 15 ms. Remains 58 /60 variables (removed 2) and now considering 229/243 (removed 14) transitions.
// Phase 1: matrix 229 rows 58 cols
[2023-03-12 16:17:58] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 16:17:58] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-12 16:17:58] [INFO ] Invariant cache hit.
[2023-03-12 16:17:58] [INFO ] State equation strengthened by 123 read => feed constraints.
[2023-03-12 16:17:58] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2023-03-12 16:17:58] [INFO ] Invariant cache hit.
[2023-03-12 16:17:58] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/60 places, 229/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 611 ms. Remains : 58/60 places, 229/243 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p3), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(AND (EQ s1 1) (EQ s9 1) (EQ s12 1) (EQ s53 1)), p0:(AND (EQ s1 1) (EQ s8 1) (EQ s27 1) (EQ s53 1)), p1:(AND (EQ s1 1) (EQ s5 1) (EQ s15 1) (EQ s53 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-04 finished in 872 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))))'
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 56 transition count 215
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 56 transition count 215
Applied a total of 8 rules in 3 ms. Remains 56 /60 variables (removed 4) and now considering 215/243 (removed 28) transitions.
// Phase 1: matrix 215 rows 56 cols
[2023-03-12 16:17:58] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-12 16:17:59] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-12 16:17:59] [INFO ] Invariant cache hit.
[2023-03-12 16:17:59] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-12 16:17:59] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2023-03-12 16:17:59] [INFO ] Invariant cache hit.
[2023-03-12 16:17:59] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 56/60 places, 215/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 491 ms. Remains : 56/60 places, 215/243 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s1 1) (NEQ s2 1) (NEQ s26 1) (NEQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-05 finished in 654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((p1||X(p2))))))'
Support contains 12 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 60 transition count 238
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 55 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 54 transition count 237
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 54 transition count 235
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 52 transition count 235
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 19 place count 49 transition count 214
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 49 transition count 214
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 48 transition count 213
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 47 transition count 213
Applied a total of 26 rules in 47 ms. Remains 47 /60 variables (removed 13) and now considering 213/243 (removed 30) transitions.
// Phase 1: matrix 213 rows 47 cols
[2023-03-12 16:17:59] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 16:17:59] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-12 16:17:59] [INFO ] Invariant cache hit.
[2023-03-12 16:17:59] [INFO ] State equation strengthened by 119 read => feed constraints.
[2023-03-12 16:17:59] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-12 16:17:59] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-12 16:17:59] [INFO ] Invariant cache hit.
[2023-03-12 16:17:59] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/60 places, 213/243 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 332 ms. Remains : 47/60 places, 213/243 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-06 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=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s16 1) (EQ s23 1) (EQ s26 1) (EQ s31 1) (EQ s39 1) (EQ s44 1)), p1:(EQ s38 1), p2:(AND (EQ s1 1) (EQ s7 1) (EQ s37 1) (EQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 16 steps with 2 reset in 1 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-06 finished in 479 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&(X(p1) U ((X(p1)&&G(!p2))||X(G(p1)))))))'
Support contains 7 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 57 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 57 transition count 222
Applied a total of 6 rules in 2 ms. Remains 57 /60 variables (removed 3) and now considering 222/243 (removed 21) transitions.
// Phase 1: matrix 222 rows 57 cols
[2023-03-12 16:18:00] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 16:18:00] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-12 16:18:00] [INFO ] Invariant cache hit.
[2023-03-12 16:18:00] [INFO ] State equation strengthened by 117 read => feed constraints.
[2023-03-12 16:18:00] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2023-03-12 16:18:00] [INFO ] Invariant cache hit.
[2023-03-12 16:18:00] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 222/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 728 ms. Remains : 57/60 places, 222/243 transitions.
Stuttering acceptance computed with spot in 505 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p1) p2), (NOT p1), true, (AND p2 (NOT p1)), (AND p2 p1)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=3 dest: 4}, { cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=4 dest: 4}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND p2 p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s7 1) (EQ s45 1) (EQ s52 1)), p2:(AND (EQ s1 1) (EQ s2 1) (EQ s24 1) (EQ s52 1)), p1:(NEQ s30 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 33 steps with 3 reset in 1 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-07 finished in 1254 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((p1 U X(p2)))&&p0))||G(p2)))'
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 57 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 57 transition count 222
Applied a total of 6 rules in 4 ms. Remains 57 /60 variables (removed 3) and now considering 222/243 (removed 21) transitions.
[2023-03-12 16:18:01] [INFO ] Invariant cache hit.
[2023-03-12 16:18:01] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-12 16:18:01] [INFO ] Invariant cache hit.
[2023-03-12 16:18:01] [INFO ] State equation strengthened by 117 read => feed constraints.
[2023-03-12 16:18:01] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-12 16:18:01] [INFO ] Invariant cache hit.
[2023-03-12 16:18:01] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 222/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 456 ms. Remains : 57/60 places, 222/243 transitions.
Stuttering acceptance computed with spot in 305 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p0 p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s6 1) (EQ s24 1) (EQ s52 1)), p2:(AND (EQ s1 1) (EQ s6 1) (EQ s24 1) (EQ s52 1)), p1:(OR (AND (EQ s1 1) (EQ s6 1) (EQ s24 1) (EQ s52...], 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]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-09 finished in 793 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(p1)&&p0))&&X(G(p2))))'
Support contains 6 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 57 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 57 transition count 222
Applied a total of 6 rules in 6 ms. Remains 57 /60 variables (removed 3) and now considering 222/243 (removed 21) transitions.
// Phase 1: matrix 222 rows 57 cols
[2023-03-12 16:18:02] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-12 16:18:02] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-12 16:18:02] [INFO ] Invariant cache hit.
[2023-03-12 16:18:02] [INFO ] State equation strengthened by 117 read => feed constraints.
[2023-03-12 16:18:02] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2023-03-12 16:18:02] [INFO ] Invariant cache hit.
[2023-03-12 16:18:02] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 222/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 460 ms. Remains : 57/60 places, 222/243 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p2), acceptance={0} source=4 dest: 1}, { cond=(NOT p2), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(AND (EQ s1 1) (EQ s9 1) (EQ s23 1) (EQ s52 1)), p1:(AND (EQ s1 1) (EQ s2 1) (EQ s18 1) (EQ s52 1)), p0:(AND (EQ s1 1) (EQ s9 1) (EQ s23 1) (EQ s52 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-10 finished in 694 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))'
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 60 transition count 235
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 52 transition count 235
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 52 transition count 234
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 51 transition count 234
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 21 place count 48 transition count 213
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 48 transition count 213
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 2 with 4 rules applied. Total rules applied 28 place count 46 transition count 211
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 45 transition count 211
Applied a total of 30 rules in 28 ms. Remains 45 /60 variables (removed 15) and now considering 211/243 (removed 32) transitions.
// Phase 1: matrix 211 rows 45 cols
[2023-03-12 16:18:02] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-12 16:18:02] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-12 16:18:02] [INFO ] Invariant cache hit.
[2023-03-12 16:18:02] [INFO ] State equation strengthened by 119 read => feed constraints.
[2023-03-12 16:18:03] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-12 16:18:03] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-12 16:18:03] [INFO ] Invariant cache hit.
[2023-03-12 16:18:03] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/60 places, 211/243 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 357 ms. Remains : 45/60 places, 211/243 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s4 1) (EQ s17 1) (EQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-12 finished in 419 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(p0)))'
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 60 transition count 236
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 53 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 52 transition count 235
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 52 transition count 234
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 51 transition count 234
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 22 place count 47 transition count 206
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 47 transition count 206
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 3 with 4 rules applied. Total rules applied 30 place count 45 transition count 204
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 44 transition count 204
Applied a total of 32 rules in 35 ms. Remains 44 /60 variables (removed 16) and now considering 204/243 (removed 39) transitions.
// Phase 1: matrix 204 rows 44 cols
[2023-03-12 16:18:03] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 16:18:03] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-12 16:18:03] [INFO ] Invariant cache hit.
[2023-03-12 16:18:03] [INFO ] State equation strengthened by 113 read => feed constraints.
[2023-03-12 16:18:03] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2023-03-12 16:18:03] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-12 16:18:03] [INFO ] Invariant cache hit.
[2023-03-12 16:18:03] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/60 places, 204/243 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 616 ms. Remains : 44/60 places, 204/243 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s8 1) (EQ s37 1) (EQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-13 finished in 668 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 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 56 transition count 215
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 56 transition count 215
Applied a total of 8 rules in 2 ms. Remains 56 /60 variables (removed 4) and now considering 215/243 (removed 28) transitions.
// Phase 1: matrix 215 rows 56 cols
[2023-03-12 16:18:03] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-12 16:18:03] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-12 16:18:03] [INFO ] Invariant cache hit.
[2023-03-12 16:18:04] [INFO ] State equation strengthened by 111 read => feed constraints.
[2023-03-12 16:18:04] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-12 16:18:04] [INFO ] Invariant cache hit.
[2023-03-12 16:18:04] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 56/60 places, 215/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 452 ms. Remains : 56/60 places, 215/243 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-14 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:(AND (EQ s1 1) (EQ s9 1) (EQ s26 1) (EQ s51 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]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-06a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-14 finished in 597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F(((!p2 U (p3||G(!p2)))||p1)))&&p0))))'
Support contains 13 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 243/243 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 57 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 57 transition count 222
Applied a total of 6 rules in 1 ms. Remains 57 /60 variables (removed 3) and now considering 222/243 (removed 21) transitions.
// Phase 1: matrix 222 rows 57 cols
[2023-03-12 16:18:04] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-12 16:18:04] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-12 16:18:04] [INFO ] Invariant cache hit.
[2023-03-12 16:18:04] [INFO ] State equation strengthened by 117 read => feed constraints.
[2023-03-12 16:18:04] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2023-03-12 16:18:04] [INFO ] Invariant cache hit.
[2023-03-12 16:18:05] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 222/243 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 612 ms. Remains : 57/60 places, 222/243 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), (OR (NOT p0) (AND (NOT p1) p2 (NOT p3))), true, (AND (NOT p1) (NOT p3) p2)]
Running random walk in product with property : AutonomousCar-PT-06a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s5 1) (EQ s14 1) (EQ s52 1)), p1:(OR (EQ s1 0) (EQ s8 0) (EQ s23 0) (EQ s52 0)), p3:(AND (NOT (AND (EQ s13 1) (EQ s20 1) (EQ s26 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], 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 AutonomousCar-PT-06a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-06a-LTLFireability-15 finished in 877 ms.
All properties solved by simple procedures.
Total runtime 14628 ms.
ITS solved all properties within timeout

BK_STOP 1678637885590

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

+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="AutonomousCar-PT-06a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is AutonomousCar-PT-06a, 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 r009-oct2-167813598100612"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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