About the Execution of ITS-Tools for DoubleLock-PT-p3s1
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
302.203 | 17625.00 | 32731.00 | 642.80 | TTFFTFFFTTFFTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r312-tall-165472282100339.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DoubleLock-PT-p3s1, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282100339
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 5.6K Jun 7 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Jun 7 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 7 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 7 16:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 6 15:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 15:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 11K Jun 7 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Jun 7 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 7 16:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Jun 7 16:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 15:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 39K Jun 6 12:11 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 DoubleLock-PT-p3s1-LTLCardinality-00
FORMULA_NAME DoubleLock-PT-p3s1-LTLCardinality-01
FORMULA_NAME DoubleLock-PT-p3s1-LTLCardinality-02
FORMULA_NAME DoubleLock-PT-p3s1-LTLCardinality-03
FORMULA_NAME DoubleLock-PT-p3s1-LTLCardinality-04
FORMULA_NAME DoubleLock-PT-p3s1-LTLCardinality-05
FORMULA_NAME DoubleLock-PT-p3s1-LTLCardinality-06
FORMULA_NAME DoubleLock-PT-p3s1-LTLCardinality-07
FORMULA_NAME DoubleLock-PT-p3s1-LTLCardinality-08
FORMULA_NAME DoubleLock-PT-p3s1-LTLCardinality-09
FORMULA_NAME DoubleLock-PT-p3s1-LTLCardinality-10
FORMULA_NAME DoubleLock-PT-p3s1-LTLCardinality-11
FORMULA_NAME DoubleLock-PT-p3s1-LTLCardinality-12
FORMULA_NAME DoubleLock-PT-p3s1-LTLCardinality-13
FORMULA_NAME DoubleLock-PT-p3s1-LTLCardinality-14
FORMULA_NAME DoubleLock-PT-p3s1-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1654805175779
Running Version 202205111006
[2022-06-09 20:06:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 20:06:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 20:06:17] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2022-06-09 20:06:17] [INFO ] Transformed 46 places.
[2022-06-09 20:06:17] [INFO ] Transformed 80 transitions.
[2022-06-09 20:06:17] [INFO ] Parsed PT model containing 46 places and 80 transitions in 164 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 4 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA DoubleLock-PT-p3s1-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s1-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s1-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s1-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s1-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s1-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 76/76 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 76
Applied a total of 1 rules in 16 ms. Remains 39 /40 variables (removed 1) and now considering 76/76 (removed 0) transitions.
[2022-06-09 20:06:17] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 39 cols
[2022-06-09 20:06:17] [INFO ] Computed 3 place invariants in 8 ms
[2022-06-09 20:06:17] [INFO ] Implicit Places using invariants in 127 ms returned []
[2022-06-09 20:06:17] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 39 cols
[2022-06-09 20:06:17] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 20:06:17] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-06-09 20:06:17] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2022-06-09 20:06:17] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 39 cols
[2022-06-09 20:06:17] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 20:06:17] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 39/40 places, 76/76 transitions.
Finished structural reductions, in 1 iterations. Remains : 39/40 places, 76/76 transitions.
Support contains 21 out of 39 places after structural reductions.
[2022-06-09 20:06:17] [INFO ] Flatten gal took : 26 ms
[2022-06-09 20:06:17] [INFO ] Flatten gal took : 11 ms
[2022-06-09 20:06:17] [INFO ] Input system was already deterministic with 76 transitions.
Incomplete random walk after 10000 steps, including 61 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-09 20:06:17] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 39 cols
[2022-06-09 20:06:17] [INFO ] Computed 3 place invariants in 8 ms
[2022-06-09 20:06:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 20:06:17] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Computed a total of 3 stabilizing places and 8 stable transitions
Graph (complete) has 178 edges and 39 vertex of which 37 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p0)||p1))&&X(X(!p0)))))'
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 37 transition count 76
Applied a total of 2 rules in 2 ms. Remains 37 /39 variables (removed 2) and now considering 76/76 (removed 0) transitions.
[2022-06-09 20:06:18] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:18] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 20:06:18] [INFO ] Implicit Places using invariants in 39 ms returned []
[2022-06-09 20:06:18] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:18] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 20:06:18] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-06-09 20:06:18] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2022-06-09 20:06:18] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:18] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 20:06:18] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 37/39 places, 76/76 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/39 places, 76/76 transitions.
Stuttering acceptance computed with spot in 355 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), p0, (NOT p0), true]
Running random walk in product with property : DoubleLock-PT-p3s1-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s14 s16), p0:(GT s36 s21)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 223 ms.
Product exploration explored 100000 steps with 25000 reset in 132 ms.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 6 states, 7 edges and 2 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 272 ms :[p0, p0, p0, p0, true]
Finished random walk after 89 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND p1 (NOT p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 137 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 142 ms :[p0, p0, p0, p0, true]
Support contains 2 out of 37 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 76/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2022-06-09 20:06:19] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 20:06:19] [INFO ] Implicit Places using invariants in 42 ms returned []
[2022-06-09 20:06:19] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 20:06:19] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-06-09 20:06:19] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2022-06-09 20:06:19] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:19] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 20:06:19] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 76/76 transitions.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 147 ms :[p0, p0, p0, p0, true]
Finished random walk after 30 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 133 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 141 ms :[p0, p0, p0, p0, true]
Stuttering acceptance computed with spot in 145 ms :[p0, p0, p0, p0, true]
Product exploration explored 100000 steps with 25000 reset in 94 ms.
Product exploration explored 100000 steps with 25000 reset in 156 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 134 ms :[p0, p0, p0, p0, true]
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 76/76 transitions.
Applied a total of 0 rules in 7 ms. Remains 37 /37 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2022-06-09 20:06:21] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-09 20:06:21] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:21] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 20:06:21] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 76/76 transitions.
Product exploration explored 100000 steps with 25000 reset in 193 ms.
Product exploration explored 100000 steps with 25000 reset in 157 ms.
Built C files in :
/tmp/ltsmin18285214784612160093
[2022-06-09 20:06:21] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18285214784612160093
Running compilation step : cd /tmp/ltsmin18285214784612160093;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 209 ms.
Running link step : cd /tmp/ltsmin18285214784612160093;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin18285214784612160093;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1780831904681545576.hoa' '--buchi-type=spotba'
LTSmin run took 435 ms.
FORMULA DoubleLock-PT-p3s1-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleLock-PT-p3s1-LTLCardinality-01 finished in 4388 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(p0)&&p1))))'
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 37 transition count 76
Applied a total of 2 rules in 2 ms. Remains 37 /39 variables (removed 2) and now considering 76/76 (removed 0) transitions.
[2022-06-09 20:06:22] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:22] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 20:06:22] [INFO ] Implicit Places using invariants in 39 ms returned []
[2022-06-09 20:06:22] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:22] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 20:06:22] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-06-09 20:06:22] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2022-06-09 20:06:22] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:22] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 20:06:22] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 37/39 places, 76/76 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/39 places, 76/76 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s1-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s31 s26), p0:(LEQ s9 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33308 reset in 86 ms.
Product exploration explored 100000 steps with 33301 reset in 91 ms.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 279 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 88 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 341 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 76/76 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2022-06-09 20:06:23] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:23] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 20:06:23] [INFO ] Implicit Places using invariants in 37 ms returned []
[2022-06-09 20:06:23] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:23] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 20:06:23] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-06-09 20:06:23] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2022-06-09 20:06:23] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:23] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 20:06:23] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 76/76 transitions.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 235 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 145 steps, including 1 resets, run visited all 3 properties in 3 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 330 ms. Reduced automaton from 3 states, 7 edges and 2 AP to 3 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 33444 reset in 79 ms.
Product exploration explored 100000 steps with 33351 reset in 100 ms.
Built C files in :
/tmp/ltsmin5262873081599222844
[2022-06-09 20:06:25] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5262873081599222844
Running compilation step : cd /tmp/ltsmin5262873081599222844;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 138 ms.
Running link step : cd /tmp/ltsmin5262873081599222844;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin5262873081599222844;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17445735950881357002.hoa' '--buchi-type=spotba'
LTSmin run took 1706 ms.
FORMULA DoubleLock-PT-p3s1-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleLock-PT-p3s1-LTLCardinality-02 finished in 5151 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(F(p0)))))'
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Graph (complete) has 178 edges and 39 vertex of which 37 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 37 /39 variables (removed 2) and now considering 76/76 (removed 0) transitions.
[2022-06-09 20:06:27] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 20:06:27] [INFO ] Implicit Places using invariants in 36 ms returned []
[2022-06-09 20:06:27] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 20:06:27] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-06-09 20:06:27] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2022-06-09 20:06:27] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-09 20:06:27] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:27] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-09 20:06:27] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/39 places, 76/76 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/39 places, 76/76 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s1-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:(GT s22 s27)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 90 steps with 2 reset in 0 ms.
FORMULA DoubleLock-PT-p3s1-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s1-LTLCardinality-03 finished in 252 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 37 transition count 76
Applied a total of 2 rules in 2 ms. Remains 37 /39 variables (removed 2) and now considering 76/76 (removed 0) transitions.
[2022-06-09 20:06:27] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:27] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 20:06:27] [INFO ] Implicit Places using invariants in 33 ms returned []
[2022-06-09 20:06:27] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:27] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 20:06:27] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-06-09 20:06:27] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2022-06-09 20:06:27] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:27] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 20:06:27] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 37/39 places, 76/76 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/39 places, 76/76 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s1-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ 2 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p3s1-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s1-LTLCardinality-05 finished in 224 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(p0))))'
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 37 transition count 76
Applied a total of 2 rules in 3 ms. Remains 37 /39 variables (removed 2) and now considering 76/76 (removed 0) transitions.
[2022-06-09 20:06:28] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:28] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 20:06:28] [INFO ] Implicit Places using invariants in 30 ms returned []
[2022-06-09 20:06:28] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:28] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 20:06:28] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-06-09 20:06:28] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2022-06-09 20:06:28] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:28] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 20:06:28] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 37/39 places, 76/76 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/39 places, 76/76 transitions.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s1-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s32 s28)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p3s1-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s1-LTLCardinality-07 finished in 244 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Graph (complete) has 178 edges and 39 vertex of which 37 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 37 /39 variables (removed 2) and now considering 76/76 (removed 0) transitions.
[2022-06-09 20:06:28] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:28] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 20:06:28] [INFO ] Implicit Places using invariants in 28 ms returned []
[2022-06-09 20:06:28] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:28] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 20:06:28] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-06-09 20:06:28] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2022-06-09 20:06:28] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-09 20:06:28] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:28] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 20:06:28] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/39 places, 76/76 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/39 places, 76/76 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s1-LTLCardinality-11 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:(LEQ 3 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 141 steps with 1 reset in 0 ms.
FORMULA DoubleLock-PT-p3s1-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s1-LTLCardinality-11 finished in 198 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(p0 U p1))||(X(p2)&&F(G(!p1)))))'
Support contains 5 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 37 transition count 76
Applied a total of 2 rules in 2 ms. Remains 37 /39 variables (removed 2) and now considering 76/76 (removed 0) transitions.
[2022-06-09 20:06:28] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:28] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 20:06:28] [INFO ] Implicit Places using invariants in 36 ms returned []
[2022-06-09 20:06:28] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:28] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 20:06:28] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-06-09 20:06:28] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2022-06-09 20:06:28] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:28] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 20:06:28] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 37/39 places, 76/76 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/39 places, 76/76 transitions.
Stuttering acceptance computed with spot in 163 ms :[p1, p1, true, p1, p1, p1]
Running random walk in product with property : DoubleLock-PT-p3s1-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(GT s5 s16), p2:(LEQ s19 s2), p0:(LEQ 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 31323 reset in 102 ms.
Product exploration explored 100000 steps with 31447 reset in 115 ms.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 6 factoid took 726 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 132 ms :[(AND p0 p2 p1), (AND p0 p2 p1), p1, p1]
Finished random walk after 39 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), true, (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 p2)), (F (AND p0 (NOT p1))), (F p1)]
Knowledge based reduction with 6 factoid took 380 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 117 ms :[(AND p0 p2 p1), (AND p0 p2 p1), p1, p1]
Stuttering acceptance computed with spot in 118 ms :[(AND p0 p2 p1), (AND p0 p2 p1), p1, p1]
Support contains 5 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 76/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2022-06-09 20:06:30] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 20:06:30] [INFO ] Implicit Places using invariants in 34 ms returned []
[2022-06-09 20:06:30] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 20:06:30] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-06-09 20:06:30] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2022-06-09 20:06:30] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:30] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 20:06:30] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 76/76 transitions.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 118 ms :[(AND p0 p2 p1), (AND p0 p2 p1), p1, p1]
Finished random walk after 33 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 p2)), (F (AND p0 (NOT p1))), (F p1)]
Knowledge based reduction with 2 factoid took 212 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 4 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 135 ms :[(AND p0 p2 p1), (AND p0 p2 p1), p1, p1]
Stuttering acceptance computed with spot in 133 ms :[(AND p0 p2 p1), (AND p0 p2 p1), p1, p1]
Stuttering acceptance computed with spot in 131 ms :[(AND p0 p2 p1), (AND p0 p2 p1), p1, p1]
Product exploration explored 100000 steps with 31495 reset in 80 ms.
Product exploration explored 100000 steps with 31468 reset in 91 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 119 ms :[(AND p0 p2 p1), (AND p0 p2 p1), p1, p1]
Support contains 5 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 76/76 transitions.
Applied a total of 0 rules in 4 ms. Remains 37 /37 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2022-06-09 20:06:31] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-09 20:06:31] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:31] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 20:06:31] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 76/76 transitions.
Product exploration explored 100000 steps with 31425 reset in 172 ms.
Product exploration explored 100000 steps with 31490 reset in 123 ms.
Built C files in :
/tmp/ltsmin17156371812461703468
[2022-06-09 20:06:32] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17156371812461703468
Running compilation step : cd /tmp/ltsmin17156371812461703468;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 139 ms.
Running link step : cd /tmp/ltsmin17156371812461703468;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin17156371812461703468;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15248212520276154468.hoa' '--buchi-type=spotba'
LTSmin run took 92 ms.
FORMULA DoubleLock-PT-p3s1-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleLock-PT-p3s1-LTLCardinality-12 finished in 4042 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Graph (complete) has 178 edges and 39 vertex of which 38 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 38 /39 variables (removed 1) and now considering 76/76 (removed 0) transitions.
[2022-06-09 20:06:32] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 38 cols
[2022-06-09 20:06:32] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 20:06:32] [INFO ] Implicit Places using invariants in 35 ms returned []
[2022-06-09 20:06:32] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 38 cols
[2022-06-09 20:06:32] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 20:06:32] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-06-09 20:06:32] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2022-06-09 20:06:32] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-09 20:06:32] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 38 cols
[2022-06-09 20:06:32] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 20:06:32] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/39 places, 76/76 transitions.
Finished structural reductions, in 1 iterations. Remains : 38/39 places, 76/76 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : DoubleLock-PT-p3s1-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 s36)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1057 steps with 10 reset in 3 ms.
FORMULA DoubleLock-PT-p3s1-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s1-LTLCardinality-13 finished in 178 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G(F(!(false U false)))))))'
Support contains 0 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Graph (complete) has 178 edges and 39 vertex of which 37 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 37 /39 variables (removed 2) and now considering 76/76 (removed 0) transitions.
[2022-06-09 20:06:32] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:32] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 20:06:32] [INFO ] Implicit Places using invariants in 39 ms returned []
[2022-06-09 20:06:32] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:32] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 20:06:32] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-06-09 20:06:32] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2022-06-09 20:06:32] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-09 20:06:32] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:32] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 20:06:32] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/39 places, 76/76 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/39 places, 76/76 transitions.
Stuttering acceptance computed with spot in 9 ms :[false]
Running random walk in product with property : DoubleLock-PT-p3s1-LTLCardinality-14 automaton TGBA Formula[mat=[[]], initial=0, aps=[], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA DoubleLock-PT-p3s1-LTLCardinality-14 TRUE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p3s1-LTLCardinality-14 finished in 164 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 76/76 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 37 transition count 76
Applied a total of 2 rules in 0 ms. Remains 37 /39 variables (removed 2) and now considering 76/76 (removed 0) transitions.
[2022-06-09 20:06:32] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:32] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 20:06:32] [INFO ] Implicit Places using invariants in 30 ms returned []
[2022-06-09 20:06:32] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:32] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 20:06:32] [INFO ] State equation strengthened by 12 read => feed constraints.
[2022-06-09 20:06:32] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2022-06-09 20:06:32] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 37 cols
[2022-06-09 20:06:32] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 20:06:33] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 37/39 places, 76/76 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/39 places, 76/76 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DoubleLock-PT-p3s1-LTLCardinality-15 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:(LEQ s13 0)], 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]]
Product exploration explored 100000 steps with 50000 reset in 76 ms.
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DoubleLock-PT-p3s1-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleLock-PT-p3s1-LTLCardinality-15 finished in 436 ms.
All properties solved by simple procedures.
Total runtime 16349 ms.
BK_STOP 1654805193404
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="DoubleLock-PT-p3s1"
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-4028"
echo " Executing tool itstools"
echo " Input is DoubleLock-PT-p3s1, 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 r312-tall-165472282100339"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p3s1.tgz
mv DoubleLock-PT-p3s1 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 '
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 ;