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.r201-smll-171649586600126.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 HirschbergSinclair-PT-45, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-171649586600126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 13 02:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Apr 13 02:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 02:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 13 02:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 616K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-00
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-01
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-02
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-03
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-04
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-05
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-06
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-07
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-08
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-09
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-10
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-11
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-12
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-13
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-14
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716634965287

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-45
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 11:02:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 11:02:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 11:02:48] [INFO ] Load time of PNML (sax parser for PT used): 294 ms
[2024-05-25 11:02:48] [INFO ] Transformed 1138 places.
[2024-05-25 11:02:48] [INFO ] Transformed 1042 transitions.
[2024-05-25 11:02:48] [INFO ] Parsed PT model containing 1138 places and 1042 transitions and 3176 arcs in 560 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 61 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (36 resets) in 4064 ms. (9 steps per ms) remains 10/16 properties
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1037 ms. (38 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 903 ms. (44 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 515 ms. (77 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 209 ms. (190 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 389 ms. (102 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 10/10 properties
// Phase 1: matrix 1042 rows 1138 cols
[2024-05-25 11:02:51] [INFO ] Computed 96 invariants in 63 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/253 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem HirschbergSinclair-PT-45-ReachabilityCardinality-2024-00 is UNSAT
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-45-ReachabilityCardinality-2024-01 is UNSAT
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-45-ReachabilityCardinality-2024-03 is UNSAT
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-45-ReachabilityCardinality-2024-06 is UNSAT
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-45-ReachabilityCardinality-2024-07 is UNSAT
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-45-ReachabilityCardinality-2024-09 is UNSAT
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-45-ReachabilityCardinality-2024-15 is UNSAT
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 757/1010 variables, 77/77 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1010 variables, 0/77 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 39/1049 variables, 13/90 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1049 variables, 0/90 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 55/1104 variables, 6/96 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1104 variables, 0/96 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1042/2146 variables, 1104/1200 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2146 variables, 0/1200 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 34/2180 variables, 34/1234 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2180 variables, 0/1234 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/2180 variables, 0/1234 constraints. Problems are: Problem set: 7 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2180/2180 variables, and 1234 constraints, problems are : Problem set: 7 solved, 3 unsolved in 4017 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 1138/1138 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 851/947 variables, 61/61 constraints. Problems are: Problem set: 7 solved, 3 unsolved
[2024-05-25 11:02:56] [INFO ] Deduced a trap composed of 27 places in 519 ms of which 80 ms to minimize.
[2024-05-25 11:02:57] [INFO ] Deduced a trap composed of 62 places in 603 ms of which 12 ms to minimize.
[2024-05-25 11:02:58] [INFO ] Deduced a trap composed of 30 places in 576 ms of which 11 ms to minimize.
[2024-05-25 11:02:58] [INFO ] Deduced a trap composed of 59 places in 563 ms of which 10 ms to minimize.
[2024-05-25 11:02:59] [INFO ] Deduced a trap composed of 195 places in 522 ms of which 10 ms to minimize.
[2024-05-25 11:02:59] [INFO ] Deduced a trap composed of 43 places in 450 ms of which 9 ms to minimize.
[2024-05-25 11:03:00] [INFO ] Deduced a trap composed of 202 places in 371 ms of which 10 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/947 variables, 7/68 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/947 variables, 0/68 constraints. Problems are: Problem set: 7 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 87/1034 variables, 29/97 constraints. Problems are: Problem set: 7 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1034/2180 variables, and 97 constraints, problems are : Problem set: 7 solved, 3 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/1138 constraints, PredecessorRefiner: 0/10 constraints, Known Traps: 7/7 constraints]
After SMT, in 9383ms problems are : Problem set: 7 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 96 out of 1138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1138/1138 places, 1042/1042 transitions.
Graph (complete) has 2184 edges and 1138 vertex of which 1094 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.12 ms
Discarding 44 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 330 transitions
Trivial Post-agglo rules discarded 330 transitions
Performed 330 trivial Post agglomeration. Transition count delta: 330
Iterating post reduction 0 with 331 rules applied. Total rules applied 332 place count 1094 transition count 711
Reduce places removed 330 places and 0 transitions.
Graph (complete) has 1329 edges and 764 vertex of which 678 are kept as prefixes of interest. Removing 86 places using SCC suffix rule.3 ms
Discarding 86 places :
Also discarding 0 output transitions
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Iterating post reduction 1 with 366 rules applied. Total rules applied 698 place count 678 transition count 676
Reduce places removed 35 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 2 with 121 rules applied. Total rules applied 819 place count 643 transition count 590
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 827 place count 635 transition count 582
Iterating global reduction 3 with 8 rules applied. Total rules applied 835 place count 635 transition count 582
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 842 place count 628 transition count 575
Iterating global reduction 3 with 7 rules applied. Total rules applied 849 place count 628 transition count 575
Free-agglomeration rule (complex) applied 62 times.
Iterating global reduction 3 with 62 rules applied. Total rules applied 911 place count 628 transition count 513
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 3 with 62 rules applied. Total rules applied 973 place count 566 transition count 513
Reduce places removed 32 places and 32 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 1005 place count 534 transition count 481
Applied a total of 1005 rules in 544 ms. Remains 534 /1138 variables (removed 604) and now considering 481/1042 (removed 561) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 567 ms. Remains : 534/1138 places, 481/1042 transitions.
RANDOM walk for 40000 steps (80 resets) in 1660 ms. (24 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (15 resets) in 258 ms. (154 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (14 resets) in 271 ms. (147 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (12 resets) in 296 ms. (134 steps per ms) remains 2/3 properties
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 481 rows 534 cols
[2024-05-25 11:03:02] [INFO ] Computed 53 invariants in 5 ms
[2024-05-25 11:03:02] [INFO ] State equation strengthened by 70 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 436/502 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/505 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 468/973 variables, 505/558 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/973 variables, 68/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/973 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 29/1002 variables, 22/648 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1002 variables, 1/649 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1002 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/1003 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1003 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/1004 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1004 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 3/1007 variables, 2/653 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1007 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1007 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1007/1015 variables, and 653 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2240 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 530/534 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 436/502 variables, 49/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/505 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem HirschbergSinclair-PT-45-ReachabilityCardinality-2024-11 is UNSAT
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 468/973 variables, 505/558 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/973 variables, 68/626 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/973 variables, 0/626 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 29/1002 variables, 22/648 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1002 variables, 1/649 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1002 variables, 1/650 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1002 variables, 0/650 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/1003 variables, 1/651 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1003 variables, 0/651 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1004 variables, 1/652 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1004 variables, 0/652 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/1007 variables, 2/654 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1007 variables, 0/654 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1007 variables, 0/654 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1007/1015 variables, and 654 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2238 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 530/534 constraints, ReadFeed: 70/70 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 4526ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 229 ms.
Support contains 33 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 481/481 transitions.
Graph (complete) has 971 edges and 534 vertex of which 521 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.3 ms
Discarding 13 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 521 transition count 425
Reduce places removed 49 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 804 edges and 472 vertex of which 463 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 68 rules applied. Total rules applied 125 place count 463 transition count 407
Reduce places removed 16 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 26 rules applied. Total rules applied 151 place count 447 transition count 397
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 20 rules applied. Total rules applied 171 place count 443 transition count 381
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 17 rules applied. Total rules applied 188 place count 427 transition count 380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 189 place count 426 transition count 380
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 21 Pre rules applied. Total rules applied 189 place count 426 transition count 359
Deduced a syphon composed of 21 places in 5 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 231 place count 405 transition count 359
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 232 place count 404 transition count 358
Iterating global reduction 6 with 1 rules applied. Total rules applied 233 place count 404 transition count 358
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 234 place count 403 transition count 357
Iterating global reduction 6 with 1 rules applied. Total rules applied 235 place count 403 transition count 357
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 237 place count 402 transition count 356
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 245 place count 402 transition count 348
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 253 place count 394 transition count 348
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 7 with 9 rules applied. Total rules applied 262 place count 385 transition count 339
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 264 place count 383 transition count 339
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 13 Pre rules applied. Total rules applied 264 place count 383 transition count 326
Deduced a syphon composed of 13 places in 10 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 8 with 26 rules applied. Total rules applied 290 place count 370 transition count 326
Applied a total of 290 rules in 348 ms. Remains 370 /534 variables (removed 164) and now considering 326/481 (removed 155) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 348 ms. Remains : 370/534 places, 326/481 transitions.
RANDOM walk for 40000 steps (120 resets) in 235 ms. (169 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (36 resets) in 296 ms. (134 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 444014 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :0 out of 1
Probabilistic random walk after 444014 steps, saw 100633 distinct states, run finished after 3006 ms. (steps per millisecond=147 ) properties seen :0
// Phase 1: matrix 326 rows 370 cols
[2024-05-25 11:03:10] [INFO ] Computed 44 invariants in 5 ms
[2024-05-25 11:03:10] [INFO ] State equation strengthened by 29 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/41 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 296/337 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/362 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 326/688 variables, 362/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem HirschbergSinclair-PT-45-ReachabilityCardinality-2024-12 is UNSAT
FORMULA HirschbergSinclair-PT-45-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Real declared 688/696 variables, and 435 constraints, problems are : Problem set: 1 solved, 0 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 362/370 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 388ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 23113 ms.
ITS solved all properties within timeout

BK_STOP 1716634990910

--------------------
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 ReachabilityCardinality -timeout 360 -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="HirschbergSinclair-PT-45"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 HirschbergSinclair-PT-45, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r201-smll-171649586600126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-45.tgz
mv HirschbergSinclair-PT-45 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;