Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245689300427.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is AutoFlight-PT-04b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245689300427
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 6.2K Apr 30 01:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 30 01:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 01:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 01:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 91K May 10 09:33 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 AutoFlight-PT-04b-LTLCardinality-00
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-01
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-02
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-03
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-04
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-05
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-06
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-07
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-08
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-09
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-10
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-11
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-12
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-13
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-14
FORMULA_NAME AutoFlight-PT-04b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652660948925

Running Version 202205111006
[2022-05-16 00:29:10] [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-05-16 00:29:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 00:29:10] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2022-05-16 00:29:10] [INFO ] Transformed 390 places.
[2022-05-16 00:29:10] [INFO ] Transformed 388 transitions.
[2022-05-16 00:29:10] [INFO ] Found NUPN structural information;
[2022-05-16 00:29:10] [INFO ] Parsed PT model containing 390 places and 388 transitions in 176 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
FORMULA AutoFlight-PT-04b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA AutoFlight-PT-04b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-04b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 388/388 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 344 transition count 342
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 344 transition count 342
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 99 place count 344 transition count 335
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 119 place count 324 transition count 315
Iterating global reduction 1 with 20 rules applied. Total rules applied 139 place count 324 transition count 315
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 141 place count 322 transition count 313
Iterating global reduction 1 with 2 rules applied. Total rules applied 143 place count 322 transition count 313
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 145 place count 320 transition count 311
Iterating global reduction 1 with 2 rules applied. Total rules applied 147 place count 320 transition count 311
Applied a total of 147 rules in 86 ms. Remains 320 /390 variables (removed 70) and now considering 311/388 (removed 77) transitions.
// Phase 1: matrix 311 rows 320 cols
[2022-05-16 00:29:10] [INFO ] Computed 28 place invariants in 17 ms
[2022-05-16 00:29:10] [INFO ] Implicit Places using invariants in 220 ms returned []
// Phase 1: matrix 311 rows 320 cols
[2022-05-16 00:29:10] [INFO ] Computed 28 place invariants in 7 ms
[2022-05-16 00:29:10] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
// Phase 1: matrix 311 rows 320 cols
[2022-05-16 00:29:10] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-16 00:29:11] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 320/390 places, 311/388 transitions.
Finished structural reductions, in 1 iterations. Remains : 320/390 places, 311/388 transitions.
Support contains 21 out of 320 places after structural reductions.
[2022-05-16 00:29:11] [INFO ] Flatten gal took : 42 ms
[2022-05-16 00:29:11] [INFO ] Flatten gal took : 17 ms
[2022-05-16 00:29:11] [INFO ] Input system was already deterministic with 311 transitions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 12) seen :9
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 311 rows 320 cols
[2022-05-16 00:29:11] [INFO ] Computed 28 place invariants in 3 ms
[2022-05-16 00:29:11] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-16 00:29:11] [INFO ] [Nat]Absence check using 27 positive place invariants in 7 ms returned sat
[2022-05-16 00:29:11] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-16 00:29:11] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-16 00:29:12] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 5 ms to minimize.
[2022-05-16 00:29:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2022-05-16 00:29:12] [INFO ] After 215ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-16 00:29:12] [INFO ] After 321ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 187 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=62 )
Parikh walk visited 2 properties in 8 ms.
FORMULA AutoFlight-PT-04b-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 5 simplifications.
FORMULA AutoFlight-PT-04b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 87 stabilizing places and 87 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(((p1 U p0) U G(F(p2))))))'
Support contains 6 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 319 transition count 200
Reduce places removed 110 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 124 rules applied. Total rules applied 234 place count 209 transition count 186
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 243 place count 201 transition count 185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 244 place count 200 transition count 185
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 244 place count 200 transition count 147
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 320 place count 162 transition count 147
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 324 place count 158 transition count 143
Iterating global reduction 4 with 4 rules applied. Total rules applied 328 place count 158 transition count 143
Performed 56 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 4 with 112 rules applied. Total rules applied 440 place count 102 transition count 81
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 441 place count 102 transition count 80
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 443 place count 101 transition count 79
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 444 place count 100 transition count 78
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 12 rules applied. Total rules applied 456 place count 92 transition count 74
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 460 place count 88 transition count 74
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 460 place count 88 transition count 70
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 468 place count 84 transition count 70
Applied a total of 468 rules in 42 ms. Remains 84 /320 variables (removed 236) and now considering 70/311 (removed 241) transitions.
// Phase 1: matrix 70 rows 84 cols
[2022-05-16 00:29:12] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 00:29:12] [INFO ] Implicit Places using invariants in 52 ms returned [50, 64, 68, 78, 83]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 54 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/320 places, 70/311 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 76 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 76 transition count 67
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 74 transition count 65
Applied a total of 10 rules in 4 ms. Remains 74 /79 variables (removed 5) and now considering 65/70 (removed 5) transitions.
// Phase 1: matrix 65 rows 74 cols
[2022-05-16 00:29:12] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-16 00:29:12] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 65 rows 74 cols
[2022-05-16 00:29:12] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-16 00:29:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 00:29:12] [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.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/320 places, 65/311 transitions.
Finished structural reductions, in 2 iterations. Remains : 74/320 places, 65/311 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s70 0) (EQ s21 1)), p2:(OR (EQ s35 0) (EQ s13 1) (EQ s6 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 4070 reset in 285 ms.
Product exploration explored 100000 steps with 4104 reset in 151 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p2), (X p2), true, (X (X p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 262 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 411 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 53 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1129077 steps, run visited all 1 properties in 1331 ms. (steps per millisecond=848 )
Probabilistic random walk after 1129077 steps, saw 163463 distinct states, run finished after 1331 ms. (steps per millisecond=848 ) properties seen :1
Knowledge obtained : [(AND p0 p2), (X p2), true, (X (X p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 353 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 81 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p2), (NOT p2)]
Support contains 4 out of 74 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 65/65 transitions.
Applied a total of 0 rules in 6 ms. Remains 74 /74 variables (removed 0) and now considering 65/65 (removed 0) transitions.
// Phase 1: matrix 65 rows 74 cols
[2022-05-16 00:29:15] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-16 00:29:15] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 65 rows 74 cols
[2022-05-16 00:29:15] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-16 00:29:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-16 00:29:15] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2022-05-16 00:29:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 65 rows 74 cols
[2022-05-16 00:29:15] [INFO ] Computed 15 place invariants in 4 ms
[2022-05-16 00:29:15] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 74/74 places, 65/65 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 95 ms :[(NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 406 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1129077 steps, run visited all 1 properties in 1248 ms. (steps per millisecond=904 )
Probabilistic random walk after 1129077 steps, saw 163463 distinct states, run finished after 1248 ms. (steps per millisecond=904 ) properties seen :1
Knowledge obtained : [p2, (X p2), (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 187 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 103 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 4077 reset in 170 ms.
Product exploration explored 100000 steps with 4068 reset in 291 ms.
Built C files in :
/tmp/ltsmin10531292270212796041
[2022-05-16 00:29:18] [INFO ] Computing symmetric may disable matrix : 65 transitions.
[2022-05-16 00:29:18] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:29:18] [INFO ] Computing symmetric may enable matrix : 65 transitions.
[2022-05-16 00:29:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:29:18] [INFO ] Computing Do-Not-Accords matrix : 65 transitions.
[2022-05-16 00:29:18] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 00:29:18] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10531292270212796041
Running compilation step : cd /tmp/ltsmin10531292270212796041;'/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 310 ms.
Running link step : cd /tmp/ltsmin10531292270212796041;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin10531292270212796041;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16177966732160012656.hoa' '--buchi-type=spotba'
LTSmin run took 3270 ms.
FORMULA AutoFlight-PT-04b-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property AutoFlight-PT-04b-LTLCardinality-02 finished in 9640 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(p0))))'
Support contains 2 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 319 transition count 196
Reduce places removed 114 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 128 rules applied. Total rules applied 242 place count 205 transition count 182
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 250 place count 197 transition count 182
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 250 place count 197 transition count 144
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 326 place count 159 transition count 144
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 335 place count 150 transition count 135
Iterating global reduction 3 with 9 rules applied. Total rules applied 344 place count 150 transition count 135
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 344 place count 150 transition count 132
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 350 place count 147 transition count 132
Performed 54 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
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 458 place count 93 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 459 place count 92 transition count 70
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 11 rules applied. Total rules applied 470 place count 84 transition count 67
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 473 place count 81 transition count 67
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 473 place count 81 transition count 63
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 481 place count 77 transition count 63
Applied a total of 481 rules in 36 ms. Remains 77 /320 variables (removed 243) and now considering 63/311 (removed 248) transitions.
// Phase 1: matrix 63 rows 77 cols
[2022-05-16 00:29:21] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 00:29:21] [INFO ] Implicit Places using invariants in 66 ms returned [29, 43, 57, 61, 65, 71, 76]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 67 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/320 places, 63/311 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 65 transition count 58
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 65 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 64 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 64 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 63 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 63 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 62 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 62 transition count 55
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 54
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 60 transition count 53
Applied a total of 20 rules in 15 ms. Remains 60 /70 variables (removed 10) and now considering 53/63 (removed 10) transitions.
// Phase 1: matrix 53 rows 60 cols
[2022-05-16 00:29:21] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 00:29:22] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 53 rows 60 cols
[2022-05-16 00:29:22] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 00:29:22] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/320 places, 53/311 transitions.
Finished structural reductions, in 2 iterations. Remains : 60/320 places, 53/311 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutoFlight-PT-04b-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 (NEQ s55 0) (NEQ s25 1) (EQ s25 0) (EQ s55 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]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLCardinality-03 finished in 300 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))&&G(X(p1))))'
Support contains 4 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 312 transition count 303
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 312 transition count 303
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 309 transition count 300
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 309 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 308 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 308 transition count 299
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 307 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 307 transition count 298
Applied a total of 26 rules in 36 ms. Remains 307 /320 variables (removed 13) and now considering 298/311 (removed 13) transitions.
// Phase 1: matrix 298 rows 307 cols
[2022-05-16 00:29:22] [INFO ] Computed 28 place invariants in 3 ms
[2022-05-16 00:29:22] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 298 rows 307 cols
[2022-05-16 00:29:22] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-16 00:29:22] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
// Phase 1: matrix 298 rows 307 cols
[2022-05-16 00:29:22] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-16 00:29:22] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 307/320 places, 298/311 transitions.
Finished structural reductions, in 1 iterations. Remains : 307/320 places, 298/311 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s121 0) (EQ s26 1)), p0:(OR (EQ s57 0) (EQ s214 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 108 steps with 0 reset in 1 ms.
FORMULA AutoFlight-PT-04b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLCardinality-06 finished in 554 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(G(((X(p1)||p1)&&p0)))||G(p2))))'
Support contains 4 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 311/311 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 310 transition count 301
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 310 transition count 301
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 310 transition count 300
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 307 transition count 297
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 307 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 306 transition count 296
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 306 transition count 296
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 305 transition count 295
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 305 transition count 295
Applied a total of 31 rules in 24 ms. Remains 305 /320 variables (removed 15) and now considering 295/311 (removed 16) transitions.
// Phase 1: matrix 295 rows 305 cols
[2022-05-16 00:29:22] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-16 00:29:22] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 295 rows 305 cols
[2022-05-16 00:29:22] [INFO ] Computed 28 place invariants in 15 ms
[2022-05-16 00:29:23] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
// Phase 1: matrix 295 rows 305 cols
[2022-05-16 00:29:23] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-16 00:29:23] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/320 places, 295/311 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/320 places, 295/311 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : AutoFlight-PT-04b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 6}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(AND (EQ s283 0) (EQ s143 1)), p2:(OR (EQ s279 0) (EQ s150 1)), p1:(AND (EQ s283 0) (EQ s143 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 83 steps with 0 reset in 0 ms.
FORMULA AutoFlight-PT-04b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutoFlight-PT-04b-LTLCardinality-10 finished in 634 ms.
All properties solved by simple procedures.
Total runtime 13259 ms.

BK_STOP 1652660963383

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="AutoFlight-PT-04b"
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 AutoFlight-PT-04b, 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 r006-tajo-165245689300427"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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