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-167856416300619.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-05120, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856416300619
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.9K Feb 26 10:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 10:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 10:48 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 4.1K Feb 25 16:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 16K Feb 25 16:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 10:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Feb 26 10:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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-05120-LTLCardinality-00
FORMULA_NAME MAPK-PT-05120-LTLCardinality-01
FORMULA_NAME MAPK-PT-05120-LTLCardinality-02
FORMULA_NAME MAPK-PT-05120-LTLCardinality-03
FORMULA_NAME MAPK-PT-05120-LTLCardinality-04
FORMULA_NAME MAPK-PT-05120-LTLCardinality-05
FORMULA_NAME MAPK-PT-05120-LTLCardinality-06
FORMULA_NAME MAPK-PT-05120-LTLCardinality-07
FORMULA_NAME MAPK-PT-05120-LTLCardinality-08
FORMULA_NAME MAPK-PT-05120-LTLCardinality-09
FORMULA_NAME MAPK-PT-05120-LTLCardinality-10
FORMULA_NAME MAPK-PT-05120-LTLCardinality-11
FORMULA_NAME MAPK-PT-05120-LTLCardinality-12
FORMULA_NAME MAPK-PT-05120-LTLCardinality-13
FORMULA_NAME MAPK-PT-05120-LTLCardinality-14
FORMULA_NAME MAPK-PT-05120-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679468204653

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-05120
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 06:56:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 06:56:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 06:56:46] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2023-03-22 06:56:46] [INFO ] Transformed 22 places.
[2023-03-22 06:56:46] [INFO ] Transformed 30 transitions.
[2023-03-22 06:56:46] [INFO ] Parsed PT model containing 22 places and 30 transitions and 90 arcs in 312 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MAPK-PT-05120-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-05120-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-05120-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 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 14 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:56:46] [INFO ] Computed 7 place invariants in 7 ms
[2023-03-22 06:56:46] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-22 06:56:46] [INFO ] Invariant cache hit.
[2023-03-22 06:56:47] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2023-03-22 06:56:47] [INFO ] Invariant cache hit.
[2023-03-22 06:56:47] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 239 ms. Remains : 22/22 places, 30/30 transitions.
Support contains 20 out of 22 places after structural reductions.
[2023-03-22 06:56:47] [INFO ] Flatten gal took : 17 ms
[2023-03-22 06:56:47] [INFO ] Flatten gal took : 5 ms
[2023-03-22 06:56:47] [INFO ] Input system was already deterministic with 30 transitions.
Incomplete random walk after 10250 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=427 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 24) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-22 06:56:47] [INFO ] Invariant cache hit.
[2023-03-22 06:56:47] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-22 06:56:47] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-22 06:56:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-22 06:56:47] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-22 06:56:47] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-22 06:56:47] [INFO ] After 214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 18 Parikh solutions to 17 different solutions.
Finished Parikh walk after 33079 steps, including 0 resets, run visited all 1 properties in 42 ms. (steps per millisecond=787 )
Parikh walk visited 18 properties in 5090 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(p0)||X(G((p1||G(p2))))))'
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 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-22 06:56:53] [INFO ] Invariant cache hit.
[2023-03-22 06:56:53] [INFO ] Implicit Places using invariants in 34 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 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 38 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 336 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 2}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=1, aps=[p0:(LEQ s2 s11), p2:(GT 2 s11), p1:(LEQ 3 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 80 steps with 0 reset in 2 ms.
FORMULA MAPK-PT-05120-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-00 finished in 435 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 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:56:53] [INFO ] Invariant cache hit.
[2023-03-22 06:56:53] [INFO ] Implicit Places using invariants in 33 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 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 36 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s9 s5)], 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 158 ms.
Product exploration explored 100000 steps with 50000 reset in 102 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), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MAPK-PT-05120-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MAPK-PT-05120-LTLCardinality-01 finished in 440 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||X((G(!p1)||(!p1&&F(p2))))))))'
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 2 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-22 06:56:54] [INFO ] Invariant cache hit.
[2023-03-22 06:56:54] [INFO ] Implicit Places using invariants in 34 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 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 38 ms. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s8 s6), p1:(AND (LEQ s8 s6) (LEQ 3 s14)), p2:(GT s10 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 64 ms.
Product exploration explored 100000 steps with 50000 reset in 59 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) (NOT p2)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 77 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MAPK-PT-05120-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MAPK-PT-05120-LTLCardinality-02 finished in 443 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(F(p0))&&F(p1))))'
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 2 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-22 06:56:54] [INFO ] Invariant cache hit.
[2023-03-22 06:56:54] [INFO ] Implicit Places using invariants in 36 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 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 2 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 41 ms. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s19 s13), p1:(LEQ s8 s11)], 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 0 reset in 150 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA MAPK-PT-05120-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-03 finished in 376 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)))'
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 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 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 6 place count 18 transition count 28
Graph (trivial) has 4 edges and 18 vertex of which 2 / 18 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 17 transition count 28
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 10 place count 17 transition count 25
Partial Post-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 17 transition count 25
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 14 transition count 22
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 14 transition count 22
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 14 transition count 21
Applied a total of 24 rules in 19 ms. Remains 14 /22 variables (removed 8) and now considering 21/30 (removed 9) transitions.
[2023-03-22 06:56:54] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
// Phase 1: matrix 19 rows 14 cols
[2023-03-22 06:56:54] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 06:56:54] [INFO ] Implicit Places using invariants in 28 ms returned [6, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/22 places, 21/30 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 20
Applied a total of 1 rules in 3 ms. Remains 12 /12 variables (removed 0) and now considering 20/21 (removed 1) transitions.
[2023-03-22 06:56:54] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 12 cols
[2023-03-22 06:56:54] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-22 06:56:54] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-22 06:56:54] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2023-03-22 06:56:54] [INFO ] Invariant cache hit.
[2023-03-22 06:56:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 06:56:54] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/22 places, 20/30 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 108 ms. Remains : 12/22 places, 20/30 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ s6 s4) (LEQ 3 s2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-05120-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-04 finished in 209 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(G(p0))&&F(!p0)))'
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 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 15 transition count 25
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 15 transition count 22
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 19 place count 15 transition count 22
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 21 place count 13 transition count 20
Iterating global reduction 0 with 2 rules applied. Total rules applied 23 place count 13 transition count 20
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 13 transition count 19
Applied a total of 24 rules in 12 ms. Remains 13 /22 variables (removed 9) and now considering 19/30 (removed 11) transitions.
[2023-03-22 06:56:55] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 13 cols
[2023-03-22 06:56:55] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 06:56:55] [INFO ] Implicit Places using invariants in 29 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/22 places, 19/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44 ms. Remains : 12/22 places, 19/30 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, p0, (NOT p0)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s4 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-05120-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-05 finished in 162 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 (G(p0)||(X(F(p2))&&p1))))))'
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:56:55] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-22 06:56:55] [INFO ] Implicit Places using invariants in 58 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 58 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 60 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p2:(GT s16 s4), p1:(AND (NOT (AND (LEQ s16 s4) (LEQ 1 s19))) (GT s8 s18)), p0:(GT s8 s18)], 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-05120-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-06 finished in 286 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&&(p1 U (p2&&X(X(F(!p1)))))))))'
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 4 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-22 06:56:55] [INFO ] Invariant cache hit.
[2023-03-22 06:56:55] [INFO ] Implicit Places using invariants in 31 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 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 40 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 266 ms :[(OR (NOT p2) (NOT p0) p1), (OR (NOT p2) p1), (OR (NOT p0) (NOT p2) p1), p1, p1]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=p2, acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(LEQ 2 s6), p1:(LEQ 1 s9), p0:(LEQ 1 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 397 reset in 209 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA MAPK-PT-05120-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-07 finished in 551 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)&&F(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 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 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 15 place count 13 transition count 24
Graph (trivial) has 8 edges and 13 vertex of which 2 / 13 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 16 place count 12 transition count 24
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 12 transition count 21
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 12 transition count 18
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 12 transition count 18
Applied a total of 24 rules in 6 ms. Remains 12 /22 variables (removed 10) and now considering 18/30 (removed 12) transitions.
[2023-03-22 06:56:56] [INFO ] Flow matrix only has 14 transitions (discarded 4 similar events)
// Phase 1: matrix 14 rows 12 cols
[2023-03-22 06:56:56] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 06:56:56] [INFO ] Implicit Places using invariants in 26 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/22 places, 18/30 transitions.
Applied a total of 0 rules in 4 ms. Remains 11 /11 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 37 ms. Remains : 11/22 places, 18/30 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s2), p1:(GT s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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-05120-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-08 finished in 185 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||G(p0))) U G(!p0)))))'
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.
// Phase 1: matrix 30 rows 22 cols
[2023-03-22 06:56:56] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-22 06:56:56] [INFO ] Implicit Places using invariants in 71 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 72 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 74 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 212 ms :[p0, p0, p0, p0, (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GT s12 s0), p1:(AND (GT s18 s14) (GT s12 s0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 98 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-05120-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-12 finished in 303 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)||X(X(G(p1)))))'
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 5 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-22 06:56:56] [INFO ] Invariant cache hit.
[2023-03-22 06:56:56] [INFO ] Implicit Places using invariants in 31 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 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 0 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 38 ms. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 305 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=p0, acceptance={} source=6 dest: 2}]], initial=4, aps=[p1:(AND (LEQ 1 s11) (GT s1 s15)), p0:(LEQ 2 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 170 ms.
Product exploration explored 100000 steps with 0 reset in 377 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 403 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10250 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1708 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2336418 steps, run timeout after 3001 ms. (steps per millisecond=778 ) properties seen :{}
Probabilistic random walk after 2336418 steps, saw 1453791 distinct states, run finished after 3002 ms. (steps per millisecond=778 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 30 rows 21 cols
[2023-03-22 06:57:01] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-22 06:57:01] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 06:57:01] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:57:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 06:57:01] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:57:01] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 06:57:01] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 30/30 transitions.
Graph (trivial) has 6 edges and 21 vertex of which 4 / 21 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 19 transition count 25
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 4 place count 17 transition count 25
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 17 transition count 24
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 11 rules applied. Total rules applied 16 place count 11 transition count 19
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 4 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 post reduction 1 with 6 rules applied. Total rules applied 22 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 4 edges and 9 vertex of which 3 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 7 transition count 12
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 31 place count 6 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 33 place count 5 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 34 place count 5 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 35 place count 5 transition count 5
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 36 place count 4 transition count 4
Iterating global reduction 5 with 1 rules applied. Total rules applied 37 place count 4 transition count 4
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 38 place count 4 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 41 place count 2 transition count 2
Applied a total of 41 rules in 153 ms. Remains 2 /21 variables (removed 19) and now considering 2/30 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 2/21 places, 2/30 transitions.
Finished random walk after 3841 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1920 )
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 233 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 21/21 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.
[2023-03-22 06:57:01] [INFO ] Invariant cache hit.
[2023-03-22 06:57:01] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-22 06:57:01] [INFO ] Invariant cache hit.
[2023-03-22 06:57:01] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-22 06:57:01] [INFO ] Invariant cache hit.
[2023-03-22 06:57:01] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 21/21 places, 30/30 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10250 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1464 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2769183 steps, run timeout after 3001 ms. (steps per millisecond=922 ) properties seen :{}
Probabilistic random walk after 2769183 steps, saw 1734566 distinct states, run finished after 3003 ms. (steps per millisecond=922 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 06:57:05] [INFO ] Invariant cache hit.
[2023-03-22 06:57:05] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 06:57:05] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:57:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 06:57:05] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:57:05] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 06:57:05] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 34558 steps, including 0 resets, run visited all 1 properties in 46 ms. (steps per millisecond=751 )
Parikh walk visited 1 properties in 46 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 158 ms.
Product exploration explored 100000 steps with 0 reset in 176 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Graph (trivial) has 6 edges and 21 vertex of which 4 / 21 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 19 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 29
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 0 with 5 rules applied. Total rules applied 7 place count 19 transition count 34
Deduced a syphon composed of 6 places in 0 ms
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 17 place count 19 transition count 24
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 17 rules in 10 ms. Remains 19 /21 variables (removed 2) and now considering 24/30 (removed 6) transitions.
[2023-03-22 06:57:06] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 06:57:06] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 19 cols
[2023-03-22 06:57:06] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-22 06:57:06] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/21 places, 24/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51 ms. Remains : 19/21 places, 24/30 transitions.
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2023-03-22 06:57:06] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-22 06:57:06] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 06:57:06] [INFO ] Invariant cache hit.
[2023-03-22 06:57:06] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-22 06:57:06] [INFO ] Invariant cache hit.
[2023-03-22 06:57:06] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 21/21 places, 30/30 transitions.
Treatment of property MAPK-PT-05120-LTLCardinality-13 finished in 9775 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||G((F(p1)&&F(G(!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 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:57:06] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-22 06:57:06] [INFO ] Implicit Places using invariants in 32 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 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 35 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), p0, (OR (NOT p1) p0)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT s17 s14), p1:(LEQ 3 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 37 reset in 157 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA MAPK-PT-05120-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-14 finished in 396 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(G(p0))))'
Support contains 1 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:57:06] [INFO ] Invariant cache hit.
[2023-03-22 06:57:06] [INFO ] Implicit Places using invariants in 31 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 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 34 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT 2 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-05120-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-15 finished in 175 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)||X(X(G(p1)))))'
Found a Lengthening insensitive property : MAPK-PT-05120-LTLCardinality-13
Stuttering acceptance computed with spot in 234 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LI_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 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 10 place count 16 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 16 transition count 25
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 16 transition count 25
Applied a total of 12 rules in 9 ms. Remains 16 /22 variables (removed 6) and now considering 25/30 (removed 5) transitions.
[2023-03-22 06:57:07] [INFO ] Flow matrix only has 23 transitions (discarded 2 similar events)
// Phase 1: matrix 23 rows 16 cols
[2023-03-22 06:57:07] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-22 06:57:07] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-22 06:57:07] [INFO ] Flow matrix only has 23 transitions (discarded 2 similar events)
[2023-03-22 06:57:07] [INFO ] Invariant cache hit.
[2023-03-22 06:57:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 06:57:07] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-22 06:57:07] [INFO ] Flow matrix only has 23 transitions (discarded 2 similar events)
[2023-03-22 06:57:07] [INFO ] Invariant cache hit.
[2023-03-22 06:57:07] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 16/22 places, 25/30 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 99 ms. Remains : 16/22 places, 25/30 transitions.
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=p0, acceptance={} source=6 dest: 2}]], initial=4, aps=[p1:(AND (LEQ 1 s10) (GT s0 s12)), p0:(LEQ 2 s7)], 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, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 169 ms.
Product exploration explored 100000 steps with 0 reset in 123 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 265 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10243 steps, including 1 resets, run finished after 5 ms. (steps per millisecond=2048 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3093687 steps, run timeout after 3001 ms. (steps per millisecond=1030 ) properties seen :{}
Probabilistic random walk after 3093687 steps, saw 1462298 distinct states, run finished after 3001 ms. (steps per millisecond=1030 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 06:57:10] [INFO ] Flow matrix only has 23 transitions (discarded 2 similar events)
[2023-03-22 06:57:10] [INFO ] Invariant cache hit.
[2023-03-22 06:57:11] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-22 06:57:11] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:57:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-22 06:57:11] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:57:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 06:57:11] [INFO ] After 2ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 06:57:11] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-22 06:57:11] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 104 ms.
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 25/25 transitions.
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t29 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 15 transition count 20
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 4 edges and 14 vertex of which 2 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 13 transition count 20
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 13 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 16 place count 9 transition count 15
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 4 edges and 9 vertex of which 3 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 3 with 4 rules applied. Total rules applied 20 place count 7 transition count 12
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 25 place count 6 transition count 8
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 5 with 2 rules applied. Total rules applied 27 place count 5 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 28 place count 5 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 29 place count 5 transition count 5
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 30 place count 4 transition count 4
Iterating global reduction 6 with 1 rules applied. Total rules applied 31 place count 4 transition count 4
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 32 place count 4 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 35 place count 2 transition count 2
Applied a total of 35 rules in 125 ms. Remains 2 /16 variables (removed 14) and now considering 2/25 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 2/16 places, 2/25 transitions.
Finished random walk after 3841 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3841 )
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 234 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 16 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-22 06:57:11] [INFO ] Flow matrix only has 23 transitions (discarded 2 similar events)
[2023-03-22 06:57:11] [INFO ] Invariant cache hit.
[2023-03-22 06:57:11] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 06:57:11] [INFO ] Flow matrix only has 23 transitions (discarded 2 similar events)
[2023-03-22 06:57:11] [INFO ] Invariant cache hit.
[2023-03-22 06:57:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 06:57:11] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-22 06:57:11] [INFO ] Flow matrix only has 23 transitions (discarded 2 similar events)
[2023-03-22 06:57:11] [INFO ] Invariant cache hit.
[2023-03-22 06:57:11] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 16/16 places, 25/25 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 111 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10243 steps, including 1 resets, run finished after 6 ms. (steps per millisecond=1707 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2866482 steps, run timeout after 3001 ms. (steps per millisecond=955 ) properties seen :{}
Probabilistic random walk after 2866482 steps, saw 1350742 distinct states, run finished after 3002 ms. (steps per millisecond=954 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 06:57:14] [INFO ] Flow matrix only has 23 transitions (discarded 2 similar events)
[2023-03-22 06:57:14] [INFO ] Invariant cache hit.
[2023-03-22 06:57:15] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-22 06:57:15] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 06:57:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-22 06:57:15] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 06:57:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 06:57:15] [INFO ] After 2ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 06:57:15] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-22 06:57:15] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 25/25 transitions.
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t29 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 15 transition count 20
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 4 edges and 14 vertex of which 2 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 13 transition count 20
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 13 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 16 place count 9 transition count 15
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 4 edges and 9 vertex of which 3 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 3 with 4 rules applied. Total rules applied 20 place count 7 transition count 12
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 25 place count 6 transition count 8
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 5 with 2 rules applied. Total rules applied 27 place count 5 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 28 place count 5 transition count 6
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 29 place count 5 transition count 5
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 30 place count 4 transition count 4
Iterating global reduction 6 with 1 rules applied. Total rules applied 31 place count 4 transition count 4
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 32 place count 4 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 35 place count 2 transition count 2
Applied a total of 35 rules in 137 ms. Remains 2 /16 variables (removed 14) and now considering 2/25 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 2/16 places, 2/25 transitions.
Finished random walk after 3841 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1920 )
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 121 ms.
Product exploration explored 100000 steps with 0 reset in 136 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 25/25 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 16 transition count 25
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 4 place count 16 transition count 28
Deduced a syphon composed of 4 places in 0 ms
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 11 place count 16 transition count 21
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 11 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 21/25 (removed 4) transitions.
[2023-03-22 06:57:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 06:57:16] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
// Phase 1: matrix 19 rows 16 cols
[2023-03-22 06:57:16] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-22 06:57:16] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/16 places, 21/25 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45 ms. Remains : 16/16 places, 21/25 transitions.
Support contains 1 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-22 06:57:16] [INFO ] Flow matrix only has 23 transitions (discarded 2 similar events)
// Phase 1: matrix 23 rows 16 cols
[2023-03-22 06:57:16] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-22 06:57:16] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-22 06:57:16] [INFO ] Flow matrix only has 23 transitions (discarded 2 similar events)
[2023-03-22 06:57:16] [INFO ] Invariant cache hit.
[2023-03-22 06:57:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 06:57:16] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-22 06:57:16] [INFO ] Flow matrix only has 23 transitions (discarded 2 similar events)
[2023-03-22 06:57:16] [INFO ] Invariant cache hit.
[2023-03-22 06:57:16] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 16/16 places, 25/25 transitions.
Treatment of property MAPK-PT-05120-LTLCardinality-13 finished in 9393 ms.
[2023-03-22 06:57:16] [INFO ] Flatten gal took : 3 ms
[2023-03-22 06:57:16] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-22 06:57:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 22 places, 30 transitions and 90 arcs took 1 ms.
Total runtime 29942 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT MAPK-PT-05120
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
LTLCardinality

BK_STOP 1679468252454

--------------------
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//
++ perl -pe 's/.*\.//g'
++ 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 MAPK-PT-05120-LTLCardinality-13
lola: time limit : 3600 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-05120-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 11/32 MAPK-PT-05120-LTLCardinality-13 1661671 m, 332334 m/sec, 7024567 t fired, .

Time elapsed: 5 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MAPK-PT-05120-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 28/32 MAPK-PT-05120-LTLCardinality-13 4259831 m, 519632 m/sec, 14159185 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
MAPK-PT-05120-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
MAPK-PT-05120-LTLCardinality-13: LTL unknown AGGR


Time elapsed: 15 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-05120"
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-05120, 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-167856416300619"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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