Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r223-tall-171649611600506.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is MAPKbis-PT-5320, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649611600506
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 18:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Apr 11 18:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 11 17:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 11 17:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 170K May 18 16:42 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 MAPKbis-PT-5320-CTLFireability-2024-00
FORMULA_NAME MAPKbis-PT-5320-CTLFireability-2024-01
FORMULA_NAME MAPKbis-PT-5320-CTLFireability-2024-02
FORMULA_NAME MAPKbis-PT-5320-CTLFireability-2024-03
FORMULA_NAME MAPKbis-PT-5320-CTLFireability-2024-04
FORMULA_NAME MAPKbis-PT-5320-CTLFireability-2024-05
FORMULA_NAME MAPKbis-PT-5320-CTLFireability-2024-06
FORMULA_NAME MAPKbis-PT-5320-CTLFireability-2024-07
FORMULA_NAME MAPKbis-PT-5320-CTLFireability-2024-08
FORMULA_NAME MAPKbis-PT-5320-CTLFireability-2024-09
FORMULA_NAME MAPKbis-PT-5320-CTLFireability-2024-10
FORMULA_NAME MAPKbis-PT-5320-CTLFireability-2024-11
FORMULA_NAME MAPKbis-PT-5320-CTLFireability-2023-12
FORMULA_NAME MAPKbis-PT-5320-CTLFireability-2023-13
FORMULA_NAME MAPKbis-PT-5320-CTLFireability-2023-14
FORMULA_NAME MAPKbis-PT-5320-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716566207008

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MAPKbis-PT-5320
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 15:56:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 15:56:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 15:56:48] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-05-24 15:56:48] [INFO ] Transformed 106 places.
[2024-05-24 15:56:48] [INFO ] Transformed 173 transitions.
[2024-05-24 15:56:48] [INFO ] Found NUPN structural information;
[2024-05-24 15:56:48] [INFO ] Parsed PT model containing 106 places and 173 transitions and 986 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 33 places and 106 transitions.
Reduce places removed 25 places and 0 transitions.
FORMULA MAPKbis-PT-5320-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPKbis-PT-5320-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPKbis-PT-5320-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPKbis-PT-5320-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 67/67 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 48 transition count 65
Applied a total of 2 rules in 17 ms. Remains 48 /48 variables (removed 0) and now considering 65/67 (removed 2) transitions.
[2024-05-24 15:56:48] [INFO ] Flow matrix only has 47 transitions (discarded 18 similar events)
// Phase 1: matrix 47 rows 48 cols
[2024-05-24 15:56:48] [INFO ] Computed 24 invariants in 7 ms
[2024-05-24 15:56:48] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-24 15:56:48] [INFO ] Flow matrix only has 47 transitions (discarded 18 similar events)
[2024-05-24 15:56:48] [INFO ] Invariant cache hit.
[2024-05-24 15:56:48] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-24 15:56:48] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-24 15:56:48] [INFO ] Flow matrix only has 47 transitions (discarded 18 similar events)
[2024-05-24 15:56:48] [INFO ] Invariant cache hit.
[2024-05-24 15:56:48] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 24/72 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-24 15:56:49] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 7 ms to minimize.
Problem TDEAD48 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 1/73 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/73 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 47/95 variables, 48/121 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 23/144 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/95 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/95 variables, and 144 constraints, problems are : Problem set: 1 solved, 63 unsolved in 970 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 48/48 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 24/72 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 1/73 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/73 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 47/95 variables, 48/121 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 23/144 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 63/207 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/207 constraints. Problems are: Problem set: 1 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/95 variables, 0/207 constraints. Problems are: Problem set: 1 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/95 variables, and 207 constraints, problems are : Problem set: 1 solved, 63 unsolved in 650 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 48/48 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 63/64 constraints, Known Traps: 1/1 constraints]
After SMT, in 1679ms problems are : Problem set: 1 solved, 63 unsolved
Search for dead transitions found 1 dead transitions in 1693ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 48/48 places, 64/67 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2038 ms. Remains : 48/48 places, 64/67 transitions.
Support contains 34 out of 48 places after structural reductions.
[2024-05-24 15:56:50] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-24 15:56:50] [INFO ] Flatten gal took : 24 ms
[2024-05-24 15:56:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MAPKbis-PT-5320-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPKbis-PT-5320-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPKbis-PT-5320-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPKbis-PT-5320-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 15:56:50] [INFO ] Flatten gal took : 9 ms
[2024-05-24 15:56:50] [INFO ] Input system was already deterministic with 64 transitions.
Support contains 31 out of 48 places (down from 34) after GAL structural reductions.
RANDOM walk for 40000 steps (1197 resets) in 732 ms. (54 steps per ms) remains 1/19 properties
BEST_FIRST walk for 40004 steps (284 resets) in 233 ms. (170 steps per ms) remains 1/1 properties
[2024-05-24 15:56:51] [INFO ] Flow matrix only has 46 transitions (discarded 18 similar events)
// Phase 1: matrix 46 rows 48 cols
[2024-05-24 15:56:51] [INFO ] Computed 24 invariants in 2 ms
[2024-05-24 15:56:51] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 3/6 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/11 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/18 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/18 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 20/38 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/38 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/38 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/38 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 9/47 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/47 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 27/74 variables, 18/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/74 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/74 variables, 9/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/74 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/78 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/78 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 12/90 variables, 8/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/90 variables, 8/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/90 variables, 4/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/90 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1/91 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/91 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 3/94 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/94 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/94 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/94 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/94 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 94/94 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 80 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 48/48 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 3/6 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/11 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/11 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/18 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/18 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 20/38 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/38 variables, 14/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/38 variables, 7/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/38 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 9/47 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/47 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 27/74 variables, 18/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/74 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/74 variables, 9/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/74 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/78 variables, 5/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/78 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 12/90 variables, 8/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/90 variables, 8/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/90 variables, 4/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/90 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 1/91 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/91 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 3/94 variables, 2/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/94 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/94 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/94 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/94 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/94 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 94/94 variables, and 144 constraints, problems are : Problem set: 0 solved, 1 unsolved in 74 ms.
Refiners :[Domain max(s): 48/48 constraints, Positive P Invariants (semi-flows): 24/24 constraints, State Equation: 48/48 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 168ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 64/64 transitions.
Graph (complete) has 123 edges and 48 vertex of which 26 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 26 transition count 34
Applied a total of 19 rules in 11 ms. Remains 26 /48 variables (removed 22) and now considering 34/64 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 26/48 places, 34/64 transitions.
RANDOM walk for 40000 steps (2059 resets) in 552 ms. (72 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (901 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
Probably explored full state space saw : 3969 states, properties seen :0
Probabilistic random walk after 27458 steps, saw 3969 distinct states, run finished after 47 ms. (steps per millisecond=584 ) properties seen :0
Explored full state space saw : 3969 states, properties seen :0
Exhaustive walk after 27458 steps, saw 3969 distinct states, run finished after 19 ms. (steps per millisecond=1445 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
FORMULA MAPKbis-PT-5320-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 15:56:51] [INFO ] Flatten gal took : 5 ms
[2024-05-24 15:56:51] [INFO ] Flatten gal took : 5 ms
[2024-05-24 15:56:51] [INFO ] Input system was already deterministic with 64 transitions.
Computed a total of 4 stabilizing places and 2 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 48/48 places, 64/64 transitions.
[2024-05-24 15:56:51] [INFO ] Flatten gal took : 4 ms
[2024-05-24 15:56:51] [INFO ] Flatten gal took : 4 ms
[2024-05-24 15:56:51] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 48/48 places, 64/64 transitions.
[2024-05-24 15:56:51] [INFO ] Flatten gal took : 3 ms
[2024-05-24 15:56:51] [INFO ] Flatten gal took : 4 ms
[2024-05-24 15:56:51] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 48/48 places, 64/64 transitions.
[2024-05-24 15:56:51] [INFO ] Flatten gal took : 4 ms
[2024-05-24 15:56:51] [INFO ] Flatten gal took : 4 ms
[2024-05-24 15:56:51] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 48/48 places, 64/64 transitions.
[2024-05-24 15:56:51] [INFO ] Flatten gal took : 3 ms
[2024-05-24 15:56:51] [INFO ] Flatten gal took : 4 ms
[2024-05-24 15:56:51] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 48/48 places, 64/64 transitions.
[2024-05-24 15:56:51] [INFO ] Flatten gal took : 4 ms
[2024-05-24 15:56:51] [INFO ] Flatten gal took : 4 ms
[2024-05-24 15:56:51] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 48/48 places, 64/64 transitions.
[2024-05-24 15:56:51] [INFO ] Flatten gal took : 4 ms
[2024-05-24 15:56:51] [INFO ] Flatten gal took : 4 ms
[2024-05-24 15:56:51] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 48/48 places, 64/64 transitions.
[2024-05-24 15:56:51] [INFO ] Flatten gal took : 5 ms
[2024-05-24 15:56:51] [INFO ] Flatten gal took : 4 ms
[2024-05-24 15:56:51] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-24 15:56:51] [INFO ] Flatten gal took : 4 ms
[2024-05-24 15:56:51] [INFO ] Flatten gal took : 3 ms
[2024-05-24 15:56:51] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-05-24 15:56:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 48 places, 64 transitions and 318 arcs took 1 ms.
Total runtime 3777 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MAPKbis-PT-5320

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/406/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 48
TRANSITIONS: 64
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.001s]


SAVING FILE /home/mcc/execution/406/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 536
MODEL NAME: /home/mcc/execution/406/model
48 places, 64 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA MAPKbis-PT-5320-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MAPKbis-PT-5320-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MAPKbis-PT-5320-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MAPKbis-PT-5320-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MAPKbis-PT-5320-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MAPKbis-PT-5320-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MAPKbis-PT-5320-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716566212719

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML

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="MAPKbis-PT-5320"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is MAPKbis-PT-5320, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r223-tall-171649611600506"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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