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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1000K
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 03:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 13 03:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 03:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 13 03:11 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 544K 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-35-ReachabilityFireability-2024-00
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-2024-01
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-2024-02
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-2024-03
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-2024-04
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-2024-05
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-2024-06
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-2024-07
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-2024-08
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-2024-09
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-2024-10
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-2024-11
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-2024-12
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-2024-13
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-2024-14
FORMULA_NAME HirschbergSinclair-PT-35-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716616820294

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-35
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 06:00:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 06:00:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 06:00:22] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2024-05-25 06:00:22] [INFO ] Transformed 998 places.
[2024-05-25 06:00:22] [INFO ] Transformed 922 transitions.
[2024-05-25 06:00:22] [INFO ] Parsed PT model containing 998 places and 922 transitions and 2806 arcs in 349 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (40 resets) in 1894 ms. (21 steps per ms) remains 8/16 properties
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 743 ms. (53 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 649 ms. (61 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 946 ms. (42 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 8/8 properties
// Phase 1: matrix 922 rows 998 cols
[2024-05-25 06:00:24] [INFO ] Computed 76 invariants in 36 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem HirschbergSinclair-PT-35-ReachabilityFireability-2024-03 is UNSAT
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-35-ReachabilityFireability-2024-06 is UNSAT
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 693/848 variables, 50/50 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/848 variables, 0/50 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 60/908 variables, 20/70 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/908 variables, 0/70 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem HirschbergSinclair-PT-35-ReachabilityFireability-2024-10 is UNSAT
FORMULA HirschbergSinclair-PT-35-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 59/967 variables, 6/76 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/967 variables, 0/76 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 922/1889 variables, 967/1043 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1889 variables, 0/1043 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 31/1920 variables, 31/1074 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1920 variables, 0/1074 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/1920 variables, 0/1074 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1920/1920 variables, and 1074 constraints, problems are : Problem set: 3 solved, 5 unsolved in 3089 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 998/998 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 737/823 variables, 44/44 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-25 06:00:28] [INFO ] Deduced a trap composed of 24 places in 400 ms of which 64 ms to minimize.
[2024-05-25 06:00:28] [INFO ] Deduced a trap composed of 39 places in 334 ms of which 7 ms to minimize.
[2024-05-25 06:00:29] [INFO ] Deduced a trap composed of 24 places in 421 ms of which 6 ms to minimize.
[2024-05-25 06:00:29] [INFO ] Deduced a trap composed of 67 places in 322 ms of which 7 ms to minimize.
[2024-05-25 06:00:30] [INFO ] Deduced a trap composed of 61 places in 328 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/823 variables, 5/49 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-25 06:00:30] [INFO ] Deduced a trap composed of 184 places in 263 ms of which 6 ms to minimize.
[2024-05-25 06:00:30] [INFO ] Deduced a trap composed of 116 places in 322 ms of which 6 ms to minimize.
[2024-05-25 06:00:31] [INFO ] Deduced a trap composed of 214 places in 318 ms of which 6 ms to minimize.
[2024-05-25 06:00:31] [INFO ] Deduced a trap composed of 110 places in 304 ms of which 6 ms to minimize.
[2024-05-25 06:00:31] [INFO ] Deduced a trap composed of 124 places in 239 ms of which 5 ms to minimize.
[2024-05-25 06:00:32] [INFO ] Deduced a trap composed of 194 places in 255 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/823 variables, 6/55 constraints. Problems are: Problem set: 3 solved, 5 unsolved
[2024-05-25 06:00:32] [INFO ] Deduced a trap composed of 186 places in 261 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/823 variables, 1/56 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 823/1920 variables, and 56 constraints, problems are : Problem set: 3 solved, 5 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 44/70 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/998 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 12/12 constraints]
After SMT, in 8480ms problems are : Problem set: 3 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 86 out of 998 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 998/998 places, 922/922 transitions.
Graph (complete) has 1924 edges and 998 vertex of which 963 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.8 ms
Discarding 35 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 963 transition count 801
Reduce places removed 121 places and 0 transitions.
Graph (complete) has 1556 edges and 842 vertex of which 814 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 122 rules applied. Total rules applied 244 place count 814 transition count 801
Drop transitions (Empty/Sink Transition effects.) removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 272 place count 814 transition count 773
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 298 place count 788 transition count 747
Iterating global reduction 3 with 26 rules applied. Total rules applied 324 place count 788 transition count 747
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 347 place count 765 transition count 724
Iterating global reduction 3 with 23 rules applied. Total rules applied 370 place count 765 transition count 724
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 390 place count 765 transition count 704
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 410 place count 745 transition count 704
Reduce places removed 12 places and 12 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 422 place count 733 transition count 692
Applied a total of 422 rules in 591 ms. Remains 733 /998 variables (removed 265) and now considering 692/922 (removed 230) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 610 ms. Remains : 733/998 places, 692/922 transitions.
RANDOM walk for 40000 steps (52 resets) in 897 ms. (44 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 339 ms. (117 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 299592 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 5
Probabilistic random walk after 299592 steps, saw 73369 distinct states, run finished after 3006 ms. (steps per millisecond=99 ) properties seen :0
// Phase 1: matrix 692 rows 733 cols
[2024-05-25 06:00:37] [INFO ] Computed 41 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 601/687 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/687 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/690 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/690 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 687/1377 variables, 690/731 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1377 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 48/1425 variables, 43/774 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1425 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/1425 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1425/1425 variables, and 774 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2617 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 733/733 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 601/687 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/687 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/690 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/690 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 687/1377 variables, 690/731 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1377 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 48/1425 variables, 43/774 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1425 variables, 5/779 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1425 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1425 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1425/1425 variables, and 779 constraints, problems are : Problem set: 0 solved, 5 unsolved in 8428 ms.
Refiners :[Generalized P Invariants (flows): 41/41 constraints, State Equation: 733/733 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 11166ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 3361 ms.
Support contains 86 out of 733 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 733/733 places, 692/692 transitions.
Applied a total of 0 rules in 48 ms. Remains 733 /733 variables (removed 0) and now considering 692/692 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 733/733 places, 692/692 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 733/733 places, 692/692 transitions.
Applied a total of 0 rules in 49 ms. Remains 733 /733 variables (removed 0) and now considering 692/692 (removed 0) transitions.
[2024-05-25 06:00:51] [INFO ] Invariant cache hit.
[2024-05-25 06:00:52] [INFO ] Implicit Places using invariants in 668 ms returned []
[2024-05-25 06:00:52] [INFO ] Invariant cache hit.
[2024-05-25 06:00:54] [INFO ] Implicit Places using invariants and state equation in 2547 ms returned []
Implicit Place search using SMT with State Equation took 3229 ms to find 0 implicit places.
[2024-05-25 06:00:54] [INFO ] Redundant transitions in 44 ms returned []
Running 669 sub problems to find dead transitions.
[2024-05-25 06:00:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/710 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/710 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 669 unsolved
At refinement iteration 2 (OVERLAPS) 23/733 variables, 35/41 constraints. Problems are: Problem set: 0 solved, 669 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/733 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 669 unsolved
SMT process timed out in 30354ms, After SMT, problems are : Problem set: 0 solved, 669 unsolved
Search for dead transitions found 0 dead transitions in 30368ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33707 ms. Remains : 733/733 places, 692/692 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 731 transition count 663
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 60 place count 702 transition count 663
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 59 Pre rules applied. Total rules applied 60 place count 702 transition count 604
Deduced a syphon composed of 59 places in 5 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 178 place count 643 transition count 604
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 17 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 188 place count 638 transition count 599
Applied a total of 188 rules in 142 ms. Remains 638 /733 variables (removed 95) and now considering 599/692 (removed 93) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 599 rows 638 cols
[2024-05-25 06:01:25] [INFO ] Computed 39 invariants in 6 ms
[2024-05-25 06:01:25] [INFO ] [Real]Absence check using 0 positive and 39 generalized place invariants in 139 ms returned sat
[2024-05-25 06:01:25] [INFO ] After 369ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-25 06:01:26] [INFO ] [Nat]Absence check using 0 positive and 39 generalized place invariants in 127 ms returned sat
[2024-05-25 06:01:27] [INFO ] After 1021ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-25 06:01:28] [INFO ] After 1883ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-25 06:01:28] [INFO ] After 2983ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 3564 ms.
[2024-05-25 06:01:28] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-25 06:01:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 733 places, 692 transitions and 2185 arcs took 9 ms.
[2024-05-25 06:01:29] [INFO ] Flatten gal took : 127 ms
Total runtime 67332 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running HirschbergSinclair-PT-35

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: 733
TRANSITIONS: 692
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.018s, Sys 0.000s]


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: 617
MODEL NAME: /home/mcc/execution/414/model
733 places, 692 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..
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..
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..
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..
Creating all event NSFs..
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..
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.
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..

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

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-35"
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-35, 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-171649586600111"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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