Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r121-tall-162075407400740.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is MAPK-PT-00320, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075407400740
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 149K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 06:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 06:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 07:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 07:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 25K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MAPK-PT-00320-00
FORMULA_NAME MAPK-PT-00320-01
FORMULA_NAME MAPK-PT-00320-02
FORMULA_NAME MAPK-PT-00320-03
FORMULA_NAME MAPK-PT-00320-04
FORMULA_NAME MAPK-PT-00320-05
FORMULA_NAME MAPK-PT-00320-06
FORMULA_NAME MAPK-PT-00320-07
FORMULA_NAME MAPK-PT-00320-08
FORMULA_NAME MAPK-PT-00320-09
FORMULA_NAME MAPK-PT-00320-10
FORMULA_NAME MAPK-PT-00320-11
FORMULA_NAME MAPK-PT-00320-12
FORMULA_NAME MAPK-PT-00320-13
FORMULA_NAME MAPK-PT-00320-14
FORMULA_NAME MAPK-PT-00320-15

=== Now, execution of the tool begins

BK_START 1620893928181

Running Version 0
[2021-05-13 08:18:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 08:18:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 08:18:49] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2021-05-13 08:18:49] [INFO ] Transformed 22 places.
[2021-05-13 08:18:49] [INFO ] Transformed 30 transitions.
[2021-05-13 08:18:49] [INFO ] Parsed PT model containing 22 places and 30 transitions in 65 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-13 08:18:49] [INFO ] Initial state test concluded for 2 properties.
FORMULA MAPK-PT-00320-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00320-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 11 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 08:18:49] [INFO ] Computed 7 place invariants in 5 ms
[2021-05-13 08:18:49] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 08:18:50] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 08:18:50] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 08:18:50] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-13 08:18:50] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 30/30 transitions.
[2021-05-13 08:18:50] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-13 08:18:50] [INFO ] Flatten gal took : 23 ms
FORMULA MAPK-PT-00320-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00320-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00320-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 08:18:50] [INFO ] Flatten gal took : 5 ms
[2021-05-13 08:18:50] [INFO ] Input system was already deterministic with 30 transitions.
Incomplete random walk after 100151 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=1221 ) properties (out of 23) seen :17
Running SMT prover for 6 properties.
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 08:18:50] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-13 08:18:50] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-13 08:18:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:18:50] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 08:18:50] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2021-05-13 08:18:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:18:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-13 08:18:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:18:50] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 08:18:50] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2021-05-13 08:18:50] [INFO ] Added : 16 causal constraints over 4 iterations in 26 ms. Result :sat
[2021-05-13 08:18:50] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 08:18:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:18:50] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 08:18:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:18:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 08:18:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:18:50] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 08:18:50] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 11 ms.
[2021-05-13 08:18:50] [INFO ] Added : 18 causal constraints over 4 iterations in 35 ms. Result :sat
[2021-05-13 08:18:50] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-13 08:18:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:18:50] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 08:18:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:18:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-13 08:18:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:18:50] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 08:18:50] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 9 ms.
[2021-05-13 08:18:50] [INFO ] Added : 17 causal constraints over 4 iterations in 26 ms. Result :sat
[2021-05-13 08:18:50] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-13 08:18:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:18:50] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 08:18:50] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 08:18:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:18:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 08:18:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:18:50] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 08:18:50] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2021-05-13 08:18:50] [INFO ] Added : 17 causal constraints over 4 iterations in 17 ms. Result :sat
[2021-05-13 08:18:50] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-13 08:18:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:18:50] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 08:18:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:18:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 08:18:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:18:50] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 08:18:50] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2021-05-13 08:18:50] [INFO ] Added : 17 causal constraints over 4 iterations in 17 ms. Result :sat
[2021-05-13 08:18:50] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-13 08:18:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:18:50] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 08:18:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:18:50] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-13 08:18:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:18:50] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-13 08:18:50] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2021-05-13 08:18:50] [INFO ] Added : 17 causal constraints over 4 iterations in 16 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&X((G(F(p1)) U p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-13 08:18:50] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 08:18:50] [INFO ] Implicit Places using invariants in 17 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 08:18:50] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-13 08:18:50] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 08:18:50] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 08:18:50] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 322 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : MAPK-PT-00320-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(NOT p2), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 3 s10), p2:(LEQ s8 s12), p1:(LEQ 2 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-00320-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00320-00 finished in 435 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 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 1 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 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 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 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 39 place count 5 transition count 7
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 41 place count 4 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 4 transition count 5
Applied a total of 42 rules in 13 ms. Remains 4 /22 variables (removed 18) and now considering 5/30 (removed 25) transitions.
// Phase 1: matrix 5 rows 4 cols
[2021-05-13 08:18:51] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-13 08:18:51] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-05-13 08:18:51] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-13 08:18:51] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2021-05-13 08:18:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2021-05-13 08:18:51] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-13 08:18:51] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/22 places, 5/30 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : MAPK-PT-00320-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-00320-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00320-01 finished in 89 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(p0)&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-13 08:18:51] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 08:18:51] [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.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 08:18:51] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 08:18:51] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 08:18:51] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 08:18:51] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : MAPK-PT-00320-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 3}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s5 s8), p0:(LEQ s5 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 93 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-00320-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00320-03 finished in 212 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-13 08:18:51] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-13 08:18:51] [INFO ] Implicit Places using invariants in 14 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 14 ms to find 2 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 08:18:51] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 08:18:51] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 08:18:51] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 08:18:51] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : MAPK-PT-00320-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 3 s13), p1:(AND (LEQ 2 s3) (GT 2 s16))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1121 reset in 243 ms.
Stack based approach found an accepted trace after 68 steps with 0 reset with depth 69 and stack size 59 in 1 ms.
FORMULA MAPK-PT-00320-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00320-04 finished in 392 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G((G(p1)||p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, 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
[2021-05-13 08:18:51] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-13 08:18:52] [INFO ] Implicit Places using invariants in 16 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 17 ms to find 2 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 08:18:52] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 08:18:52] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 08:18:52] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 08:18:52] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), true]
Running random walk in product with property : MAPK-PT-00320-05 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=3, aps=[p1:(GT s4 s12), p0:(OR (LEQ s13 s2) (LEQ s4 s12))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 711 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-00320-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00320-05 finished in 222 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, 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.
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 08:18:52] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 08:18:52] [INFO ] Implicit Places using invariants in 17 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 17 ms to find 2 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 08:18:52] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 08:18:52] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 08:18:52] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 08:18:52] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MAPK-PT-00320-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(LEQ s6 s7), p1:(GT 1 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 121 ms.
Product exploration explored 100000 steps with 50000 reset in 127 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 75 ms.
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Applying partial POR strategy [true, true, false, true, true]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 30/30 transitions.
Graph (trivial) has 5 edges and 20 vertex of which 2 / 20 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 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 30
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 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 19 transition count 32
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 19 transition count 28
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 8 rules in 3 ms. Remains 19 /20 variables (removed 1) and now considering 28/30 (removed 2) transitions.
[2021-05-13 08:18:53] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-13 08:18:53] [INFO ] Flow matrix only has 26 transitions (discarded 2 similar events)
// Phase 1: matrix 26 rows 19 cols
[2021-05-13 08:18:53] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 08:18:53] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/20 places, 28/30 transitions.
Product exploration explored 100000 steps with 50000 reset in 244 ms.
Product exploration explored 100000 steps with 50000 reset in 187 ms.
[2021-05-13 08:18:53] [INFO ] Flatten gal took : 3 ms
[2021-05-13 08:18:53] [INFO ] Flatten gal took : 3 ms
[2021-05-13 08:18:53] [INFO ] Time to serialize gal into /tmp/LTL14702624739352827413.gal : 1 ms
[2021-05-13 08:18:53] [INFO ] Time to serialize properties into /tmp/LTL12199279419702827780.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14702624739352827413.gal, -t, CGAL, -LTL, /tmp/LTL12199279419702827780.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14702624739352827413.gal -t CGAL -LTL /tmp/LTL12199279419702827780.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X("(ERKP<=MEKPP)"))||(G("(ERKPP_Phase3<1)"))))
Formula 0 simplified : !(X"(ERKP<=MEKPP)" | G"(ERKPP_Phase3<1)")
Detected timeout of ITS tools.
[2021-05-13 08:19:08] [INFO ] Flatten gal took : 2 ms
[2021-05-13 08:19:08] [INFO ] Applying decomposition
[2021-05-13 08:19:08] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4845119398856010016.txt, -o, /tmp/graph4845119398856010016.bin, -w, /tmp/graph4845119398856010016.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4845119398856010016.bin, -l, -1, -v, -w, /tmp/graph4845119398856010016.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 08:19:08] [INFO ] Decomposing Gal with order
[2021-05-13 08:19:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 08:19:08] [INFO ] Removed a total of 11 redundant transitions.
[2021-05-13 08:19:08] [INFO ] Flatten gal took : 204 ms
[2021-05-13 08:19:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2021-05-13 08:19:09] [INFO ] Time to serialize gal into /tmp/LTL492395549572380609.gal : 1 ms
[2021-05-13 08:19:09] [INFO ] Time to serialize properties into /tmp/LTL12117467488547453130.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL492395549572380609.gal, -t, CGAL, -LTL, /tmp/LTL12117467488547453130.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL492395549572380609.gal -t CGAL -LTL /tmp/LTL12117467488547453130.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X("(gu2.ERKP<=gu2.MEKPP)"))||(G("(gu1.ERKPP_Phase3<1)"))))
Formula 0 simplified : !(X"(gu2.ERKP<=gu2.MEKPP)" | G"(gu1.ERKPP_Phase3<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7113548430082264749
[2021-05-13 08:19:24] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7113548430082264749
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7113548430082264749]
Compilation finished in 224 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7113548430082264749]
Link finished in 54 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (X((LTLAPp0==true))||[]((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin7113548430082264749]
LTSmin run took 256 ms.
FORMULA MAPK-PT-00320-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MAPK-PT-00320-06 finished in 32407 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0)) U (p1||X(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions, 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.
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 08:19:24] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-13 08:19:24] [INFO ] Implicit Places using invariants in 33 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 08:19:24] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-13 08:19:24] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 08:19:24] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-13 08:19:24] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : MAPK-PT-00320-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ s8 s17), p2:(GT s4 s11), p0:(GT 2 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 193 ms.
Stack based approach found an accepted trace after 41 steps with 0 reset with depth 42 and stack size 37 in 0 ms.
FORMULA MAPK-PT-00320-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00320-07 finished in 406 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions, 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.
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 08:19:25] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-13 08:19:25] [INFO ] Implicit Places using invariants in 18 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 18 ms to find 2 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 08:19:25] [INFO ] Computed 5 place invariants in 6 ms
[2021-05-13 08:19:25] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 08:19:25] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 08:19:25] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-00320-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 727 reset in 119 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA MAPK-PT-00320-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00320-10 finished in 248 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, 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
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 14 transition count 22
Applied a total of 16 rules in 3 ms. Remains 14 /22 variables (removed 8) and now considering 22/30 (removed 8) transitions.
[2021-05-13 08:19:25] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 14 cols
[2021-05-13 08:19:25] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 08:19:25] [INFO ] Implicit Places using invariants in 13 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 14 ms to find 1 implicit places.
[2021-05-13 08:19:25] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 08:19:25] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 13 cols
[2021-05-13 08:19:25] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 08:19:25] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 13/22 places, 22/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2021-05-13 08:19:25] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 08:19:25] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 13 cols
[2021-05-13 08:19:25] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 08:19:25] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 2 iterations. Remains : 13/22 places, 22/30 transitions.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : MAPK-PT-00320-13 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s11 s9), p1:(LEQ 1 s7)], nbAcceptance=2, 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 2 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-00320-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00320-13 finished in 125 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((X(p0) U G(p1))&&G(F(p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, 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.
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 08:19:25] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 08:19:25] [INFO ] Implicit Places using invariants in 12 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 12 ms to find 1 implicit places.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 08:19:25] [INFO ] Computed 6 place invariants in 6 ms
[2021-05-13 08:19:25] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, 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.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 08:19:25] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-13 08:19:25] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p1) p0)]
Running random walk in product with property : MAPK-PT-00320-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}, { cond=true, acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=(NOT p1), acceptance={} source=6 dest: 2}, { cond=p1, acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={0} source=6 dest: 6}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=8 dest: 7}, { cond=(AND p1 p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(LEQ 3 s15), p2:(LEQ 2 s1), p0:(LEQ s8 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 267 reset in 171 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA MAPK-PT-00320-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00320-14 finished in 464 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, 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
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 11 transition count 24
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 7 edges and 11 vertex of which 3 / 11 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 22 place count 9 transition count 20
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 28 place count 9 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 9 transition count 13
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 9 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 9 transition count 12
Applied a total of 31 rules in 4 ms. Remains 9 /22 variables (removed 13) and now considering 12/30 (removed 18) transitions.
// Phase 1: matrix 12 rows 9 cols
[2021-05-13 08:19:25] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-13 08:19:25] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 12 rows 9 cols
[2021-05-13 08:19:25] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 08:19:25] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2021-05-13 08:19:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 9 cols
[2021-05-13 08:19:25] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 08:19:25] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/22 places, 12/30 transitions.
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MAPK-PT-00320-15 automaton TGBA [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}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 s5), p1:(LEQ s0 s7)], 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 1 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-00320-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00320-15 finished in 132 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620893966885

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MAPK-PT-00320"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is MAPK-PT-00320, 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 r121-tall-162075407400740"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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