fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r132-tall-165271821100596
Last Updated
Jun 22, 2022

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
240.655 5576.00 10858.00 281.30 FFFFTFTTFFFFFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 8.4K Apr 29 19:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 29 19:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 29 19:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 19:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 25K May 10 09:34 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-00640-LTLFireability-00
FORMULA_NAME MAPK-PT-00640-LTLFireability-01
FORMULA_NAME MAPK-PT-00640-LTLFireability-02
FORMULA_NAME MAPK-PT-00640-LTLFireability-03
FORMULA_NAME MAPK-PT-00640-LTLFireability-04
FORMULA_NAME MAPK-PT-00640-LTLFireability-05
FORMULA_NAME MAPK-PT-00640-LTLFireability-06
FORMULA_NAME MAPK-PT-00640-LTLFireability-07
FORMULA_NAME MAPK-PT-00640-LTLFireability-08
FORMULA_NAME MAPK-PT-00640-LTLFireability-09
FORMULA_NAME MAPK-PT-00640-LTLFireability-10
FORMULA_NAME MAPK-PT-00640-LTLFireability-11
FORMULA_NAME MAPK-PT-00640-LTLFireability-12
FORMULA_NAME MAPK-PT-00640-LTLFireability-13
FORMULA_NAME MAPK-PT-00640-LTLFireability-14
FORMULA_NAME MAPK-PT-00640-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652813788287

