About the Execution of ITS-Tools for MAPK-PT-00320
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 515.447 | 68842.00 | 77946.00 | 232.80 | FFFFFFFFTTFTTFFF | normal |
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-162075407400741.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is MAPK-PT-00320, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075407400741
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 149K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 16:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 06:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 06:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 07:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 25 07:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 25K May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME MAPK-PT-00320-00
FORMULA_NAME MAPK-PT-00320-01
FORMULA_NAME MAPK-PT-00320-02
FORMULA_NAME MAPK-PT-00320-03
FORMULA_NAME MAPK-PT-00320-04
FORMULA_NAME MAPK-PT-00320-05
FORMULA_NAME MAPK-PT-00320-06
FORMULA_NAME MAPK-PT-00320-07
FORMULA_NAME MAPK-PT-00320-08
FORMULA_NAME MAPK-PT-00320-09
FORMULA_NAME MAPK-PT-00320-10
FORMULA_NAME MAPK-PT-00320-11
FORMULA_NAME MAPK-PT-00320-12
FORMULA_NAME MAPK-PT-00320-13
FORMULA_NAME MAPK-PT-00320-14
FORMULA_NAME MAPK-PT-00320-15
=== Now, execution of the tool begins
BK_START 1620893980160
Running Version 0
[2021-05-13 08:19:41] [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 08:19:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 08:19:41] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2021-05-13 08:19:41] [INFO ] Transformed 22 places.
[2021-05-13 08:19:41] [INFO ] Transformed 30 transitions.
[2021-05-13 08:19:41] [INFO ] Parsed PT model containing 22 places and 30 transitions in 62 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 08:19:41] [INFO ] Initial state test concluded for 3 properties.
FORMULA MAPK-PT-00320-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 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 08:19:41] [INFO ] Computed 7 place invariants in 7 ms
[2021-05-13 08:19:41] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 08:19:41] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-13 08:19:41] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 08:19:41] [INFO ] Computed 7 place invariants in 6 ms
[2021-05-13 08:19:41] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 30/30 transitions.
[2021-05-13 08:19:42] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-13 08:19:42] [INFO ] Flatten gal took : 20 ms
FORMULA MAPK-PT-00320-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00320-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 08:19:42] [INFO ] Flatten gal took : 7 ms
[2021-05-13 08:19:42] [INFO ] Input system was already deterministic with 30 transitions.
Finished random walk after 11077 steps, including 0 resets, run visited all 17 properties in 15 ms. (steps per millisecond=738 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((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.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 08:19:42] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-13 08:19:42] [INFO ] Implicit Places using invariants in 29 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 08:19:42] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 08:19:42] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 08:19:42] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 08:19:42] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-00320-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-00320-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00320-00 finished in 351 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(X(G(p0))) U G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 08:19:42] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 08:19:42] [INFO ] Implicit Places using invariants in 16 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 17 ms to find 2 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 08:19:42] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 08:19:42] [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 08:19:42] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 08:19:42] [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 204 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) p0)]
Running random walk in product with property : MAPK-PT-00320-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=p1, acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 5}, { cond=(AND p1 p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(OR (LT s18 1) (LT s19 1)), p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-00320-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00320-01 finished in 305 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(X(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 08:19:42] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 08:19:42] [INFO ] Implicit Places using invariants in 21 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 08:19:42] [INFO ] Computed 5 place invariants in 7 ms
[2021-05-13 08:19:42] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 08:19:42] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 08:19:42] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : MAPK-PT-00320-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s12 1), p1:(LT 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 41 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-00320-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00320-02 finished in 204 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&G(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 7 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 15 place count 13 transition count 24
Graph (trivial) has 8 edges and 13 vertex of which 2 / 13 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 11 transition count 24
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 7 edges and 11 vertex of which 3 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 22 place count 9 transition count 20
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 28 place count 9 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 9 transition count 13
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 9 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 9 transition count 12
Applied a total of 31 rules in 18 ms. Remains 9 /22 variables (removed 13) and now considering 12/30 (removed 18) transitions.
// Phase 1: matrix 12 rows 9 cols
[2021-05-13 08:19:43] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-13 08:19:43] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 12 rows 9 cols
[2021-05-13 08:19:43] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-13 08:19:43] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2021-05-13 08:19:43] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 12 rows 9 cols
[2021-05-13 08:19:43] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-13 08:19:43] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/22 places, 12/30 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : MAPK-PT-00320-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s1 1), p1:(AND (GEQ s1 1) (GEQ s4 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], 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-00320-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00320-04 finished in 181 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(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 08:19:43] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-13 08:19:43] [INFO ] Implicit Places using invariants in 15 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 08:19:43] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-13 08:19:43] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 21/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 08:19:43] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-13 08:19:43] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 51 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-00320-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s7 1) (GEQ 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-00320-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00320-05 finished in 125 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(X(p0)) U ((p1&&X(X(p0)))||X(X(G(p0)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 08:19:43] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-13 08:19:43] [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 08:19:43] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 08:19:43] [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 08:19:43] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 08:19:43] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : MAPK-PT-00320-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s17 1) (GEQ s2 1) (GEQ s14 1)) (AND (GEQ s2 1) (GEQ s14 1))), p1:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 2 reset in 0 ms.
FORMULA MAPK-PT-00320-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00320-06 finished in 173 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(p1))))], 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 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 18 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 18 transition count 26
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 11 place count 18 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 18 transition count 25
Applied a total of 12 rules in 10 ms. Remains 18 /22 variables (removed 4) and now considering 25/30 (removed 5) transitions.
[2021-05-13 08:19:43] [INFO ] Flow matrix only has 23 transitions (discarded 2 similar events)
// Phase 1: matrix 23 rows 18 cols
[2021-05-13 08:19:43] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-13 08:19:43] [INFO ] Implicit Places using invariants in 16 ms returned [6, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 17 ms to find 2 implicit places.
[2021-05-13 08:19:43] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 08:19:43] [INFO ] Flow matrix only has 23 transitions (discarded 2 similar events)
// Phase 1: matrix 23 rows 16 cols
[2021-05-13 08:19:43] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 08:19:43] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 16/22 places, 25/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2021-05-13 08:19:43] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 08:19:43] [INFO ] Flow matrix only has 23 transitions (discarded 2 similar events)
// Phase 1: matrix 23 rows 16 cols
[2021-05-13 08:19:43] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 08:19:43] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 2 iterations. Remains : 16/22 places, 25/30 transitions.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : MAPK-PT-00320-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:(OR (GEQ s13 1) (LT s5 1) (LT s11 1)), p0:(GEQ s9 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 119 steps with 5 reset in 1 ms.
FORMULA MAPK-PT-00320-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00320-07 finished in 142 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(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 08:19:43] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-13 08:19:43] [INFO ] Implicit Places using invariants in 22 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 ms to find 2 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 08:19:43] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 08:19:43] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 08:19:43] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 08:19:43] [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 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-00320-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s12 1) (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 189 ms.
Product exploration explored 100000 steps with 50000 reset in 131 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 99 ms.
Product exploration explored 100000 steps with 50000 reset in 118 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Support contains 2 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 6 edges and 20 vertex of which 4 / 20 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 18 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 18 transition count 29
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 18 transition count 34
Deduced a syphon composed of 6 places in 0 ms
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 15 place count 18 transition count 26
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 15 rules in 6 ms. Remains 18 /20 variables (removed 2) and now considering 26/30 (removed 4) transitions.
[2021-05-13 08:19:44] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 08:19:44] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
// Phase 1: matrix 21 rows 18 cols
[2021-05-13 08:19:44] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 08:19:44] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 18/20 places, 26/30 transitions.
Product exploration explored 100000 steps with 50000 reset in 205 ms.
Product exploration explored 100000 steps with 50000 reset in 189 ms.
[2021-05-13 08:19:45] [INFO ] Flatten gal took : 4 ms
[2021-05-13 08:19:45] [INFO ] Flatten gal took : 3 ms
[2021-05-13 08:19:45] [INFO ] Time to serialize gal into /tmp/LTL3014685917638416443.gal : 3 ms
[2021-05-13 08:19:45] [INFO ] Time to serialize properties into /tmp/LTL12116591400202459169.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/LTL3014685917638416443.gal, -t, CGAL, -LTL, /tmp/LTL12116591400202459169.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/LTL3014685917638416443.gal -t CGAL -LTL /tmp/LTL12116591400202459169.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((MEKPP_Phase2<1)||(MEKP_Phase2>=1))"))))
Formula 0 simplified : !XF"((MEKPP_Phase2<1)||(MEKP_Phase2>=1))"
Detected timeout of ITS tools.
[2021-05-13 08:20:00] [INFO ] Flatten gal took : 3 ms
[2021-05-13 08:20:00] [INFO ] Applying decomposition
[2021-05-13 08:20:00] [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/graph10629108914036917875.txt, -o, /tmp/graph10629108914036917875.bin, -w, /tmp/graph10629108914036917875.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/graph10629108914036917875.bin, -l, -1, -v, -w, /tmp/graph10629108914036917875.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 08:20:00] [INFO ] Decomposing Gal with order
[2021-05-13 08:20:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 08:20:00] [INFO ] Removed a total of 10 redundant transitions.
[2021-05-13 08:20:00] [INFO ] Flatten gal took : 24 ms
[2021-05-13 08:20:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2021-05-13 08:20:00] [INFO ] Time to serialize gal into /tmp/LTL469529029112815822.gal : 1 ms
[2021-05-13 08:20:00] [INFO ] Time to serialize properties into /tmp/LTL10030515751632119029.ltl : 8 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/LTL469529029112815822.gal, -t, CGAL, -LTL, /tmp/LTL10030515751632119029.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/LTL469529029112815822.gal -t CGAL -LTL /tmp/LTL10030515751632119029.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((i2.u5.MEKPP_Phase2<1)||(i1.u3.MEKP_Phase2>=1))"))))
Formula 0 simplified : !XF"((i2.u5.MEKPP_Phase2<1)||(i1.u3.MEKP_Phase2>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8866683552618029444
[2021-05-13 08:20:15] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8866683552618029444
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/ltsmin8866683552618029444]
Compilation finished in 218 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8866683552618029444]
Link finished in 45 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/ltsmin8866683552618029444]
LTSmin run took 293 ms.
FORMULA MAPK-PT-00320-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MAPK-PT-00320-09 finished in 32092 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((F(p1)||X(F(p2)))&&p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 08:20:15] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-13 08:20:15] [INFO ] Implicit Places using invariants in 20 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 08:20:15] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-13 08:20:15] [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 08:20:15] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-13 08:20:15] [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 85 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : MAPK-PT-00320-10 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (GEQ s8 1) (GEQ s10 1)), p1:(GEQ s17 1), p2:(AND (GEQ s8 1) (GEQ s10 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-00320-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00320-10 finished in 156 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((!p0&&(G(!p0)||F(!p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2021-05-13 08:20:15] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-13 08:20:15] [INFO ] Implicit Places using invariants in 14 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 14 ms to find 1 implicit places.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 08:20:15] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-13 08:20:15] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Starting structural reductions, iteration 1 : 21/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 08:20:15] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-13 08:20:15] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, p1, p0, p0, (AND p1 p0)]
Running random walk in product with property : MAPK-PT-00320-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GEQ s7 1) (GEQ s8 1)), p0:(GEQ s1 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 99 ms.
Product exploration explored 100000 steps with 50000 reset in 83 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[true, p1, p0, p0, (AND p1 p0)]
Product exploration explored 100000 steps with 50000 reset in 71 ms.
Product exploration explored 100000 steps with 50000 reset in 83 ms.
Applying partial POR strategy [true, true, false, true, true]
Stuttering acceptance computed with spot in 105 ms :[true, p1, p0, p0, (AND p1 p0)]
Support contains 3 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 21/21 places, 30/30 transitions.
Graph (trivial) has 6 edges and 21 vertex of which 4 / 21 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 19 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 19 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 19 transition count 28
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 7 rules in 4 ms. Remains 19 /21 variables (removed 2) and now considering 28/30 (removed 2) transitions.
[2021-05-13 08:20:16] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 08:20:16] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
// Phase 1: matrix 24 rows 19 cols
[2021-05-13 08:20:16] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-13 08:20:16] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/21 places, 28/30 transitions.
Product exploration explored 100000 steps with 50000 reset in 191 ms.
Product exploration explored 100000 steps with 50000 reset in 205 ms.
[2021-05-13 08:20:17] [INFO ] Flatten gal took : 2 ms
[2021-05-13 08:20:17] [INFO ] Flatten gal took : 2 ms
[2021-05-13 08:20:17] [INFO ] Time to serialize gal into /tmp/LTL2694154479368495138.gal : 0 ms
[2021-05-13 08:20:17] [INFO ] Time to serialize properties into /tmp/LTL777425112236991800.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/LTL2694154479368495138.gal, -t, CGAL, -LTL, /tmp/LTL777425112236991800.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/LTL2694154479368495138.gal -t CGAL -LTL /tmp/LTL777425112236991800.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(ERKP_MEKPP<1)")&&((G("(ERKP_MEKPP<1)"))||(F("((MEKPP<1)||(Phase2<1))"))))))
Formula 0 simplified : !X("(ERKP_MEKPP<1)" & (G"(ERKP_MEKPP<1)" | F"((MEKPP<1)||(Phase2<1))"))
Detected timeout of ITS tools.
[2021-05-13 08:20:32] [INFO ] Flatten gal took : 2 ms
[2021-05-13 08:20:32] [INFO ] Applying decomposition
[2021-05-13 08:20:32] [INFO ] Flatten gal took : 1 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/graph13309801819385285912.txt, -o, /tmp/graph13309801819385285912.bin, -w, /tmp/graph13309801819385285912.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/graph13309801819385285912.bin, -l, -1, -v, -w, /tmp/graph13309801819385285912.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 08:20:32] [INFO ] Decomposing Gal with order
[2021-05-13 08:20:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 08:20:32] [INFO ] Removed a total of 9 redundant transitions.
[2021-05-13 08:20:32] [INFO ] Flatten gal took : 4 ms
[2021-05-13 08:20:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-13 08:20:32] [INFO ] Time to serialize gal into /tmp/LTL1394662917522482895.gal : 1 ms
[2021-05-13 08:20:32] [INFO ] Time to serialize properties into /tmp/LTL8295723966173752949.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/LTL1394662917522482895.gal, -t, CGAL, -LTL, /tmp/LTL8295723966173752949.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/LTL1394662917522482895.gal -t CGAL -LTL /tmp/LTL8295723966173752949.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("(i0.u0.ERKP_MEKPP<1)")&&((G("(i0.u0.ERKP_MEKPP<1)"))||(F("((i0.u0.MEKPP<1)||(u4.Phase2<1))"))))))
Formula 0 simplified : !X("(i0.u0.ERKP_MEKPP<1)" & (G"(i0.u0.ERKP_MEKPP<1)" | F"((i0.u0.MEKPP<1)||(u4.Phase2<1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9636039405424766219
[2021-05-13 08:20:47] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9636039405424766219
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/ltsmin9636039405424766219]
Compilation finished in 157 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin9636039405424766219]
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, --when, --ltl, X(((LTLAPp0==true)&&([]((LTLAPp0==true))||<>((LTLAPp1==true))))), --buchi-type=spotba], workingDir=/tmp/ltsmin9636039405424766219]
LTSmin run took 183 ms.
FORMULA MAPK-PT-00320-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MAPK-PT-00320-12 finished in 31715 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], 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 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 10 place count 16 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 16 transition count 25
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 16 transition count 25
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 15 transition count 24
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 15 transition count 24
Applied a total of 16 rules in 5 ms. Remains 15 /22 variables (removed 7) and now considering 24/30 (removed 6) transitions.
[2021-05-13 08:20:47] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 15 cols
[2021-05-13 08:20:47] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 08:20:47] [INFO ] Implicit Places using invariants in 17 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 18 ms to find 1 implicit places.
[2021-05-13 08:20:47] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 08:20:47] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 14 cols
[2021-05-13 08:20:47] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 08:20:47] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 14/22 places, 24/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2021-05-13 08:20:47] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 08:20:47] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 14 cols
[2021-05-13 08:20:47] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 08:20:47] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 2 iterations. Remains : 14/22 places, 24/30 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : MAPK-PT-00320-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s5 1) (GEQ s10 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-00320-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00320-13 finished in 97 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(p0) U G(p1))||G(F(!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.
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 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 8 place count 17 transition count 27
Graph (trivial) has 4 edges and 17 vertex of which 2 / 17 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 9 place count 16 transition count 27
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 12 place count 16 transition count 24
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 16 transition count 24
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 16 transition count 23
Applied a total of 15 rules in 5 ms. Remains 16 /22 variables (removed 6) and now considering 23/30 (removed 7) transitions.
[2021-05-13 08:20:47] [INFO ] Flow matrix only has 22 transitions (discarded 1 similar events)
// Phase 1: matrix 22 rows 16 cols
[2021-05-13 08:20:47] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 08:20:47] [INFO ] Implicit Places using invariants in 11 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 12 ms to find 1 implicit places.
[2021-05-13 08:20:47] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 08:20:47] [INFO ] Flow matrix only has 22 transitions (discarded 1 similar events)
// Phase 1: matrix 22 rows 15 cols
[2021-05-13 08:20:47] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 08:20:47] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 15/22 places, 23/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2021-05-13 08:20:47] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 08:20:47] [INFO ] Flow matrix only has 22 transitions (discarded 1 similar events)
// Phase 1: matrix 22 rows 15 cols
[2021-05-13 08:20:47] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 08:20:47] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 2 iterations. Remains : 15/22 places, 23/30 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) p2), p2, p2, (AND (NOT p1) p2), (AND p2 (NOT p0) p1), (AND p2 (NOT p0) p1), (AND p2 (NOT p1)), (AND p2 (NOT p1))]
Running random walk in product with property : MAPK-PT-00320-14 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 7}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 6}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 1}, { cond=(AND p1 p0 p2), acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 1}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 1}, { cond=(NOT p1), acceptance={} source=7 dest: 2}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s9 1)), p1:(AND (GEQ s6 1) (GEQ s12 1)), p2:(GEQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-00320-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00320-14 finished in 263 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(!p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 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 8 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 18 place count 12 transition count 22
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 12 transition count 20
Applied a total of 20 rules in 3 ms. Remains 12 /22 variables (removed 10) and now considering 20/30 (removed 10) transitions.
[2021-05-13 08:20:48] [INFO ] Flow matrix only has 15 transitions (discarded 5 similar events)
// Phase 1: matrix 15 rows 12 cols
[2021-05-13 08:20:48] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 08:20:48] [INFO ] Implicit Places using invariants in 11 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 11 ms to find 1 implicit places.
[2021-05-13 08:20:48] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 08:20:48] [INFO ] Flow matrix only has 15 transitions (discarded 5 similar events)
// Phase 1: matrix 15 rows 11 cols
[2021-05-13 08:20:48] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 08:20:48] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 11/22 places, 20/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 11 transition count 19
Applied a total of 1 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 19/20 (removed 1) transitions.
[2021-05-13 08:20:48] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
// Phase 1: matrix 15 rows 11 cols
[2021-05-13 08:20:48] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 08:20:48] [INFO ] Implicit Places using invariants in 8 ms returned []
[2021-05-13 08:20:48] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
// Phase 1: matrix 15 rows 11 cols
[2021-05-13 08:20:48] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 08:20:48] [INFO ] State equation strengthened by 5 read => feed constraints.
[2021-05-13 08:20:48] [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.
Finished structural reductions, in 2 iterations. Remains : 11/22 places, 19/30 transitions.
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : MAPK-PT-00320-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s6 1), p1:(LT s9 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 4 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-00320-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00320-15 finished in 135 ms.
All properties solved without resorting to model-checking.
BK_STOP 1620894049002
--------------------
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-00320"
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-00320, 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-162075407400741"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-00320.tgz
mv MAPK-PT-00320 execution
cd execution
if [ "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 '
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 ;