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-162075407400765.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-02560, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075407400765
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 132K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 97K 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.1K Mar 28 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 27 06:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 06:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 07:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 07:16 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-02560-00
FORMULA_NAME MAPK-PT-02560-01
FORMULA_NAME MAPK-PT-02560-02
FORMULA_NAME MAPK-PT-02560-03
FORMULA_NAME MAPK-PT-02560-04
FORMULA_NAME MAPK-PT-02560-05
FORMULA_NAME MAPK-PT-02560-06
FORMULA_NAME MAPK-PT-02560-07
FORMULA_NAME MAPK-PT-02560-08
FORMULA_NAME MAPK-PT-02560-09
FORMULA_NAME MAPK-PT-02560-10
FORMULA_NAME MAPK-PT-02560-11
FORMULA_NAME MAPK-PT-02560-12
FORMULA_NAME MAPK-PT-02560-13
FORMULA_NAME MAPK-PT-02560-14
FORMULA_NAME MAPK-PT-02560-15

=== Now, execution of the tool begins

BK_START 1620899222212

Running Version 0
[2021-05-13 09:47:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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 09:47:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 09:47:04] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2021-05-13 09:47:04] [INFO ] Transformed 22 places.
[2021-05-13 09:47:04] [INFO ] Transformed 30 transitions.
[2021-05-13 09:47:04] [INFO ] Parsed PT model containing 22 places and 30 transitions in 61 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-13 09:47:04] [INFO ] Initial state test concluded for 2 properties.
Support contains 20 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 7 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 09:47:04] [INFO ] Computed 7 place invariants in 5 ms
[2021-05-13 09:47:04] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 09:47:04] [INFO ] Computed 7 place invariants in 4 ms
[2021-05-13 09:47:04] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 09:47:04] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-13 09:47:04] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 30/30 transitions.
[2021-05-13 09:47:04] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-13 09:47:04] [INFO ] Flatten gal took : 21 ms
FORMULA MAPK-PT-02560-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-02560-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 09:47:04] [INFO ] Flatten gal took : 6 ms
[2021-05-13 09:47:04] [INFO ] Input system was already deterministic with 30 transitions.
Incomplete random walk after 100607 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=1397 ) properties (out of 17) seen :10
Running SMT prover for 7 properties.
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 09:47:04] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-13 09:47:04] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2021-05-13 09:47:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:47:04] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 09:47:04] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2021-05-13 09:47:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:47:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-13 09:47:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:47:04] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 09:47:04] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2021-05-13 09:47:04] [INFO ] Added : 19 causal constraints over 4 iterations in 22 ms. Result :sat
[2021-05-13 09:47:04] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 09:47:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:47:04] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 09:47:04] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 09:47:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:47:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-13 09:47:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:47:04] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-13 09:47:04] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 09:47:05] [INFO ] Added : 17 causal constraints over 4 iterations in 17 ms. Result :sat
[2021-05-13 09:47:05] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-13 09:47:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:47:05] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 09:47:05] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 09:47:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:47:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 09:47:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:47:05] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 09:47:05] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2021-05-13 09:47:05] [INFO ] Added : 15 causal constraints over 3 iterations in 16 ms. Result :sat
[2021-05-13 09:47:05] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-13 09:47:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:47:05] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 09:47:05] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2021-05-13 09:47:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:47:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-13 09:47:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:47:05] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 09:47:05] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 09:47:05] [INFO ] Added : 19 causal constraints over 4 iterations in 19 ms. Result :sat
[2021-05-13 09:47:05] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 09:47:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:47:05] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 09:47:05] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 09:47:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:47:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 09:47:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:47:05] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 09:47:05] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 09:47:05] [INFO ] Added : 21 causal constraints over 5 iterations in 18 ms. Result :sat
[2021-05-13 09:47:05] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-13 09:47:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:47:05] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 09:47:05] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2021-05-13 09:47:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:47:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 09:47:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:47:05] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 09:47:05] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 09:47:05] [INFO ] Added : 19 causal constraints over 4 iterations in 15 ms. Result :sat
[2021-05-13 09:47:05] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-13 09:47:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:47:05] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 09:47:05] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 09:47:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:47:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 09:47:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:47:05] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-13 09:47:05] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 09:47:05] [INFO ] Added : 16 causal constraints over 4 iterations in 18 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(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.
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
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 8 transition count 21
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 26 place count 8 transition count 18
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 8 transition count 15
Applied a total of 29 rules in 22 ms. Remains 8 /22 variables (removed 14) and now considering 15/30 (removed 15) transitions.
[2021-05-13 09:47:05] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
// Phase 1: matrix 11 rows 8 cols
[2021-05-13 09:47:05] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-13 09:47:05] [INFO ] Implicit Places using invariants in 14 ms returned []
[2021-05-13 09:47:05] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
// Phase 1: matrix 11 rows 8 cols
[2021-05-13 09:47:05] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-13 09:47:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-13 09:47:05] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2021-05-13 09:47:05] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 09:47:05] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
// Phase 1: matrix 11 rows 8 cols
[2021-05-13 09:47:05] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 09:47:05] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/22 places, 15/30 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-02560-00 automaton TGBA [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:(GEQ s6 1)], 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 0 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-02560-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-02560-00 finished in 249 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 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 12 transition count 22
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 12 transition count 18
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 12 transition count 18
Applied a total of 23 rules in 4 ms. Remains 12 /22 variables (removed 10) and now considering 18/30 (removed 12) transitions.
[2021-05-13 09:47:05] [INFO ] Flow matrix only has 14 transitions (discarded 4 similar events)
// Phase 1: matrix 14 rows 12 cols
[2021-05-13 09:47:05] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 09:47:05] [INFO ] Implicit Places using invariants in 12 ms returned []
[2021-05-13 09:47:05] [INFO ] Flow matrix only has 14 transitions (discarded 4 similar events)
// Phase 1: matrix 14 rows 12 cols
[2021-05-13 09:47:05] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 09:47:05] [INFO ] State equation strengthened by 5 read => feed constraints.
[2021-05-13 09:47:05] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
[2021-05-13 09:47:05] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 09:47:05] [INFO ] Flow matrix only has 14 transitions (discarded 4 similar events)
// Phase 1: matrix 14 rows 12 cols
[2021-05-13 09:47:05] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 09:47:05] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/22 places, 18/30 transitions.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : MAPK-PT-02560-01 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:(OR (LT s10 1) (LT s11 1)), p1:(LT s8 1)], 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 5 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-02560-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-02560-01 finished in 100 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&G((X(p1)||G(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 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 09:47:05] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 09:47:05] [INFO ] Implicit Places using invariants in 15 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 16 ms to find 1 implicit places.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 09:47:05] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-13 09:47:05] [INFO ] Dead Transitions using invariants and state equation in 17 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 09:47:05] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-13 09:47:05] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (AND (NOT p2) p1)]
Running random walk in product with property : MAPK-PT-02560-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 5}, { cond=(AND p2 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s14 1)), p2:(AND (GEQ s6 1) (GEQ s8 1)), p1:(GEQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-02560-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-02560-02 finished in 271 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -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 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 15 place count 14 transition count 23
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 19 place count 14 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 14 transition count 19
Applied a total of 20 rules in 9 ms. Remains 14 /22 variables (removed 8) and now considering 19/30 (removed 11) transitions.
[2021-05-13 09:47:06] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 14 cols
[2021-05-13 09:47:06] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-13 09:47:06] [INFO ] Implicit Places using invariants in 11 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 11 ms to find 1 implicit places.
[2021-05-13 09:47:06] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 09:47:06] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 13 cols
[2021-05-13 09:47:06] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 09:47:06] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Starting structural reductions, iteration 1 : 13/22 places, 19/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 19/19 (removed 0) transitions.
[2021-05-13 09:47:06] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 09:47:06] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 13 cols
[2021-05-13 09:47:06] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 09:47:06] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 2 iterations. Remains : 13/22 places, 19/30 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : MAPK-PT-02560-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s11 1) (LT s12 1)), p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 307 ms.
Product exploration explored 100000 steps with 0 reset in 273 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 124 ms.
Product exploration explored 100000 steps with 0 reset in 173 ms.
[2021-05-13 09:47:07] [INFO ] Flatten gal took : 2 ms
[2021-05-13 09:47:07] [INFO ] Flatten gal took : 2 ms
[2021-05-13 09:47:07] [INFO ] Time to serialize gal into /tmp/LTL1729050665282082097.gal : 1 ms
[2021-05-13 09:47:07] [INFO ] Time to serialize properties into /tmp/LTL4427610911035820033.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/LTL1729050665282082097.gal, -t, CGAL, -LTL, /tmp/LTL4427610911035820033.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/LTL1729050665282082097.gal -t CGAL -LTL /tmp/LTL4427610911035820033.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("(ERKPP_Phase3>=1)"))||(G("((RasGTP>=1)&&(Raf>=1))"))))
Formula 0 simplified : !(G"(ERKPP_Phase3>=1)" | G"((RasGTP>=1)&&(Raf>=1))")
Detected timeout of ITS tools.
[2021-05-13 09:47:22] [INFO ] Flatten gal took : 11 ms
[2021-05-13 09:47:22] [INFO ] Applying decomposition
[2021-05-13 09:47:22] [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/graph16066442858078777582.txt, -o, /tmp/graph16066442858078777582.bin, -w, /tmp/graph16066442858078777582.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/graph16066442858078777582.bin, -l, -1, -v, -w, /tmp/graph16066442858078777582.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 09:47:22] [INFO ] Decomposing Gal with order
[2021-05-13 09:47:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 09:47:22] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-13 09:47:22] [INFO ] Flatten gal took : 25 ms
[2021-05-13 09:47:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-13 09:47:22] [INFO ] Time to serialize gal into /tmp/LTL6471472707277013930.gal : 3 ms
[2021-05-13 09:47:22] [INFO ] Time to serialize properties into /tmp/LTL2942612567111259423.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/LTL6471472707277013930.gal, -t, CGAL, -LTL, /tmp/LTL2942612567111259423.ltl, -c, -stutter-deadlock], 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/LTL6471472707277013930.gal -t CGAL -LTL /tmp/LTL2942612567111259423.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("(i2.u2.ERKPP_Phase3>=1)"))||(G("((u4.RasGTP>=1)&&(u4.Raf>=1))"))))
Formula 0 simplified : !(G"(i2.u2.ERKPP_Phase3>=1)" | G"((u4.RasGTP>=1)&&(u4.Raf>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2132140641899082444
[2021-05-13 09:47:37] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2132140641899082444
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/ltsmin2132140641899082444]
Compilation finished in 194 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2132140641899082444]
Link finished in 40 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, ([]((LTLAPp0==true))||[]((LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin2132140641899082444]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property MAPK-PT-02560-03 finished in 46393 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 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 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 17 rules applied. Total rules applied 20 place count 10 transition count 22
Graph (trivial) has 12 edges and 10 vertex of which 2 / 10 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 22 place count 8 transition count 22
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 11 edges and 8 vertex of which 3 / 8 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 27 place count 6 transition count 18
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 33 place count 6 transition count 12
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 36 place count 6 transition count 9
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 38 place count 5 transition count 8
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 5 transition count 7
Applied a total of 39 rules in 8 ms. Remains 5 /22 variables (removed 17) and now considering 7/30 (removed 23) transitions.
// Phase 1: matrix 7 rows 5 cols
[2021-05-13 09:47:52] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-13 09:47:52] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 7 rows 5 cols
[2021-05-13 09:47:52] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-13 09:47:52] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-13 09:47:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 5 cols
[2021-05-13 09:47:52] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-13 09:47:52] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/22 places, 7/30 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MAPK-PT-02560-04 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}]], initial=0, aps=[p0:(GEQ s0 1), p1:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-02560-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-02560-04 finished in 131 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(!p0)||(p1&&X(G(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 09:47:52] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-13 09:47:52] [INFO ] Implicit Places using invariants in 14 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 15 ms to find 1 implicit places.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 09:47:52] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-13 09:47:52] [INFO ] Dead Transitions using invariants and state equation in 25 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 09:47:52] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-13 09:47:52] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), p0, (NOT p2), (AND p0 (NOT p2))]
Running random walk in product with property : MAPK-PT-02560-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p0 p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(GEQ s17 1), p1:(OR (LT s3 1) (LT s15 1)), p2:(OR (LT s7 1) (LT s8 1))], 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 51 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-02560-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-02560-05 finished in 228 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 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 10 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 21 place count 10 transition count 21
Graph (trivial) has 8 edges and 10 vertex of which 2 / 10 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 23 place count 8 transition count 21
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 26 place count 8 transition count 18
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 33 place count 8 transition count 11
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 35 place count 7 transition count 10
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 37 place count 6 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 6 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 6 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 4 transition count 6
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 5
Applied a total of 43 rules in 28 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 09:47:52] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-13 09:47:52] [INFO ] Implicit Places using invariants in 9 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 9 ms to find 1 implicit places.
[2021-05-13 09:47:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 3 cols
[2021-05-13 09:47:52] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 09:47:52] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Starting structural reductions, iteration 1 : 3/22 places, 5/30 transitions.
Graph (trivial) has 2 edges and 3 vertex of which 2 / 3 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2 transition count 3
Applied a total of 2 rules in 0 ms. Remains 2 /3 variables (removed 1) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 09:47:52] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-13 09:47:52] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 09:47:52] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-13 09:47:52] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2/22 places, 3/30 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : MAPK-PT-02560-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s1 1)], 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 0 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-02560-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-02560-07 finished in 103 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((!p0&&X(!p0)))||(F(!p1)&&F(p2)))))], 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 09:47:52] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 09:47:52] [INFO ] Implicit Places using invariants in 29 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 09:47:52] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 09:47: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 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 09:47:52] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 09:47:52] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (AND (NOT p2) p0), (AND p1 p0), (NOT p2), (AND (NOT p2) p0), p1, (AND p1 p0)]
Running random walk in product with property : MAPK-PT-02560-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 4}], [{ cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(AND p1 p0), acceptance={} source=7 dest: 6}]], initial=0, aps=[p2:(GEQ s5 1), p1:(GEQ s0 1), p0:(LT s15 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1104 reset in 168 ms.
Stack based approach found an accepted trace after 12 steps with 1 reset with depth 9 and stack size 9 in 1 ms.
FORMULA MAPK-PT-02560-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-02560-08 finished in 480 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((F(!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.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 19 transition count 28
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 19 transition count 28
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 18 transition count 27
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 18 transition count 27
Applied a total of 11 rules in 4 ms. Remains 18 /22 variables (removed 4) and now considering 27/30 (removed 3) transitions.
[2021-05-13 09:47:53] [INFO ] Flow matrix only has 24 transitions (discarded 3 similar events)
// Phase 1: matrix 24 rows 18 cols
[2021-05-13 09:47:53] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-13 09:47:53] [INFO ] Implicit Places using invariants in 12 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 13 ms to find 1 implicit places.
[2021-05-13 09:47:53] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 09:47:53] [INFO ] Flow matrix only has 24 transitions (discarded 3 similar events)
// Phase 1: matrix 24 rows 17 cols
[2021-05-13 09:47:53] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 09:47:53] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 17/22 places, 27/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 17 transition count 26
Applied a total of 1 rules in 2 ms. Remains 17 /17 variables (removed 0) and now considering 26/27 (removed 1) transitions.
[2021-05-13 09:47:53] [INFO ] Flow matrix only has 24 transitions (discarded 2 similar events)
// Phase 1: matrix 24 rows 17 cols
[2021-05-13 09:47:53] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 09:47:53] [INFO ] Implicit Places using invariants in 20 ms returned []
[2021-05-13 09:47:53] [INFO ] Flow matrix only has 24 transitions (discarded 2 similar events)
// Phase 1: matrix 24 rows 17 cols
[2021-05-13 09:47:53] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 09:47:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-13 09:47:53] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 17/22 places, 26/30 transitions.
Stuttering acceptance computed with spot in 48 ms :[p1, (OR (NOT p0) p1)]
Running random walk in product with property : MAPK-PT-02560-09 automaton TGBA [mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(OR (LT s2 1) (LT s13 1)), p0:(AND (GEQ s5 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-02560-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-02560-09 finished in 138 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F(p0))||(G(!p2)&&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 09:47:53] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-13 09:47:53] [INFO ] Implicit Places using invariants in 13 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 13 ms to find 2 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 09:47:53] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 09:47:53] [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 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 09:47:53] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 09:47:53] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Running random walk in product with property : MAPK-PT-02560-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) p2), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GEQ s12 1), p1:(AND (GEQ s3 1) (GEQ s14 1)), p2:(OR (LT s3 1) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1320 reset in 128 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-02560-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-02560-11 finished in 407 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(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.
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 09:47:53] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 09:47:53] [INFO ] Implicit Places using invariants in 43 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 09:47:53] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 09:47:53] [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 09:47:53] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 09:47:53] [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 78 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-02560-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s1 1)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-02560-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-02560-12 finished in 181 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 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 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
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 4 transition count 5
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 45 place count 2 transition count 4
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 2 transition count 3
Applied a total of 46 rules in 3 ms. Remains 2 /22 variables (removed 20) and now considering 3/30 (removed 27) transitions.
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 09:47:54] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 09:47:54] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 09:47:54] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 09:47:54] [INFO ] Implicit Places using invariants and state equation in 6 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-13 09:47:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2021-05-13 09:47:54] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-13 09:47:54] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/22 places, 3/30 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : MAPK-PT-02560-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1)], 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 0 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-02560-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-02560-13 finished in 66 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0 U (p1 U 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 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 09:47:54] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-13 09:47:54] [INFO ] Implicit Places using invariants in 11 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 09:47:54] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-13 09:47:54] [INFO ] Dead Transitions using invariants and state equation in 26 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 09:47:54] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-13 09:47:54] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2)]
Running random walk in product with property : MAPK-PT-02560-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p2 p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(GEQ s17 1), p1:(AND (GEQ s7 1) (GEQ s14 1)), p0:(AND (GEQ s8 1) (GEQ s10 1))], 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 2 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-02560-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-02560-14 finished in 210 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G(F((p0||G(p1)))) U p2)))], 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 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 13 rules applied. Total rules applied 16 place count 13 transition count 23
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 13 transition count 21
Applied a total of 18 rules in 2 ms. Remains 13 /22 variables (removed 9) and now considering 21/30 (removed 9) transitions.
[2021-05-13 09:47:54] [INFO ] Flow matrix only has 17 transitions (discarded 4 similar events)
// Phase 1: matrix 17 rows 13 cols
[2021-05-13 09:47:54] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 09:47:54] [INFO ] Implicit Places using invariants in 15 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 15 ms to find 1 implicit places.
[2021-05-13 09:47:54] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 09:47:54] [INFO ] Flow matrix only has 17 transitions (discarded 4 similar events)
// Phase 1: matrix 17 rows 12 cols
[2021-05-13 09:47:54] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 09:47:54] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 12/22 places, 21/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 21/21 (removed 0) transitions.
[2021-05-13 09:47:54] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 09:47:54] [INFO ] Flow matrix only has 17 transitions (discarded 4 similar events)
// Phase 1: matrix 17 rows 12 cols
[2021-05-13 09:47:54] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 09:47:54] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 12/22 places, 21/30 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p2), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MAPK-PT-02560-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s6 1), p1:(GEQ s10 1), p0:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-02560-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-02560-15 finished in 231 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4259734884493214806
[2021-05-13 09:47:54] [INFO ] Applying decomposition
[2021-05-13 09:47:54] [INFO ] Flatten gal took : 2 ms
[2021-05-13 09:47:54] [INFO ] Computing symmetric may disable matrix : 30 transitions.
[2021-05-13 09:47:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph5162227967872900846.txt, -o, /tmp/graph5162227967872900846.bin, -w, /tmp/graph5162227967872900846.weights], workingDir=null]
[2021-05-13 09:47:54] [INFO ] Computing symmetric may enable matrix : 30 transitions.
[2021-05-13 09:47:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5162227967872900846.bin, -l, -1, -v, -w, /tmp/graph5162227967872900846.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 09:47:54] [INFO ] Computing Do-Not-Accords matrix : 30 transitions.
[2021-05-13 09:47:54] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 09:47:54] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4259734884493214806
[2021-05-13 09:47:54] [INFO ] Decomposing Gal with order
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/ltsmin4259734884493214806]
[2021-05-13 09:47:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 09:47:54] [INFO ] Removed a total of 7 redundant transitions.
[2021-05-13 09:47:54] [INFO ] Flatten gal took : 6 ms
[2021-05-13 09:47:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-13 09:47:54] [INFO ] Time to serialize gal into /tmp/LTLFireability15229804986015283585.gal : 1 ms
[2021-05-13 09:47:54] [INFO ] Time to serialize properties into /tmp/LTLFireability13214384973264584109.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/LTLFireability15229804986015283585.gal, -t, CGAL, -LTL, /tmp/LTLFireability13214384973264584109.ltl, -c, -stutter-deadlock], 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/LTLFireability15229804986015283585.gal -t CGAL -LTL /tmp/LTLFireability13214384973264584109.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((G("(u2.ERKPP_Phase3>=1)"))||(G("((u5.RasGTP>=1)&&(u5.Raf>=1))"))))
Formula 0 simplified : !(G"(u2.ERKPP_Phase3>=1)" | G"((u5.RasGTP>=1)&&(u5.Raf>=1))")
Compilation finished in 187 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4259734884493214806]
Link finished in 34 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, -p, --pins-guards, --when, --ltl, ([]((LTLAPp0==true))||[](!(LTLAPp1==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin4259734884493214806]
LTSmin run took 366 ms.
FORMULA MAPK-PT-02560-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620899276078

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-02560"
export BK_EXAMINATION="LTLFireability"
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-02560, examination is LTLFireability"
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-162075407400765"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-02560.tgz
mv MAPK-PT-02560 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;