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.r238-smll-174903502800007.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 StigmergyCommit-PT-02b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r238-smll-174903502800007
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K 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:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 231K May 29 14:33 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 1749106345722

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=StigmergyCommit-PT-02b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-05 06:52:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2025-06-05 06:52:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 06:52:28] [INFO ] Load time of PNML (sax parser for PT used): 266 ms
[2025-06-05 06:52:28] [INFO ] Transformed 928 places.
[2025-06-05 06:52:28] [INFO ] Transformed 1040 transitions.
[2025-06-05 06:52:28] [INFO ] Found NUPN structural information;
[2025-06-05 06:52:28] [INFO ] Parsed PT model containing 928 places and 1040 transitions and 2439 arcs in 491 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 928/928 places, 1040/1040 transitions.
Graph (trivial) has 921 edges and 928 vertex of which 63 / 928 are part of one of the 9 SCC in 12 ms
Free SCC test removed 54 places
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 696 transitions
Trivial Post-agglo rules discarded 696 transitions
Performed 696 trivial Post agglomeration. Transition count delta: 696
Iterating post reduction 0 with 696 rules applied. Total rules applied 697 place count 874 transition count 284
Reduce places removed 696 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 708 rules applied. Total rules applied 1405 place count 178 transition count 272
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1408 place count 175 transition count 272
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 1408 place count 175 transition count 239
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 1474 place count 142 transition count 239
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1566 place count 96 transition count 193
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1584 place count 87 transition count 225
Applied a total of 1584 rules in 230 ms. Remains 87 /928 variables (removed 841) and now considering 225/1040 (removed 815) transitions.
[2025-06-05 06:52:29] [INFO ] Flow matrix only has 216 transitions (discarded 9 similar events)
// Phase 1: matrix 216 rows 87 cols
[2025-06-05 06:52:29] [INFO ] Computed 4 invariants in 21 ms
[2025-06-05 06:52:29] [INFO ] Implicit Places using invariants in 386 ms returned []
[2025-06-05 06:52:29] [INFO ] Flow matrix only has 216 transitions (discarded 9 similar events)
[2025-06-05 06:52:29] [INFO ] Invariant cache hit.
[2025-06-05 06:52:29] [INFO ] State equation strengthened by 64 read => feed constraints.
[2025-06-05 06:52:29] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2025-06-05 06:52:29] [INFO ] Flow matrix only has 216 transitions (discarded 9 similar events)
[2025-06-05 06:52:29] [INFO ] Invariant cache hit.
[2025-06-05 06:52:29] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2025-06-05 06:52:33] [INFO ] Deduced a trap composed of 37 places in 142 ms of which 19 ms to minimize.
[2025-06-05 06:52:33] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 3 ms to minimize.
[2025-06-05 06:52:33] [INFO ] Deduced a trap composed of 37 places in 91 ms of which 3 ms to minimize.
[2025-06-05 06:52:33] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 3 ms to minimize.
[2025-06-05 06:52:34] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2025-06-05 06:52:34] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 2 ms to minimize.
[2025-06-05 06:52:34] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 2 ms to minimize.
[2025-06-05 06:52:34] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
[2025-06-05 06:52:34] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2025-06-05 06:52:34] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 2 ms to minimize.
[2025-06-05 06:52:35] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 11/102 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2025-06-05 06:52:35] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2025-06-05 06:52:36] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (OVERLAPS) 215/302 variables, 87/191 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 63/254 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (OVERLAPS) 1/303 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/303 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 13 (OVERLAPS) 0/303 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 255 constraints, problems are : Problem set: 0 solved, 198 unsolved in 17814 ms.
Refiners :[Domain max(s): 87/87 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 87/87 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 4/90 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 13/104 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 215/302 variables, 87/191 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 63/254 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 198/452 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2025-06-05 06:52:53] [INFO ] Deduced a trap composed of 37 places in 63 ms of which 2 ms to minimize.
[2025-06-05 06:52:54] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 2/454 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 11 (OVERLAPS) 1/303 variables, 1/455 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2025-06-05 06:53:00] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/303 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/303 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 14 (OVERLAPS) 0/303 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 456 constraints, problems are : Problem set: 0 solved, 198 unsolved in 23507 ms.
Refiners :[Domain max(s): 87/87 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 87/87 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 16/16 constraints]
After SMT, in 41978ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 42016ms
Starting structural reductions in LIVENESS mode, iteration 1 : 87/928 places, 225/1040 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 43155 ms. Remains : 87/928 places, 225/1040 transitions.
Discarding 97 transitions out of 225. Remains 128
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (7844 resets) in 3776 ms. (10 steps per ms) remains 37/127 properties
BEST_FIRST walk for 4004 steps (66 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (54 resets) in 27 ms. (142 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4004 steps (48 resets) in 26 ms. (148 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4002 steps (47 resets) in 39 ms. (100 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4004 steps (39 resets) in 25 ms. (154 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4003 steps (65 resets) in 28 ms. (138 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (59 resets) in 19 ms. (200 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (72 resets) in 19 ms. (200 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4004 steps (60 resets) in 12 ms. (308 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4004 steps (55 resets) in 13 ms. (286 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (44 resets) in 12 ms. (308 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4003 steps (43 resets) in 12 ms. (307 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4004 steps (62 resets) in 18 ms. (210 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4003 steps (61 resets) in 10 ms. (363 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4004 steps (57 resets) in 12 ms. (308 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4004 steps (28 resets) in 11 ms. (333 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (34 resets) in 17 ms. (222 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4003 steps (35 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (32 resets) in 12 ms. (308 steps per ms) remains 15/21 properties
BEST_FIRST walk for 4002 steps (33 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (34 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (34 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (36 resets) in 8 ms. (444 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 17 ms. (222 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4003 steps (34 resets) in 13 ms. (285 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4004 steps (32 resets) in 12 ms. (308 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (33 resets) in 11 ms. (333 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (35 resets) in 17 ms. (222 steps per ms) remains 12/12 properties
[2025-06-05 06:53:13] [INFO ] Flow matrix only has 216 transitions (discarded 9 similar events)
[2025-06-05 06:53:13] [INFO ] Invariant cache hit.
[2025-06-05 06:53:13] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 74/87 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 74/91 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 215/302 variables, 87/178 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 63/241 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/303 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 0/303 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 242 constraints, problems are : Problem set: 0 solved, 12 unsolved in 863 ms.
Refiners :[Domain max(s): 87/87 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 87/87 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 74/87 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 74/91 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 215/302 variables, 87/178 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 63/241 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 12/253 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2025-06-05 06:53:14] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
[2025-06-05 06:53:14] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
[2025-06-05 06:53:14] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 2 ms to minimize.
[2025-06-05 06:53:14] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 4/257 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 1/303 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/303 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 258 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1466 ms.
Refiners :[Domain max(s): 87/87 constraints, Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 87/87 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 4/4 constraints]
After SMT, in 2366ms problems are : Problem set: 0 solved, 12 unsolved
Finished Parikh walk after 3725 steps, including 648 resets, run visited all 2 properties in 21 ms. (steps per millisecond=177 )
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 12 properties in 717 ms.
Able to resolve query QuasiLiveness after proving 128 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 48269 ms.
ITS solved all properties within timeout

BK_STOP 1749106396540

--------------------
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="StigmergyCommit-PT-02b"
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 StigmergyCommit-PT-02b, 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 r238-smll-174903502800007"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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