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.r007-oct2-167813595700539.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 lolaxred
Input is AutonomousCar-PT-01b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595700539
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 5.7K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 12:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 12:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 25 12:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 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 31K 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-01b-LTLCardinality-00
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-01
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-02
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-03
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-04
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-05
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-06
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-07
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-08
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-09
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-10
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-11
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-12
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-13
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-14
FORMULA_NAME AutonomousCar-PT-01b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678351176643

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-01b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 08:39:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 08:39:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:39:39] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2023-03-09 08:39:39] [INFO ] Transformed 119 places.
[2023-03-09 08:39:39] [INFO ] Transformed 132 transitions.
[2023-03-09 08:39:39] [INFO ] Found NUPN structural information;
[2023-03-09 08:39:39] [INFO ] Parsed PT model containing 119 places and 132 transitions and 339 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA AutonomousCar-PT-01b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-01b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 132/132 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 109 transition count 122
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 109 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 109 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 108 transition count 117
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 108 transition count 117
Applied a total of 26 rules in 27 ms. Remains 108 /119 variables (removed 11) and now considering 117/132 (removed 15) transitions.
// Phase 1: matrix 117 rows 108 cols
[2023-03-09 08:39:39] [INFO ] Computed 6 place invariants in 11 ms
[2023-03-09 08:39:39] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-09 08:39:39] [INFO ] Invariant cache hit.
[2023-03-09 08:39:40] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2023-03-09 08:39:40] [INFO ] Invariant cache hit.
[2023-03-09 08:39:40] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/119 places, 117/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 833 ms. Remains : 108/119 places, 117/132 transitions.
Support contains 28 out of 108 places after structural reductions.
[2023-03-09 08:39:40] [INFO ] Flatten gal took : 41 ms
[2023-03-09 08:39:40] [INFO ] Flatten gal took : 13 ms
[2023-03-09 08:39:40] [INFO ] Input system was already deterministic with 117 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 17) seen :14
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 08:39:41] [INFO ] Invariant cache hit.
[2023-03-09 08:39:41] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-09 08:39:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-09 08:39:41] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-09 08:39:41] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
[2023-03-09 08:39:41] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2023-03-09 08:39:41] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2023-03-09 08:39:41] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2023-03-09 08:39:41] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2023-03-09 08:39:41] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2023-03-09 08:39:41] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2023-03-09 08:39:41] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 299 ms
[2023-03-09 08:39:41] [INFO ] After 340ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 08:39:41] [INFO ] After 405ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 117/117 transitions.
Graph (trivial) has 97 edges and 108 vertex of which 4 / 108 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 183 edges and 106 vertex of which 102 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 102 transition count 66
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 53 rules applied. Total rules applied 100 place count 58 transition count 57
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 106 place count 53 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 107 place count 52 transition count 56
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 107 place count 52 transition count 49
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 121 place count 45 transition count 49
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 125 place count 41 transition count 45
Iterating global reduction 4 with 4 rules applied. Total rules applied 129 place count 41 transition count 45
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 131 place count 39 transition count 43
Iterating global reduction 4 with 2 rules applied. Total rules applied 133 place count 39 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 2 rules applied. Total rules applied 135 place count 39 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 136 place count 38 transition count 41
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 168 place count 22 transition count 25
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 169 place count 22 transition count 24
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 170 place count 21 transition count 22
Iterating global reduction 7 with 1 rules applied. Total rules applied 171 place count 21 transition count 22
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 7 with 2 rules applied. Total rules applied 173 place count 20 transition count 21
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 175 place count 20 transition count 19
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 178 place count 20 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 179 place count 19 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 180 place count 18 transition count 18
Applied a total of 180 rules in 22 ms. Remains 18 /108 variables (removed 90) and now considering 18/117 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 18/108 places, 18/117 transitions.
Finished random walk after 20 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
FORMULA AutonomousCar-PT-01b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 28 stabilizing places and 29 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(G(p0))&&F(p1))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 117/117 transitions.
Graph (trivial) has 95 edges and 108 vertex of which 4 / 108 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 105 transition count 68
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 56 rules applied. Total rules applied 103 place count 59 transition count 58
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 109 place count 54 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 110 place count 53 transition count 57
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 110 place count 53 transition count 50
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 124 place count 46 transition count 50
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 127 place count 43 transition count 47
Iterating global reduction 4 with 3 rules applied. Total rules applied 130 place count 43 transition count 47
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 160 place count 28 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 161 place count 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 162 place count 27 transition count 28
Iterating global reduction 5 with 1 rules applied. Total rules applied 163 place count 27 transition count 28
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 5 with 2 rules applied. Total rules applied 165 place count 26 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 166 place count 25 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 167 place count 24 transition count 26
Applied a total of 167 rules in 43 ms. Remains 24 /108 variables (removed 84) and now considering 26/117 (removed 91) transitions.
// Phase 1: matrix 26 rows 24 cols
[2023-03-09 08:39:41] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 08:39:41] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-09 08:39:41] [INFO ] Invariant cache hit.
[2023-03-09 08:39:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 08:39:41] [INFO ] Implicit Places using invariants and state equation in 50 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 93 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/108 places, 26/117 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 22 transition count 25
Applied a total of 2 rules in 5 ms. Remains 22 /23 variables (removed 1) and now considering 25/26 (removed 1) transitions.
// Phase 1: matrix 25 rows 22 cols
[2023-03-09 08:39:42] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-09 08:39:42] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-09 08:39:42] [INFO ] Invariant cache hit.
[2023-03-09 08:39:42] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 08:39:42] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/108 places, 25/117 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 276 ms. Remains : 22/108 places, 25/117 transitions.
Stuttering acceptance computed with spot in 423 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-03 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=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s12 0) (EQ s18 1)), p1:(OR (EQ s4 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 2 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLCardinality-03 finished in 782 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||G(F(p1)))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 117/117 transitions.
Graph (trivial) has 95 edges and 108 vertex of which 4 / 108 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 105 transition count 68
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 54 rules applied. Total rules applied 101 place count 59 transition count 60
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 105 place count 55 transition count 60
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 105 place count 55 transition count 54
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 117 place count 49 transition count 54
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 122 place count 44 transition count 49
Iterating global reduction 3 with 5 rules applied. Total rules applied 127 place count 44 transition count 49
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 43 transition count 48
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 43 transition count 48
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 161 place count 27 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 162 place count 27 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 4 with 2 rules applied. Total rules applied 164 place count 26 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 166 place count 24 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 167 place count 23 transition count 27
Applied a total of 167 rules in 69 ms. Remains 23 /108 variables (removed 85) and now considering 27/117 (removed 90) transitions.
// Phase 1: matrix 27 rows 23 cols
[2023-03-09 08:39:42] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-09 08:39:42] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-09 08:39:42] [INFO ] Invariant cache hit.
[2023-03-09 08:39:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:39:42] [INFO ] Implicit Places using invariants and state equation in 60 ms returned [16, 22]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 161 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/108 places, 27/117 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 26
Applied a total of 2 rules in 3 ms. Remains 20 /21 variables (removed 1) and now considering 26/27 (removed 1) transitions.
// Phase 1: matrix 26 rows 20 cols
[2023-03-09 08:39:42] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 08:39:42] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-09 08:39:42] [INFO ] Invariant cache hit.
[2023-03-09 08:39:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:39:42] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/108 places, 26/117 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 342 ms. Remains : 20/108 places, 26/117 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s5 0) (EQ s11 1)), p1:(OR (EQ s2 0) (EQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4 reset in 197 ms.
Product exploration explored 100000 steps with 5 reset in 76 ms.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 242 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 24 steps, including 2 resets, run visited all 2 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 447 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 26/26 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2023-03-09 08:39:44] [INFO ] Invariant cache hit.
[2023-03-09 08:39:44] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-09 08:39:44] [INFO ] Invariant cache hit.
[2023-03-09 08:39:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:39:44] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2023-03-09 08:39:44] [INFO ] Redundant transitions in 17 ms returned [22]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 25 rows 20 cols
[2023-03-09 08:39:44] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-09 08:39:44] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/20 places, 25/26 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 18 transition count 23
Applied a total of 2 rules in 4 ms. Remains 18 /20 variables (removed 2) and now considering 23/25 (removed 2) transitions.
// Phase 1: matrix 23 rows 18 cols
[2023-03-09 08:39:44] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-09 08:39:44] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-09 08:39:44] [INFO ] Invariant cache hit.
[2023-03-09 08:39:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:39:44] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/20 places, 23/26 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 305 ms. Remains : 18/20 places, 23/26 transitions.
Computed a total of 4 stabilizing places and 5 stable transitions
Computed a total of 4 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 315 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 34 steps, including 4 resets, run visited all 2 properties in 3 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p0), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 208 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 34 reset in 115 ms.
Product exploration explored 100000 steps with 17 reset in 99 ms.
Support contains 4 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 23/23 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-09 08:39:45] [INFO ] Invariant cache hit.
[2023-03-09 08:39:46] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-09 08:39:46] [INFO ] Invariant cache hit.
[2023-03-09 08:39:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 08:39:46] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-09 08:39:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 08:39:46] [INFO ] Invariant cache hit.
[2023-03-09 08:39:46] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 18/18 places, 23/23 transitions.
Treatment of property AutonomousCar-PT-01b-LTLCardinality-05 finished in 3603 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) U p1)&&(G(p0)||G(p1))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 117/117 transitions.
Graph (trivial) has 92 edges and 108 vertex of which 4 / 108 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 105 transition count 68
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 52 rules applied. Total rules applied 99 place count 59 transition count 62
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 103 place count 56 transition count 61
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 106 place count 55 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 107 place count 54 transition count 59
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 107 place count 54 transition count 54
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 117 place count 49 transition count 54
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 120 place count 46 transition count 51
Iterating global reduction 5 with 3 rules applied. Total rules applied 123 place count 46 transition count 51
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 125 place count 44 transition count 49
Iterating global reduction 5 with 2 rules applied. Total rules applied 127 place count 44 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 5 with 2 rules applied. Total rules applied 129 place count 44 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 130 place count 43 transition count 47
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 162 place count 27 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 163 place count 27 transition count 29
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 8 with 2 rules applied. Total rules applied 165 place count 26 transition count 28
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 166 place count 26 transition count 28
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 168 place count 24 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 169 place count 23 transition count 26
Applied a total of 169 rules in 24 ms. Remains 23 /108 variables (removed 85) and now considering 26/117 (removed 91) transitions.
// Phase 1: matrix 26 rows 23 cols
[2023-03-09 08:39:46] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 08:39:46] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-09 08:39:46] [INFO ] Invariant cache hit.
[2023-03-09 08:39:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:39:46] [INFO ] Implicit Places using invariants and state equation in 103 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 142 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/108 places, 26/117 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 168 ms. Remains : 22/108 places, 26/117 transitions.
Stuttering acceptance computed with spot in 297 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(OR (EQ s10 0) (EQ s16 1)), p0:(OR (EQ s6 0) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLCardinality-06 finished in 481 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(p1)))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 117/117 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 99 transition count 108
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 99 transition count 108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 96 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 96 transition count 105
Applied a total of 24 rules in 6 ms. Remains 96 /108 variables (removed 12) and now considering 105/117 (removed 12) transitions.
// Phase 1: matrix 105 rows 96 cols
[2023-03-09 08:39:46] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 08:39:46] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-09 08:39:46] [INFO ] Invariant cache hit.
[2023-03-09 08:39:46] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-09 08:39:46] [INFO ] Invariant cache hit.
[2023-03-09 08:39:46] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/108 places, 105/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 292 ms. Remains : 96/108 places, 105/117 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s81 0) (EQ s20 1)), p1:(OR (EQ s74 0) (EQ s39 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 200 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property AutonomousCar-PT-01b-LTLCardinality-07 finished in 660 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(p0))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 117/117 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 102 transition count 111
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 102 transition count 111
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 99 transition count 108
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 99 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 98 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 98 transition count 107
Applied a total of 20 rules in 15 ms. Remains 98 /108 variables (removed 10) and now considering 107/117 (removed 10) transitions.
// Phase 1: matrix 107 rows 98 cols
[2023-03-09 08:39:47] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-09 08:39:47] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-09 08:39:47] [INFO ] Invariant cache hit.
[2023-03-09 08:39:47] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2023-03-09 08:39:47] [INFO ] Invariant cache hit.
[2023-03-09 08:39:47] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 98/108 places, 107/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 258 ms. Remains : 98/108 places, 107/117 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (EQ s73 0) (EQ s77 1)) (AND (EQ s92 0) (EQ s20 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLCardinality-08 finished in 427 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((F(p0)&&X(p1)))))'
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 117/117 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 100 transition count 109
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 100 transition count 109
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 97 transition count 106
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 97 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 96 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 96 transition count 105
Applied a total of 24 rules in 5 ms. Remains 96 /108 variables (removed 12) and now considering 105/117 (removed 12) transitions.
// Phase 1: matrix 105 rows 96 cols
[2023-03-09 08:39:47] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-09 08:39:47] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-09 08:39:47] [INFO ] Invariant cache hit.
[2023-03-09 08:39:47] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-09 08:39:47] [INFO ] Invariant cache hit.
[2023-03-09 08:39:47] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/108 places, 105/117 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 191 ms. Remains : 96/108 places, 105/117 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s32 0) (EQ s67 1)), p1:(EQ s20 1)], nbAcceptance=0, 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]]
Stuttering criterion allowed to conclude after 31 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-01b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-01b-LTLCardinality-10 finished in 430 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)||G(p1))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 117/117 transitions.
Graph (trivial) has 94 edges and 108 vertex of which 4 / 108 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 41 place count 105 transition count 74
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 49 rules applied. Total rules applied 90 place count 65 transition count 65
Reduce places removed 5 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 9 rules applied. Total rules applied 99 place count 60 transition count 61
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 103 place count 56 transition count 61
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 103 place count 56 transition count 54
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 117 place count 49 transition count 54
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 121 place count 45 transition count 50
Iterating global reduction 4 with 4 rules applied. Total rules applied 125 place count 45 transition count 50
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 127 place count 43 transition count 48
Iterating global reduction 4 with 2 rules applied. Total rules applied 129 place count 43 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 4 with 2 rules applied. Total rules applied 131 place count 43 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 132 place count 42 transition count 46
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 160 place count 28 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 161 place count 28 transition count 31
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 162 place count 27 transition count 29
Iterating global reduction 7 with 1 rules applied. Total rules applied 163 place count 27 transition count 29
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 7 with 2 rules applied. Total rules applied 165 place count 26 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 166 place count 26 transition count 27
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 167 place count 26 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 169 place count 24 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 170 place count 23 transition count 25
Applied a total of 170 rules in 34 ms. Remains 23 /108 variables (removed 85) and now considering 25/117 (removed 92) transitions.
// Phase 1: matrix 25 rows 23 cols
[2023-03-09 08:39:48] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-09 08:39:48] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-09 08:39:48] [INFO ] Invariant cache hit.
[2023-03-09 08:39:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-09 08:39:48] [INFO ] Implicit Places using invariants and state equation in 47 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 94 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/108 places, 25/117 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 130 ms. Remains : 22/108 places, 25/117 transitions.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-01b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s20 0) (EQ s10 1)), p1:(OR (EQ s15 0) (EQ s7 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2 reset in 119 ms.
Product exploration explored 100000 steps with 0 reset in 68 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Detected a total of 5/22 stabilizing places and 6/25 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 593 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 887 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 321 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 25 rows 22 cols
[2023-03-09 08:39:49] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-09 08:39:49] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 08:39:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-09 08:39:49] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 08:39:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 08:39:49] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 08:39:49] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 8 ms to minimize.
[2023-03-09 08:39:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 31 ms
[2023-03-09 08:39:49] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-09 08:39:49] [INFO ] After 130ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge :(F (OR (G p1) (G (NOT p1))))
Knowledge based reduction with 7 factoid took 635 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA AutonomousCar-PT-01b-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-01b-LTLCardinality-12 finished in 1902 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||G(F(p1)))))'
[2023-03-09 08:39:50] [INFO ] Flatten gal took : 39 ms
[2023-03-09 08:39:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-09 08:39:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 108 places, 117 transitions and 285 arcs took 1 ms.
Total runtime 11149 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT AutonomousCar-PT-01b
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/380
LTLCardinality

FORMULA AutonomousCar-PT-01b-LTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678351190716

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/380/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/380/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/380/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 AutonomousCar-PT-01b-LTLCardinality-05
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for AutonomousCar-PT-01b-LTLCardinality-05
lola: result : false
lola: markings : 93
lola: fired transitions : 126
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
AutonomousCar-PT-01b-LTLCardinality-05: LTL false LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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-01b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is AutonomousCar-PT-01b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-oct2-167813595700539"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-01b.tgz
mv AutonomousCar-PT-01b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;