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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 8.7K Apr 12 14:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 12 14:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 12 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 14:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 12 14:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 14:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 12 14:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 42K May 18 16:43 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 1716816525243

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SafeBus-COL-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 13:28:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-27 13:28:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 13:28:46] [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.
[2024-05-27 13:28:46] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 13:28:46] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 550 ms
[2024-05-27 13:28:46] [INFO ] Detected 1 constant HL places corresponding to 6 PT places.
[2024-05-27 13:28:47] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 150 PT places and 2029.0 transition bindings in 21 ms.
[2024-05-27 13:28:47] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 4 ms.
[2024-05-27 13:28:47] [INFO ] Skeletonized 0 HLPN properties in 0 ms.
[2024-05-27 13:28:47] [INFO ] Unfolded HLPN to a Petri net with 150 places and 463 transitions 2962 arcs in 29 ms.
[2024-05-27 13:28:47] [INFO ] Unfolded 0 HLPN properties in 0 ms.
[2024-05-27 13:28:47] [INFO ] Unfolded HLPN to a Petri net with 150 places and 463 transitions 2962 arcs in 9 ms.
[2024-05-27 13:28:47] [INFO ] Unfolded 14 HLPN properties in 0 ms.
[2024-05-27 13:28:47] [INFO ] Reduced 24 identical enabling conditions.
[2024-05-27 13:28:47] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 0 ms.
[2024-05-27 13:28:47] [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(6), It(6)] of place AMC breaks symmetries in sort It
[2024-05-27 13:28:47] [INFO ] Unfolded HLPN to a Petri net with 150 places and 463 transitions 2962 arcs in 11 ms.
[2024-05-27 13:28:47] [INFO ] Unfolded 14 HLPN properties in 0 ms.
[2024-05-27 13:28:47] [INFO ] Reduced 24 identical enabling conditions.
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 12 places and 12 transitions.
Built sparse matrix representations for Structural reductions in 2 ms.22799KB 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 51 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 61 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 30 ms. Remains 138 /138 variables (removed 0) and now considering 451/451 (removed 0) transitions.
[2024-05-27 13:28:47] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
// Phase 1: matrix 242 rows 138 cols
[2024-05-27 13:28:47] [INFO ] Computed 29 invariants in 25 ms
[2024-05-27 13:28:47] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-27 13:28:47] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-05-27 13:28:47] [INFO ] Invariant cache hit.
[2024-05-27 13:28:47] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 13:28:47] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2024-05-27 13:28:47] [INFO ] Redundant transitions in 25 ms returned []
Running 445 sub problems to find dead transitions.
[2024-05-27 13:28:47] [INFO ] Flow matrix only has 242 transitions (discarded 209 similar events)
[2024-05-27 13:28:47] [INFO ] Invariant cache hit.
[2024-05-27 13:28:47] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 445 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 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 13:28:49] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 13 ms to minimize.
[2024-05-27 13:28:49] [INFO ] Deduced a trap composed of 27 places in 93 ms of which 1 ms to minimize.
[2024-05-27 13:28:50] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
[2024-05-27 13:28:50] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-27 13:28:51] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-05-27 13:28:51] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-05-27 13:28:51] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 2 ms to minimize.
[2024-05-27 13:28:51] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-27 13:28:51] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-27 13:28:51] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 2 ms to minimize.
[2024-05-27 13:28:51] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 11 ms to minimize.
[2024-05-27 13:28:51] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-27 13:28:51] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-27 13:28:51] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-05-27 13:28:52] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-05-27 13:28:52] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-05-27 13:28:52] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-27 13:28:52] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-27 13:28:52] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-27 13:28:52] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 20/49 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 13:28:54] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 1 ms to minimize.
[2024-05-27 13:28:54] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-05-27 13:28:54] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 1 ms to minimize.
[2024-05-27 13:28:54] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-05-27 13:28:54] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-27 13:28:54] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-27 13:28:54] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-27 13:28:54] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2024-05-27 13:28:54] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 9/58 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 13:28:56] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/59 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 13:28:58] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-05-27 13:28:58] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 2/61 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 13:29:00] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/62 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 13:29:01] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2024-05-27 13:29:01] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 2 ms to minimize.
[2024-05-27 13:29:01] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 0 ms to minimize.
[2024-05-27 13:29:01] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-27 13:29:01] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-27 13:29:01] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 6/68 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 13:29:04] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-27 13:29:04] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2024-05-27 13:29:04] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 3/71 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 13:29:06] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 1/72 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/72 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 11 (OVERLAPS) 242/380 variables, 138/210 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 43/253 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/253 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 14 (OVERLAPS) 0/380 variables, 0/253 constraints. Problems are: Problem set: 36 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 253 constraints, problems are : Problem set: 36 solved, 409 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 36 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 43/72 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/72 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/380 variables, 138/210 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 43/253 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 409/662 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 13:29:25] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-27 13:29:25] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 1 ms to minimize.
[2024-05-27 13:29:30] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-27 13:29:30] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-05-27 13:29:30] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 5/667 constraints. Problems are: Problem set: 36 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/667 constraints. Problems are: Problem set: 36 solved, 409 unsolved
[2024-05-27 13:29:48] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
SMT process timed out in 60686ms, After SMT, problems are : Problem set: 36 solved, 409 unsolved
Search for dead transitions found 36 dead transitions in 60703ms
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 : 138/138 places, 415/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 14 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 13:29:48] [INFO ] Redundant transitions in 6 ms returned []
Finished structural reductions in DEADLOCK mode , in 2 iterations and 61155 ms. Remains : 138/138 places, 415/451 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2608 ms (no deadlock found). (steps per millisecond=479 )
Random directed walk for 1250000 steps, including 0 resets, run took 1879 ms (no deadlock found). (steps per millisecond=665 )
[2024-05-27 13:29:52] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 13:29:52] [INFO ] Invariant cache hit.
[2024-05-27 13:29:52] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-27 13:29:52] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 27 ms returned sat
[2024-05-27 13:29:53] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-27 13:29:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 13:29:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-27 13:29:53] [INFO ] [Nat]Absence check using 13 positive and 16 generalized place invariants in 11 ms returned sat
[2024-05-27 13:29:53] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-27 13:29:53] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 13:29:53] [INFO ] [Nat]Added 43 Read/Feed constraints in 23 ms returned sat
[2024-05-27 13:29:53] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-27 13:29:53] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-27 13:29:53] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-05-27 13:29:53] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-27 13:29:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 259 ms
[2024-05-27 13:29:53] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 23 ms.
[2024-05-27 13:29:53] [INFO ] Added : 4 causal constraints over 1 iterations in 64 ms. Result :sat
Parikh directed walk for 10400 steps, including 989 resets, run took 58 ms. (steps per millisecond=179 )
Random directed walk for 500000 steps, including 0 resets, run took 747 ms (no deadlock found). (steps per millisecond=669 )
Random walk for 500000 steps, including 0 resets, run took 967 ms (no deadlock found). (steps per millisecond=517 )
Random directed walk for 500002 steps, including 0 resets, run took 732 ms (no deadlock found). (steps per millisecond=683 )
Random walk for 500000 steps, including 0 resets, run took 980 ms (no deadlock found). (steps per millisecond=510 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 138/138 places, 415/415 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 23 ms. Remains 138 /138 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2024-05-27 13:29:57] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 13:29:57] [INFO ] Invariant cache hit.
[2024-05-27 13:29:57] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-27 13:29:57] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 13:29:57] [INFO ] Invariant cache hit.
[2024-05-27 13:29:57] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 13:29:57] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2024-05-27 13:29:57] [INFO ] Redundant transitions in 2 ms returned []
Running 409 sub problems to find dead transitions.
[2024-05-27 13:29:57] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 13:29:57] [INFO ] Invariant cache hit.
[2024-05-27 13:29:57] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 13:29:58] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-27 13:29:58] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-27 13:29:59] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2024-05-27 13:29:59] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 8 ms to minimize.
[2024-05-27 13:29:59] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-27 13:29:59] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 1 ms to minimize.
[2024-05-27 13:29:59] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-27 13:30:00] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
[2024-05-27 13:30:00] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2024-05-27 13:30:00] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-27 13:30:00] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-27 13:30:00] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-27 13:30:00] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-27 13:30:00] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-27 13:30:01] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-27 13:30:01] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 13:30:01] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-27 13:30:01] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-05-27 13:30:01] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2024-05-27 13:30:01] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-05-27 13:30:02] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-27 13:30:02] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-05-27 13:30:03] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-05-27 13:30:03] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-27 13:30:03] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
[2024-05-27 13:30:03] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 10/55 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 13:30:05] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 237 constraints, problems are : Problem set: 0 solved, 409 unsolved in 25368 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 242/380 variables, 138/194 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 43/237 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 409/646 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-05-27 13:30:29] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 1/647 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 647 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 138/138 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 28/28 constraints]
After SMT, in 55760ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 55769ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 55941 ms. Remains : 138/138 places, 415/415 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2408 ms (no deadlock found). (steps per millisecond=519 )
Random directed walk for 1250000 steps, including 0 resets, run took 1837 ms (no deadlock found). (steps per millisecond=680 )
[2024-05-27 13:30:57] [INFO ] Flow matrix only has 242 transitions (discarded 173 similar events)
[2024-05-27 13:30:57] [INFO ] Invariant cache hit.
[2024-05-27 13:30:57] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-27 13:30:57] [INFO ] [Real]Absence check using 13 positive and 16 generalized place invariants in 14 ms returned sat
[2024-05-27 13:30:57] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-27 13:30:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 13:30:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-27 13:30:57] [INFO ] [Nat]Absence check using 13 positive and 16 generalized place invariants in 11 ms returned sat
[2024-05-27 13:30:57] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-27 13:30:57] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-27 13:30:57] [INFO ] [Nat]Added 43 Read/Feed constraints in 21 ms returned sat
[2024-05-27 13:30:57] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-27 13:30:57] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-27 13:30:57] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-27 13:30:57] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2024-05-27 13:30:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 256 ms
[2024-05-27 13:30:57] [INFO ] Computed and/alt/rep : 30/132/30 causal constraints (skipped 206 transitions) in 23 ms.
[2024-05-27 13:30:57] [INFO ] Added : 4 causal constraints over 1 iterations in 61 ms. Result :sat
Parikh directed walk for 10400 steps, including 994 resets, run took 38 ms. (steps per millisecond=273 )
Random directed walk for 500000 steps, including 0 resets, run took 730 ms (no deadlock found). (steps per millisecond=684 )
Random walk for 500000 steps, including 0 resets, run took 957 ms (no deadlock found). (steps per millisecond=522 )
Random directed walk for 500003 steps, including 0 resets, run took 731 ms (no deadlock found). (steps per millisecond=683 )
Random walk for 500000 steps, including 0 resets, run took 961 ms (no deadlock found). (steps per millisecond=520 )
[2024-05-27 13:31:01] [INFO ] Flatten gal took : 92 ms
[2024-05-27 13:31:01] [INFO ] Unfolded HLPN to a Petri net with 150 places and 463 transitions 2962 arcs in 6 ms.
[2024-05-27 13:31:01] [INFO ] Unfolded 14 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
[2024-05-27 13:31:01] [INFO ] Reduced 24 identical enabling conditions.
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 12 places and 12 transitions.
RANDOM walk for 799 steps (0 resets) in 29 ms. (26 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 6 places in 1 ms
Reduce places removed 12 places and 12 transitions.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 12 places and 12 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 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 135282 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SafeBus-COL-06

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.138

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 150
TRANSITIONS: 463
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 3022
UNFOLDING TIME: 0.217

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.036
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 0.546
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: 833
MODEL NAME: /home/mcc/execution/model
150 places, 463 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 Liveness TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716816708839

--------------------
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-06"
export BK_EXAMINATION="Liveness"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is SafeBus-COL-06, 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 r342-tall-171679093200229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-06.tgz
mv SafeBus-COL-06 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;