Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r196-tall-174889279200481.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is SafeBus-PT-06, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r196-tall-174889279200481
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 15K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 203K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 166K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 791K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 303K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1748964996172

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SafeBus-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-03 15:36:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2025-06-03 15:36:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 15:36:37] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2025-06-03 15:36:37] [INFO ] Transformed 144 places.
[2025-06-03 15:36:37] [INFO ] Transformed 451 transitions.
[2025-06-03 15:36:37] [INFO ] Found NUPN structural information;
[2025-06-03 15:36:37] [INFO ] Parsed PT model containing 144 places and 451 transitions and 2968 arcs in 187 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 4 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 6 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 4 ms.20783KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 138/138 places, 451/451 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 68 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 86 ms. Remains : 138/138 places, 451/451 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 138/138 places, 451/451 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 32 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2025-06-03 15:36:37] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2025-06-03 15:36:37] [INFO ] Computed 29 invariants in 23 ms
[2025-06-03 15:36:38] [INFO ] Implicit Places using invariants in 447 ms returned [114, 115, 116, 117, 118, 119]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 475 ms to find 6 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 132/138 places, 451/451 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 132 transition count 445
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 445
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -114
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 120 transition count 559
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 24 rules in 75 ms. Remains 120 /132 variables (removed 12) and now considering 559/451 (removed -108) transitions.
[2025-06-03 15:36:38] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
// Phase 1: matrix 350 rows 120 cols
[2025-06-03 15:36:38] [INFO ] Computed 23 invariants in 5 ms
[2025-06-03 15:36:38] [INFO ] Implicit Places using invariants in 256 ms returned []
[2025-06-03 15:36:38] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
[2025-06-03 15:36:38] [INFO ] Invariant cache hit.
[2025-06-03 15:36:38] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 15:36:39] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 120/138 places, 559/451 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 1364 ms. Remains : 120/138 places, 559/451 transitions.
Random walk for 1250000 steps, including 0 resets, run took 4329 ms (no deadlock found). (steps per millisecond=288 )
Random directed walk for 1250001 steps, including 0 resets, run took 3516 ms (no deadlock found). (steps per millisecond=355 )
[2025-06-03 15:36:46] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
[2025-06-03 15:36:46] [INFO ] Invariant cache hit.
[2025-06-03 15:36:46] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-03 15:36:47] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 152 ms returned sat
[2025-06-03 15:36:47] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2025-06-03 15:36:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 15:36:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2025-06-03 15:36:47] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 37 ms returned sat
[2025-06-03 15:36:47] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2025-06-03 15:36:47] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 15:36:47] [INFO ] [Nat]Added 43 Read/Feed constraints in 46 ms returned sat
[2025-06-03 15:36:47] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 308 transitions) in 54 ms.
[2025-06-03 15:36:47] [INFO ] Added : 3 causal constraints over 2 iterations in 177 ms. Result :sat
Parikh directed walk for 4700 steps, including 712 resets, run took 36 ms. (steps per millisecond=130 )
Random directed walk for 500000 steps, including 0 resets, run took 1349 ms (no deadlock found). (steps per millisecond=370 )
Random walk for 500000 steps, including 0 resets, run took 1621 ms (no deadlock found). (steps per millisecond=308 )
Random directed walk for 500004 steps, including 0 resets, run took 1354 ms (no deadlock found). (steps per millisecond=369 )
Random walk for 500000 steps, including 0 resets, run took 1621 ms (no deadlock found). (steps per millisecond=308 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 120/120 places, 559/559 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 35 ms. Remains 120 /120 variables (removed 0) and now considering 559/559 (removed 0) transitions.
[2025-06-03 15:36:53] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
[2025-06-03 15:36:53] [INFO ] Invariant cache hit.
[2025-06-03 15:36:54] [INFO ] Implicit Places using invariants in 243 ms returned []
[2025-06-03 15:36:54] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
[2025-06-03 15:36:54] [INFO ] Invariant cache hit.
[2025-06-03 15:36:54] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 15:36:54] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
[2025-06-03 15:36:54] [INFO ] Redundant transitions in 34 ms returned []
Running 553 sub problems to find dead transitions.
[2025-06-03 15:36:54] [INFO ] Flow matrix only has 350 transitions (discarded 209 similar events)
[2025-06-03 15:36:54] [INFO ] Invariant cache hit.
[2025-06-03 15:36:54] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 553 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 553 unsolved
Problem TDEAD31 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 15/143 constraints. Problems are: Problem set: 36 solved, 517 unsolved
[2025-06-03 15:36:57] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 9 ms to minimize.
[2025-06-03 15:36:58] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 2 ms to minimize.
[2025-06-03 15:36:59] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 1 ms to minimize.
[2025-06-03 15:36:59] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2025-06-03 15:36:59] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2025-06-03 15:36:59] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2025-06-03 15:36:59] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2025-06-03 15:36:59] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2025-06-03 15:36:59] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2025-06-03 15:36:59] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 1 ms to minimize.
[2025-06-03 15:37:00] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2025-06-03 15:37:00] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2025-06-03 15:37:00] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 1 ms to minimize.
[2025-06-03 15:37:00] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2025-06-03 15:37:00] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2025-06-03 15:37:00] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2025-06-03 15:37:00] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 1 ms to minimize.
[2025-06-03 15:37:00] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 1 ms to minimize.
[2025-06-03 15:37:00] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2025-06-03 15:37:00] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 20/163 constraints. Problems are: Problem set: 36 solved, 517 unsolved
[2025-06-03 15:37:03] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 1 ms to minimize.
[2025-06-03 15:37:03] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2025-06-03 15:37:03] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 3/166 constraints. Problems are: Problem set: 36 solved, 517 unsolved
[2025-06-03 15:37:05] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 1 ms to minimize.
[2025-06-03 15:37:05] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2025-06-03 15:37:05] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2025-06-03 15:37:05] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 4/170 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/170 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 7 (OVERLAPS) 350/470 variables, 120/290 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 43/333 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 0/333 constraints. Problems are: Problem set: 36 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/470 variables, and 333 constraints, problems are : Problem set: 36 solved, 517 unsolved in 30021 ms.
Refiners :[Domain max(s): 120/120 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 553/553 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 36 solved, 517 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 120/120 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 8/128 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 15/143 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 27/170 constraints. Problems are: Problem set: 36 solved, 517 unsolved
[2025-06-03 15:37:28] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 1/171 constraints. Problems are: Problem set: 36 solved, 517 unsolved
[2025-06-03 15:37:33] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 1 ms to minimize.
[2025-06-03 15:37:33] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 2/173 constraints. Problems are: Problem set: 36 solved, 517 unsolved
[2025-06-03 15:37:38] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 1 ms to minimize.
[2025-06-03 15:37:38] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 2/175 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/175 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 8 (OVERLAPS) 350/470 variables, 120/295 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 43/338 constraints. Problems are: Problem set: 36 solved, 517 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 517/855 constraints. Problems are: Problem set: 36 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/470 variables, and 855 constraints, problems are : Problem set: 36 solved, 517 unsolved in 30015 ms.
Refiners :[Domain max(s): 120/120 constraints, Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 120/120 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 517/553 constraints, Known Traps: 32/32 constraints]
After SMT, in 61566ms problems are : Problem set: 36 solved, 517 unsolved
Search for dead transitions found 36 dead transitions in 61582ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 120/120 places, 523/559 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 21 ms. Remains 120 /120 variables (removed 0) and now considering 523/523 (removed 0) transitions.
[2025-06-03 15:37:56] [INFO ] Redundant transitions in 8 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 62467 ms. Remains : 120/120 places, 523/559 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3836 ms (no deadlock found). (steps per millisecond=325 )
Random directed walk for 1250002 steps, including 0 resets, run took 3146 ms (no deadlock found). (steps per millisecond=397 )
[2025-06-03 15:38:03] [INFO ] Flow matrix only has 350 transitions (discarded 173 similar events)
// Phase 1: matrix 350 rows 120 cols
[2025-06-03 15:38:03] [INFO ] Computed 23 invariants in 13 ms
[2025-06-03 15:38:03] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-03 15:38:03] [INFO ] [Real]Absence check using 8 positive and 15 generalized place invariants in 122 ms returned sat
[2025-06-03 15:38:03] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2025-06-03 15:38:03] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 15:38:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2025-06-03 15:38:03] [INFO ] [Nat]Absence check using 8 positive and 15 generalized place invariants in 16 ms returned sat
[2025-06-03 15:38:03] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2025-06-03 15:38:03] [INFO ] State equation strengthened by 43 read => feed constraints.
[2025-06-03 15:38:03] [INFO ] [Nat]Added 43 Read/Feed constraints in 51 ms returned sat
[2025-06-03 15:38:03] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2025-06-03 15:38:03] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2025-06-03 15:38:04] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2025-06-03 15:38:04] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2025-06-03 15:38:04] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2025-06-03 15:38:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 421 ms
[2025-06-03 15:38:04] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 308 transitions) in 43 ms.
[2025-06-03 15:38:04] [INFO ] Added : 4 causal constraints over 2 iterations in 109 ms. Result :sat
Parikh directed walk for 6600 steps, including 539 resets, run took 34 ms. (steps per millisecond=194 )
Random directed walk for 500001 steps, including 0 resets, run took 1280 ms (no deadlock found). (steps per millisecond=390 )
Random walk for 500000 steps, including 0 resets, run took 1523 ms (no deadlock found). (steps per millisecond=328 )
Random directed walk for 500000 steps, including 0 resets, run took 1269 ms (no deadlock found). (steps per millisecond=394 )
Random walk for 500000 steps, including 0 resets, run took 1529 ms (no deadlock found). (steps per millisecond=327 )
[2025-06-03 15:38:10] [INFO ] Flatten gal took : 77 ms
[2025-06-03 15:38:10] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 1 ms.
[2025-06-03 15:38:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 138 places, 451 transitions and 2908 arcs took 6 ms.
Total runtime 92956 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SafeBus-PT-06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/402/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 138
TRANSITIONS: 451
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.014s, Sys 0.000s]


SAVING FILE /home/mcc/execution/402/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 662
MODEL NAME: /home/mcc/execution/402/model
138 places, 451 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
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 ReachabilityDeadlock FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1748965141116

--------------------
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 ReachabilityDeadlock -timeout 180 -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="SafeBus-PT-06"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5832"
echo " Executing tool gold2024"
echo " Input is SafeBus-PT-06, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r196-tall-174889279200481"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-06.tgz
mv SafeBus-PT-06 execution
cd execution
if [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "UpperBounds" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] || [ "ReachabilityDeadlock" = "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 [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.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 '' ReachabilityDeadlock.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityDeadlock" = "ReachabilityDeadlock" ] || [ "ReachabilityDeadlock" = "QuasiLiveness" ] || [ "ReachabilityDeadlock" = "StableMarking" ] || [ "ReachabilityDeadlock" = "Liveness" ] || [ "ReachabilityDeadlock" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityDeadlock"
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 ;