fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r121-tall-162075407400756
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for MAPK-PT-01280

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
540.987 70325.00 81080.00 506.40 FTTTFTFFFTTFFFFF 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-162075407400756.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075407400756
=====================================================================

--------------------
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 1620897513135

Running Version 0
[2021-05-13 09:18:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 09:18:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 09:18:34] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2021-05-13 09:18:34] [INFO ] Transformed 22 places.
[2021-05-13 09:18:34] [INFO ] Transformed 30 transitions.
[2021-05-13 09:18:34] [INFO ] Parsed PT model containing 22 places and 30 transitions in 61 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-13 09:18:34] [INFO ] Initial state test concluded for 3 properties.
FORMULA MAPK-PT-01280-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 22 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 8 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:18:34] [INFO ] Computed 7 place invariants in 4 ms
[2021-05-13 09:18:35] [INFO ] Implicit Places using invariants in 66 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 09:18:35] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-13 09:18:35] [INFO ] Dead Transitions using invariants and state equation in 42 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:18:35] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-13 09:18:35] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/22 places, 30/30 transitions.
[2021-05-13 09:18:35] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-13 09:18:35] [INFO ] Flatten gal took : 20 ms
FORMULA MAPK-PT-01280-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-01280-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 09:18:35] [INFO ] Flatten gal took : 6 ms
[2021-05-13 09:18:35] [INFO ] Input system was already deterministic with 30 transitions.
Incomplete random walk after 100144 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=1540 ) properties (out of 15) seen :10
Running SMT prover for 5 properties.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 09:18:35] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 09:18:35] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 09:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:18:35] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 09:18:35] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2021-05-13 09:18:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:18:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 09:18:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:18:35] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 09:18:35] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 09:18:35] [INFO ] Added : 22 causal constraints over 5 iterations in 27 ms. Result :sat
[2021-05-13 09:18:35] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 09:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:18:35] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-13 09:18:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:18:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 09:18:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:18:35] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 09:18:35] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 09:18:35] [INFO ] Added : 19 causal constraints over 4 iterations in 18 ms. Result :sat
[2021-05-13 09:18:35] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 09:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:18:35] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 09:18:35] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 09:18:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:18:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 09:18:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:18:35] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 09:18:35] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 09:18:35] [INFO ] Added : 17 causal constraints over 4 iterations in 20 ms. Result :sat
[2021-05-13 09:18:35] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 09:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:18:35] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-13 09:18:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:18:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 09:18:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:18:35] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 09:18:35] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 09:18:35] [INFO ] Added : 18 causal constraints over 4 iterations in 20 ms. Result :sat
[2021-05-13 09:18:35] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-13 09:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 09:18:35] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-13 09:18:35] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2021-05-13 09:18:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 09:18:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-13 09:18:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 09:18:35] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 09:18:35] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 1 ms.
[2021-05-13 09:18:35] [INFO ] Added : 16 causal constraints over 4 iterations in 15 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((p0 U p1)&&X(X(X(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 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:18:35] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-13 09:18:35] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 09:18:35] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-13 09:18:35] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 09:18:35] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-13 09:18:35] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : MAPK-PT-01280-00 automaton TGBA [mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 1}]], initial=0, aps=[p1:(LEQ s1 s13), p0:(GT s8 s12), p2:(GT 2 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 2 ms.
FORMULA MAPK-PT-01280-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-00 finished in 363 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X((G((p1||G(p2))) U (p0&&G((p1||G(p2)))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 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:18:36] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 09:18:36] [INFO ] Implicit Places using invariants in 50 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 09:18:36] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 09:18:36] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Starting structural reductions, iteration 1 : 20/21 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:18:36] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 09:18:36] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MAPK-PT-01280-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s18 s10), p1:(LEQ 1 s4), p2:(LEQ 2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 265 ms.
Product exploration explored 100000 steps with 0 reset in 299 ms.
Knowledge obtained : [(NOT p0), (NOT p1), p2]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 156 ms.
Product exploration explored 100000 steps with 0 reset in 237 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 4 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 8 edges and 20 vertex of which 6 / 20 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 17 transition count 30
Deduced a syphon composed of 3 places in 0 ms
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 17 transition count 25
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 16 transition count 24
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 16 transition count 24
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 11 rules in 12 ms. Remains 16 /20 variables (removed 4) and now considering 24/30 (removed 6) transitions.
[2021-05-13 09:18:37] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 09:18:37] [INFO ] Flow matrix only has 21 transitions (discarded 3 similar events)
// Phase 1: matrix 21 rows 16 cols
[2021-05-13 09:18:37] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 09:18:37] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/20 places, 24/30 transitions.
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-01280-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-04 finished in 1733 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 21 places. Attempting structural reductions.
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 27
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 4 place count 17 transition count 27
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 15 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 16 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 19 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 22 place count 10 transition count 16
Applied a total of 22 rules in 9 ms. Remains 10 /21 variables (removed 11) and now considering 16/30 (removed 14) transitions.
[2021-05-13 09:18:37] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
// Phase 1: matrix 13 rows 10 cols
[2021-05-13 09:18:37] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 09:18:37] [INFO ] Implicit Places using invariants in 11 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 13 ms to find 1 implicit places.
[2021-05-13 09:18:37] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-13 09:18:37] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
// Phase 1: matrix 13 rows 9 cols
[2021-05-13 09:18:37] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 09:18:37] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 9/21 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:18:37] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 09:18:37] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
// Phase 1: matrix 13 rows 9 cols
[2021-05-13 09:18:37] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-13 09:18:37] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 2 iterations. Remains : 9/21 places, 16/30 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : MAPK-PT-01280-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT s1 s5)], 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-01280-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-07 finished in 92 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 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:18:37] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-13 09:18:37] [INFO ] Implicit Places using invariants in 14 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 14 ms to find 1 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 09:18:37] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 09:18:37] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 20/21 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:18:38] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-13 09:18:38] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-01280-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s0 s12)], 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]]
Product exploration explored 100000 steps with 33333 reset in 124 ms.
Product exploration explored 100000 steps with 33333 reset in 109 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 85 ms.
Product exploration explored 100000 steps with 33333 reset in 106 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (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 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 4 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 17 transition count 32
Deduced a syphon composed of 5 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 14 place count 17 transition count 24
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 16 transition count 23
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 16 transition count 23
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 16 rules in 4 ms. Remains 16 /20 variables (removed 4) and now considering 23/30 (removed 7) transitions.
[2021-05-13 09:18:38] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 09:18:38] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
// Phase 1: matrix 19 rows 16 cols
[2021-05-13 09:18:38] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 09:18:38] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/20 places, 23/30 transitions.
Product exploration explored 100000 steps with 33333 reset in 159 ms.
Product exploration explored 100000 steps with 33333 reset in 133 ms.
[2021-05-13 09:18:39] [INFO ] Flatten gal took : 5 ms
[2021-05-13 09:18:39] [INFO ] Flatten gal took : 3 ms
[2021-05-13 09:18:39] [INFO ] Time to serialize gal into /tmp/LTL16007438064245403474.gal : 1 ms
[2021-05-13 09:18:39] [INFO ] Time to serialize properties into /tmp/LTL12415819102553107737.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/LTL16007438064245403474.gal, -t, CGAL, -LTL, /tmp/LTL12415819102553107737.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/LTL16007438064245403474.gal -t CGAL -LTL /tmp/LTL12415819102553107737.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(ERK_MEKPP<=MEKPP_Phase2)")))))
Formula 0 simplified : !XXF"(ERK_MEKPP<=MEKPP_Phase2)"
Detected timeout of ITS tools.
[2021-05-13 09:18:54] [INFO ] Flatten gal took : 2 ms
[2021-05-13 09:18:54] [INFO ] Applying decomposition
[2021-05-13 09:18:54] [INFO ] Flatten gal took : 3 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/graph11546484742212046407.txt, -o, /tmp/graph11546484742212046407.bin, -w, /tmp/graph11546484742212046407.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/graph11546484742212046407.bin, -l, -1, -v, -w, /tmp/graph11546484742212046407.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 09:18:54] [INFO ] Decomposing Gal with order
[2021-05-13 09:18:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 09:18:54] [INFO ] Removed a total of 15 redundant transitions.
[2021-05-13 09:18:54] [INFO ] Flatten gal took : 114 ms
[2021-05-13 09:18:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2021-05-13 09:18:54] [INFO ] Time to serialize gal into /tmp/LTL5696063035634510427.gal : 1 ms
[2021-05-13 09:18:54] [INFO ] Time to serialize properties into /tmp/LTL8682547846713301539.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/LTL5696063035634510427.gal, -t, CGAL, -LTL, /tmp/LTL8682547846713301539.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/LTL5696063035634510427.gal -t CGAL -LTL /tmp/LTL8682547846713301539.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(gu6.ERK_MEKPP<=gu6.MEKPP_Phase2)")))))
Formula 0 simplified : !XXF"(gu6.ERK_MEKPP<=gu6.MEKPP_Phase2)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18413215853705412509
[2021-05-13 09:19:09] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18413215853705412509
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/ltsmin18413215853705412509]
Compilation finished in 216 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin18413215853705412509]
Link finished in 42 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(X(<>((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin18413215853705412509]
LTSmin run took 577 ms.
FORMULA MAPK-PT-01280-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MAPK-PT-01280-09 finished in 32242 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 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:19:10] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-13 09:19:10] [INFO ] Implicit Places using invariants in 23 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 09:19:10] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 09:19:10] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Starting structural reductions, iteration 1 : 20/21 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:19:10] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 09:19:10] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : MAPK-PT-01280-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s17 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 63 ms.
Product exploration explored 100000 steps with 50000 reset in 71 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 50000 reset in 76 ms.
Product exploration explored 100000 steps with 50000 reset in 80 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0), true]
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 12 edges and 20 vertex of which 8 / 20 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 16 transition count 27
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 16 transition count 27
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 16 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 12 place count 16 transition count 23
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 12 rules in 6 ms. Remains 16 /20 variables (removed 4) and now considering 23/30 (removed 7) transitions.
[2021-05-13 09:19:10] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 09:19:10] [INFO ] Flow matrix only has 19 transitions (discarded 4 similar events)
// Phase 1: matrix 19 rows 16 cols
[2021-05-13 09:19:10] [INFO ] Computed 5 place invariants in 3 ms
[2021-05-13 09:19:10] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 16/20 places, 23/30 transitions.
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Product exploration explored 100000 steps with 50000 reset in 148 ms.
[2021-05-13 09:19:11] [INFO ] Flatten gal took : 2 ms
[2021-05-13 09:19:11] [INFO ] Flatten gal took : 2 ms
[2021-05-13 09:19:11] [INFO ] Time to serialize gal into /tmp/LTL534455487404117119.gal : 1 ms
[2021-05-13 09:19:11] [INFO ] Time to serialize properties into /tmp/LTL1081553883386087056.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/LTL534455487404117119.gal, -t, CGAL, -LTL, /tmp/LTL1081553883386087056.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/LTL534455487404117119.gal -t CGAL -LTL /tmp/LTL1081553883386087056.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X("(RafP_Phase1<=ERKP_MEKPP)")))
Formula 0 simplified : !X"(RafP_Phase1<=ERKP_MEKPP)"
Detected timeout of ITS tools.
[2021-05-13 09:19:26] [INFO ] Flatten gal took : 16 ms
[2021-05-13 09:19:26] [INFO ] Applying decomposition
[2021-05-13 09:19:26] [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/graph13671016157436918443.txt, -o, /tmp/graph13671016157436918443.bin, -w, /tmp/graph13671016157436918443.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/graph13671016157436918443.bin, -l, -1, -v, -w, /tmp/graph13671016157436918443.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 09:19:26] [INFO ] Decomposing Gal with order
[2021-05-13 09:19:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 09:19:26] [INFO ] Removed a total of 12 redundant transitions.
[2021-05-13 09:19:26] [INFO ] Flatten gal took : 4 ms
[2021-05-13 09:19:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 1 ms.
[2021-05-13 09:19:26] [INFO ] Time to serialize gal into /tmp/LTL9681954476500551972.gal : 1 ms
[2021-05-13 09:19:26] [INFO ] Time to serialize properties into /tmp/LTL1232659270307292960.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/LTL9681954476500551972.gal, -t, CGAL, -LTL, /tmp/LTL1232659270307292960.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/LTL9681954476500551972.gal -t CGAL -LTL /tmp/LTL1232659270307292960.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X("(gu0.RafP_Phase1<=gu0.ERKP_MEKPP)")))
Formula 0 simplified : !X"(gu0.RafP_Phase1<=gu0.ERKP_MEKPP)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2057131732150516013
[2021-05-13 09:19:41] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2057131732150516013
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/ltsmin2057131732150516013]
Compilation finished in 148 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2057131732150516013]
Link finished in 33 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/ltsmin2057131732150516013]
LTSmin run took 261 ms.
FORMULA MAPK-PT-01280-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MAPK-PT-01280-10 finished in 31514 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 21 places. Attempting structural reductions.
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 27
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 4 place count 17 transition count 27
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 13 place count 12 transition count 23
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 15 place count 12 transition count 21
Applied a total of 15 rules in 3 ms. Remains 12 /21 variables (removed 9) and now considering 21/30 (removed 9) transitions.
[2021-05-13 09:19:41] [INFO ] Flow matrix only has 17 transitions (discarded 4 similar events)
// Phase 1: matrix 17 rows 12 cols
[2021-05-13 09:19:41] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-13 09:19:41] [INFO ] Implicit Places using invariants in 8 ms returned []
[2021-05-13 09:19:41] [INFO ] Flow matrix only has 17 transitions (discarded 4 similar events)
// Phase 1: matrix 17 rows 12 cols
[2021-05-13 09:19:41] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 09:19:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2021-05-13 09:19:41] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2021-05-13 09:19:41] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-13 09:19:41] [INFO ] Flow matrix only has 17 transitions (discarded 4 similar events)
// Phase 1: matrix 17 rows 12 cols
[2021-05-13 09:19:41] [INFO ] Computed 4 place invariants in 5 ms
[2021-05-13 09:19:41] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/21 places, 21/30 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : MAPK-PT-01280-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT s10 s8)], 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-01280-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-13 finished in 132 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&G(F((p1 U (p2||G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 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:19:41] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-13 09:19:41] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 09:19:41] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-13 09:19:41] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 21 cols
[2021-05-13 09:19:41] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-13 09:19:41] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : MAPK-PT-01280-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT s8 s14), p2:(AND (OR (GT s1 s5) (GT 2 s1)) (GT 3 s15)), p1:(GT 3 s15)], 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 1 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-01280-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-14 finished in 192 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||X((G(p1) U (p0&&G(p1))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 21/21 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:19:42] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-13 09:19:42] [INFO ] Implicit Places using invariants in 26 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
// Phase 1: matrix 30 rows 20 cols
[2021-05-13 09:19:42] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-13 09:19:42] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 20/21 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:19:42] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-13 09:19:42] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MAPK-PT-01280-15 automaton TGBA [mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={1} source=1 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s7), p1:(LEQ 2 s9)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 176 ms.
Stack based approach found an accepted trace after 82 steps with 0 reset with depth 83 and stack size 81 in 1 ms.
FORMULA MAPK-PT-01280-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-01280-15 finished in 330 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620897583460

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is MAPK-PT-01280, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r121-tall-162075407400756"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;