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.r517-tall-167987243300035.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Anderson-PT-08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243300035
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.5K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 17K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 667K Mar 31 16:48 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 Anderson-PT-08-LTLCardinality-00
FORMULA_NAME Anderson-PT-08-LTLCardinality-01
FORMULA_NAME Anderson-PT-08-LTLCardinality-02
FORMULA_NAME Anderson-PT-08-LTLCardinality-03
FORMULA_NAME Anderson-PT-08-LTLCardinality-04
FORMULA_NAME Anderson-PT-08-LTLCardinality-05
FORMULA_NAME Anderson-PT-08-LTLCardinality-06
FORMULA_NAME Anderson-PT-08-LTLCardinality-07
FORMULA_NAME Anderson-PT-08-LTLCardinality-08
FORMULA_NAME Anderson-PT-08-LTLCardinality-09
FORMULA_NAME Anderson-PT-08-LTLCardinality-10
FORMULA_NAME Anderson-PT-08-LTLCardinality-11
FORMULA_NAME Anderson-PT-08-LTLCardinality-12
FORMULA_NAME Anderson-PT-08-LTLCardinality-13
FORMULA_NAME Anderson-PT-08-LTLCardinality-14
FORMULA_NAME Anderson-PT-08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680843181922

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-08
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2023-04-07 04:53:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-04-07 04:53:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 04:53:03] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2023-04-07 04:53:03] [INFO ] Transformed 401 places.
[2023-04-07 04:53:03] [INFO ] Transformed 1328 transitions.
[2023-04-07 04:53:03] [INFO ] Found NUPN structural information;
[2023-04-07 04:53:03] [INFO ] Parsed PT model containing 401 places and 1328 transitions and 5088 arcs in 167 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 5 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-08-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-08-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 1328/1328 transitions.
Discarding 105 places :
Symmetric choice reduction at 0 with 105 rule applications. Total rules 105 place count 296 transition count 481
Iterating global reduction 0 with 105 rules applied. Total rules applied 210 place count 296 transition count 481
Applied a total of 210 rules in 66 ms. Remains 296 /401 variables (removed 105) and now considering 481/1328 (removed 847) transitions.
// Phase 1: matrix 481 rows 296 cols
[2023-04-07 04:53:03] [INFO ] Computed 19 invariants in 36 ms
[2023-04-07 04:53:04] [INFO ] Implicit Places using invariants in 410 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 524 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 295/401 places, 481/1328 transitions.
Applied a total of 0 rules in 8 ms. Remains 295 /295 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 600 ms. Remains : 295/401 places, 481/1328 transitions.
Support contains 21 out of 295 places after structural reductions.
[2023-04-07 04:53:04] [INFO ] Flatten gal took : 67 ms
[2023-04-07 04:53:04] [INFO ] Flatten gal took : 34 ms
[2023-04-07 04:53:04] [INFO ] Input system was already deterministic with 481 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 13) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 481 rows 295 cols
[2023-04-07 04:53:05] [INFO ] Computed 18 invariants in 11 ms
[2023-04-07 04:53:05] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-04-07 04:53:05] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 17 ms returned sat
[2023-04-07 04:53:05] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 04:53:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-04-07 04:53:05] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 15 ms returned sat
[2023-04-07 04:53:06] [INFO ] After 1246ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 04:53:06] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:53:06] [INFO ] After 119ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 04:53:06] [INFO ] After 223ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-04-07 04:53:07] [INFO ] After 1677ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 481/481 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 295 transition count 434
Reduce places removed 47 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 56 rules applied. Total rules applied 103 place count 248 transition count 425
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 112 place count 239 transition count 425
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 112 place count 239 transition count 371
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 220 place count 185 transition count 371
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 225 place count 180 transition count 324
Iterating global reduction 3 with 5 rules applied. Total rules applied 230 place count 180 transition count 324
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 234 place count 178 transition count 322
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 242 place count 178 transition count 314
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 250 place count 170 transition count 314
Applied a total of 250 rules in 68 ms. Remains 170 /295 variables (removed 125) and now considering 314/481 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 170/295 places, 314/481 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 314 rows 170 cols
[2023-04-07 04:53:07] [INFO ] Computed 18 invariants in 7 ms
[2023-04-07 04:53:07] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:53:07] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-07 04:53:07] [INFO ] [Nat]Absence check using 9 positive and 9 generalized place invariants in 10 ms returned sat
[2023-04-07 04:53:07] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:53:07] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:53:07] [INFO ] After 25ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:53:07] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-04-07 04:53:07] [INFO ] After 246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 314/314 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 169 transition count 313
Applied a total of 2 rules in 15 ms. Remains 169 /170 variables (removed 1) and now considering 313/314 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 169/170 places, 313/314 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 7426 steps, run visited all 1 properties in 39 ms. (steps per millisecond=190 )
Probabilistic random walk after 7426 steps, saw 5647 distinct states, run finished after 39 ms. (steps per millisecond=190 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 295/295 places, 481/481 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 295 transition count 418
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 127 place count 232 transition count 417
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 231 transition count 417
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 128 place count 231 transition count 362
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 238 place count 176 transition count 362
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 244 place count 170 transition count 314
Iterating global reduction 3 with 6 rules applied. Total rules applied 250 place count 170 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 252 place count 169 transition count 313
Applied a total of 252 rules in 29 ms. Remains 169 /295 variables (removed 126) and now considering 313/481 (removed 168) transitions.
// Phase 1: matrix 313 rows 169 cols
[2023-04-07 04:53:07] [INFO ] Computed 18 invariants in 3 ms
[2023-04-07 04:53:07] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-04-07 04:53:07] [INFO ] Invariant cache hit.
[2023-04-07 04:53:08] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:53:08] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2023-04-07 04:53:08] [INFO ] Redundant transitions in 16 ms returned []
[2023-04-07 04:53:08] [INFO ] Invariant cache hit.
[2023-04-07 04:53:08] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 169/295 places, 313/481 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 648 ms. Remains : 169/295 places, 313/481 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s35 0) (EQ s111 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 125 reset in 251 ms.
Stack based approach found an accepted trace after 37 steps with 0 reset with depth 38 and stack size 38 in 1 ms.
FORMULA Anderson-PT-08-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLCardinality-03 finished in 1125 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 295/295 places, 481/481 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 295 transition count 418
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 126 place count 232 transition count 418
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 126 place count 232 transition count 363
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 236 place count 177 transition count 363
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 243 place count 170 transition count 314
Iterating global reduction 2 with 7 rules applied. Total rules applied 250 place count 170 transition count 314
Applied a total of 250 rules in 21 ms. Remains 170 /295 variables (removed 125) and now considering 314/481 (removed 167) transitions.
// Phase 1: matrix 314 rows 170 cols
[2023-04-07 04:53:08] [INFO ] Computed 18 invariants in 4 ms
[2023-04-07 04:53:09] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-04-07 04:53:09] [INFO ] Invariant cache hit.
[2023-04-07 04:53:09] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:53:09] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2023-04-07 04:53:09] [INFO ] Redundant transitions in 9 ms returned []
[2023-04-07 04:53:09] [INFO ] Invariant cache hit.
[2023-04-07 04:53:09] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 170/295 places, 314/481 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 672 ms. Remains : 170/295 places, 314/481 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s169 0) (EQ s103 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 167 ms.
Stack based approach found an accepted trace after 1676 steps with 0 reset with depth 1677 and stack size 1317 in 4 ms.
FORMULA Anderson-PT-08-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLCardinality-07 finished in 897 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 295/295 places, 481/481 transitions.
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 295 transition count 419
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 233 transition count 419
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 124 place count 233 transition count 363
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 236 place count 177 transition count 363
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 241 place count 172 transition count 344
Iterating global reduction 2 with 5 rules applied. Total rules applied 246 place count 172 transition count 344
Applied a total of 246 rules in 20 ms. Remains 172 /295 variables (removed 123) and now considering 344/481 (removed 137) transitions.
// Phase 1: matrix 344 rows 172 cols
[2023-04-07 04:53:09] [INFO ] Computed 18 invariants in 2 ms
[2023-04-07 04:53:09] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-04-07 04:53:09] [INFO ] Invariant cache hit.
[2023-04-07 04:53:10] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:53:10] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2023-04-07 04:53:10] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-07 04:53:10] [INFO ] Invariant cache hit.
[2023-04-07 04:53:10] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 172/295 places, 344/481 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 672 ms. Remains : 172/295 places, 344/481 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s29 0) (EQ s25 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]]
Product exploration explored 100000 steps with 107 reset in 140 ms.
Stack based approach found an accepted trace after 31 steps with 0 reset with depth 32 and stack size 32 in 0 ms.
FORMULA Anderson-PT-08-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLCardinality-08 finished in 866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(F(X(p0)) U !(X(p2)||p1))))'
Support contains 5 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 481/481 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 289 transition count 433
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 289 transition count 433
Applied a total of 12 rules in 14 ms. Remains 289 /295 variables (removed 6) and now considering 433/481 (removed 48) transitions.
// Phase 1: matrix 433 rows 289 cols
[2023-04-07 04:53:10] [INFO ] Computed 18 invariants in 4 ms
[2023-04-07 04:53:10] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-04-07 04:53:10] [INFO ] Invariant cache hit.
[2023-04-07 04:53:11] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:53:11] [INFO ] Implicit Places using invariants and state equation in 663 ms returned []
Implicit Place search using SMT with State Equation took 831 ms to find 0 implicit places.
[2023-04-07 04:53:11] [INFO ] Invariant cache hit.
[2023-04-07 04:53:11] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 289/295 places, 433/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1098 ms. Remains : 289/295 places, 433/481 transitions.
Stuttering acceptance computed with spot in 283 ms :[true, (NOT p2), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), p0]
Running random walk in product with property : Anderson-PT-08-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 0}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=3, aps=[p2:(OR (EQ s122 0) (EQ s23 1)), p1:(OR (EQ s122 0) (EQ s23 1) (EQ s246 0) (EQ s89 1)), p0:(EQ s232 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6251 steps with 0 reset in 13 ms.
FORMULA Anderson-PT-08-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-08-LTLCardinality-10 finished in 1500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G((G(p0)&&p1)) U X((!F(p1) U p2))) U !p0))'
Support contains 5 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 481/481 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 291 transition count 449
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 291 transition count 449
Applied a total of 8 rules in 13 ms. Remains 291 /295 variables (removed 4) and now considering 449/481 (removed 32) transitions.
// Phase 1: matrix 449 rows 291 cols
[2023-04-07 04:53:12] [INFO ] Computed 18 invariants in 8 ms
[2023-04-07 04:53:12] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-04-07 04:53:12] [INFO ] Invariant cache hit.
[2023-04-07 04:53:12] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:53:13] [INFO ] Implicit Places using invariants and state equation in 754 ms returned []
Implicit Place search using SMT with State Equation took 915 ms to find 0 implicit places.
[2023-04-07 04:53:13] [INFO ] Invariant cache hit.
[2023-04-07 04:53:13] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 291/295 places, 449/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1180 ms. Remains : 291/295 places, 449/481 transitions.
Stuttering acceptance computed with spot in 225 ms :[p1, p0, (OR (NOT p2) p1), (OR (NOT p2) p0 p1), true, (OR (NOT p2) p0)]
Running random walk in product with property : Anderson-PT-08-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 5}]], initial=1, aps=[p1:(EQ s73 1), p0:(OR (EQ s261 0) (EQ s91 1)), p2:(OR (EQ s111 0) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 126 ms.
Stack based approach found an accepted trace after 65 steps with 0 reset with depth 66 and stack size 66 in 1 ms.
FORMULA Anderson-PT-08-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-08-LTLCardinality-12 finished in 1559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(F((G(F(p2))||p1))))))'
Support contains 5 out of 295 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 295/295 places, 481/481 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 289 transition count 433
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 289 transition count 433
Applied a total of 12 rules in 9 ms. Remains 289 /295 variables (removed 6) and now considering 433/481 (removed 48) transitions.
// Phase 1: matrix 433 rows 289 cols
[2023-04-07 04:53:13] [INFO ] Computed 18 invariants in 4 ms
[2023-04-07 04:53:13] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-04-07 04:53:13] [INFO ] Invariant cache hit.
[2023-04-07 04:53:14] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:53:14] [INFO ] Implicit Places using invariants and state equation in 812 ms returned []
Implicit Place search using SMT with State Equation took 985 ms to find 0 implicit places.
[2023-04-07 04:53:14] [INFO ] Invariant cache hit.
[2023-04-07 04:53:14] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 289/295 places, 433/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1254 ms. Remains : 289/295 places, 433/481 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Anderson-PT-08-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s213 1) (EQ s48 0) (EQ s5 1)), p1:(OR (EQ s161 0) (EQ s158 1)), p2:(EQ s213 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 123 ms.
Product exploration explored 100000 steps with 3 reset in 192 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 104 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-04-07 04:53:16] [INFO ] Invariant cache hit.
[2023-04-07 04:53:16] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:53:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-04-07 04:53:16] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-04-07 04:53:16] [INFO ] After 202ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:53:16] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:53:16] [INFO ] After 35ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:53:16] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-04-07 04:53:16] [INFO ] After 404ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 433/433 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 289 transition count 386
Reduce places removed 47 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 56 rules applied. Total rules applied 103 place count 242 transition count 377
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 112 place count 233 transition count 377
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 112 place count 233 transition count 322
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 222 place count 178 transition count 322
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 224 place count 177 transition count 321
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 232 place count 177 transition count 313
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 240 place count 169 transition count 313
Applied a total of 240 rules in 23 ms. Remains 169 /289 variables (removed 120) and now considering 313/433 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 169/289 places, 313/433 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10978 steps, run visited all 1 properties in 29 ms. (steps per millisecond=378 )
Probabilistic random walk after 10978 steps, saw 8161 distinct states, run finished after 30 ms. (steps per millisecond=365 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 183 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 433/433 transitions.
Applied a total of 0 rules in 4 ms. Remains 289 /289 variables (removed 0) and now considering 433/433 (removed 0) transitions.
[2023-04-07 04:53:17] [INFO ] Invariant cache hit.
[2023-04-07 04:53:17] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-04-07 04:53:17] [INFO ] Invariant cache hit.
[2023-04-07 04:53:17] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:53:18] [INFO ] Implicit Places using invariants and state equation in 813 ms returned []
Implicit Place search using SMT with State Equation took 968 ms to find 0 implicit places.
[2023-04-07 04:53:18] [INFO ] Invariant cache hit.
[2023-04-07 04:53:18] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1217 ms. Remains : 289/289 places, 433/433 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 94 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 04:53:18] [INFO ] Invariant cache hit.
[2023-04-07 04:53:18] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 04:53:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-04-07 04:53:18] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2023-04-07 04:53:18] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 04:53:18] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:53:18] [INFO ] After 34ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 04:53:19] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-04-07 04:53:19] [INFO ] After 378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 433/433 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 289 transition count 386
Reduce places removed 47 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 56 rules applied. Total rules applied 103 place count 242 transition count 377
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 112 place count 233 transition count 377
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 55 Pre rules applied. Total rules applied 112 place count 233 transition count 322
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 222 place count 178 transition count 322
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 224 place count 177 transition count 321
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 232 place count 177 transition count 313
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 240 place count 169 transition count 313
Applied a total of 240 rules in 24 ms. Remains 169 /289 variables (removed 120) and now considering 313/433 (removed 120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 169/289 places, 313/433 transitions.
Finished random walk after 8190 steps, including 2 resets, run visited all 1 properties in 12 ms. (steps per millisecond=682 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 154 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 128 ms.
Product exploration explored 100000 steps with 0 reset in 158 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 5 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 433/433 transitions.
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 289 transition count 433
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 54 Pre rules applied. Total rules applied 56 place count 289 transition count 433
Deduced a syphon composed of 110 places in 0 ms
Iterating global reduction 1 with 54 rules applied. Total rules applied 110 place count 289 transition count 433
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 111 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 289 transition count 433
Deduced a syphon composed of 111 places in 0 ms
Applied a total of 111 rules in 48 ms. Remains 289 /289 variables (removed 0) and now considering 433/433 (removed 0) transitions.
[2023-04-07 04:53:20] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 433 rows 289 cols
[2023-04-07 04:53:20] [INFO ] Computed 18 invariants in 4 ms
[2023-04-07 04:53:20] [INFO ] Dead Transitions using invariants and state equation in 460 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/289 places, 433/433 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 522 ms. Remains : 289/289 places, 433/433 transitions.
Built C files in :
/tmp/ltsmin7335776732972013050
[2023-04-07 04:53:20] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7335776732972013050
Running compilation step : cd /tmp/ltsmin7335776732972013050;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 690 ms.
Running link step : cd /tmp/ltsmin7335776732972013050;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin7335776732972013050;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5725670126258458010.hoa' '--buchi-type=spotba'
LTSmin run took 715 ms.
FORMULA Anderson-PT-08-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-08-LTLCardinality-13 finished in 8740 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 295 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 295/295 places, 481/481 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 295 transition count 417
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 231 transition count 417
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 56 Pre rules applied. Total rules applied 128 place count 231 transition count 361
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 240 place count 175 transition count 361
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 247 place count 168 transition count 312
Iterating global reduction 2 with 7 rules applied. Total rules applied 254 place count 168 transition count 312
Applied a total of 254 rules in 19 ms. Remains 168 /295 variables (removed 127) and now considering 312/481 (removed 169) transitions.
// Phase 1: matrix 312 rows 168 cols
[2023-04-07 04:53:22] [INFO ] Computed 18 invariants in 2 ms
[2023-04-07 04:53:22] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-04-07 04:53:22] [INFO ] Invariant cache hit.
[2023-04-07 04:53:22] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:53:22] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2023-04-07 04:53:22] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 04:53:22] [INFO ] Invariant cache hit.
[2023-04-07 04:53:23] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 168/295 places, 312/481 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 637 ms. Remains : 168/295 places, 312/481 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-08-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s16 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]]
Product exploration explored 100000 steps with 9007 reset in 158 ms.
Product exploration explored 100000 steps with 9001 reset in 154 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2023-04-07 04:53:23] [INFO ] Invariant cache hit.
[2023-04-07 04:53:23] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-04-07 04:53:23] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2023-04-07 04:53:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 04:53:23] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2023-04-07 04:53:23] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:53:23] [INFO ] [Real]Added 56 Read/Feed constraints in 7 ms returned sat
[2023-04-07 04:53:23] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 04:53:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-04-07 04:53:24] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 11 ms returned sat
[2023-04-07 04:53:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 04:53:24] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2023-04-07 04:53:24] [INFO ] [Nat]Added 56 Read/Feed constraints in 10 ms returned sat
[2023-04-07 04:53:24] [INFO ] Computed and/alt/rep : 192/1552/192 causal constraints (skipped 112 transitions) in 25 ms.
[2023-04-07 04:53:24] [INFO ] Added : 35 causal constraints over 7 iterations in 227 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 312/312 transitions.
Applied a total of 0 rules in 7 ms. Remains 168 /168 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2023-04-07 04:53:24] [INFO ] Invariant cache hit.
[2023-04-07 04:53:24] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-04-07 04:53:24] [INFO ] Invariant cache hit.
[2023-04-07 04:53:24] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:53:24] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
[2023-04-07 04:53:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 04:53:24] [INFO ] Invariant cache hit.
[2023-04-07 04:53:25] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 594 ms. Remains : 168/168 places, 312/312 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2023-04-07 04:53:25] [INFO ] Invariant cache hit.
[2023-04-07 04:53:25] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-04-07 04:53:25] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2023-04-07 04:53:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 04:53:25] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2023-04-07 04:53:25] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-04-07 04:53:25] [INFO ] [Real]Added 56 Read/Feed constraints in 14 ms returned sat
[2023-04-07 04:53:25] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 04:53:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-04-07 04:53:25] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 15 ms returned sat
[2023-04-07 04:53:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 04:53:25] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2023-04-07 04:53:25] [INFO ] [Nat]Added 56 Read/Feed constraints in 11 ms returned sat
[2023-04-07 04:53:25] [INFO ] Computed and/alt/rep : 192/1552/192 causal constraints (skipped 112 transitions) in 22 ms.
[2023-04-07 04:53:26] [INFO ] Added : 35 causal constraints over 7 iterations in 201 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8996 reset in 143 ms.
Product exploration explored 100000 steps with 9003 reset in 153 ms.
Built C files in :
/tmp/ltsmin4923823260802078015
[2023-04-07 04:53:26] [INFO ] Computing symmetric may disable matrix : 312 transitions.
[2023-04-07 04:53:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 04:53:26] [INFO ] Computing symmetric may enable matrix : 312 transitions.
[2023-04-07 04:53:26] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 04:53:26] [INFO ] Computing Do-Not-Accords matrix : 312 transitions.
[2023-04-07 04:53:26] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 04:53:26] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4923823260802078015
Running compilation step : cd /tmp/ltsmin4923823260802078015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 579 ms.
Running link step : cd /tmp/ltsmin4923823260802078015;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin4923823260802078015;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16001884503276335638.hoa' '--buchi-type=spotba'
LTSmin run took 13889 ms.
FORMULA Anderson-PT-08-LTLCardinality-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-08-LTLCardinality-15 finished in 18475 ms.
All properties solved by simple procedures.
Total runtime 37548 ms.

BK_STOP 1680843221914

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Anderson-PT-08, 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 r517-tall-167987243300035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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