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-171649586600127.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-171649586600127
=====================================================================

--------------------
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-ReachabilityFireability-2024-00
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-01
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-02
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-03
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-04
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-05
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-06
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-07
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-08
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-09
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-10
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-11
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-12
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-13
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-14
FORMULA_NAME HirschbergSinclair-PT-45-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716635003151

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
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:03:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 11:03:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 11:03:26] [INFO ] Load time of PNML (sax parser for PT used): 290 ms
[2024-05-25 11:03:26] [INFO ] Transformed 1138 places.
[2024-05-25 11:03:26] [INFO ] Transformed 1042 transitions.
[2024-05-25 11:03:26] [INFO ] Parsed PT model containing 1138 places and 1042 transitions and 3176 arcs in 555 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 60 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (36 resets) in 3341 ms. (11 steps per ms) remains 5/16 properties
FORMULA HirschbergSinclair-PT-45-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-45-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1206 ms. (33 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1770 ms. (22 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 5/5 properties
// Phase 1: matrix 1042 rows 1138 cols
[2024-05-25 11:03:28] [INFO ] Computed 96 invariants in 68 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem HirschbergSinclair-PT-45-ReachabilityFireability-2024-11 is UNSAT
FORMULA HirschbergSinclair-PT-45-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 800/938 variables, 61/61 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/938 variables, 0/61 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 94/1032 variables, 28/89 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1032 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/1035 variables, 1/90 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1035 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 60/1095 variables, 6/96 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1095 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1042/2137 variables, 1095/1191 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2137 variables, 0/1191 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 43/2180 variables, 43/1234 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2180 variables, 0/1234 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/2180 variables, 0/1234 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2180/2180 variables, and 1234 constraints, problems are : Problem set: 1 solved, 4 unsolved in 4929 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 1138/1138 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 796/903 variables, 51/51 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-25 11:03:35] [INFO ] Deduced a trap composed of 34 places in 801 ms of which 92 ms to minimize.
[2024-05-25 11:03:36] [INFO ] Deduced a trap composed of 49 places in 765 ms of which 11 ms to minimize.
[2024-05-25 11:03:37] [INFO ] Deduced a trap composed of 194 places in 409 ms of which 8 ms to minimize.
[2024-05-25 11:03:37] [INFO ] Deduced a trap composed of 203 places in 322 ms of which 8 ms to minimize.
[2024-05-25 11:03:37] [INFO ] Deduced a trap composed of 206 places in 319 ms of which 7 ms to minimize.
[2024-05-25 11:03:38] [INFO ] Deduced a trap composed of 197 places in 319 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/903 variables, 6/57 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-25 11:03:38] [INFO ] Deduced a trap composed of 40 places in 503 ms of which 9 ms to minimize.
[2024-05-25 11:03:39] [INFO ] Deduced a trap composed of 192 places in 436 ms of which 10 ms to minimize.
SMT process timed out in 10524ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 107 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 1091 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.9 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 167 rules applied. Total rules applied 168 place count 1091 transition count 875
Reduce places removed 165 places and 0 transitions.
Graph (complete) has 1683 edges and 926 vertex of which 887 are kept as prefixes of interest. Removing 39 places using SCC suffix rule.4 ms
Discarding 39 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 166 rules applied. Total rules applied 334 place count 887 transition count 875
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 373 place count 887 transition count 836
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 402 place count 858 transition count 807
Iterating global reduction 3 with 29 rules applied. Total rules applied 431 place count 858 transition count 807
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 455 place count 834 transition count 783
Iterating global reduction 3 with 24 rules applied. Total rules applied 479 place count 834 transition count 783
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 3 with 25 rules applied. Total rules applied 504 place count 834 transition count 758
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 529 place count 809 transition count 758
Reduce places removed 16 places and 16 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 545 place count 793 transition count 742
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 546 place count 792 transition count 742
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 546 place count 792 transition count 729
Deduced a syphon composed of 13 places in 10 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 572 place count 779 transition count 729
Applied a total of 572 rules in 785 ms. Remains 779 /1138 variables (removed 359) and now considering 729/1042 (removed 313) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 827 ms. Remains : 779/1138 places, 729/1042 transitions.
RANDOM walk for 40000 steps (48 resets) in 1205 ms. (33 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 421 ms. (94 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 332 ms. (120 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 226496 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 4
Probabilistic random walk after 226496 steps, saw 66181 distinct states, run finished after 3007 ms. (steps per millisecond=75 ) properties seen :0
// Phase 1: matrix 729 rows 779 cols
[2024-05-25 11:03:43] [INFO ] Computed 50 invariants in 6 ms
[2024-05-25 11:03:43] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 609/717 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/717 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/719 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/719 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 720/1439 variables, 719/769 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1439 variables, 13/782 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1439 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 69/1508 variables, 60/842 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1508 variables, 1/843 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1508 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1508 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1508/1508 variables, and 843 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4338 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 779/779 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 609/717 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/717 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/719 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/719 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 720/1439 variables, 719/769 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1439 variables, 13/782 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1439 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 69/1508 variables, 60/842 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1508 variables, 1/843 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1508 variables, 4/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1508 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1508 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1508/1508 variables, and 847 constraints, problems are : Problem set: 0 solved, 4 unsolved in 13890 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 779/779 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 18370ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 3239 ms.
Support contains 107 out of 779 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 779/779 places, 729/729 transitions.
Applied a total of 0 rules in 51 ms. Remains 779 /779 variables (removed 0) and now considering 729/729 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 779/779 places, 729/729 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 779/779 places, 729/729 transitions.
Applied a total of 0 rules in 45 ms. Remains 779 /779 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2024-05-25 11:04:05] [INFO ] Invariant cache hit.
[2024-05-25 11:04:06] [INFO ] Implicit Places using invariants in 833 ms returned []
[2024-05-25 11:04:06] [INFO ] Invariant cache hit.
[2024-05-25 11:04:07] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-25 11:04:11] [INFO ] Implicit Places using invariants and state equation in 4962 ms returned []
Implicit Place search using SMT with State Equation took 5809 ms to find 0 implicit places.
[2024-05-25 11:04:11] [INFO ] Redundant transitions in 75 ms returned []
Running 699 sub problems to find dead transitions.
[2024-05-25 11:04:11] [INFO ] Invariant cache hit.
[2024-05-25 11:04:11] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/749 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/749 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 699 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/749 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 699 unsolved
SMT process timed out in 30518ms, After SMT, problems are : Problem set: 0 solved, 699 unsolved
Search for dead transitions found 0 dead transitions in 30536ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36488 ms. Remains : 779/779 places, 729/729 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 776 transition count 696
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 69 place count 743 transition count 696
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 71 Pre rules applied. Total rules applied 69 place count 743 transition count 625
Deduced a syphon composed of 71 places in 8 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 211 place count 672 transition count 625
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 8 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 227 place count 664 transition count 617
Applied a total of 227 rules in 158 ms. Remains 664 /779 variables (removed 115) and now considering 617/729 (removed 112) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 617 rows 664 cols
[2024-05-25 11:04:42] [INFO ] Computed 47 invariants in 18 ms
[2024-05-25 11:04:42] [INFO ] [Real]Absence check using 1 positive place invariants in 14 ms returned sat
[2024-05-25 11:04:42] [INFO ] [Real]Absence check using 1 positive and 46 generalized place invariants in 243 ms returned sat
[2024-05-25 11:04:42] [INFO ] After 670ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 11:04:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-25 11:04:43] [INFO ] [Nat]Absence check using 1 positive and 46 generalized place invariants in 222 ms returned sat
[2024-05-25 11:04:45] [INFO ] After 2145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-25 11:04:47] [INFO ] After 3701ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-25 11:04:48] [INFO ] After 5774ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 6723 ms.
[2024-05-25 11:04:48] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2024-05-25 11:04:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 779 places, 729 transitions and 2310 arcs took 10 ms.
[2024-05-25 11:04:49] [INFO ] Flatten gal took : 221 ms
Total runtime 83762 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running HirschbergSinclair-PT-45

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 779
TRANSITIONS: 729
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.019s, Sys 0.001s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 607
MODEL NAME: /home/mcc/execution/414/model
779 places, 729 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..

BK_TIME_CONFINEMENT_REACHED

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="ReachabilityFireability"
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 ReachabilityFireability"
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-171649586600127"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;