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.r168-tall-165277016500331.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 Philosophers-PT-000500, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016500331
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.5M
-rw-r--r-- 1 mcc users 331K Apr 29 12:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.8M Apr 29 12:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 278K Apr 29 11:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 29 11:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 238K May 9 08:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 895K May 9 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 195K May 9 08:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 884K May 9 08:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 46K May 9 08:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 130K May 9 08:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.1M May 10 09:34 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 Philosophers-PT-000500-LTLCardinality-00
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-01
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-02
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-03
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-04
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-05
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-06
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-07
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-08
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-09
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-10
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-11
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-12
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-13
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-14
FORMULA_NAME Philosophers-PT-000500-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652826079791

Running Version 202205111006
[2022-05-17 22:21:20] [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-17 22:21:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 22:21:21] [INFO ] Load time of PNML (sax parser for PT used): 184 ms
[2022-05-17 22:21:21] [INFO ] Transformed 2500 places.
[2022-05-17 22:21:21] [INFO ] Transformed 2500 transitions.
[2022-05-17 22:21:21] [INFO ] Parsed PT model containing 2500 places and 2500 transitions in 297 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 176 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Philosophers-PT-000500-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 31 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:21:21] [INFO ] Computed 1000 place invariants in 36 ms
[2022-05-17 22:21:22] [INFO ] Implicit Places using invariants in 592 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:21:22] [INFO ] Computed 1000 place invariants in 14 ms
[2022-05-17 22:21:23] [INFO ] Implicit Places using invariants and state equation in 1374 ms returned []
Implicit Place search using SMT with State Equation took 1993 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:21:23] [INFO ] Computed 1000 place invariants in 17 ms
[2022-05-17 22:21:25] [INFO ] Dead Transitions using invariants and state equation in 1473 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 2500 out of 2500 places after structural reductions.
[2022-05-17 22:21:25] [INFO ] Flatten gal took : 204 ms
[2022-05-17 22:21:25] [INFO ] Flatten gal took : 159 ms
[2022-05-17 22:21:26] [INFO ] Input system was already deterministic with 2500 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1788 ms. (steps per millisecond=5 ) properties (out of 19) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 640 ms. (steps per millisecond=15 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 584 ms. (steps per millisecond=17 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 414 ms. (steps per millisecond=24 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:21:30] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 22:21:31] [INFO ] After 556ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-17 22:21:32] [INFO ] [Nat]Absence check using 1000 positive place invariants in 171 ms returned sat
[2022-05-17 22:21:34] [INFO ] After 1226ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :2
[2022-05-17 22:21:34] [INFO ] After 1578ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :2
Attempting to minimize the solution found.
Minimization took 168 ms.
[2022-05-17 22:21:34] [INFO ] After 2805ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :2
Fused 6 Parikh solutions to 1 different solutions.
Finished Parikh walk after 500 steps, including 0 resets, run visited all 2 properties in 85 ms. (steps per millisecond=5 )
Parikh walk visited 2 properties in 91 ms.
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
FORMULA Philosophers-PT-000500-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA Philosophers-PT-000500-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 160 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:21:35] [INFO ] Computed 1000 place invariants in 13 ms
[2022-05-17 22:21:36] [INFO ] Implicit Places using invariants in 902 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:21:36] [INFO ] Computed 1000 place invariants in 14 ms
[2022-05-17 22:21:38] [INFO ] Implicit Places using invariants and state equation in 2120 ms returned []
Implicit Place search using SMT with State Equation took 3027 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:21:38] [INFO ] Computed 1000 place invariants in 7 ms
[2022-05-17 22:21:39] [INFO ] Dead Transitions using invariants and state equation in 1481 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-00 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 (ADD s1414 s1437 s1438 s1439 s1440 s1441 s1442 s1443 s1444 s1445 s1446 s1447 s1448 s1449 s1450 s1451 s1452 s1453 s1454 s1455 s1456 s1457 s1458 s14...], 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 timeout after 88840 steps with 44420 reset in 10001 ms.
Product exploration timeout after 87810 steps with 43905 reset in 10002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Philosophers-PT-000500-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-000500-LTLCardinality-00 finished in 39715 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F(p0)))&&F(p1)))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 65 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:22:14] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 22:22:15] [INFO ] Implicit Places using invariants in 1030 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:22:15] [INFO ] Computed 1000 place invariants in 6 ms
[2022-05-17 22:22:17] [INFO ] Implicit Places using invariants and state equation in 2255 ms returned []
Implicit Place search using SMT with State Equation took 3287 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:22:17] [INFO ] Computed 1000 place invariants in 5 ms
[2022-05-17 22:22:19] [INFO ] Dead Transitions using invariants and state equation in 1395 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 3 (ADD s1414 s1437 s1438 s1439 s1440 s1441 s1442 s1443 s1444 s1445 s1446 s1447 s1448 s1449 s1450 s1451 s1452 s1453 s1454 s1455 s1456 s1457 s1458 s...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 69880 steps with 15488 reset in 10002 ms.
Product exploration timeout after 68290 steps with 15082 reset in 10002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (NOT p1)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 191 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p1)]
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:23:21] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 22:23:36] [INFO ] [Real]Absence check using 1000 positive place invariants in 9859 ms returned unknown
Could not prove EG (NOT p1)
Support contains 500 out of 2500 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 : 2500/2500 places, 2500/2500 transitions.
Performed 500 Post agglomeration using F-continuation condition.Transition count delta: 500
Deduced a syphon composed of 500 places in 1 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 0 with 1000 rules applied. Total rules applied 1000 place count 2000 transition count 2000
Applied a total of 1000 rules in 218 ms. Remains 2000 /2500 variables (removed 500) and now considering 2000/2500 (removed 500) transitions.
// Phase 1: matrix 2000 rows 2000 cols
[2022-05-17 22:23:36] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 22:23:37] [INFO ] Implicit Places using invariants in 863 ms returned []
// Phase 1: matrix 2000 rows 2000 cols
[2022-05-17 22:23:37] [INFO ] Computed 1000 place invariants in 7 ms
[2022-05-17 22:23:39] [INFO ] Implicit Places using invariants and state equation in 2453 ms returned []
Implicit Place search using SMT with State Equation took 3322 ms to find 0 implicit places.
[2022-05-17 22:23:40] [INFO ] Redundant transitions in 113 ms returned []
// Phase 1: matrix 2000 rows 2000 cols
[2022-05-17 22:23:40] [INFO ] Computed 1000 place invariants in 7 ms
[2022-05-17 22:23:41] [INFO ] Dead Transitions using invariants and state equation in 1124 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2000/2500 places, 2000/2500 transitions.
Finished structural reductions, in 1 iterations. Remains : 2000/2500 places, 2000/2500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p1)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p1)]
// Phase 1: matrix 2000 rows 2000 cols
[2022-05-17 22:24:02] [INFO ] Computed 1000 place invariants in 6 ms
[2022-05-17 22:24:16] [INFO ] [Real]Absence check using 1000 positive place invariants in 10215 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Product exploration timeout after 65500 steps with 9349 reset in 10001 ms.
Stack based approach found an accepted trace after 1777 steps with 256 reset with depth 2 and stack size 2 in 279 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-01 finished in 132342 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X(G((p0||F(X(F(p1))))))))))'
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 43 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:24:27] [INFO ] Computed 1000 place invariants in 6 ms
[2022-05-17 22:24:27] [INFO ] Implicit Places using invariants in 423 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:24:27] [INFO ] Computed 1000 place invariants in 10 ms
[2022-05-17 22:24:28] [INFO ] Implicit Places using invariants and state equation in 1415 ms returned []
Implicit Place search using SMT with State Equation took 1841 ms to find 0 implicit places.
[2022-05-17 22:24:29] [INFO ] Redundant transitions in 232 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:24:29] [INFO ] Computed 1000 place invariants in 12 ms
[2022-05-17 22:24:30] [INFO ] Dead Transitions using invariants and state equation in 1513 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 95930 steps with 28 reset in 10001 ms.
Product exploration explored 100000 steps with 9 reset in 7787 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 190 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 216 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 46 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:25:58] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 22:25:59] [INFO ] Implicit Places using invariants in 426 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:25:59] [INFO ] Computed 1000 place invariants in 10 ms
[2022-05-17 22:26:00] [INFO ] Implicit Places using invariants and state equation in 1372 ms returned []
Implicit Place search using SMT with State Equation took 1800 ms to find 0 implicit places.
[2022-05-17 22:26:00] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:26:00] [INFO ] Computed 1000 place invariants in 7 ms
[2022-05-17 22:26:02] [INFO ] Dead Transitions using invariants and state equation in 1424 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 201 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 3335 steps, including 1 resets, run visited all 2 properties in 246 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 201 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 21 reset in 7011 ms.
Stack based approach found an accepted trace after 5707 steps with 2 reset with depth 5502 and stack size 5502 in 766 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-02 finished in 173438 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 15 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:27:20] [INFO ] Computed 1000 place invariants in 10 ms
[2022-05-17 22:27:21] [INFO ] Implicit Places using invariants in 615 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:27:21] [INFO ] Computed 1000 place invariants in 12 ms
[2022-05-17 22:27:22] [INFO ] Implicit Places using invariants and state equation in 1810 ms returned []
Implicit Place search using SMT with State Equation took 2427 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:27:22] [INFO ] Computed 1000 place invariants in 7 ms
[2022-05-17 22:27:24] [INFO ] Dead Transitions using invariants and state equation in 1484 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-03 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:(OR (LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36...], 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 Philosophers-PT-000500-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-03 finished in 4031 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(X(X(p0)))&&p1))))'
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 20 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:27:24] [INFO ] Computed 1000 place invariants in 7 ms
[2022-05-17 22:27:25] [INFO ] Implicit Places using invariants in 697 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:27:25] [INFO ] Computed 1000 place invariants in 5 ms
[2022-05-17 22:27:27] [INFO ] Implicit Places using invariants and state equation in 1846 ms returned []
Implicit Place search using SMT with State Equation took 2546 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:27:27] [INFO ] Computed 1000 place invariants in 12 ms
[2022-05-17 22:27:28] [INFO ] Dead Transitions using invariants and state equation in 1417 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={0} source=3 dest: 1}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (LEQ (ADD s1917 s1918 s1919 s1920 s1921 s1922 s1923 s1924 s1925 s1926 s1927 s1928 s1929 s1930 s1931 s1932 s1933 s1934 s1935 s1936 s1937 s1938 s1939...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 5091 ms.
Stack based approach found an accepted trace after 6473 steps with 0 reset with depth 6474 and stack size 6474 in 482 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-05 finished in 9739 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(F(X(p0))))))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Performed 499 Post agglomeration using F-continuation condition.Transition count delta: 499
Deduced a syphon composed of 499 places in 0 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 0 with 998 rules applied. Total rules applied 998 place count 2001 transition count 2001
Applied a total of 998 rules in 208 ms. Remains 2001 /2500 variables (removed 499) and now considering 2001/2500 (removed 499) transitions.
// Phase 1: matrix 2001 rows 2001 cols
[2022-05-17 22:27:34] [INFO ] Computed 1000 place invariants in 2 ms
[2022-05-17 22:27:35] [INFO ] Implicit Places using invariants in 1271 ms returned []
// Phase 1: matrix 2001 rows 2001 cols
[2022-05-17 22:27:35] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 22:27:38] [INFO ] Implicit Places using invariants and state equation in 2549 ms returned []
Implicit Place search using SMT with State Equation took 3824 ms to find 0 implicit places.
[2022-05-17 22:27:38] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 2001 rows 2001 cols
[2022-05-17 22:27:38] [INFO ] Computed 1000 place invariants in 5 ms
[2022-05-17 22:27:39] [INFO ] Dead Transitions using invariants and state equation in 1114 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2001/2500 places, 2001/2500 transitions.
Finished structural reductions, in 1 iterations. Remains : 2001/2500 places, 2001/2500 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-08 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 s1333 s2000)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 31 reset in 4609 ms.
Stack based approach found an accepted trace after 323 steps with 0 reset with depth 324 and stack size 324 in 45 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-08 finished in 9927 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 64 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:27:44] [INFO ] Computed 1000 place invariants in 8 ms
[2022-05-17 22:27:45] [INFO ] Implicit Places using invariants in 1445 ms returned []
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:27:45] [INFO ] Computed 1000 place invariants in 4 ms
[2022-05-17 22:27:48] [INFO ] Implicit Places using invariants and state equation in 3052 ms returned []
Implicit Place search using SMT with State Equation took 4498 ms to find 0 implicit places.
// Phase 1: matrix 2500 rows 2500 cols
[2022-05-17 22:27:48] [INFO ] Computed 1000 place invariants in 11 ms
[2022-05-17 22:27:50] [INFO ] Dead Transitions using invariants and state equation in 1431 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-11 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:(LEQ s2495 s724)], 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 5949 steps with 0 reset in 182 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-11 finished in 6288 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(F(p0)))))'
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Performed 494 Post agglomeration using F-continuation condition.Transition count delta: 494
Deduced a syphon composed of 494 places in 0 ms
Reduce places removed 494 places and 0 transitions.
Iterating global reduction 0 with 988 rules applied. Total rules applied 988 place count 2006 transition count 2006
Applied a total of 988 rules in 199 ms. Remains 2006 /2500 variables (removed 494) and now considering 2006/2500 (removed 494) transitions.
// Phase 1: matrix 2006 rows 2006 cols
[2022-05-17 22:27:50] [INFO ] Computed 1000 place invariants in 2 ms
[2022-05-17 22:27:51] [INFO ] Implicit Places using invariants in 1225 ms returned []
// Phase 1: matrix 2006 rows 2006 cols
[2022-05-17 22:27:51] [INFO ] Computed 1000 place invariants in 5 ms
[2022-05-17 22:27:54] [INFO ] Implicit Places using invariants and state equation in 2703 ms returned []
Implicit Place search using SMT with State Equation took 3930 ms to find 0 implicit places.
[2022-05-17 22:27:54] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 2006 rows 2006 cols
[2022-05-17 22:27:54] [INFO ] Computed 1000 place invariants in 7 ms
[2022-05-17 22:27:55] [INFO ] Dead Transitions using invariants and state equation in 1106 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2006/2500 places, 2006/2500 transitions.
Finished structural reductions, in 1 iterations. Remains : 2006/2500 places, 2006/2500 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-12 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:(OR (LEQ s2 s655) (LEQ s543 s2005))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7 reset in 2029 ms.
Stack based approach found an accepted trace after 317 steps with 0 reset with depth 318 and stack size 318 in 43 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-12 finished in 7413 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Performed 498 Post agglomeration using F-continuation condition.Transition count delta: 498
Deduced a syphon composed of 498 places in 1 ms
Reduce places removed 498 places and 0 transitions.
Iterating global reduction 0 with 996 rules applied. Total rules applied 996 place count 2002 transition count 2002
Applied a total of 996 rules in 170 ms. Remains 2002 /2500 variables (removed 498) and now considering 2002/2500 (removed 498) transitions.
// Phase 1: matrix 2002 rows 2002 cols
[2022-05-17 22:27:57] [INFO ] Computed 1000 place invariants in 2 ms
[2022-05-17 22:27:59] [INFO ] Implicit Places using invariants in 1208 ms returned []
// Phase 1: matrix 2002 rows 2002 cols
[2022-05-17 22:27:59] [INFO ] Computed 1000 place invariants in 3 ms
[2022-05-17 22:28:01] [INFO ] Implicit Places using invariants and state equation in 2343 ms returned []
Implicit Place search using SMT with State Equation took 3552 ms to find 0 implicit places.
[2022-05-17 22:28:01] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 2002 rows 2002 cols
[2022-05-17 22:28:01] [INFO ] Computed 1000 place invariants in 7 ms
[2022-05-17 22:28:02] [INFO ] Dead Transitions using invariants and state equation in 1087 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2002/2500 places, 2002/2500 transitions.
Finished structural reductions, in 1 iterations. Remains : 2002/2500 places, 2002/2500 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLCardinality-15 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 s553 s1555)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1627 ms.
Stack based approach found an accepted trace after 885 steps with 0 reset with depth 886 and stack size 886 in 86 ms.
FORMULA Philosophers-PT-000500-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLCardinality-15 finished in 6609 ms.
All properties solved by simple procedures.
Total runtime 403529 ms.

BK_STOP 1652826484487

--------------------
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="Philosophers-PT-000500"
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 Philosophers-PT-000500, 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 r168-tall-165277016500331"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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