Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r231-tall-167856416300603.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is MAPK-PT-01280, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856416300603
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 10:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 10:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 10:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 10:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 10:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 10:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 25K 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 MAPK-PT-01280-LTLCardinality-00
FORMULA_NAME MAPK-PT-01280-LTLCardinality-01
FORMULA_NAME MAPK-PT-01280-LTLCardinality-02
FORMULA_NAME MAPK-PT-01280-LTLCardinality-03
FORMULA_NAME MAPK-PT-01280-LTLCardinality-04
FORMULA_NAME MAPK-PT-01280-LTLCardinality-05
FORMULA_NAME MAPK-PT-01280-LTLCardinality-06
FORMULA_NAME MAPK-PT-01280-LTLCardinality-07
FORMULA_NAME MAPK-PT-01280-LTLCardinality-08
FORMULA_NAME MAPK-PT-01280-LTLCardinality-09
FORMULA_NAME MAPK-PT-01280-LTLCardinality-10
FORMULA_NAME MAPK-PT-01280-LTLCardinality-11
FORMULA_NAME MAPK-PT-01280-LTLCardinality-12
FORMULA_NAME MAPK-PT-01280-LTLCardinality-13
FORMULA_NAME MAPK-PT-01280-LTLCardinality-14
FORMULA_NAME MAPK-PT-01280-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679467729750

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=MAPK-PT-01280
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 06:48:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 06:48:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 06:48:51] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2023-03-22 06:48:51] [INFO ] Transformed 22 places.
[2023-03-22 06:48:51] [INFO ] Transformed 30 transitions.
[2023-03-22 06:48:51] [INFO ] Parsed PT model containing 22 places and 30 transitions and 90 arcs in 83 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA MAPK-PT-01280-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA MAPK-PT-01280-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 8 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2023-03-22 06:48:51] [INFO ] Computed 7 place invariants in 7 ms
[2023-03-22 06:48:51] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-22 06:48:51] [INFO ] Invariant cache hit.
[2023-03-22 06:48:51] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2023-03-22 06:48:51] [INFO ] Invariant cache hit.
[2023-03-22 06:48:51] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 242 ms. Remains : 22/22 places, 30/30 transitions.
Support contains 19 out of 22 places after structural reductions.
[2023-03-22 06:48:51] [INFO ] Flatten gal took : 16 ms
[2023-03-22 06:48:51] [INFO ] Flatten gal took : 5 ms
[2023-03-22 06:48:51] [INFO ] Input system was already deterministic with 30 transitions.
Incomplete random walk after 10273 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=489 ) properties (out of 20) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 06:48:52] [INFO ] Invariant cache hit.
[2023-03-22 06:48:52] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-22 06:48:52] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 06:48:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-22 06:48:52] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 06:48:52] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-22 06:48:52] [INFO ] After 88ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 7702 steps, including 0 resets, run visited all 3 properties in 80 ms. (steps per millisecond=96 )
Parikh walk visited 3 properties in 80 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
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((F(p0)||(!p0 U G(p1)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 15 transition count 24
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 15 place count 15 transition count 22
Applied a total of 15 rules in 9 ms. Remains 15 /22 variables (removed 7) and now considering 22/30 (removed 8) transitions.
[2023-03-22 06:48:52] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 15 cols
[2023-03-22 06:48:52] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-22 06:48:52] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-22 06:48:52] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-22 06:48:52] [INFO ] Invariant cache hit.
[2023-03-22 06:48:52] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-22 06:48:52] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-22 06:48:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 06:48:52] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-22 06:48:52] [INFO ] Invariant cache hit.
[2023-03-22 06:48:52] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/22 places, 22/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 15/22 places, 22/30 transitions.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MAPK-PT-01280-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s4 s13), p1:(LEQ 1 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 267 ms.
Product exploration explored 100000 steps with 0 reset in 237 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 303 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10909 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2181 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 06:48:53] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-22 06:48:53] [INFO ] Invariant cache hit.
[2023-03-22 06:48:53] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 06:48:53] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:48:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 06:48:53] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:48:53] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-22 06:48:53] [INFO ] After 7ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 06:48:53] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-22 06:48:53] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 22/22 transitions.
Graph (complete) has 30 edges and 15 vertex of which 12 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 12 transition count 14
Applied a total of 5 rules in 3 ms. Remains 12 /15 variables (removed 3) and now considering 14/22 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 12/15 places, 14/22 transitions.
Finished random walk after 3849 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3849 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 218 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 22/22 transitions.
Applied a total of 0 rules in 6 ms. Remains 15 /15 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-22 06:48:54] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-22 06:48:54] [INFO ] Invariant cache hit.
[2023-03-22 06:48:54] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-22 06:48:54] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-22 06:48:54] [INFO ] Invariant cache hit.
[2023-03-22 06:48:54] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-22 06:48:54] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-22 06:48:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 06:48:54] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-22 06:48:54] [INFO ] Invariant cache hit.
[2023-03-22 06:48:54] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 15/15 places, 22/22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 184 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10270 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1711 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 06:48:54] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-22 06:48:54] [INFO ] Invariant cache hit.
[2023-03-22 06:48:54] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 06:48:54] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:48:54] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 06:48:54] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:48:54] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-22 06:48:54] [INFO ] After 2ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 06:48:54] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-22 06:48:54] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 22/22 transitions.
Graph (complete) has 30 edges and 15 vertex of which 12 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 12 transition count 14
Applied a total of 5 rules in 2 ms. Remains 12 /15 variables (removed 3) and now considering 14/22 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 12/15 places, 14/22 transitions.
Incomplete random walk after 10271 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=5135 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 24345 steps, run visited all 1 properties in 50 ms. (steps per millisecond=486 )
Probabilistic random walk after 24345 steps, saw 17902 distinct states, run finished after 50 ms. (steps per millisecond=486 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 244 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 119 ms.
Product exploration explored 100000 steps with 0 reset in 265 ms.
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-22 06:48:55] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-22 06:48:55] [INFO ] Invariant cache hit.
[2023-03-22 06:48:55] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 06:48:55] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-22 06:48:55] [INFO ] Invariant cache hit.
[2023-03-22 06:48:55] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-22 06:48:55] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-22 06:48:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 06:48:55] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
[2023-03-22 06:48:55] [INFO ] Invariant cache hit.
[2023-03-22 06:48:55] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91 ms. Remains : 15/15 places, 22/22 transitions.
Treatment of property MAPK-PT-01280-LTLCardinality-00 finished in 3261 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' '!((F(p0)&&G(F(p1))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 13 rules applied. Total rules applied 16 place count 13 transition count 23
Graph (trivial) has 4 edges and 13 vertex of which 2 / 13 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 11 transition count 23
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 11 transition count 20
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 11 transition count 14
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 1 with 2 rules applied. Total rules applied 29 place count 10 transition count 13
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 10 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 10 transition count 12
Applied a total of 32 rules in 21 ms. Remains 10 /22 variables (removed 12) and now considering 12/30 (removed 18) transitions.
// Phase 1: matrix 12 rows 10 cols
[2023-03-22 06:48:55] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 06:48:55] [INFO ] Implicit Places using invariants in 21 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 22 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/22 places, 12/30 transitions.
Graph (trivial) has 4 edges and 8 vertex of which 2 / 8 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 6 transition count 10
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 6 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 5 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 0 with 2 rules applied. Total rules applied 7 place count 5 transition count 7
Applied a total of 7 rules in 1 ms. Remains 5 /8 variables (removed 3) and now considering 7/12 (removed 5) transitions.
// Phase 1: matrix 7 rows 5 cols
[2023-03-22 06:48:55] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-22 06:48:55] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-22 06:48:55] [INFO ] Invariant cache hit.
[2023-03-22 06:48:55] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/22 places, 7/30 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 84 ms. Remains : 5/22 places, 7/30 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : MAPK-PT-01280-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 2 s3), p1:(LEQ 1 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 178 ms.
Product exploration explored 100000 steps with 0 reset in 122 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 215 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Finished random walk after 961 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=961 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), true, (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 259 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 5 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-22 06:48:57] [INFO ] Invariant cache hit.
[2023-03-22 06:48:57] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-22 06:48:57] [INFO ] Invariant cache hit.
[2023-03-22 06:48:57] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-22 06:48:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 06:48:57] [INFO ] Invariant cache hit.
[2023-03-22 06:48:57] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 5/5 places, 7/7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Finished random walk after 3525 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1762 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 58 ms.
Product exploration explored 100000 steps with 0 reset in 70 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 7/7 transitions.
Graph (trivial) has 2 edges and 5 vertex of which 2 / 5 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4 transition count 5
Applied a total of 2 rules in 1 ms. Remains 4 /5 variables (removed 1) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 4 cols
[2023-03-22 06:48:57] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-22 06:48:57] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-22 06:48:57] [INFO ] Invariant cache hit.
[2023-03-22 06:48:57] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-22 06:48:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 06:48:57] [INFO ] Invariant cache hit.
[2023-03-22 06:48:57] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/5 places, 5/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 4/5 places, 5/7 transitions.
Treatment of property MAPK-PT-01280-LTLCardinality-01 finished in 2177 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' '!((((p0||X(G(p1))) U p2)&&X(F(p3))))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2023-03-22 06:48:57] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-22 06:48:57] [INFO ] Implicit Places using invariants in 44 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p2) (NOT p3)), (NOT p1), (NOT p2), (NOT p3), true]
Running random walk in product with property : MAPK-PT-01280-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ s9 s4), p0:(LEQ s5 s4), p1:(GT s5 s10), p3:(LEQ 3 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 651 reset in 183 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 0 ms.
FORMULA MAPK-PT-01280-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-01280-LTLCardinality-05 finished in 414 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(p0)))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-22 06:48:58] [INFO ] Invariant cache hit.
[2023-03-22 06:48:58] [INFO ] Implicit Places using invariants in 26 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 28 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-01280-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GT 3 s7) (GT 2 s1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 117 steps with 0 reset in 3 ms.
FORMULA MAPK-PT-01280-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-LTLCardinality-06 finished in 237 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(F((X(p0)&&((F(p1) U p2) U X(p3)))))))'
Support contains 7 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-22 06:48:58] [INFO ] Invariant cache hit.
[2023-03-22 06:48:58] [INFO ] Implicit Places using invariants in 30 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33 ms. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 467 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p2) p3)]
Running random walk in product with property : MAPK-PT-01280-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}, { cond=true, acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) p3), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p3), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p3), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=4 dest: 7}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(NOT p3), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 7}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=8 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) p3), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p2) (NOT p0) p3), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) p3), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p2) (NOT p0) p3), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(LEQ s11 s6), p1:(LEQ s8 s14), p0:(LEQ s18 s20), p3:(LEQ 1 s13)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3826 reset in 146 ms.
Stack based approach found an accepted trace after 15 steps with 1 reset with depth 12 and stack size 12 in 0 ms.
FORMULA MAPK-PT-01280-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-01280-LTLCardinality-07 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((X(!((p0 U p1) U !X(p1)))&&(F(p0) U p2))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-22 06:48:59] [INFO ] Invariant cache hit.
[2023-03-22 06:48:59] [INFO ] Implicit Places using invariants in 34 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 379 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p0), (NOT p2), (NOT p1), false, true, false, p1]
Running random walk in product with property : MAPK-PT-01280-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=p1, acceptance={} source=6 dest: 2}, { cond=p1, acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 9}], [{ cond=p1, acceptance={} source=9 dest: 7}]], initial=0, aps=[p2:(LEQ s0 s19), p0:(LEQ 2 s17), p1:(LEQ 3 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-01280-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-LTLCardinality-10 finished in 453 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))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-22 06:48:59] [INFO ] Invariant cache hit.
[2023-03-22 06:48:59] [INFO ] Implicit Places using invariants in 36 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : MAPK-PT-01280-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GT s1 s16) (GT 3 s11))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 59 ms.
Product exploration explored 100000 steps with 50000 reset in 68 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MAPK-PT-01280-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MAPK-PT-01280-LTLCardinality-12 finished in 328 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' '!(F(p0))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 19 rules applied. Total rules applied 22 place count 9 transition count 21
Graph (trivial) has 12 edges and 9 vertex of which 2 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 7 transition count 21
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 11 edges and 7 vertex of which 3 / 7 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 29 place count 5 transition count 17
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 35 place count 5 transition count 11
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 40 place count 5 transition count 6
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 2 with 2 rules applied. Total rules applied 42 place count 4 transition count 5
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 4 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 2 transition count 3
Applied a total of 46 rules in 11 ms. Remains 2 /22 variables (removed 20) and now considering 3/30 (removed 27) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-22 06:49:00] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 06:49:00] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-22 06:49:00] [INFO ] Invariant cache hit.
[2023-03-22 06:49:00] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-22 06:49:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 06:49:00] [INFO ] Invariant cache hit.
[2023-03-22 06:49:00] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/22 places, 3/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 78 ms. Remains : 2/22 places, 3/30 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : MAPK-PT-01280-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-01280-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-LTLCardinality-14 finished in 119 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||F((p0&&G(p1))))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 19 place count 11 transition count 22
Graph (trivial) has 8 edges and 11 vertex of which 2 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 10 transition count 22
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 10 transition count 19
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 10 transition count 16
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 10 transition count 16
Applied a total of 27 rules in 12 ms. Remains 10 /22 variables (removed 12) and now considering 16/30 (removed 14) transitions.
[2023-03-22 06:49:00] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
// Phase 1: matrix 13 rows 10 cols
[2023-03-22 06:49:00] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 06:49:00] [INFO ] Implicit Places using invariants in 21 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/22 places, 16/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 36 ms. Remains : 9/22 places, 16/30 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MAPK-PT-01280-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 s5), p1:(LEQ 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-01280-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-LTLCardinality-15 finished in 174 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((F(p0)||(!p0 U G(p1)))))'
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' '!((F(p0)&&G(F(p1))))'
[2023-03-22 06:49:00] [INFO ] Flatten gal took : 9 ms
[2023-03-22 06:49:00] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-22 06:49:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 22 places, 30 transitions and 90 arcs took 0 ms.
Total runtime 9424 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT MAPK-PT-01280
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/368
LTLCardinality

