fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r231-tall-167856416300571
Last Updated
May 14, 2023

About the Execution of LoLa+red for MAPK-PT-00080

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1051.840 34302.00 37335.00 634.70 FFF?FFFFFFFFFFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 5.9K Feb 26 10:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 26 10:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 10:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 10:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 26 10:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Feb 26 10:47 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-00080-LTLCardinality-00
FORMULA_NAME MAPK-PT-00080-LTLCardinality-01
FORMULA_NAME MAPK-PT-00080-LTLCardinality-02
FORMULA_NAME MAPK-PT-00080-LTLCardinality-03
FORMULA_NAME MAPK-PT-00080-LTLCardinality-04
FORMULA_NAME MAPK-PT-00080-LTLCardinality-05
FORMULA_NAME MAPK-PT-00080-LTLCardinality-06
FORMULA_NAME MAPK-PT-00080-LTLCardinality-07
FORMULA_NAME MAPK-PT-00080-LTLCardinality-08
FORMULA_NAME MAPK-PT-00080-LTLCardinality-09
FORMULA_NAME MAPK-PT-00080-LTLCardinality-10
FORMULA_NAME MAPK-PT-00080-LTLCardinality-11
FORMULA_NAME MAPK-PT-00080-LTLCardinality-12
FORMULA_NAME MAPK-PT-00080-LTLCardinality-13
FORMULA_NAME MAPK-PT-00080-LTLCardinality-14
FORMULA_NAME MAPK-PT-00080-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679464050651

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-00080
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-22 05:47:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 05:47:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 05:47:32] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2023-03-22 05:47:32] [INFO ] Transformed 22 places.
[2023-03-22 05:47:32] [INFO ] Transformed 30 transitions.
[2023-03-22 05:47:32] [INFO ] Parsed PT model containing 22 places and 30 transitions and 90 arcs in 78 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 2 formulas.
FORMULA MAPK-PT-00080-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00080-LTLCardinality-13 FALSE 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 8 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2023-03-22 05:47:32] [INFO ] Computed 7 place invariants in 9 ms
[2023-03-22 05:47:32] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-22 05:47:32] [INFO ] Invariant cache hit.
[2023-03-22 05:47:32] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-22 05:47:32] [INFO ] Invariant cache hit.
[2023-03-22 05:47:32] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 22/22 places, 30/30 transitions.
Support contains 20 out of 22 places after structural reductions.
[2023-03-22 05:47:32] [INFO ] Flatten gal took : 16 ms
[2023-03-22 05:47:32] [INFO ] Flatten gal took : 5 ms
[2023-03-22 05:47:32] [INFO ] Input system was already deterministic with 30 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 27) seen :24
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :2
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
Running SMT prover for 1 properties.
[2023-03-22 05:47:33] [INFO ] Invariant cache hit.
[2023-03-22 05:47:33] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 05:47:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 9 ms returned sat
[2023-03-22 05:47:33] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
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' '!(F(G(p0)))'
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 19 transition count 28
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 19 transition count 26
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 10 place count 19 transition count 26
Applied a total of 10 rules in 10 ms. Remains 19 /22 variables (removed 3) and now considering 26/30 (removed 4) transitions.
[2023-03-22 05:47:33] [INFO ] Flow matrix only has 24 transitions (discarded 2 similar events)
// Phase 1: matrix 24 rows 19 cols
[2023-03-22 05:47:33] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-22 05:47:33] [INFO ] Implicit Places using invariants in 33 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/22 places, 26/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 46 ms. Remains : 18/22 places, 26/30 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0)]
Running random walk in product with property : MAPK-PT-00080-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ 2 s17) (OR (GT s8 s3) (AND (LEQ 1 s5) (LEQ s10 s15))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 2 ms.
FORMULA MAPK-PT-00080-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00080-LTLCardinality-00 finished in 223 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(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 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 05:47:33] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-22 05:47:33] [INFO ] Implicit Places using invariants in 34 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 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 36 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : MAPK-PT-00080-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GT s14 s1) (LEQ s9 s12)), p0:(LEQ 2 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-00080-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00080-LTLCardinality-01 finished in 217 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 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 18 place count 12 transition count 22
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 21 place count 12 transition count 19
Applied a total of 21 rules in 10 ms. Remains 12 /22 variables (removed 10) and now considering 19/30 (removed 11) transitions.
[2023-03-22 05:47:33] [INFO ] Flow matrix only has 14 transitions (discarded 5 similar events)
// Phase 1: matrix 14 rows 12 cols
[2023-03-22 05:47:33] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 05:47:33] [INFO ] Implicit Places using invariants in 33 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/22 places, 19/30 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 17
Applied a total of 2 rules in 3 ms. Remains 11 /11 variables (removed 0) and now considering 17/19 (removed 2) transitions.
[2023-03-22 05:47:33] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
// Phase 1: matrix 14 rows 11 cols
[2023-03-22 05:47:33] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 05:47:33] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-22 05:47:33] [INFO ] Flow matrix only has 14 transitions (discarded 3 similar events)
[2023-03-22 05:47:33] [INFO ] Invariant cache hit.
[2023-03-22 05:47:33] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 05:47:33] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/22 places, 17/30 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 103 ms. Remains : 11/22 places, 17/30 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-00080-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s9 s6)], 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 3 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-00080-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00080-LTLCardinality-02 finished in 184 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||X(X(X(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 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 05:47:34] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-22 05:47:34] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-22 05:47:34] [INFO ] Invariant cache hit.
[2023-03-22 05:47:34] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-22 05:47:34] [INFO ] Invariant cache hit.
[2023-03-22 05:47:34] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 22/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : MAPK-PT-00080-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ s19 s9), p1:(GT 2 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 271 ms.
Product exploration explored 100000 steps with 0 reset in 265 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)), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10015 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=715 ) properties (out of 2) seen :1
Finished Best-First random walk after 2311 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=770 )
Knowledge obtained : [(AND p0 (NOT p1)), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
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 05:47:35] [INFO ] Invariant cache hit.
[2023-03-22 05:47:35] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-22 05:47:35] [INFO ] Invariant cache hit.
[2023-03-22 05:47:36] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-22 05:47:36] [INFO ] Invariant cache hit.
[2023-03-22 05:47:36] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 22/22 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 : [(AND p0 (NOT p1)), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Finished random walk after 8479 steps, including 2 resets, run visited all 2 properties in 8 ms. (steps per millisecond=1059 )
Knowledge obtained : [(AND p0 (NOT p1)), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 0 reset in 157 ms.
Product exploration explored 100000 steps with 0 reset in 187 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
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 31
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 31
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 22 transition count 35
Deduced a syphon composed of 5 places in 1 ms
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 22 transition count 30
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 10 rules in 10 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-22 05:47:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:47:38] [INFO ] Flow matrix only has 26 transitions (discarded 4 similar events)
// Phase 1: matrix 26 rows 22 cols
[2023-03-22 05:47:38] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-22 05:47:38] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/22 places, 30/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49 ms. Remains : 22/22 places, 30/30 transitions.
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 05:47:38] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-22 05:47:38] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-22 05:47:38] [INFO ] Invariant cache hit.
[2023-03-22 05:47:38] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-22 05:47:38] [INFO ] Invariant cache hit.
[2023-03-22 05:47:38] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 22/22 places, 30/30 transitions.
Treatment of property MAPK-PT-00080-LTLCardinality-03 finished in 4166 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)||G(p1)) U p2)))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-22 05:47:38] [INFO ] Invariant cache hit.
[2023-03-22 05:47:38] [INFO ] Implicit Places using invariants in 25 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 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 27 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p2), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MAPK-PT-00080-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ 1 s14), p0:(LEQ s10 s4), p1:(GT 1 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 17681 reset in 127 ms.
Stack based approach found an accepted trace after 17 steps with 4 reset with depth 3 and stack size 3 in 0 ms.
FORMULA MAPK-PT-00080-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-00080-LTLCardinality-04 finished in 352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!p0 U p1))&&(p2 U p3)))'
Support contains 7 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-22 05:47:38] [INFO ] Invariant cache hit.
[2023-03-22 05:47:38] [INFO ] Implicit Places using invariants in 27 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 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 31 ms. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p3) (NOT p1)), true, (NOT p1), (NOT p3)]
Running random walk in product with property : MAPK-PT-00080-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR p3 p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(LEQ 3 s18), p2:(LEQ s16 s9), p1:(LEQ s5 s8), p0:(OR (LEQ s8 s14) (LEQ 1 s12))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-00080-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00080-LTLCardinality-05 finished in 205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(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.
[2023-03-22 05:47:38] [INFO ] Invariant cache hit.
[2023-03-22 05:47:38] [INFO ] Implicit Places using invariants in 28 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 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 33 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-00080-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (GT 1 s2) (OR (LEQ s11 s10) (LEQ 1 s2)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 157 ms.
Stack based approach found an accepted trace after 13 steps with 0 reset with depth 14 and stack size 14 in 0 ms.
FORMULA MAPK-PT-00080-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-00080-LTLCardinality-06 finished in 444 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 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 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 0 with 11 rules applied. Total rules applied 14 place count 14 transition count 24
Graph (trivial) has 4 edges and 14 vertex of which 2 / 14 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 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 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 12 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 11 transition count 14
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 10 transition count 13
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 10 transition count 13
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 10 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 10 transition count 12
Applied a total of 32 rules in 16 ms. Remains 10 /22 variables (removed 12) and now considering 12/30 (removed 18) transitions.
// Phase 1: matrix 12 rows 10 cols
[2023-03-22 05:47:39] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-22 05:47:39] [INFO ] Implicit Places using invariants in 22 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/22 places, 12/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 40 ms. Remains : 9/22 places, 12/30 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : MAPK-PT-00080-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=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:(GT 2 s4), p1:(LEQ s4 s6)], 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-00080-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00080-LTLCardinality-07 finished in 180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(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.
// Phase 1: matrix 30 rows 22 cols
[2023-03-22 05:47:39] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-22 05:47:39] [INFO ] Implicit Places using invariants in 27 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 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 30 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-00080-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ 2 s14)], 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][false, false, false]]
Product exploration explored 100000 steps with 4731 reset in 85 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-00080-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-00080-LTLCardinality-09 finished in 224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(F(p1)))))'
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 05:47:39] [INFO ] Invariant cache hit.
[2023-03-22 05:47:39] [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 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 36 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MAPK-PT-00080-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ 2 s6), p0:(LEQ 2 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 394 reset in 129 ms.
Product exploration explored 100000 steps with 395 reset in 133 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) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 4555 steps, including 1 resets, run visited all 3 properties in 9 ms. (steps per millisecond=506 )
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 212 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 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.
// Phase 1: matrix 30 rows 20 cols
[2023-03-22 05:47:41] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-22 05:47:41] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-22 05:47:41] [INFO ] Invariant cache hit.
[2023-03-22 05:47:41] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-22 05:47:41] [INFO ] Invariant cache hit.
[2023-03-22 05:47:41] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 20/20 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 : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 6143 steps, including 1 resets, run visited all 3 properties in 7 ms. (steps per millisecond=877 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 401 reset in 126 ms.
Product exploration explored 100000 steps with 410 reset in 121 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 30/30 transitions.
Graph (trivial) has 9 edges and 20 vertex of which 6 / 20 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 17 transition count 29
Deduced a syphon composed of 2 places in 0 ms
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 8 place count 17 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 17 transition count 24
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 9 rules in 9 ms. Remains 17 /20 variables (removed 3) and now considering 24/30 (removed 6) transitions.
[2023-03-22 05:47:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:47:42] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
// Phase 1: matrix 22 rows 17 cols
[2023-03-22 05:47:42] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-22 05:47:42] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/20 places, 24/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57 ms. Remains : 17/20 places, 24/30 transitions.
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 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.
// Phase 1: matrix 30 rows 20 cols
[2023-03-22 05:47:42] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-22 05:47:42] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-22 05:47:42] [INFO ] Invariant cache hit.
[2023-03-22 05:47:42] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-22 05:47:42] [INFO ] Invariant cache hit.
[2023-03-22 05:47:42] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 20/20 places, 30/30 transitions.
Treatment of property MAPK-PT-00080-LTLCardinality-10 finished in 3129 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((G(p0) U (X(p1)&&G(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 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 05:47:42] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-22 05:47:42] [INFO ] Implicit Places using invariants in 36 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 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 40 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p0), (AND p2 (NOT p1)), (NOT p2), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : MAPK-PT-00080-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 6}, { cond=(AND p2 p0), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 2}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={0} source=6 dest: 6}, { cond=(AND p2 p0), acceptance={0} source=6 dest: 7}, { cond=(AND p2 p0), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=7 dest: 6}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=7 dest: 7}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=8 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={0} source=8 dest: 6}, { cond=(AND p2 p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(LEQ 1 s17), p0:(OR (LEQ 1 s1) (LEQ s2 s11)), p1:(LEQ s1 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-00080-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00080-LTLCardinality-11 finished in 406 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(p1))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 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 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 13 ms. Remains 13 /22 variables (removed 9) and now considering 19/30 (removed 11) transitions.
[2023-03-22 05:47:43] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 13 cols
[2023-03-22 05:47:43] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 05:47:43] [INFO ] Implicit Places using invariants in 26 ms returned [3]
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 : 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 42 ms. Remains : 12/22 places, 19/30 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MAPK-PT-00080-LTLCardinality-12 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=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 s9), p1:(AND (LEQ 2 s9) (LEQ 2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 1 reset in 1 ms.
FORMULA MAPK-PT-00080-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00080-LTLCardinality-12 finished in 186 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((X(G(p1))&&p0)))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 15 transition count 24
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 15 place count 15 transition count 22
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 15 transition count 22
Applied a total of 16 rules in 8 ms. Remains 15 /22 variables (removed 7) and now considering 22/30 (removed 8) transitions.
[2023-03-22 05:47:43] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 15 cols
[2023-03-22 05:47:43] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-22 05:47:43] [INFO ] Implicit Places using invariants in 25 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/22 places, 22/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 14 transition count 21
Applied a total of 1 rules in 3 ms. Remains 14 /14 variables (removed 0) and now considering 21/22 (removed 1) transitions.
[2023-03-22 05:47:43] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
// Phase 1: matrix 19 rows 14 cols
[2023-03-22 05:47:43] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-22 05:47:43] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-22 05:47:43] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
[2023-03-22 05:47:43] [INFO ] Invariant cache hit.
[2023-03-22 05:47:43] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 05:47:43] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/22 places, 21/30 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 89 ms. Remains : 14/22 places, 21/30 transitions.
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MAPK-PT-00080-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LEQ 2 s0) (LEQ 1 s7) (GT s7 s13)), p1:(LEQ 3 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-00080-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00080-LTLCardinality-14 finished in 181 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)))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 19 rules applied. Total rules applied 22 place count 9 transition count 21
Graph (trivial) has 12 edges and 9 vertex of which 2 / 9 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 7 transition count 21
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 11 edges and 7 vertex of which 3 / 7 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 29 place count 5 transition count 17
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 35 place count 5 transition count 11
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 40 place count 5 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 4 transition count 5
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 4 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 2 transition count 3
Applied a total of 46 rules in 11 ms. Remains 2 /22 variables (removed 20) and now considering 3/30 (removed 27) transitions.
// Phase 1: matrix 3 rows 2 cols
[2023-03-22 05:47:43] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 05:47:43] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-22 05:47:43] [INFO ] Invariant cache hit.
[2023-03-22 05:47:43] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-22 05:47:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 05:47:43] [INFO ] Invariant cache hit.
[2023-03-22 05:47:43] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/22 places, 3/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 ms. Remains : 2/22 places, 3/30 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : MAPK-PT-00080-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-00080-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00080-LTLCardinality-15 finished in 143 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||X(X(X(p1))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(F(p1)))))'
[2023-03-22 05:47:43] [INFO ] Flatten gal took : 9 ms
[2023-03-22 05:47:43] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-22 05:47:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 22 places, 30 transitions and 90 arcs took 0 ms.
Total runtime 11605 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT MAPK-PT-00080
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

FORMULA MAPK-PT-00080-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679464084953

--------------------
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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
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-00080-LTLCardinality-03
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1800 11/32 MAPK-PT-00080-LTLCardinality-03 1560125 m, 312025 m/sec, 7346064 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1800 21/32 MAPK-PT-00080-LTLCardinality-03 3122945 m, 312564 m/sec, 14593697 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1800 31/32 MAPK-PT-00080-LTLCardinality-03 4764951 m, 328401 m/sec, 21906978 t fired, .

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

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

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
MAPK-PT-00080-LTLCardinality-03: LTL unknown AGGR
MAPK-PT-00080-LTLCardinality-10: LTL false LTL model checker


Time elapsed: 20 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-00080"
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-00080, 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-167856416300571"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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