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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 17K 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 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 130K 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.4K Mar 28 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 3.7K Mar 27 06:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 06:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 07:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 07:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 25K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620897596113

Running Version 0
[2021-05-13 09:19:57] [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:19:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 09:19:57] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2021-05-13 09:19:57] [INFO ] Transformed 22 places.
[2021-05-13 09:19:57] [INFO ] Transformed 30 transitions.
[2021-05-13 09:19:57] [INFO ] Parsed PT model containing 22 places and 30 transitions in 63 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:19:57] [INFO ] Initial state test concluded for 4 properties.
Support contains 18 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 9 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:19:57] [INFO ] Computed 7 place invariants in 4 ms
[2021-05-13 09:19:57] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 09:19:57] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-13 09:19:58] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 09:19:58] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 09:19:58] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 30/30 transitions.
[2021-05-13 09:19:58] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-13 09:19:58] [INFO ] Flatten gal took : 20 ms
FORMULA MAPK-PT-01280-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 09:19:58] [INFO ] Flatten gal took : 5 ms
[2021-05-13 09:19:58] [INFO ] Input system was already deterministic with 30 transitions.
Incomplete random walk after 100148 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=1206 ) properties (out of 14) seen :12
Running SMT prover for 2 properties.
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 09:19:58] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-13 09:19:58] [INFO ] [Real]Absence check using 7 positive place invariants in 7 ms returned sat
[2021-05-13 09:19:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:19:58] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-13 09:19:58] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2021-05-13 09:19:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:19:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-13 09:19:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:19:58] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-13 09:19:58] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 4 ms.
[2021-05-13 09:19:58] [INFO ] Added : 19 causal constraints over 4 iterations in 23 ms. Result :sat
[2021-05-13 09:19:58] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 09:19:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:19:58] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 09:19:58] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2021-05-13 09:19:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:19:58] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 09:19:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:19:58] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 09:19:58] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 09:19:58] [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&&X(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.
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:19:58] [INFO ] Computed 7 place invariants in 6 ms
[2021-05-13 09:19:58] [INFO ] Implicit Places using invariants in 23 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 09:19:58] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 09:19:58] [INFO ] Dead Transitions using invariants and state equation in 28 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:19:58] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 09:19:58] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MAPK-PT-01280-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s1 1), p1:(LT s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 32793 reset in 206 ms.
Stack based approach found an accepted trace after 511 steps with 172 reset with depth 6 and stack size 6 in 1 ms.
FORMULA MAPK-PT-01280-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-00 finished in 540 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 09:19:59] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-13 09:19:59] [INFO ] Implicit Places using invariants in 22 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 22 ms to find 2 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 09:19:59] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 09:19:59] [INFO ] Dead Transitions using invariants and state equation in 39 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:19:59] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 09:19:59] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MAPK-PT-01280-01 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (GEQ s18 1) (GEQ s19 1)), p0:(LT s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 125 ms.
Product exploration explored 100000 steps with 50000 reset in 126 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 95 ms.
Product exploration explored 100000 steps with 50000 reset in 116 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 30/30 transitions.
Graph (trivial) has 12 edges and 20 vertex of which 8 / 20 are part of one of the 4 SCC in 2 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 16 transition count 30
Deduced a syphon composed of 4 places in 1 ms
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 13 place count 16 transition count 22
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 13 rules in 17 ms. Remains 16 /20 variables (removed 4) and now considering 22/30 (removed 8) transitions.
[2021-05-13 09:20:00] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 09:20:00] [INFO ] Flow matrix only has 19 transitions (discarded 3 similar events)
// Phase 1: matrix 19 rows 16 cols
[2021-05-13 09:20:00] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 09:20:00] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/20 places, 22/30 transitions.
Product exploration explored 100000 steps with 50000 reset in 260 ms.
Product exploration explored 100000 steps with 50000 reset in 194 ms.
[2021-05-13 09:20:00] [INFO ] Flatten gal took : 3 ms
[2021-05-13 09:20:00] [INFO ] Flatten gal took : 3 ms
[2021-05-13 09:20:00] [INFO ] Time to serialize gal into /tmp/LTL3696823221332278203.gal : 1 ms
[2021-05-13 09:20:00] [INFO ] Time to serialize properties into /tmp/LTL6937526953413277669.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/LTL3696823221332278203.gal, -t, CGAL, -LTL, /tmp/LTL6937526953413277669.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/LTL3696823221332278203.gal -t CGAL -LTL /tmp/LTL6937526953413277669.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("(RafP_Phase1<1)")||(G("((RasGTP>=1)&&(Raf>=1))"))))))
Formula 0 simplified : !XF("(RafP_Phase1<1)" | G"((RasGTP>=1)&&(Raf>=1))")
Detected timeout of ITS tools.
[2021-05-13 09:20:15] [INFO ] Flatten gal took : 27 ms
[2021-05-13 09:20:15] [INFO ] Applying decomposition
[2021-05-13 09:20:15] [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/graph679831213238860915.txt, -o, /tmp/graph679831213238860915.bin, -w, /tmp/graph679831213238860915.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/graph679831213238860915.bin, -l, -1, -v, -w, /tmp/graph679831213238860915.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 09:20:15] [INFO ] Decomposing Gal with order
[2021-05-13 09:20:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 09:20:15] [INFO ] Removed a total of 10 redundant transitions.
[2021-05-13 09:20:15] [INFO ] Flatten gal took : 95 ms
[2021-05-13 09:20:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2021-05-13 09:20:15] [INFO ] Time to serialize gal into /tmp/LTL15972789992591842606.gal : 4 ms
[2021-05-13 09:20:15] [INFO ] Time to serialize properties into /tmp/LTL12447144863034864135.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/LTL15972789992591842606.gal, -t, CGAL, -LTL, /tmp/LTL12447144863034864135.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/LTL15972789992591842606.gal -t CGAL -LTL /tmp/LTL12447144863034864135.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i0.u0.RafP_Phase1<1)")||(G("((i0.u6.RasGTP>=1)&&(i0.u6.Raf>=1))"))))))
Formula 0 simplified : !XF("(i0.u0.RafP_Phase1<1)" | G"((i0.u6.RasGTP>=1)&&(i0.u6.Raf>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11009903789839270532
[2021-05-13 09:20:30] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11009903789839270532
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/ltsmin11009903789839270532]
Compilation finished in 232 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11009903789839270532]
Link finished in 41 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(((LTLAPp0==true)||[]((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin11009903789839270532]
LTSmin run took 213 ms.
FORMULA MAPK-PT-01280-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MAPK-PT-01280-01 finished in 32211 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((p0&&X(p0))))))], 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.
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:20:31] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-13 09:20:31] [INFO ] Implicit Places using invariants in 42 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 09:20:31] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 09:20:31] [INFO ] Dead Transitions using invariants and state equation in 29 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:20:31] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 09:20:31] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-01280-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (LT s2 1) (LT s14 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 3 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-01280-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-03 finished in 203 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], 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.
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:20:31] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-13 09:20:31] [INFO ] Implicit Places using invariants in 32 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 09:20:31] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-13 09:20:31] [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 1 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:20:31] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-13 09:20:31] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-01280-05 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:(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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 28 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-01280-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-05 finished in 204 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(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 9 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 19 place count 11 transition count 22
Graph (trivial) has 8 edges and 11 vertex of which 2 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 10 transition count 22
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 10 transition count 19
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 10 transition count 16
Applied a total of 26 rules in 5 ms. Remains 10 /22 variables (removed 12) and now considering 16/30 (removed 14) transitions.
[2021-05-13 09:20:31] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
// Phase 1: matrix 13 rows 10 cols
[2021-05-13 09:20:31] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 09:20:31] [INFO ] Implicit Places using invariants in 21 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
[2021-05-13 09:20:31] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 09:20:31] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
// Phase 1: matrix 13 rows 9 cols
[2021-05-13 09:20:31] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-13 09:20:31] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Starting structural reductions, iteration 1 : 9/22 places, 16/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2021-05-13 09:20:31] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 09:20:31] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
// Phase 1: matrix 13 rows 9 cols
[2021-05-13 09:20:31] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-13 09:20:31] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 2 iterations. Remains : 9/22 places, 16/30 transitions.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : MAPK-PT-01280-07 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(GEQ s5 1), p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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-01280-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-07 finished in 126 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 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:20:31] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-13 09:20:31] [INFO ] Implicit Places using invariants in 16 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 17 ms to find 2 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 09:20:31] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 09:20:31] [INFO ] Dead Transitions using invariants and state equation in 33 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:20:31] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 09:20:32] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 54 ms :[p0, p0]
Running random walk in product with property : MAPK-PT-01280-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s11 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 122 ms.
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[p0, p0]
Product exploration explored 100000 steps with 50000 reset in 64 ms.
Product exploration explored 100000 steps with 50000 reset in 80 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 46 ms :[p0, p0]
Support contains 1 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 30/30 transitions.
Graph (trivial) has 9 edges and 20 vertex of which 6 / 20 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 17 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 17 transition count 28
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 0 with 5 rules applied. Total rules applied 7 place count 17 transition count 33
Deduced a syphon composed of 6 places in 0 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 16 place count 17 transition count 24
Deduced a syphon composed of 6 places in 1 ms
Applied a total of 16 rules in 3 ms. Remains 17 /20 variables (removed 3) and now considering 24/30 (removed 6) transitions.
[2021-05-13 09:20:32] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 09:20:32] [INFO ] Flow matrix only has 19 transitions (discarded 5 similar events)
// Phase 1: matrix 19 rows 17 cols
[2021-05-13 09:20:32] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 09:20:32] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17/20 places, 24/30 transitions.
Product exploration explored 100000 steps with 50000 reset in 162 ms.
Product exploration explored 100000 steps with 50000 reset in 166 ms.
[2021-05-13 09:20:33] [INFO ] Flatten gal took : 3 ms
[2021-05-13 09:20:33] [INFO ] Flatten gal took : 2 ms
[2021-05-13 09:20:33] [INFO ] Time to serialize gal into /tmp/LTL4176839894593665290.gal : 1 ms
[2021-05-13 09:20:33] [INFO ] Time to serialize properties into /tmp/LTL8274736849137170683.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4176839894593665290.gal, -t, CGAL, -LTL, /tmp/LTL8274736849137170683.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/LTL4176839894593665290.gal -t CGAL -LTL /tmp/LTL8274736849137170683.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(MEKP_Phase2<1)"))))
Formula 0 simplified : !XF"(MEKP_Phase2<1)"
Detected timeout of ITS tools.
[2021-05-13 09:20:48] [INFO ] Flatten gal took : 2 ms
[2021-05-13 09:20:48] [INFO ] Applying decomposition
[2021-05-13 09:20:48] [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/graph12430425588198293500.txt, -o, /tmp/graph12430425588198293500.bin, -w, /tmp/graph12430425588198293500.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/graph12430425588198293500.bin, -l, -1, -v, -w, /tmp/graph12430425588198293500.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 09:20:48] [INFO ] Decomposing Gal with order
[2021-05-13 09:20:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 09:20:48] [INFO ] Removed a total of 10 redundant transitions.
[2021-05-13 09:20:48] [INFO ] Flatten gal took : 6 ms
[2021-05-13 09:20:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2021-05-13 09:20:48] [INFO ] Time to serialize gal into /tmp/LTL7464407482278975590.gal : 4 ms
[2021-05-13 09:20:48] [INFO ] Time to serialize properties into /tmp/LTL8204644937364701193.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7464407482278975590.gal, -t, CGAL, -LTL, /tmp/LTL8204644937364701193.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/LTL7464407482278975590.gal -t CGAL -LTL /tmp/LTL8204644937364701193.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(i2.u4.MEKP_Phase2<1)"))))
Formula 0 simplified : !XF"(i2.u4.MEKP_Phase2<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17160952340095945136
[2021-05-13 09:21:03] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17160952340095945136
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/ltsmin17160952340095945136]
Compilation finished in 162 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17160952340095945136]
Link finished in 36 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin17160952340095945136]
LTSmin run took 142 ms.
FORMULA MAPK-PT-01280-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MAPK-PT-01280-08 finished in 31617 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 09:21:03] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-13 09:21:03] [INFO ] Implicit Places using invariants in 18 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 19 ms to find 1 implicit places.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 09:21:03] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-13 09:21:03] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 21/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 09:21:03] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-13 09:21:03] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : MAPK-PT-01280-09 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s13 1) (GEQ s6 1) (GEQ s8 1)), p0:(GEQ s13 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-01280-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-09 finished in 129 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(p0))||G(!p0)||F((p1||X((p0 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.
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:21:03] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 09:21:03] [INFO ] Implicit Places using invariants in 15 ms returned [9]
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:21:03] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-13 09:21:03] [INFO ] Dead Transitions using invariants and state equation in 29 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:21:03] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-13 09:21:03] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), false, false, false, (AND (NOT p1) (NOT p2) p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MAPK-PT-01280-11 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=1, aps=[p0:(AND (GEQ s8 1) (GEQ s9 1)), p1:(GEQ s13 1), p2:(AND (GEQ s13 1) (GEQ s8 1) (GEQ s9 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, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1345 reset in 124 ms.
Stack based approach found an accepted trace after 104 steps with 1 reset with depth 78 and stack size 51 in 0 ms.
FORMULA MAPK-PT-01280-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-11 finished in 370 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((F(!p0)&&G(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.
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:21:04] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 09:21:04] [INFO ] Implicit Places using invariants in 15 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 16 ms to find 2 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 09:21:04] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 09:21:04] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 09:21:04] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 09:21:04] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : MAPK-PT-01280-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LT s1 1), p0:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 168 reset in 143 ms.
Stack based approach found an accepted trace after 720 steps with 0 reset with depth 721 and stack size 658 in 1 ms.
FORMULA MAPK-PT-01280-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-13 finished in 355 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(!p0)) U (!p0||X((G(p0)&&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:21:04] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 09:21:04] [INFO ] Implicit Places using invariants in 13 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 14 ms to find 2 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 09:21:04] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 09:21:04] [INFO ] Dead Transitions using invariants and state equation in 25 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:21:04] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 09:21:04] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 146 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, p0, false]
Running random walk in product with property : MAPK-PT-01280-14 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LT s16 1), p1:(AND (GEQ s7 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 7593 reset in 80 ms.
Stack based approach found an accepted trace after 15 steps with 1 reset with depth 12 and stack size 12 in 0 ms.
FORMULA MAPK-PT-01280-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-14 finished in 303 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0))&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 11 rules applied. Total rules applied 14 place count 14 transition count 24
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 17 place count 14 transition count 21
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 14 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 14 transition count 20
Applied a total of 19 rules in 4 ms. Remains 14 /22 variables (removed 8) and now considering 20/30 (removed 10) transitions.
[2021-05-13 09:21:04] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
// Phase 1: matrix 18 rows 14 cols
[2021-05-13 09:21:04] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 09:21:04] [INFO ] Implicit Places using invariants in 11 ms returned []
[2021-05-13 09:21:04] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
// Phase 1: matrix 18 rows 14 cols
[2021-05-13 09:21:04] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 09:21:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-13 09:21:04] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2021-05-13 09:21:04] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 09:21:04] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
// Phase 1: matrix 18 rows 14 cols
[2021-05-13 09:21:04] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 09:21:04] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 14/22 places, 20/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-01280-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s9 1)), p1:(LT s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-01280-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-15 finished in 162 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620897665689

--------------------
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-01280"
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-01280, 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-162075407400757"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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