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.r098-smll-174860112400297.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 FlexibleBarrier-PT-12b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-smll-174860112400297
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1000K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 536K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1748688050316

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=FlexibleBarrier-PT-12b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-31 10:40:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-05-31 10:40:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 10:40:53] [INFO ] Load time of PNML (sax parser for PT used): 421 ms
[2025-05-31 10:40:53] [INFO ] Transformed 1988 places.
[2025-05-31 10:40:53] [INFO ] Transformed 2289 transitions.
[2025-05-31 10:40:53] [INFO ] Found NUPN structural information;
[2025-05-31 10:40:53] [INFO ] Parsed PT model containing 1988 places and 2289 transitions and 5727 arcs in 865 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Graph (trivial) has 1950 edges and 1988 vertex of which 74 / 1988 are part of one of the 12 SCC in 17 ms
Free SCC test removed 62 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 501 transitions
Trivial Post-agglo rules discarded 501 transitions
Performed 501 trivial Post agglomeration. Transition count delta: 501
Iterating post reduction 0 with 501 rules applied. Total rules applied 502 place count 1926 transition count 1725
Reduce places removed 501 places and 0 transitions.
Iterating post reduction 1 with 501 rules applied. Total rules applied 1003 place count 1425 transition count 1725
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 132 Pre rules applied. Total rules applied 1003 place count 1425 transition count 1593
Deduced a syphon composed of 132 places in 14 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 264 rules applied. Total rules applied 1267 place count 1293 transition count 1593
Performed 831 Post agglomeration using F-continuation condition.Transition count delta: 831
Deduced a syphon composed of 831 places in 3 ms
Reduce places removed 831 places and 0 transitions.
Iterating global reduction 2 with 1662 rules applied. Total rules applied 2929 place count 462 transition count 762
Applied a total of 2929 rules in 655 ms. Remains 462 /1988 variables (removed 1526) and now considering 762/2289 (removed 1527) transitions.
[2025-05-31 10:40:54] [INFO ] Flow matrix only has 727 transitions (discarded 35 similar events)
// Phase 1: matrix 727 rows 462 cols
[2025-05-31 10:40:54] [INFO ] Computed 14 invariants in 54 ms
[2025-05-31 10:40:55] [INFO ] Implicit Places using invariants in 1278 ms returned []
[2025-05-31 10:40:55] [INFO ] Flow matrix only has 727 transitions (discarded 35 similar events)
[2025-05-31 10:40:55] [INFO ] Invariant cache hit.
[2025-05-31 10:40:56] [INFO ] State equation strengthened by 73 read => feed constraints.
[2025-05-31 10:40:57] [INFO ] Implicit Places using invariants and state equation in 1728 ms returned []
Implicit Place search using SMT with State Equation took 3066 ms to find 0 implicit places.
Running 761 sub problems to find dead transitions.
[2025-05-31 10:40:57] [INFO ] Flow matrix only has 727 transitions (discarded 35 similar events)
[2025-05-31 10:40:57] [INFO ] Invariant cache hit.
[2025-05-31 10:40:57] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/461 variables, 461/461 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/461 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 2 (OVERLAPS) 1/462 variables, 14/475 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 761 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 462/1189 variables, and 476 constraints, problems are : Problem set: 0 solved, 761 unsolved in 30074 ms.
Refiners :[Domain max(s): 462/462 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/462 constraints, ReadFeed: 0/73 constraints, PredecessorRefiner: 761/761 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 761 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/461 variables, 461/461 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/461 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 2 (OVERLAPS) 1/462 variables, 14/475 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 5 (OVERLAPS) 726/1188 variables, 462/938 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1188 variables, 72/1010 constraints. Problems are: Problem set: 0 solved, 761 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1188 variables, 761/1771 constraints. Problems are: Problem set: 0 solved, 761 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1188/1189 variables, and 1771 constraints, problems are : Problem set: 0 solved, 761 unsolved in 30031 ms.
Refiners :[Domain max(s): 462/462 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 462/462 constraints, ReadFeed: 72/73 constraints, PredecessorRefiner: 761/761 constraints, Known Traps: 0/0 constraints]
After SMT, in 62394ms problems are : Problem set: 0 solved, 761 unsolved
Search for dead transitions found 0 dead transitions in 62437ms
Starting structural reductions in LIVENESS mode, iteration 1 : 462/1988 places, 762/2289 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 66206 ms. Remains : 462/1988 places, 762/2289 transitions.
Discarding 435 transitions out of 762. Remains 327
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (2273 resets) in 9726 ms. (4 steps per ms) remains 270/326 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 9 ms. (40 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 5 ms. (67 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 7 ms. (50 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 6 ms. (57 steps per ms) remains 270/270 properties
BEST_FIRST walk for 404 steps (0 resets) in 4 ms. (80 steps per ms) remains 270/270 properties
[2025-05-31 10:42:02] [INFO ] Flow matrix only has 727 transitions (discarded 35 similar events)
[2025-05-31 10:42:02] [INFO ] Invariant cache hit.
[2025-05-31 10:42:02] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 404/404 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s27 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s55 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s83 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s111 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s139 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s167 1.0)
(s169 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s195 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s223 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s251 1.0)
(s253 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 404/1189 variables, and 404 constraints, problems are : Problem set: 0 solved, 270 unsolved in 5017 ms.
Refiners :[Domain max(s): 404/462 constraints, Positive P Invariants (semi-flows): 0/14 constraints, State Equation: 0/462 constraints, ReadFeed: 0/73 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/404 variables, 404/404 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/404 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (OVERLAPS) 58/462 variables, 14/418 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 58/476 constraints. Problems are: Problem set: 0 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/1189 variables, and 476 constraints, problems are : Problem set: 0 solved, 270 unsolved in 5017 ms.
Refiners :[Domain max(s): 462/462 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/462 constraints, ReadFeed: 0/73 constraints, PredecessorRefiner: 0/270 constraints, Known Traps: 0/0 constraints]
After SMT, in 10357ms problems are : Problem set: 0 solved, 270 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 404 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 762/762 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 462 transition count 726
Free-agglomeration rule applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 56 place count 462 transition count 706
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 76 place count 442 transition count 706
Applied a total of 76 rules in 263 ms. Remains 442 /462 variables (removed 20) and now considering 706/762 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 264 ms. Remains : 442/462 places, 706/762 transitions.
RANDOM walk for 4000000 steps (248592 resets) in 101232 ms. (39 steps per ms) remains 32/270 properties
BEST_FIRST walk for 400004 steps (8 resets) in 559 ms. (714 steps per ms) remains 31/32 properties
BEST_FIRST walk for 400004 steps (117 resets) in 545 ms. (732 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400004 steps (117 resets) in 288 ms. (1384 steps per ms) remains 30/31 properties
BEST_FIRST walk for 400004 steps (116 resets) in 300 ms. (1328 steps per ms) remains 27/30 properties
BEST_FIRST walk for 400004 steps (117 resets) in 227 ms. (1754 steps per ms) remains 23/27 properties
BEST_FIRST walk for 400004 steps (117 resets) in 287 ms. (1388 steps per ms) remains 20/23 properties
BEST_FIRST walk for 400004 steps (183 resets) in 369 ms. (1081 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (183 resets) in 317 ms. (1257 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (183 resets) in 305 ms. (1307 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (183 resets) in 306 ms. (1302 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (182 resets) in 253 ms. (1574 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (183 resets) in 210 ms. (1895 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (182 resets) in 213 ms. (1869 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (181 resets) in 199 ms. (2000 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (182 resets) in 205 ms. (1941 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (185 resets) in 214 ms. (1860 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (183 resets) in 204 ms. (1951 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (183 resets) in 206 ms. (1932 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (183 resets) in 204 ms. (1951 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (183 resets) in 227 ms. (1754 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (185 resets) in 263 ms. (1515 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (184 resets) in 259 ms. (1538 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (184 resets) in 267 ms. (1492 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (183 resets) in 272 ms. (1465 steps per ms) remains 20/20 properties
// Phase 1: matrix 706 rows 442 cols
[2025-05-31 10:42:41] [INFO ] Computed 14 invariants in 10 ms
[2025-05-31 10:42:41] [INFO ] State equation strengthened by 80 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 367/389 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/389 variables, 367/401 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 53/442 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 53/456 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 706/1148 variables, 442/898 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1148 variables, 80/978 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1148 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 0/1148 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1148/1148 variables, and 978 constraints, problems are : Problem set: 0 solved, 20 unsolved in 3884 ms.
Refiners :[Domain max(s): 442/442 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 442/442 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 367/389 variables, 12/34 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/389 variables, 367/401 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/389 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 53/442 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 53/456 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 706/1148 variables, 442/898 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1148 variables, 80/978 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1148 variables, 20/998 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1148 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 0/1148 variables, 0/998 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1148/1148 variables, and 998 constraints, problems are : Problem set: 0 solved, 20 unsolved in 19658 ms.
Refiners :[Domain max(s): 442/442 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 442/442 constraints, ReadFeed: 80/80 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 23625ms problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 19 different solutions.
Finished Parikh walk after 4250 steps, including 187 resets, run visited all 1 properties in 64 ms. (steps per millisecond=66 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 20 properties in 1244 ms.
Able to resolve query QuasiLiveness after proving 327 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 133648 ms.
ITS solved all properties within timeout

BK_STOP 1748688186733

--------------------
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 QuasiLiveness -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="FlexibleBarrier-PT-12b"
export BK_EXAMINATION="QuasiLiveness"
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 FlexibleBarrier-PT-12b, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098-smll-174860112400297"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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