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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 42K 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 Liveness

=== Now, execution of the tool begins

BK_START 1748962975162

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SafeBus-COL-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-03 15:02:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-03 15:02:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 15:02:56] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-03 15:02:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-03 15:02:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 560 ms
[2025-06-03 15:02:57] [INFO ] Detected 1 constant HL places corresponding to 3 PT places.
[2025-06-03 15:02:57] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 60 PT places and 214.0 transition bindings in 21 ms.
[2025-06-03 15:02:57] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 16 ms.
[2025-06-03 15:02:57] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2025-06-03 15:02:57] [INFO ] Unfolded HLPN to a Petri net with 60 places and 97 transitions 556 arcs in 16 ms.
[2025-06-03 15:02:57] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2025-06-03 15:02:57] [INFO ] Unfolded HLPN to a Petri net with 60 places and 97 transitions 556 arcs in 3 ms.
[2025-06-03 15:02:57] [INFO ] Unfolded 14 HLPN properties in 0 ms.
[2025-06-03 15:02:57] [INFO ] Reduced 3 identical enabling conditions.
[2025-06-03 15:02:57] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 1 ms.
[2025-06-03 15:02:57] [INFO ] Skeletonized 14 HLPN properties in 1 ms.
Reduce places removed 3 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Prefix of Interest using HLPN skeleton for deadlock discarded 0 places and 0 transitions.
Domain [It(3), It(3)] of place AMC breaks symmetries in sort It
[2025-06-03 15:02:57] [INFO ] Unfolded HLPN to a Petri net with 60 places and 97 transitions 556 arcs in 8 ms.
[2025-06-03 15:02:57] [INFO ] Unfolded 14 HLPN properties in 0 ms.
[2025-06-03 15:02:57] [INFO ] Reduced 3 identical enabling conditions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 6 transitions.
Built sparse matrix representations for Structural reductions in 1 ms.29784KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 54/54 places, 91/91 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 51 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 63 ms. Remains : 54/54 places, 91/91 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 54/54 places, 91/91 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 12 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2025-06-03 15:02:57] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2025-06-03 15:02:57] [INFO ] Computed 17 invariants in 9 ms
[2025-06-03 15:02:57] [INFO ] Implicit Places using invariants in 206 ms returned []
[2025-06-03 15:02:57] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2025-06-03 15:02:57] [INFO ] Invariant cache hit.
[2025-06-03 15:02:57] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-03 15:02:57] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2025-06-03 15:02:57] [INFO ] Redundant transitions in 2 ms returned []
Running 88 sub problems to find dead transitions.
[2025-06-03 15:02:57] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2025-06-03 15:02:57] [INFO ] Invariant cache hit.
[2025-06-03 15:02:57] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD33 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 10/17 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2025-06-03 15:02:58] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 11 ms to minimize.
[2025-06-03 15:02:58] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2025-06-03 15:02:58] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2025-06-03 15:02:58] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2025-06-03 15:02:58] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2025-06-03 15:02:58] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2025-06-03 15:02:58] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2025-06-03 15:02:58] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2025-06-03 15:02:58] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2025-06-03 15:02:58] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2025-06-03 15:02:58] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2025-06-03 15:02:58] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 12/29 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2025-06-03 15:02:58] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2025-06-03 15:02:59] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 2/31 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/31 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/122 variables, 54/85 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 13/98 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/98 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/98 constraints. Problems are: Problem set: 9 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 98 constraints, problems are : Problem set: 9 solved, 79 unsolved in 2206 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 9 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 7/7 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 10/17 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 14/31 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2025-06-03 15:03:00] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/32 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/32 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/122 variables, 54/86 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 13/99 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 79/178 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2025-06-03 15:03:00] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 1/179 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/179 constraints. Problems are: Problem set: 9 solved, 79 unsolved
[2025-06-03 15:03:01] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/122 variables, 1/180 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/122 variables, 0/180 constraints. Problems are: Problem set: 9 solved, 79 unsolved
At refinement iteration 12 (OVERLAPS) 0/122 variables, 0/180 constraints. Problems are: Problem set: 9 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 180 constraints, problems are : Problem set: 9 solved, 79 unsolved in 3172 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/88 constraints, Known Traps: 17/17 constraints]
After SMT, in 5469ms problems are : Problem set: 9 solved, 79 unsolved
Search for dead transitions found 9 dead transitions in 5478ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 54/54 places, 82/91 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 4 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-06-03 15:03:03] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 5913 ms. Remains : 54/54 places, 82/91 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1369 ms (no deadlock found). (steps per millisecond=913 )
Random directed walk for 1250003 steps, including 0 resets, run took 955 ms (no deadlock found). (steps per millisecond=1308 )
[2025-06-03 15:03:05] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2025-06-03 15:03:05] [INFO ] Invariant cache hit.
[2025-06-03 15:03:05] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2025-06-03 15:03:05] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 15 ms returned sat
[2025-06-03 15:03:05] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-03 15:03:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 15:03:05] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-03 15:03:05] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 3 ms returned sat
[2025-06-03 15:03:05] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-03 15:03:05] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-03 15:03:05] [INFO ] [Nat]Added 13 Read/Feed constraints in 4 ms returned sat
[2025-06-03 15:03:05] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 5 ms to minimize.
[2025-06-03 15:03:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2025-06-03 15:03:05] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 6 ms.
[2025-06-03 15:03:05] [INFO ] Added : 39 causal constraints over 8 iterations in 106 ms. Result :sat
Parikh directed walk for 12100 steps, including 803 resets, run took 28 ms. (steps per millisecond=432 )
Random directed walk for 500001 steps, including 0 resets, run took 374 ms (no deadlock found). (steps per millisecond=1336 )
Random walk for 500000 steps, including 0 resets, run took 487 ms (no deadlock found). (steps per millisecond=1026 )
Random directed walk for 500001 steps, including 0 resets, run took 368 ms (no deadlock found). (steps per millisecond=1358 )
Random walk for 500000 steps, including 0 resets, run took 485 ms (no deadlock found). (steps per millisecond=1030 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 54/54 places, 82/82 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 5 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2025-06-03 15:03:07] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2025-06-03 15:03:07] [INFO ] Invariant cache hit.
[2025-06-03 15:03:07] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-03 15:03:07] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2025-06-03 15:03:07] [INFO ] Invariant cache hit.
[2025-06-03 15:03:07] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-03 15:03:07] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2025-06-03 15:03:07] [INFO ] Redundant transitions in 3 ms returned []
Running 79 sub problems to find dead transitions.
[2025-06-03 15:03:07] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2025-06-03 15:03:07] [INFO ] Invariant cache hit.
[2025-06-03 15:03:07] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2025-06-03 15:03:07] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2025-06-03 15:03:07] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2025-06-03 15:03:07] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2025-06-03 15:03:08] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-06-03 15:03:08] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2025-06-03 15:03:08] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2025-06-03 15:03:08] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2025-06-03 15:03:08] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2025-06-03 15:03:08] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2025-06-03 15:03:08] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2025-06-03 15:03:08] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2025-06-03 15:03:08] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/122 variables, 54/83 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 13/96 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 96 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1593 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 10/17 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2025-06-03 15:03:09] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2025-06-03 15:03:09] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 68/122 variables, 54/85 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 13/98 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 79/177 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 177 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1584 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 14/14 constraints]
After SMT, in 3210ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 3211ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 3317 ms. Remains : 54/54 places, 82/82 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1220 ms (no deadlock found). (steps per millisecond=1024 )
Random directed walk for 1250000 steps, including 0 resets, run took 933 ms (no deadlock found). (steps per millisecond=1339 )
[2025-06-03 15:03:13] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2025-06-03 15:03:13] [INFO ] Invariant cache hit.
[2025-06-03 15:03:13] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-03 15:03:13] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 6 ms returned sat
[2025-06-03 15:03:13] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-03 15:03:13] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 15:03:13] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2025-06-03 15:03:13] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 4 ms returned sat
[2025-06-03 15:03:13] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-03 15:03:13] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-03 15:03:13] [INFO ] [Nat]Added 13 Read/Feed constraints in 5 ms returned sat
[2025-06-03 15:03:13] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2025-06-03 15:03:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2025-06-03 15:03:13] [INFO ] Computed and/alt/rep : 52/309/52 causal constraints (skipped 13 transitions) in 5 ms.
[2025-06-03 15:03:13] [INFO ] Added : 39 causal constraints over 8 iterations in 70 ms. Result :sat
Parikh directed walk for 12100 steps, including 798 resets, run took 29 ms. (steps per millisecond=417 )
Random directed walk for 500002 steps, including 0 resets, run took 397 ms (no deadlock found). (steps per millisecond=1259 )
Random walk for 500000 steps, including 0 resets, run took 493 ms (no deadlock found). (steps per millisecond=1014 )
Random directed walk for 500000 steps, including 0 resets, run took 361 ms (no deadlock found). (steps per millisecond=1385 )
Random walk for 500000 steps, including 0 resets, run took 487 ms (no deadlock found). (steps per millisecond=1026 )
[2025-06-03 15:03:15] [INFO ] Flatten gal took : 39 ms
[2025-06-03 15:03:15] [INFO ] Unfolded HLPN to a Petri net with 60 places and 97 transitions 556 arcs in 3 ms.
[2025-06-03 15:03:15] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
[2025-06-03 15:03:15] [INFO ] Reduced 3 identical enabling conditions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 6 transitions.
RANDOM walk for 331 steps (0 resets) in 18 ms. (17 steps per ms) remains 0/13 properties
Able to resolve query QuasiLiveness after proving 14 properties.
Net is quasi-live, checking if it is reversible to establish liveness.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 6 transitions.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 6 transitions.
Unable to solve all queries for examination Liveness. Remains :14 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 14 properties from file /home/mcc/execution/Liveness.xml in 0 ms.
Working with output stream class java.io.PrintStream
Total runtime 18840 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SafeBus-COL-03

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 20
TRANSITIONS: 14
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 2
COLOR VARS: 5
ARCS: 68
LOADING TIME: 0.136

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 60
TRANSITIONS: 97
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 568
UNFOLDING TIME: 0.119

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.019
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 0.423
OK.
----------------------------------------------------------------------
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: 674
MODEL NAME: /home/mcc/execution/model
60 places, 97 transitions.

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.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Liveness TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1748962996292

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -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-COL-03"
export BK_EXAMINATION="Liveness"
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-COL-03, examination is Liveness"
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-174889279200444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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