Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r083-tall-162048875800756.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 FMS-PT-00020, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875800756
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 10:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 10:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 18:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 18:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 16K May 5 16:51 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 FMS-PT-00020-00
FORMULA_NAME FMS-PT-00020-01
FORMULA_NAME FMS-PT-00020-02
FORMULA_NAME FMS-PT-00020-03
FORMULA_NAME FMS-PT-00020-04
FORMULA_NAME FMS-PT-00020-05
FORMULA_NAME FMS-PT-00020-06
FORMULA_NAME FMS-PT-00020-07
FORMULA_NAME FMS-PT-00020-08
FORMULA_NAME FMS-PT-00020-09
FORMULA_NAME FMS-PT-00020-10
FORMULA_NAME FMS-PT-00020-11
FORMULA_NAME FMS-PT-00020-12
FORMULA_NAME FMS-PT-00020-13
FORMULA_NAME FMS-PT-00020-14
FORMULA_NAME FMS-PT-00020-15

=== Now, execution of the tool begins

BK_START 1620659970349

Running Version 0
[2021-05-10 15:19:42] [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]
[2021-05-10 15:19:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 15:19:42] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2021-05-10 15:19:42] [INFO ] Transformed 22 places.
[2021-05-10 15:19:42] [INFO ] Transformed 20 transitions.
[2021-05-10 15:19:42] [INFO ] Parsed PT model containing 22 places and 20 transitions in 68 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-10 15:19:42] [INFO ] Initial state test concluded for 2 properties.
FORMULA FMS-PT-00020-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00020-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 7 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 15:19:42] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-10 15:19:42] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 15:19:42] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 15:19:42] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 15:19:42] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-10 15:19:42] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
[2021-05-10 15:19:42] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-10 15:19:42] [INFO ] Flatten gal took : 20 ms
FORMULA FMS-PT-00020-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00020-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00020-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 15:19:42] [INFO ] Flatten gal took : 4 ms
[2021-05-10 15:19:42] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=625 ) properties (out of 20) seen :17
Running SMT prover for 3 properties.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 15:19:43] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-10 15:19:43] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 15:19:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:19:43] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-10 15:19:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-10 15:19:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 15:19:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-10 15:19:43] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-10 15:19:43] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-10 15:19:43] [INFO ] Added : 10 causal constraints over 2 iterations in 24 ms. Result :sat
[2021-05-10 15:19:43] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned unsat
[2021-05-10 15:19:43] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-10 15:19:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-10 15:19:43] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-10 15:19:43] [INFO ] Solution in real domain found non-integer solution.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2021-05-10 15:19:43] [INFO ] Initial state test concluded for 2 properties.
FORMULA FMS-PT-00020-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00020-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 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 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 5 places and 0 transitions.
Graph (trivial) has 8 edges and 17 vertex of which 3 / 17 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 11 place count 15 transition count 15
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 7 edges and 13 vertex of which 3 / 13 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 2 with 5 rules applied. Total rules applied 16 place count 11 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 19 place count 10 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 19 place count 10 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 24 place count 7 transition count 9
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 26 place count 6 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 6 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 27 place count 6 transition count 6
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 29 place count 5 transition count 6
Applied a total of 29 rules in 10 ms. Remains 5 /22 variables (removed 17) and now considering 6/20 (removed 14) transitions.
// Phase 1: matrix 6 rows 5 cols
[2021-05-10 15:19:43] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-10 15:19:43] [INFO ] Implicit Places using invariants in 11 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 12 ms to find 1 implicit places.
[2021-05-10 15:19:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2021-05-10 15:19:43] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-10 15:19:43] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 4/22 places, 6/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-10 15:19:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2021-05-10 15:19:43] [INFO ] Computed 1 place invariants in 9 ms
[2021-05-10 15:19:43] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 2 iterations. Remains : 4/22 places, 6/20 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-00020-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s2 s0)], 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 0 steps with 0 reset in 1 ms.
FORMULA FMS-PT-00020-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00020-00 finished in 265 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 8 places and 0 transitions.
Graph (trivial) has 11 edges and 14 vertex of which 6 / 14 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 12 rules applied. Total rules applied 17 place count 10 transition count 12
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 25 place count 6 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 25 place count 6 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 5 transition count 7
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 28 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 31 place count 3 transition count 5
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 3 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 33 place count 2 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 34 place count 2 transition count 3
Applied a total of 34 rules in 10 ms. Remains 2 /22 variables (removed 20) and now considering 3/20 (removed 17) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 15:19:43] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-10 15:19:43] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 15:19:43] [INFO ] Computed 1 place invariants in 3 ms
[2021-05-10 15:19:43] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2021-05-10 15:19:43] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-10 15:19:43] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-10 15:19:43] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/22 places, 3/20 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-00020-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00020-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00020-01 finished in 85 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 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 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 18 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 17 transition count 16
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 9 place count 17 transition count 12
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 18 place count 12 transition count 12
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 25 place count 8 transition count 9
Applied a total of 25 rules in 4 ms. Remains 8 /22 variables (removed 14) and now considering 9/20 (removed 11) transitions.
// Phase 1: matrix 9 rows 8 cols
[2021-05-10 15:19:43] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 15:19:43] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 9 rows 8 cols
[2021-05-10 15:19:43] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 15:19:43] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2021-05-10 15:19:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 8 cols
[2021-05-10 15:19:43] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-10 15:19:43] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/22 places, 9/20 transitions.
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p0)]
Running random walk in product with property : FMS-PT-00020-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GT 2 s5) (GT s2 s6))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 89 steps with 0 reset in 2 ms.
FORMULA FMS-PT-00020-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00020-05 finished in 105 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 15:19:43] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-10 15:19:43] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 15:19:43] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 15:19:43] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 15:19:43] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-10 15:19:43] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-00020-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s12 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 FMS-PT-00020-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00020-06 finished in 116 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 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 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 4 places and 0 transitions.
Graph (trivial) has 9 edges and 18 vertex of which 6 / 18 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 9 place count 14 transition count 16
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 16 place count 11 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 11 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 10 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 9 transition count 10
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 21 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 8 transition count 8
Applied a total of 23 rules in 5 ms. Remains 8 /22 variables (removed 14) and now considering 8/20 (removed 12) transitions.
// Phase 1: matrix 8 rows 8 cols
[2021-05-10 15:19:43] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-10 15:19:43] [INFO ] Implicit Places using invariants in 10 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 11 ms to find 1 implicit places.
[2021-05-10 15:19:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 7 cols
[2021-05-10 15:19:43] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 15:19:43] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 7/22 places, 8/20 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 6 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 6 transition count 7
Applied a total of 2 rules in 2 ms. Remains 6 /7 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 6 cols
[2021-05-10 15:19:43] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-10 15:19:43] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2021-05-10 15:19:43] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-10 15:19:43] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 6/22 places, 7/20 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : FMS-PT-00020-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LEQ 1 s3) (LEQ s2 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00020-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00020-07 finished in 83 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((F((p1||X(p2)))&&p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 15:19:43] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 15:19:43] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 15:19:43] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 15:19:43] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 15:19:43] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 15:19:44] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FMS-PT-00020-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LEQ s0 s14) (LEQ 2 s6)), p1:(LEQ 2 s6), p2:(LEQ s2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2719 reset in 244 ms.
Stack based approach found an accepted trace after 370 steps with 7 reset with depth 4 and stack size 4 in 2 ms.
FORMULA FMS-PT-00020-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00020-09 finished in 458 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0&&X(F(p1))) U G(!p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 15:19:44] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 15:19:44] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 15:19:44] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 15:19:44] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 15:19:44] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 15:19:44] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 106 ms :[p0, p0, (NOT p1), p0, true]
Running random walk in product with property : FMS-PT-00020-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GT s18 s16), p1:(GT s10 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00020-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00020-12 finished in 171 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X((G(p0) U (p1||G(p2))))||G(p3))))], workingDir=/home/mcc/execution]
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 15:19:44] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 15:19:44] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 15:19:44] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 15:19:44] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 15:19:44] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 15:19:44] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (OR (AND p0 (NOT p3)) (AND p1 (NOT p3)) (AND p2 (NOT p3))), (AND (NOT p0) (NOT p2) (NOT p3) p1), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p1 (NOT p2) (NOT p3)))]
Running random walk in product with property : FMS-PT-00020-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=p3, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p3) (NOT p1) p2 p0), acceptance={} source=2 dest: 6}, { cond=(AND p3 (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND p3 (NOT p1) p2 p0), acceptance={} source=2 dest: 8}, { cond=(AND p3 (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 9}, { cond=(AND p3 (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 10}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p2 p0), acceptance={} source=6 dest: 6}], [{ cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p2) (AND (NOT p3) p0)), acceptance={} source=7 dest: 3}, { cond=(OR (AND p3 p1) (AND p3 p2) (AND p3 p0)), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p3) p1 (NOT p2) (NOT p0)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p3) p1 (NOT p2) p0), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p3) p1 p2 (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p3) p1 p2 p0), acceptance={} source=8 dest: 6}, { cond=(AND p3 p1 (NOT p2) (NOT p0)), acceptance={} source=8 dest: 7}, { cond=(AND p3 p1 p2 p0), acceptance={} source=8 dest: 8}, { cond=(AND p3 p1 (NOT p2) p0), acceptance={} source=8 dest: 9}, { cond=(AND p3 p1 p2 (NOT p0)), acceptance={} source=8 dest: 10}], [{ cond=(OR (AND (NOT p3) p1 (NOT p0)) (AND (NOT p3) p2 (NOT p0))), acceptance={} source=9 dest: 3}, { cond=(OR (AND (NOT p3) p1 p0) (AND (NOT p3) p2 p0)), acceptance={} source=9 dest: 4}, { cond=(OR (AND p3 p1 (NOT p0)) (AND p3 p2 (NOT p0))), acceptance={} source=9 dest: 7}, { cond=(OR (AND p3 p1 p0) (AND p3 p2 p0)), acceptance={} source=9 dest: 9}], [{ cond=(OR (AND (NOT p3) p1 (NOT p2)) (AND (NOT p3) (NOT p2) p0)), acceptance={} source=10 dest: 3}, { cond=(OR (AND (NOT p3) p1 p2) (AND (NOT p3) p2 p0)), acceptance={} source=10 dest: 5}, { cond=(OR (AND p3 p1 (NOT p2)) (AND p3 (NOT p2) p0)), acceptance={} source=10 dest: 7}, { cond=(OR (AND p3 p1 p2) (AND p3 p2 p0)), acceptance={} source=10 dest: 10}]], initial=0, aps=[p3:(GT s9 s15), p1:(LEQ 3 s16), p2:(LEQ s1 s5), p0:(GT 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 15529 steps with 3865 reset in 50 ms.
FORMULA FMS-PT-00020-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00020-14 finished in 432 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U X(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 15:19:44] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 15:19:44] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 15:19:44] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-10 15:19:45] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2021-05-10 15:19:45] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-10 15:19:45] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : FMS-PT-00020-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 s7), p1:(GT 2 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 379 reset in 168 ms.
Stack based approach found an accepted trace after 51 steps with 0 reset with depth 52 and stack size 52 in 0 ms.
FORMULA FMS-PT-00020-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00020-15 finished in 310 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620659986091

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="FMS-PT-00020"
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 FMS-PT-00020, 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 r083-tall-162048875800756"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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