Running Version 202205111006
[2022-05-17 18:56:29] [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]
[2022-05-17 18:56:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 18:56:29] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2022-05-17 18:56:29] [INFO ] Transformed 22 places.
[2022-05-17 18:56:29] [INFO ] Transformed 30 transitions.
[2022-05-17 18:56:29] [INFO ] Parsed PT model containing 22 places and 30 transitions in 143 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA MAPK-PT-00640-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00640-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00640-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00640-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00640-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00640-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 7 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 18:56:29] [INFO ] Computed 7 place invariants in 5 ms
[2022-05-17 18:56:29] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 18:56:29] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 18:56:29] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 18:56:29] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 18:56:29] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 30/30 transitions.
Support contains 14 out of 22 places after structural reductions.
[2022-05-17 18:56:29] [INFO ] Flatten gal took : 19 ms
[2022-05-17 18:56:30] [INFO ] Flatten gal took : 5 ms
[2022-05-17 18:56:30] [INFO ] Input system was already deterministic with 30 transitions.
Incomplete random walk after 10306 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=257 ) properties (out of 12) seen :7
Finished Best-First random walk after 8068 steps, including 2 resets, run visited all 5 properties in 20 ms. (steps per millisecond=403 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U !(X(X(p1))||!p1)))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 18:56:30] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-17 18:56:30] [INFO ] Implicit Places using invariants in 37 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in LTL mode, 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.
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 400 ms :[p1, p1, p1, p1, true, true, p1, p1]
Running random walk in product with property : MAPK-PT-00640-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 6}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=5 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=6 dest: 6}, { cond=(AND p1 p0), acceptance={0} source=6 dest: 7}], [{ cond=p1, acceptance={} source=7 dest: 0}]], initial=5, aps=[p1:(GEQ s17 1), p0:(AND (GEQ s7 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], 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 375 steps with 27 reset in 9 ms.
FORMULA MAPK-PT-00640-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00640-LTLFireability-02 finished in 508 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&F((p1&&X((p1 U (!p2||G(p1))))))))))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-17 18:56:30] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 18:56:30] [INFO ] Implicit Places using invariants in 30 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 425 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : MAPK-PT-00640-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LT s4 1), p0:(AND (GEQ s8 1) (GEQ s14 1)), p2:(AND (GEQ s7 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25035 reset in 194 ms.
Stack based approach found an accepted trace after 33 steps with 8 reset with depth 4 and stack size 4 in 0 ms.
FORMULA MAPK-PT-00640-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-00640-LTLFireability-03 finished in 676 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 19 rules applied. Total rules applied 22 place count 9 transition count 21
Graph (trivial) has 12 edges and 9 vertex of which 2 / 9 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 8 transition count 21
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 26 place count 8 transition count 18
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 8 transition count 14
Applied a total of 30 rules in 14 ms. Remains 8 /22 variables (removed 14) and now considering 14/30 (removed 16) transitions.
[2022-05-17 18:56:31] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 8 cols
[2022-05-17 18:56:31] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 18:56:31] [INFO ] Implicit Places using invariants in 16 ms returned []
[2022-05-17 18:56:31] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 8 cols
[2022-05-17 18:56:31] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 18:56:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 18:56:31] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2022-05-17 18:56:31] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-17 18:56:31] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 8 cols
[2022-05-17 18:56:31] [INFO ] Computed 3 place invariants in 8 ms
[2022-05-17 18:56:31] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/22 places, 14/30 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/22 places, 14/30 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : MAPK-PT-00640-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s5 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 10 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-00640-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00640-LTLFireability-08 finished in 130 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(X(p0))) U (X(p1)||p1)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 18:56:31] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-17 18:56:31] [INFO ] Implicit Places using invariants in 45 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 47 ms to find 2 implicit places.
Starting structural reductions in LTL mode, 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.
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MAPK-PT-00640-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s7 1) (GEQ s13 1)), p0:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2440 reset in 156 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 12 in 1 ms.
FORMULA MAPK-PT-00640-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-00640-LTLFireability-09 finished in 360 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&G((X(p1) U F(p1)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2022-05-17 18:56:32] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 18:56:32] [INFO ] Implicit Places using invariants in 30 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, 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.
Finished structural reductions, in 2 iterations. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : MAPK-PT-00640-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s0 1), p1:(AND (GEQ s6 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 0 ms.
FORMULA MAPK-PT-00640-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00640-LTLFireability-10 finished in 212 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(p0) U p1))&&(p2 U !X(p3)))))'
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-17 18:56:32] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 18:56:32] [INFO ] Implicit Places using invariants in 50 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in LTL mode, 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.
Finished structural reductions, in 2 iterations. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 329 ms :[(OR (NOT p1) p3), (OR (NOT p1) p3), p3, (NOT p0), (NOT p1), (NOT p1), p3, true]
Running random walk in product with property : MAPK-PT-00640-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=true, acceptance={} source=1 dest: 5}, { cond=p2, acceptance={} source=1 dest: 6}], [{ cond=p3, acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) p3), acceptance={0} source=6 dest: 2}, { cond=(AND p2 p3), acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(LT s0 1), p1:(AND (GEQ s6 1) (GEQ s8 1)), p0:(AND (GEQ s7 1) (GEQ s14 1)), p3:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2082 reset in 99 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA MAPK-PT-00640-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-00640-LTLFireability-11 finished in 507 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(F((X(p0)&&p1))))||(G(p0)&&G(!p1))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-17 18:56:32] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 18:56:32] [INFO ] Implicit Places using invariants in 25 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
Starting structural reductions in LTL mode, 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.
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-00640-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(OR p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (LT s6 1) (LT s7 1)), p0:(LT s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 16022 reset in 87 ms.
Stack based approach found an accepted trace after 11 steps with 2 reset with depth 6 and stack size 6 in 0 ms.
FORMULA MAPK-PT-00640-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-00640-LTLFireability-12 finished in 295 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0)&&G(p1)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 11 place count 16 transition count 25
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 16 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 16 transition count 23
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 14 transition count 23
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 14 transition count 23
Applied a total of 16 rules in 8 ms. Remains 14 /22 variables (removed 8) and now considering 23/30 (removed 7) transitions.
[2022-05-17 18:56:33] [INFO ] Flow matrix only has 18 transitions (discarded 5 similar events)
// Phase 1: matrix 18 rows 14 cols
[2022-05-17 18:56:33] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 18:56:33] [INFO ] Implicit Places using invariants in 23 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/22 places, 23/30 transitions.
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 12 transition count 20
Applied a total of 3 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 20/23 (removed 3) transitions.
[2022-05-17 18:56:33] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 12 cols
[2022-05-17 18:56:33] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 18:56:33] [INFO ] Implicit Places using invariants in 15 ms returned []
[2022-05-17 18:56:33] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 12 cols
[2022-05-17 18:56:33] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-17 18:56:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 18:56:33] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/22 places, 20/30 transitions.
Finished structural reductions, in 2 iterations. Remains : 12/22 places, 20/30 transitions.
Stuttering acceptance computed with spot in 32 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : MAPK-PT-00640-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s1 1) (OR (LT s0 1) (LT s9 1))), p1:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-00640-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00640-LTLFireability-13 finished in 125 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2022-05-17 18:56:33] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-17 18:56:33] [INFO ] Implicit Places using invariants in 39 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in LTL mode, 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.
Finished structural reductions, in 2 iterations. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-00640-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1157 reset in 90 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA MAPK-PT-00640-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-00640-LTLFireability-14 finished in 209 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X((G(X(p0))||(F(p1)&&F(p2)))))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 16 transition count 23
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 16 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 16 transition count 22
Applied a total of 16 rules in 6 ms. Remains 16 /22 variables (removed 6) and now considering 22/30 (removed 8) transitions.
[2022-05-17 18:56:33] [INFO ] Flow matrix only has 21 transitions (discarded 1 similar events)
// Phase 1: matrix 21 rows 16 cols
[2022-05-17 18:56:33] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-17 18:56:33] [INFO ] Implicit Places using invariants in 21 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/22 places, 22/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 15/22 places, 22/30 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MAPK-PT-00640-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s13 1)), p1:(OR (LT s6 1) (LT s7 1)), p2:(LT s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 235 ms.
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-00640-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00640-LTLFireability-15 finished in 377 ms.
All properties solved by simple procedures.
Total runtime 4409 ms.

BK_STOP 1652813793863

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-00640"
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-00640, 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 r132-tall-165271821100596"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-00640.tgz
mv MAPK-PT-00640 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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