FORMULA MAPK-PT-01280-LTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679467751618

--------------------
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:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/368/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/368/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/368/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:535
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 10 (type EXCL) for 3 MAPK-PT-01280-LTLCardinality-01
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for MAPK-PT-01280-LTLCardinality-01
lola: result : false
lola: markings : 1
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 MAPK-PT-01280-LTLCardinality-00
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MAPK-PT-01280-LTLCardinality-00: LTL 0 0 1 0 1 0 0 0
MAPK-PT-01280-LTLCardinality-01: CONJ 0 1 0 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1800 19/32 MAPK-PT-01280-LTLCardinality-00 2852878 m, 570575 m/sec, 6763645 t fired, .

Time elapsed: 5 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for MAPK-PT-01280-LTLCardinality-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MAPK-PT-01280-LTLCardinality-00: LTL 0 0 0 0 1 0 1 0
MAPK-PT-01280-LTLCardinality-01: CONJ 0 1 0 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 10 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 8 (type EXCL) for 3 MAPK-PT-01280-LTLCardinality-01
lola: time limit : 3590 sec
lola: memory limit: 32 pages
lola: FINISHED task # 8 (type EXCL) for MAPK-PT-01280-LTLCardinality-01
lola: result : false
lola: markings : 9289
lola: fired transitions : 11211
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
MAPK-PT-01280-LTLCardinality-00: LTL unknown AGGR
MAPK-PT-01280-LTLCardinality-01: CONJ false LTL model checker


Time elapsed: 10 secs. Pages in use: 32

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="MAPK-PT-01280"
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 MAPK-PT-01280, 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 r231-tall-167856416300603"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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