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.r364-tall-171683777300187.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 ShieldIIPt-PT-030B, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r364-tall-171683777300187
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 20:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 20:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 20:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 20:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 512K 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 QuasiLiveness

=== Now, execution of the tool begins

BK_START 1716910562124

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldIIPt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 15:36:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-05-28 15:36:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 15:36:03] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2024-05-28 15:36:03] [INFO ] Transformed 2103 places.
[2024-05-28 15:36:03] [INFO ] Transformed 1953 transitions.
[2024-05-28 15:36:03] [INFO ] Found NUPN structural information;
[2024-05-28 15:36:03] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 339 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 512 transitions
Trivial Post-agglo rules discarded 512 transitions
Performed 512 trivial Post agglomeration. Transition count delta: 512
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 2103 transition count 1441
Reduce places removed 512 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 514 rules applied. Total rules applied 1026 place count 1591 transition count 1439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1027 place count 1590 transition count 1439
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 121 Pre rules applied. Total rules applied 1027 place count 1590 transition count 1318
Deduced a syphon composed of 121 places in 20 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 1269 place count 1469 transition count 1318
Performed 809 Post agglomeration using F-continuation condition.Transition count delta: 809
Deduced a syphon composed of 809 places in 3 ms
Reduce places removed 809 places and 0 transitions.
Iterating global reduction 3 with 1618 rules applied. Total rules applied 2887 place count 660 transition count 509
Renaming transitions due to excessive name length > 1024 char.
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 2 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 3065 place count 571 transition count 568
Applied a total of 3065 rules in 386 ms. Remains 571 /2103 variables (removed 1532) and now considering 568/1953 (removed 1385) transitions.
// Phase 1: matrix 568 rows 571 cols
[2024-05-28 15:36:04] [INFO ] Computed 271 invariants in 23 ms
[2024-05-28 15:36:04] [INFO ] Implicit Places using invariants in 624 ms returned [563, 564]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 655 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 569/2103 places, 568/1953 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 569 transition count 567
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 568 transition count 567
Applied a total of 2 rules in 16 ms. Remains 568 /569 variables (removed 1) and now considering 567/568 (removed 1) transitions.
// Phase 1: matrix 567 rows 568 cols
[2024-05-28 15:36:04] [INFO ] Computed 269 invariants in 4 ms
[2024-05-28 15:36:05] [INFO ] Implicit Places using invariants in 388 ms returned [557]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 391 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 567/2103 places, 567/1953 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 566 transition count 566
Applied a total of 2 rules in 16 ms. Remains 566 /567 variables (removed 1) and now considering 566/567 (removed 1) transitions.
// Phase 1: matrix 566 rows 566 cols
[2024-05-28 15:36:05] [INFO ] Computed 268 invariants in 6 ms
[2024-05-28 15:36:05] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-05-28 15:36:05] [INFO ] Invariant cache hit.
[2024-05-28 15:36:05] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-28 15:36:09] [INFO ] Implicit Places using invariants and state equation in 3543 ms returned []
Implicit Place search using SMT with State Equation took 3937 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 3 : 566/2103 places, 566/1953 transitions.
Finished structural reductions in LIVENESS mode , in 3 iterations and 5420 ms. Remains : 566/2103 places, 566/1953 transitions.
Discarding 267 transitions out of 566. Remains 299
Initial state reduction rules removed 1 formulas.
RANDOM walk for 40000 steps (8 resets) in 3821 ms. (10 steps per ms) remains 169/298 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 10 ms. (36 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 11 ms. (33 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 17 ms. (22 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 169/169 properties
BEST_FIRST walk for 401 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 169/169 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 9 ms. (40 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 7 ms. (50 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 402 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 402 steps (8 resets) in 7 ms. (50 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 403 steps (8 resets) in 8 ms. (44 steps per ms) remains 169/169 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 169/169 properties
[2024-05-28 15:36:10] [INFO ] Invariant cache hit.
[2024-05-28 15:36:10] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 323/323 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 5/328 variables, 155/478 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/328 variables, 5/483 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 238/566 variables, 113/596 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 238/834 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 566/1132 variables, and 834 constraints, problems are : Problem set: 0 solved, 169 unsolved in 5020 ms.
Refiners :[Domain max(s): 566/566 constraints, Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 0/566 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 323/323 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/323 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 5/328 variables, 155/478 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/328 variables, 5/483 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 238/566 variables, 113/596 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 238/834 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 565/1131 variables, 566/1400 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1131 variables, 266/1666 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1131/1132 variables, and 1835 constraints, problems are : Problem set: 0 solved, 169 unsolved in 5043 ms.
Refiners :[Domain max(s): 566/566 constraints, Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 266/267 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 0/0 constraints]
After SMT, in 10198ms problems are : Problem set: 0 solved, 169 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 323 out of 566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 566/566 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 566 transition count 565
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 13 place count 566 transition count 565
Applied a total of 13 rules in 52 ms. Remains 566 /566 variables (removed 0) and now considering 565/566 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 566/566 places, 565/566 transitions.
RANDOM walk for 4000000 steps (8 resets) in 50955 ms. (78 steps per ms) remains 53/169 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1835 ms. (217 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1793 ms. (222 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1781 ms. (224 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1788 ms. (223 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1761 ms. (227 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1777 ms. (224 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1760 ms. (227 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1772 ms. (225 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1861 ms. (214 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2056 ms. (194 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2270 ms. (176 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1936 ms. (206 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1821 ms. (219 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1806 ms. (221 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1783 ms. (224 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1825 ms. (219 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1838 ms. (217 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1858 ms. (215 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1854 ms. (215 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1827 ms. (218 steps per ms) remains 49/53 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1813 ms. (220 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1798 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1814 ms. (220 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1840 ms. (217 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1845 ms. (216 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1845 ms. (216 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1827 ms. (218 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1790 ms. (223 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1789 ms. (223 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1779 ms. (224 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1784 ms. (224 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1810 ms. (220 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1837 ms. (217 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1810 ms. (220 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1801 ms. (221 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1829 ms. (218 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1811 ms. (220 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1809 ms. (220 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1805 ms. (221 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1814 ms. (220 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1812 ms. (220 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1807 ms. (221 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1789 ms. (223 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1791 ms. (223 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1836 ms. (217 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1792 ms. (223 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1800 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1799 ms. (222 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1815 ms. (220 steps per ms) remains 49/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2363 ms. (169 steps per ms) remains 49/49 properties
// Phase 1: matrix 565 rows 566 cols
[2024-05-28 15:36:57] [INFO ] Computed 268 invariants in 4 ms
[2024-05-28 15:36:57] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 12/110 variables, 52/150 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 12/162 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 456/566 variables, 216/378 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 456/834 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 565/1131 variables, 566/1400 constraints. Problems are: Problem set: 0 solved, 49 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1131 variables, 266/1666 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1131 variables, 0/1666 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 0/1131 variables, 0/1666 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1131/1131 variables, and 1666 constraints, problems are : Problem set: 0 solved, 49 unsolved in 5268 ms.
Refiners :[Domain max(s): 566/566 constraints, Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 12/110 variables, 52/150 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 12/162 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 456/566 variables, 216/378 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 456/834 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 565/1131 variables, 566/1400 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1131 variables, 266/1666 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1131 variables, 49/1715 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1131 variables, 0/1715 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 12 (OVERLAPS) 0/1131 variables, 0/1715 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1131/1131 variables, and 1715 constraints, problems are : Problem set: 0 solved, 49 unsolved in 45013 ms.
Refiners :[Domain max(s): 566/566 constraints, Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 0/0 constraints]
After SMT, in 50324ms problems are : Problem set: 0 solved, 49 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 98 out of 566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 565/565 transitions.
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 566 transition count 565
Applied a total of 12 rules in 61 ms. Remains 566 /566 variables (removed 0) and now considering 565/565 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 566/566 places, 565/565 transitions.
RANDOM walk for 4000000 steps (8 resets) in 41899 ms. (95 steps per ms) remains 23/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1798 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1798 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1815 ms. (220 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1811 ms. (220 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1769 ms. (225 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1789 ms. (223 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1793 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1812 ms. (220 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1801 ms. (221 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1832 ms. (218 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1833 ms. (218 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1838 ms. (217 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1839 ms. (217 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1833 ms. (218 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1841 ms. (217 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1857 ms. (215 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1838 ms. (217 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1840 ms. (217 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1831 ms. (218 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1836 ms. (217 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1866 ms. (214 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1854 ms. (215 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1841 ms. (217 steps per ms) remains 23/23 properties
// Phase 1: matrix 565 rows 566 cols
[2024-05-28 15:38:10] [INFO ] Computed 268 invariants in 7 ms
[2024-05-28 15:38:10] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 9/57 variables, 27/75 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 509/566 variables, 241/325 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 509/834 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 565/1131 variables, 566/1400 constraints. Problems are: Problem set: 0 solved, 23 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1131 variables, 266/1666 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1131 variables, 0/1666 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 0/1131 variables, 0/1666 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1131/1131 variables, and 1666 constraints, problems are : Problem set: 0 solved, 23 unsolved in 2352 ms.
Refiners :[Domain max(s): 566/566 constraints, Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 9/57 variables, 27/75 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 9/84 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 509/566 variables, 241/325 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 509/834 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/566 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 565/1131 variables, 566/1400 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1131 variables, 266/1666 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1131 variables, 23/1689 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1131 variables, 0/1689 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 0/1131 variables, 0/1689 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1131/1131 variables, and 1689 constraints, problems are : Problem set: 0 solved, 23 unsolved in 36487 ms.
Refiners :[Domain max(s): 566/566 constraints, Positive P Invariants (semi-flows): 268/268 constraints, State Equation: 566/566 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
After SMT, in 38872ms problems are : Problem set: 0 solved, 23 unsolved
Fused 23 Parikh solutions to 21 different solutions.
Parikh walk visited 0 properties in 5003 ms.
Support contains 48 out of 566 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 566/566 places, 565/565 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 566 transition count 565
Applied a total of 3 rules in 54 ms. Remains 566 /566 variables (removed 0) and now considering 565/565 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 566/566 places, 565/565 transitions.
RANDOM walk for 3091683 steps (6 resets) in 35467 ms. (87 steps per ms) remains 0/23 properties
Able to resolve query QuasiLiveness after proving 299 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 183561 ms.
ITS solved all properties within timeout

BK_STOP 1716910746960

--------------------
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 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="ShieldIIPt-PT-030B"
export BK_EXAMINATION="QuasiLiveness"
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 ShieldIIPt-PT-030B, 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 r364-tall-171683777300187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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