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-174889279200486.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-10, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r196-tall-174889279200486
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.4M
-rw-r--r-- 1 mcc users 23K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 175K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 90K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 390K 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 16K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 38K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 139K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 316K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 362K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.6M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.0K 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 1.2M 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 1748965065174

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-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-03 15:37:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2025-06-03 15:37:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 15:37:46] [INFO ] Load time of PNML (sax parser for PT used): 250 ms
[2025-06-03 15:37:46] [INFO ] Transformed 316 places.
[2025-06-03 15:37:46] [INFO ] Transformed 1631 transitions.
[2025-06-03 15:37:46] [INFO ] Found NUPN structural information;
[2025-06-03 15:37:46] [INFO ] Parsed PT model containing 316 places and 1631 transitions and 11384 arcs in 363 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 10 places and 0 transitions.
Built sparse matrix representations for Structural reductions in 5 ms.21588KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 306/306 places, 1631/1631 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 311 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 323 ms. Remains : 306/306 places, 1631/1631 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 306/306 places, 1631/1631 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 211 ms. Remains 306 /306 variables (removed 0) and now considering 1631/1631 (removed 0) transitions.
[2025-06-03 15:37:47] [INFO ] Flow matrix only has 642 transitions (discarded 989 similar events)
// Phase 1: matrix 642 rows 306 cols
[2025-06-03 15:37:47] [INFO ] Computed 45 invariants in 39 ms
[2025-06-03 15:37:49] [INFO ] Implicit Places using invariants in 1890 ms returned [266, 267, 268, 269, 270, 271, 272, 273, 274, 275]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1941 ms to find 10 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 1 : 296/306 places, 1631/1631 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 296 transition count 1621
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 286 transition count 1621
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 20 rules in 144 ms. Remains 286 /296 variables (removed 10) and now considering 1621/1631 (removed 10) transitions.
[2025-06-03 15:37:49] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
// Phase 1: matrix 632 rows 286 cols
[2025-06-03 15:37:49] [INFO ] Computed 35 invariants in 11 ms
[2025-06-03 15:37:50] [INFO ] Implicit Places using invariants in 962 ms returned []
[2025-06-03 15:37:50] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2025-06-03 15:37:50] [INFO ] Invariant cache hit.
[2025-06-03 15:37:50] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 15:37:52] [INFO ] Implicit Places using invariants and state equation in 2348 ms returned []
Implicit Place search using SMT with State Equation took 3315 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 286/306 places, 1621/1631 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 5615 ms. Remains : 286/306 places, 1621/1631 transitions.
Random walk for 1250000 steps, including 0 resets, run took 6854 ms (no deadlock found). (steps per millisecond=182 )
Random directed walk for 1250002 steps, including 0 resets, run took 4944 ms (no deadlock found). (steps per millisecond=252 )
[2025-06-03 15:38:04] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2025-06-03 15:38:04] [INFO ] Invariant cache hit.
[2025-06-03 15:38:04] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2025-06-03 15:38:04] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 165 ms returned sat
[2025-06-03 15:38:06] [INFO ] [Real]Absence check using state equation in 1045 ms returned sat
[2025-06-03 15:38:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 15:38:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 13 ms returned sat
[2025-06-03 15:38:06] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 161 ms returned sat
[2025-06-03 15:38:06] [INFO ] [Nat]Absence check using state equation in 394 ms returned sat
[2025-06-03 15:38:06] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 15:38:07] [INFO ] [Nat]Added 111 Read/Feed constraints in 451 ms returned sat
[2025-06-03 15:38:07] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 11 ms to minimize.
[2025-06-03 15:38:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 848 ms
[2025-06-03 15:38:08] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 602 transitions) in 119 ms.
[2025-06-03 15:38:08] [INFO ] Added : 1 causal constraints over 1 iterations in 424 ms. Result :sat
Parikh directed walk for 16400 steps, including 1000 resets, run took 131 ms. (steps per millisecond=125 )
Random directed walk for 500001 steps, including 0 resets, run took 2062 ms (no deadlock found). (steps per millisecond=242 )
Random walk for 500000 steps, including 0 resets, run took 2669 ms (no deadlock found). (steps per millisecond=187 )
Random directed walk for 500002 steps, including 0 resets, run took 2009 ms (no deadlock found). (steps per millisecond=248 )
Random walk for 500000 steps, including 0 resets, run took 2587 ms (no deadlock found). (steps per millisecond=193 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 286/286 places, 1621/1621 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 107 ms. Remains 286 /286 variables (removed 0) and now considering 1621/1621 (removed 0) transitions.
[2025-06-03 15:38:18] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2025-06-03 15:38:18] [INFO ] Invariant cache hit.
[2025-06-03 15:38:19] [INFO ] Implicit Places using invariants in 992 ms returned []
[2025-06-03 15:38:19] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2025-06-03 15:38:19] [INFO ] Invariant cache hit.
[2025-06-03 15:38:19] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 15:38:21] [INFO ] Implicit Places using invariants and state equation in 2486 ms returned []
Implicit Place search using SMT with State Equation took 3481 ms to find 0 implicit places.
[2025-06-03 15:38:21] [INFO ] Redundant transitions in 93 ms returned []
Running 1611 sub problems to find dead transitions.
[2025-06-03 15:38:21] [INFO ] Flow matrix only has 632 transitions (discarded 989 similar events)
[2025-06-03 15:38:21] [INFO ] Invariant cache hit.
[2025-06-03 15:38:21] [INFO ] State equation strengthened by 111 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 286/286 constraints. Problems are: Problem set: 0 solved, 1611 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 14/300 constraints. Problems are: Problem set: 0 solved, 1611 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD635 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD757 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD791 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD924 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD946 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD968 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1090 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 21/321 constraints. Problems are: Problem set: 100 solved, 1511 unsolved
[2025-06-03 15:38:35] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 2 ms to minimize.
[2025-06-03 15:38:35] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 2 ms to minimize.
[2025-06-03 15:38:35] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2025-06-03 15:38:35] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2025-06-03 15:38:35] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2025-06-03 15:38:44] [INFO ] Deduced a trap composed of 49 places in 234 ms of which 3 ms to minimize.
[2025-06-03 15:38:44] [INFO ] Deduced a trap composed of 49 places in 209 ms of which 2 ms to minimize.
[2025-06-03 15:38:44] [INFO ] Deduced a trap composed of 49 places in 209 ms of which 4 ms to minimize.
[2025-06-03 15:38:44] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 2 ms to minimize.
[2025-06-03 15:38:47] [INFO ] Deduced a trap composed of 36 places in 214 ms of which 2 ms to minimize.
[2025-06-03 15:38:47] [INFO ] Deduced a trap composed of 43 places in 212 ms of which 2 ms to minimize.
[2025-06-03 15:38:48] [INFO ] Deduced a trap composed of 44 places in 244 ms of which 2 ms to minimize.
[2025-06-03 15:38:48] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 2 ms to minimize.
[2025-06-03 15:38:49] [INFO ] Deduced a trap composed of 68 places in 148 ms of which 2 ms to minimize.
[2025-06-03 15:38:49] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 1 ms to minimize.
[2025-06-03 15:38:49] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 1 ms to minimize.
[2025-06-03 15:38:49] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 17/338 constraints. Problems are: Problem set: 100 solved, 1511 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 286/918 variables, and 338 constraints, problems are : Problem set: 100 solved, 1511 unsolved in 30047 ms.
Refiners :[Domain max(s): 286/286 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 1611/1611 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 100 solved, 1511 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 286/286 constraints. Problems are: Problem set: 100 solved, 1511 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 14/300 constraints. Problems are: Problem set: 100 solved, 1511 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 21/321 constraints. Problems are: Problem set: 100 solved, 1511 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 17/338 constraints. Problems are: Problem set: 100 solved, 1511 unsolved
[2025-06-03 15:39:09] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 2 ms to minimize.
[2025-06-03 15:39:11] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 2 ms to minimize.
[2025-06-03 15:39:22] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 1 ms to minimize.
[2025-06-03 15:39:23] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 1 ms to minimize.
[2025-06-03 15:39:23] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 2 ms to minimize.
[2025-06-03 15:39:23] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 2 ms to minimize.
[2025-06-03 15:39:25] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 2 ms to minimize.
[2025-06-03 15:39:25] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 1 ms to minimize.
[2025-06-03 15:39:25] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 2 ms to minimize.
[2025-06-03 15:39:26] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 286/918 variables, and 348 constraints, problems are : Problem set: 100 solved, 1511 unsolved in 30042 ms.
Refiners :[Domain max(s): 286/286 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/286 constraints, ReadFeed: 0/111 constraints, PredecessorRefiner: 0/1611 constraints, Known Traps: 27/27 constraints]
After SMT, in 64306ms problems are : Problem set: 100 solved, 1511 unsolved
Search for dead transitions found 100 dead transitions in 64337ms
Found 100 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 100 transitions
Dead transitions reduction (with SMT) removed 100 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 286/286 places, 1521/1621 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 99 ms. Remains 286 /286 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2025-06-03 15:39:26] [INFO ] Redundant transitions in 27 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 68188 ms. Remains : 286/286 places, 1521/1621 transitions.
Random walk for 1250000 steps, including 0 resets, run took 6093 ms (no deadlock found). (steps per millisecond=205 )
Random directed walk for 1250010 steps, including 0 resets, run took 4494 ms (no deadlock found). (steps per millisecond=278 )
[2025-06-03 15:39:36] [INFO ] Flow matrix only has 632 transitions (discarded 889 similar events)
// Phase 1: matrix 632 rows 286 cols
[2025-06-03 15:39:36] [INFO ] Computed 35 invariants in 13 ms
[2025-06-03 15:39:37] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned sat
[2025-06-03 15:39:39] [INFO ] [Real]Absence check using 14 positive and 21 generalized place invariants in 2260 ms returned sat
[2025-06-03 15:39:39] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2025-06-03 15:39:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 15:39:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2025-06-03 15:39:40] [INFO ] [Nat]Absence check using 14 positive and 21 generalized place invariants in 108 ms returned sat
[2025-06-03 15:39:40] [INFO ] [Nat]Absence check using state equation in 491 ms returned sat
[2025-06-03 15:39:40] [INFO ] State equation strengthened by 111 read => feed constraints.
[2025-06-03 15:39:40] [INFO ] [Nat]Added 111 Read/Feed constraints in 93 ms returned sat
[2025-06-03 15:39:40] [INFO ] Deduced a trap composed of 49 places in 91 ms of which 1 ms to minimize.
[2025-06-03 15:39:40] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
[2025-06-03 15:39:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 877 ms
[2025-06-03 15:39:41] [INFO ] Computed and/alt/rep : 20/30/20 causal constraints (skipped 602 transitions) in 78 ms.
[2025-06-03 15:39:41] [INFO ] Added : 0 causal constraints over 0 iterations in 151 ms. Result :sat
Parikh directed walk for 12000 steps, including 1000 resets, run took 76 ms. (steps per millisecond=157 )
Random directed walk for 500008 steps, including 0 resets, run took 1784 ms (no deadlock found). (steps per millisecond=280 )
Random walk for 500000 steps, including 0 resets, run took 2442 ms (no deadlock found). (steps per millisecond=204 )
Random directed walk for 500002 steps, including 0 resets, run took 1783 ms (no deadlock found). (steps per millisecond=280 )
Random walk for 500000 steps, including 0 resets, run took 2430 ms (no deadlock found). (steps per millisecond=205 )
[2025-06-03 15:39:50] [INFO ] Flatten gal took : 240 ms
[2025-06-03 15:39:50] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityDeadlock.sr.xml took 1 ms.
[2025-06-03 15:39:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 306 places, 1631 transitions and 11204 arcs took 13 ms.
Total runtime 124565 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SafeBus-PT-10

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/408/model (.net / .def) ...
EXPORT TIME: [User 0.006s, 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: 651
MODEL NAME: /home/mcc/execution/408/model
306 places, 1631 transitions.

No place bound informations found.
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..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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-10"
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-10, 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-174889279200486"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-PT-10.tgz
mv SafeBus-PT-10 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 ;