Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r039-tajo-167813692600507.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is BusinessProcesses-PT-08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692600507
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.9K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 16:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 91K Mar 5 18:22 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 BusinessProcesses-PT-08-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-08-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678502157644

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-08
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 02:35:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 02:35:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:35:59] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-11 02:35:59] [INFO ] Transformed 393 places.
[2023-03-11 02:35:59] [INFO ] Transformed 344 transitions.
[2023-03-11 02:35:59] [INFO ] Found NUPN structural information;
[2023-03-11 02:35:59] [INFO ] Parsed PT model containing 393 places and 344 transitions and 911 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 13 places in 11 ms
Reduce places removed 13 places and 13 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA BusinessProcesses-PT-08-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 331/331 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 372 transition count 331
Discarding 59 places :
Symmetric choice reduction at 1 with 59 rule applications. Total rules 67 place count 313 transition count 272
Iterating global reduction 1 with 59 rules applied. Total rules applied 126 place count 313 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 127 place count 313 transition count 271
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 159 place count 281 transition count 239
Iterating global reduction 2 with 32 rules applied. Total rules applied 191 place count 281 transition count 239
Applied a total of 191 rules in 80 ms. Remains 281 /380 variables (removed 99) and now considering 239/331 (removed 92) transitions.
// Phase 1: matrix 239 rows 281 cols
[2023-03-11 02:36:00] [INFO ] Computed 50 place invariants in 15 ms
[2023-03-11 02:36:00] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-03-11 02:36:00] [INFO ] Invariant cache hit.
[2023-03-11 02:36:00] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
[2023-03-11 02:36:00] [INFO ] Invariant cache hit.
[2023-03-11 02:36:01] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 281/380 places, 239/331 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 925 ms. Remains : 281/380 places, 239/331 transitions.
Support contains 37 out of 281 places after structural reductions.
[2023-03-11 02:36:01] [INFO ] Flatten gal took : 50 ms
[2023-03-11 02:36:01] [INFO ] Flatten gal took : 14 ms
[2023-03-11 02:36:01] [INFO ] Input system was already deterministic with 239 transitions.
Incomplete random walk after 10000 steps, including 89 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 23) seen :16
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-11 02:36:01] [INFO ] Invariant cache hit.
[2023-03-11 02:36:01] [INFO ] [Real]Absence check using 50 positive place invariants in 40 ms returned sat
[2023-03-11 02:36:01] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 02:36:02] [INFO ] [Nat]Absence check using 50 positive place invariants in 11 ms returned sat
[2023-03-11 02:36:02] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-11 02:36:02] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 9 ms to minimize.
[2023-03-11 02:36:02] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 5 ms to minimize.
[2023-03-11 02:36:02] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2023-03-11 02:36:02] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2023-03-11 02:36:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 195 ms
[2023-03-11 02:36:02] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 1 ms to minimize.
[2023-03-11 02:36:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-03-11 02:36:02] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2023-03-11 02:36:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-11 02:36:02] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2023-03-11 02:36:02] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2023-03-11 02:36:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 99 ms
[2023-03-11 02:36:02] [INFO ] After 843ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-11 02:36:03] [INFO ] After 1043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 4 properties in 71 ms.
Support contains 5 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 239/239 transitions.
Graph (trivial) has 145 edges and 281 vertex of which 6 / 281 are part of one of the 1 SCC in 9 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 577 edges and 276 vertex of which 275 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 275 transition count 194
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 239 transition count 193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 238 transition count 193
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 76 place count 238 transition count 139
Deduced a syphon composed of 54 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 119 rules applied. Total rules applied 195 place count 173 transition count 139
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 207 place count 161 transition count 127
Iterating global reduction 3 with 12 rules applied. Total rules applied 219 place count 161 transition count 127
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 151 rules applied. Total rules applied 370 place count 84 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 371 place count 83 transition count 52
Applied a total of 371 rules in 78 ms. Remains 83 /281 variables (removed 198) and now considering 52/239 (removed 187) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 83/281 places, 52/239 transitions.
Finished random walk after 352 steps, including 17 resets, run visited all 3 properties in 5 ms. (steps per millisecond=70 )
FORMULA BusinessProcesses-PT-08-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BusinessProcesses-PT-08-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 100 stabilizing places and 96 stable transitions
Graph (complete) has 589 edges and 281 vertex of which 280 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&X(F((F(p3)&&p2)))&&p0)))'
Support contains 6 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 239/239 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 267 transition count 225
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 267 transition count 225
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 263 transition count 221
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 263 transition count 221
Applied a total of 36 rules in 28 ms. Remains 263 /281 variables (removed 18) and now considering 221/239 (removed 18) transitions.
// Phase 1: matrix 221 rows 263 cols
[2023-03-11 02:36:03] [INFO ] Computed 50 place invariants in 14 ms
[2023-03-11 02:36:03] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-03-11 02:36:03] [INFO ] Invariant cache hit.
[2023-03-11 02:36:03] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2023-03-11 02:36:03] [INFO ] Invariant cache hit.
[2023-03-11 02:36:04] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 263/281 places, 221/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 631 ms. Remains : 263/281 places, 221/239 transitions.
Stuttering acceptance computed with spot in 407 ms :[(NOT p1), (OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p3) (NOT p0)), true]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND p1 p2 p3), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2 (NOT p3)), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 5}], [{ cond=(AND p1 p3), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(AND (EQ s243 0) (EQ s39 1)), p2:(AND (EQ s57 0) (EQ s204 1)), p3:(AND (EQ s57 0) (EQ s204 1)), p0:(AND (EQ s237 0) (EQ s104 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-08-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLCardinality-00 finished in 1136 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((G(p1)||p0)))))))'
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 239/239 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 267 transition count 225
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 267 transition count 225
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 262 transition count 220
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 262 transition count 220
Applied a total of 38 rules in 21 ms. Remains 262 /281 variables (removed 19) and now considering 220/239 (removed 19) transitions.
// Phase 1: matrix 220 rows 262 cols
[2023-03-11 02:36:04] [INFO ] Computed 50 place invariants in 4 ms
[2023-03-11 02:36:04] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-11 02:36:04] [INFO ] Invariant cache hit.
[2023-03-11 02:36:04] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2023-03-11 02:36:04] [INFO ] Invariant cache hit.
[2023-03-11 02:36:05] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 262/281 places, 220/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 563 ms. Remains : 262/281 places, 220/239 transitions.
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (EQ s235 0) (EQ s134 1)), p0:(OR (EQ s102 0) (EQ s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 283 ms.
Product exploration explored 100000 steps with 20000 reset in 217 ms.
Computed a total of 92 stabilizing places and 88 stable transitions
Graph (complete) has 558 edges and 262 vertex of which 261 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 92 stabilizing places and 88 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 84 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 02:36:06] [INFO ] Invariant cache hit.
[2023-03-11 02:36:06] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 02:36:06] [INFO ] [Nat]Absence check using 50 positive place invariants in 11 ms returned sat
[2023-03-11 02:36:06] [INFO ] After 174ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), true, (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-08-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-08-LTLCardinality-03 finished in 1948 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||(p1&&X(!p2))) U (G((p0||(p1&&X(!p2))))||(X(!p2)&&p3)))))'
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 239/239 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 267 transition count 225
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 267 transition count 225
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 264 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 264 transition count 222
Applied a total of 34 rules in 14 ms. Remains 264 /281 variables (removed 17) and now considering 222/239 (removed 17) transitions.
// Phase 1: matrix 222 rows 264 cols
[2023-03-11 02:36:06] [INFO ] Computed 50 place invariants in 2 ms
[2023-03-11 02:36:06] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-11 02:36:06] [INFO ] Invariant cache hit.
[2023-03-11 02:36:06] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-11 02:36:06] [INFO ] Invariant cache hit.
[2023-03-11 02:36:06] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 264/281 places, 222/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 494 ms. Remains : 264/281 places, 222/239 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2)), true, p2, (AND (NOT p0) p2)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p3) p0) (AND (NOT p3) p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (AND p3 (NOT p0)) (AND (NOT p0) p1)), acceptance={} source=1 dest: 3}, { cond=(AND p3 p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}], [{ cond=(OR (AND (NOT p3) p0 p2) (AND (NOT p3) p1 p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(OR (AND p3 (NOT p0) p2) (AND (NOT p0) p1 p2)), acceptance={} source=4 dest: 3}, { cond=(AND p3 p0 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(AND (EQ s221 1) (NEQ s58 1)), p0:(NEQ s221 1), p1:(NEQ s58 1), p2:(OR (EQ s259 0) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 192 steps with 1 reset in 1 ms.
FORMULA BusinessProcesses-PT-08-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLCardinality-09 finished in 672 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U (p0&&G(p1))) U G(p2))))'
Support contains 6 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 239/239 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 266 transition count 224
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 266 transition count 224
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 261 transition count 219
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 261 transition count 219
Applied a total of 40 rules in 8 ms. Remains 261 /281 variables (removed 20) and now considering 219/239 (removed 20) transitions.
// Phase 1: matrix 219 rows 261 cols
[2023-03-11 02:36:07] [INFO ] Computed 50 place invariants in 2 ms
[2023-03-11 02:36:07] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-11 02:36:07] [INFO ] Invariant cache hit.
[2023-03-11 02:36:07] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-11 02:36:07] [INFO ] Invariant cache hit.
[2023-03-11 02:36:07] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 261/281 places, 219/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 380 ms. Remains : 261/281 places, 219/239 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p2), (NOT p2), true, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p2 (NOT p0)) (AND p2 p1)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND p2 p0 p1), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=6 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(OR (EQ s4 0) (EQ s181 1)), p0:(OR (EQ s178 0) (EQ s24 1)), p1:(OR (EQ s258 0) (EQ s195 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1712 steps with 311 reset in 4 ms.
FORMULA BusinessProcesses-PT-08-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLCardinality-10 finished in 608 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(p1))))'
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 239/239 transitions.
Graph (trivial) has 149 edges and 281 vertex of which 6 / 281 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 582 edges and 276 vertex of which 275 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 274 transition count 192
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 80 place count 235 transition count 192
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 80 place count 235 transition count 137
Deduced a syphon composed of 55 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 121 rules applied. Total rules applied 201 place count 169 transition count 137
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 215 place count 155 transition count 123
Iterating global reduction 2 with 14 rules applied. Total rules applied 229 place count 155 transition count 123
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 145 rules applied. Total rules applied 374 place count 81 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 375 place count 80 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 376 place count 79 transition count 51
Applied a total of 376 rules in 23 ms. Remains 79 /281 variables (removed 202) and now considering 51/239 (removed 188) transitions.
// Phase 1: matrix 51 rows 79 cols
[2023-03-11 02:36:07] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-11 02:36:07] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-11 02:36:07] [INFO ] Invariant cache hit.
[2023-03-11 02:36:07] [INFO ] Implicit Places using invariants and state equation in 60 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 59, 61]
Discarding 16 places :
Implicit Place search using SMT with State Equation took 125 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/281 places, 51/239 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 62 transition count 50
Applied a total of 2 rules in 3 ms. Remains 62 /63 variables (removed 1) and now considering 50/51 (removed 1) transitions.
// Phase 1: matrix 50 rows 62 cols
[2023-03-11 02:36:07] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-11 02:36:07] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-11 02:36:07] [INFO ] Invariant cache hit.
[2023-03-11 02:36:08] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/281 places, 50/239 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 255 ms. Remains : 62/281 places, 50/239 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s53 0) (EQ s23 1)), p1:(AND (EQ s42 0) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1137 steps with 176 reset in 4 ms.
FORMULA BusinessProcesses-PT-08-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLCardinality-11 finished in 368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 239/239 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 264 transition count 222
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 264 transition count 222
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 259 transition count 217
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 259 transition count 217
Applied a total of 44 rules in 12 ms. Remains 259 /281 variables (removed 22) and now considering 217/239 (removed 22) transitions.
// Phase 1: matrix 217 rows 259 cols
[2023-03-11 02:36:08] [INFO ] Computed 50 place invariants in 1 ms
[2023-03-11 02:36:08] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-11 02:36:08] [INFO ] Invariant cache hit.
[2023-03-11 02:36:08] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2023-03-11 02:36:08] [INFO ] Invariant cache hit.
[2023-03-11 02:36:08] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 259/281 places, 217/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 586 ms. Remains : 259/281 places, 217/239 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s115 0) (EQ s204 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 152 ms.
Product exploration explored 100000 steps with 50000 reset in 161 ms.
Computed a total of 90 stabilizing places and 86 stable transitions
Graph (complete) has 551 edges and 259 vertex of which 258 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 90 stabilizing places and 86 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-08-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-08-LTLCardinality-12 finished in 1029 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&p0)))'
Support contains 3 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 239/239 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 265 transition count 223
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 265 transition count 223
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 261 transition count 219
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 261 transition count 219
Applied a total of 40 rules in 17 ms. Remains 261 /281 variables (removed 20) and now considering 219/239 (removed 20) transitions.
// Phase 1: matrix 219 rows 261 cols
[2023-03-11 02:36:09] [INFO ] Computed 50 place invariants in 1 ms
[2023-03-11 02:36:09] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-11 02:36:09] [INFO ] Invariant cache hit.
[2023-03-11 02:36:09] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-03-11 02:36:09] [INFO ] Invariant cache hit.
[2023-03-11 02:36:09] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 261/281 places, 219/239 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 329 ms. Remains : 261/281 places, 219/239 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : BusinessProcesses-PT-08-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s125 0), p0:(AND (EQ s138 0) (EQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-08-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-LTLCardinality-13 finished in 418 ms.
All properties solved by simple procedures.
Total runtime 9841 ms.
ITS solved all properties within timeout

BK_STOP 1678502169815

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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="BusinessProcesses-PT-08"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is BusinessProcesses-PT-08, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r039-tajo-167813692600507"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-08.tgz
mv BusinessProcesses-PT-08 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;