fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r267-smll-171654406000239
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for Peterson-COL-6

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9326.716 3600000.00 14037588.00 581.60 TFTTTT??TTFF?FFT normal

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.r267-smll-171654406000239.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 Peterson-COL-6, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654406000239
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 8.9K Apr 12 02:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 12 02:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 12 02:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 02:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 03:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 12 03:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 46K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716752433115

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-6
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 19:40:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 19:40:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 19:40:35] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-26 19:40:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 19:40:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 944 ms
[2024-05-26 19:40:36] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 1372 PT places and 2247.0 transition bindings in 32 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 39 ms.
Reduction of identical properties reduced properties to check from 16 to 14
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-6-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-6-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-6-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 19:40:36] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 6 ms.
[2024-05-26 19:40:36] [INFO ] Skeletonized 13 HLPN properties in 1 ms.
Remains 2 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 296 steps (0 resets) in 24 ms. (11 steps per ms) remains 0/2 properties
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-26 19:40:36] [INFO ] Flatten gal took : 47 ms
[2024-05-26 19:40:36] [INFO ] Flatten gal took : 3 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Domain [Process(7), Tour(6), Process(7)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 6)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-26 19:40:36] [INFO ] Unfolded HLPN to a Petri net with 1372 places and 2114 transitions 6608 arcs in 106 ms.
[2024-05-26 19:40:36] [INFO ] Unfolded 13 HLPN properties in 5 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 42 places in 24 ms
Reduce places removed 42 places and 84 transitions.
FORMULA Peterson-COL-6-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 4118 ms. (9 steps per ms) remains 3/12 properties
FORMULA Peterson-COL-6-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 2836 ms. (14 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 6427 ms. (6 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5383 ms. (7 steps per ms) remains 3/3 properties
[2024-05-26 19:40:42] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-05-26 19:40:42] [INFO ] Computed 27 invariants in 46 ms
[2024-05-26 19:40:42] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1330 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1330 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1330 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1820/3150 variables, 1330/1357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3150 variables, 330/1687 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3150 variables, 0/1687 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/3150 variables, 0/1687 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3150/3150 variables, and 1687 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4024 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1330/1330 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1330 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1330 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 19:40:53] [INFO ] Deduced a trap composed of 42 places in 1277 ms of which 128 ms to minimize.
[2024-05-26 19:40:55] [INFO ] Deduced a trap composed of 143 places in 1136 ms of which 13 ms to minimize.
[2024-05-26 19:40:56] [INFO ] Deduced a trap composed of 135 places in 992 ms of which 12 ms to minimize.
[2024-05-26 19:40:57] [INFO ] Deduced a trap composed of 12 places in 924 ms of which 12 ms to minimize.
SMT process timed out in 14315ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1330 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 96 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 1330/1330 places, 2030/2030 transitions.
RANDOM walk for 40000 steps (8 resets) in 1091 ms. (36 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3329 ms. (12 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4984 ms. (8 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5476 ms. (7 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 266408 steps, run timeout after 9001 ms. (steps per millisecond=29 ) properties seen :0 out of 3
Probabilistic random walk after 266408 steps, saw 161003 distinct states, run finished after 9008 ms. (steps per millisecond=29 ) properties seen :0
[2024-05-26 19:41:10] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-26 19:41:10] [INFO ] Invariant cache hit.
[2024-05-26 19:41:10] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1330 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1330 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1330 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1820/3150 variables, 1330/1357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3150 variables, 330/1687 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3150 variables, 0/1687 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/3150 variables, 0/1687 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3150/3150 variables, and 1687 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3905 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1330/1330 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1330 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1330 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 19:41:20] [INFO ] Deduced a trap composed of 70 places in 1326 ms of which 11 ms to minimize.
[2024-05-26 19:41:21] [INFO ] Deduced a trap composed of 25 places in 1172 ms of which 12 ms to minimize.
[2024-05-26 19:41:22] [INFO ] Deduced a trap composed of 22 places in 987 ms of which 12 ms to minimize.
[2024-05-26 19:41:23] [INFO ] Deduced a trap composed of 22 places in 1102 ms of which 14 ms to minimize.
[2024-05-26 19:41:24] [INFO ] Deduced a trap composed of 110 places in 1006 ms of which 11 ms to minimize.
[2024-05-26 19:41:25] [INFO ] Deduced a trap composed of 48 places in 1038 ms of which 12 ms to minimize.
[2024-05-26 19:41:26] [INFO ] Deduced a trap composed of 98 places in 1023 ms of which 11 ms to minimize.
[2024-05-26 19:41:27] [INFO ] Deduced a trap composed of 27 places in 1035 ms of which 12 ms to minimize.
[2024-05-26 19:41:28] [INFO ] Deduced a trap composed of 107 places in 1047 ms of which 12 ms to minimize.
[2024-05-26 19:41:29] [INFO ] Deduced a trap composed of 62 places in 935 ms of which 13 ms to minimize.
[2024-05-26 19:41:30] [INFO ] Deduced a trap composed of 57 places in 925 ms of which 10 ms to minimize.
[2024-05-26 19:41:31] [INFO ] Deduced a trap composed of 130 places in 932 ms of which 11 ms to minimize.
[2024-05-26 19:41:32] [INFO ] Deduced a trap composed of 119 places in 835 ms of which 11 ms to minimize.
[2024-05-26 19:41:33] [INFO ] Deduced a trap composed of 50 places in 1001 ms of which 11 ms to minimize.
[2024-05-26 19:41:34] [INFO ] Deduced a trap composed of 22 places in 960 ms of which 11 ms to minimize.
[2024-05-26 19:41:35] [INFO ] Deduced a trap composed of 41 places in 975 ms of which 12 ms to minimize.
[2024-05-26 19:41:36] [INFO ] Deduced a trap composed of 87 places in 865 ms of which 10 ms to minimize.
[2024-05-26 19:41:37] [INFO ] Deduced a trap composed of 24 places in 965 ms of which 11 ms to minimize.
[2024-05-26 19:41:38] [INFO ] Deduced a trap composed of 24 places in 805 ms of which 10 ms to minimize.
[2024-05-26 19:41:39] [INFO ] Deduced a trap composed of 152 places in 816 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1330 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 19:41:40] [INFO ] Deduced a trap composed of 71 places in 1019 ms of which 12 ms to minimize.
[2024-05-26 19:41:41] [INFO ] Deduced a trap composed of 95 places in 1008 ms of which 12 ms to minimize.
[2024-05-26 19:41:42] [INFO ] Deduced a trap composed of 235 places in 870 ms of which 11 ms to minimize.
[2024-05-26 19:41:43] [INFO ] Deduced a trap composed of 20 places in 1029 ms of which 12 ms to minimize.
[2024-05-26 19:41:45] [INFO ] Deduced a trap composed of 29 places in 1116 ms of which 11 ms to minimize.
[2024-05-26 19:41:46] [INFO ] Deduced a trap composed of 56 places in 1124 ms of which 11 ms to minimize.
[2024-05-26 19:41:47] [INFO ] Deduced a trap composed of 364 places in 1023 ms of which 11 ms to minimize.
[2024-05-26 19:41:48] [INFO ] Deduced a trap composed of 107 places in 1030 ms of which 12 ms to minimize.
[2024-05-26 19:41:49] [INFO ] Deduced a trap composed of 59 places in 1028 ms of which 11 ms to minimize.
[2024-05-26 19:41:50] [INFO ] Deduced a trap composed of 171 places in 1174 ms of which 11 ms to minimize.
[2024-05-26 19:41:51] [INFO ] Deduced a trap composed of 79 places in 1125 ms of which 16 ms to minimize.
[2024-05-26 19:41:52] [INFO ] Deduced a trap composed of 108 places in 943 ms of which 10 ms to minimize.
[2024-05-26 19:41:53] [INFO ] Deduced a trap composed of 63 places in 1003 ms of which 10 ms to minimize.
[2024-05-26 19:41:55] [INFO ] Deduced a trap composed of 59 places in 1015 ms of which 11 ms to minimize.
[2024-05-26 19:41:56] [INFO ] Deduced a trap composed of 240 places in 1108 ms of which 16 ms to minimize.
[2024-05-26 19:41:57] [INFO ] Deduced a trap composed of 41 places in 1199 ms of which 11 ms to minimize.
[2024-05-26 19:41:58] [INFO ] Deduced a trap composed of 58 places in 1016 ms of which 16 ms to minimize.
[2024-05-26 19:41:59] [INFO ] Deduced a trap composed of 208 places in 1171 ms of which 15 ms to minimize.
[2024-05-26 19:42:00] [INFO ] Deduced a trap composed of 54 places in 989 ms of which 11 ms to minimize.
[2024-05-26 19:42:01] [INFO ] Deduced a trap composed of 78 places in 1029 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1330 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 19:42:03] [INFO ] Deduced a trap composed of 12 places in 1162 ms of which 11 ms to minimize.
SMT process timed out in 53447ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1330 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 49 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 34 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-05-26 19:42:03] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-26 19:42:03] [INFO ] Invariant cache hit.
[2024-05-26 19:42:03] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-26 19:42:03] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-26 19:42:03] [INFO ] Invariant cache hit.
[2024-05-26 19:42:05] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-05-26 19:42:05] [INFO ] Implicit Places using invariants and state equation in 1221 ms returned []
Implicit Place search using SMT with State Equation took 1525 ms to find 0 implicit places.
[2024-05-26 19:42:05] [INFO ] Redundant transitions in 123 ms returned []
Running 2023 sub problems to find dead transitions.
[2024-05-26 19:42:05] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-05-26 19:42:05] [INFO ] Invariant cache hit.
[2024-05-26 19:42:05] [INFO ] State equation strengthened by 330 read => feed constraints.
(s11 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30953ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30982ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32683 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 210 transitions
Reduce isomorphic transitions removed 210 transitions.
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 1330 transition count 1820
Applied a total of 210 rules in 48 ms. Remains 1330 /1330 variables (removed 0) and now considering 1820/2030 (removed 210) transitions.
Running SMT prover for 3 properties.
[2024-05-26 19:42:40] [INFO ] Invariant cache hit.
[2024-05-26 19:42:40] [INFO ] [Real]Absence check using 20 positive place invariants in 34 ms returned sat
[2024-05-26 19:42:40] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 19 ms returned sat
[2024-05-26 19:42:40] [INFO ] After 555ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-26 19:42:41] [INFO ] [Nat]Absence check using 20 positive place invariants in 30 ms returned sat
[2024-05-26 19:42:41] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 17 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-05-26 19:42:42] [INFO ] After 878ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :3
[2024-05-26 19:42:42] [INFO ] After 1538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 6620 ms.
[2024-05-26 19:42:43] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 47 ms.
[2024-05-26 19:42:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1330 places, 2030 transitions and 6272 arcs took 20 ms.
[2024-05-26 19:42:43] [INFO ] Flatten gal took : 291 ms
Total runtime 128453 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Peterson-COL-6

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1330
TRANSITIONS: 2030
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.048s, Sys 0.005s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.010s, 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: 723
MODEL NAME: /home/mcc/execution/415/model
1330 places, 2030 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.

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

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="Peterson-COL-6"
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 Peterson-COL-6, 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 r267-smll-171654406000239"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-6.tgz
mv Peterson-COL-6 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 ;