fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r289-tajo-171654445800382
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for PolyORBNT-COL-S05J40

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
375.128 10789.00 25455.00 45.10 TTTFFTFFFTFTFTTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445800382.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBNT-COL-S05J40, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445800382
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.7K Apr 12 09:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 09:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 09:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 12 09:51 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 4.2K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 10:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 12 10:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 10:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 10:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 93K 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 PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-00
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-01
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-02
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-03
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-04
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-05
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-06
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-07
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-08
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-09
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-10
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-11
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-12
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-13
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-14
FORMULA_NAME PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716877754299

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J40
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 06:29:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 06:29:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:29:15] [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-28 06:29:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 06:29:17] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1137 ms
[2024-05-28 06:29:17] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 669 PT places and 1712.0 transition bindings in 51 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 06:29:17] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 4 ms.
[2024-05-28 06:29:17] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40010 steps (3182 resets) in 2880 ms. (13 steps per ms) remains 14/16 properties
BEST_FIRST walk for 40004 steps (1003 resets) in 681 ms. (58 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1004 resets) in 278 ms. (143 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1022 resets) in 341 ms. (116 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (1284 resets) in 865 ms. (46 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1700 resets) in 715 ms. (55 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (989 resets) in 329 ms. (121 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (869 resets) in 125 ms. (317 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (1562 resets) in 265 ms. (150 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1698 resets) in 151 ms. (263 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (1703 resets) in 272 ms. (146 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (1014 resets) in 120 ms. (330 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (997 resets) in 150 ms. (264 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40001 steps (988 resets) in 117 ms. (338 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40006 steps (1673 resets) in 141 ms. (281 steps per ms) remains 14/14 properties
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 06:29:19] [INFO ] Computed 13 invariants in 5 ms
[2024-05-28 06:29:19] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-01 is UNSAT
Problem PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-03 is UNSAT
Problem PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-05 is UNSAT
Problem PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-06 is UNSAT
Problem PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-09 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 5/5 constraints. Problems are: Problem set: 5 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 4/9 constraints. Problems are: Problem set: 5 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 5 solved, 9 unsolved
Problem PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-02 is UNSAT
Problem PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-13 is UNSAT
Problem PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-15 is UNSAT
At refinement iteration 3 (OVERLAPS) 1/47 variables, 1/10 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 8 solved, 6 unsolved
Problem PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-04 is UNSAT
Problem PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-10 is UNSAT
Problem PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-14 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/48 variables, 3/13 constraints. Problems are: Problem set: 11 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/13 constraints. Problems are: Problem set: 11 solved, 3 unsolved
Problem PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-08 is UNSAT
At refinement iteration 7 (OVERLAPS) 38/86 variables, 48/61 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 1/62 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 0/62 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/86 variables, 0/62 constraints. Problems are: Problem set: 12 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 62 constraints, problems are : Problem set: 12 solved, 2 unsolved in 762 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 14/28 variables, 3/3 constraints. Problems are: Problem set: 12 solved, 2 unsolved
[2024-05-28 06:29:20] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 20 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 1/4 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/6 constraints. Problems are: Problem set: 12 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 12 solved, 2 unsolved
Problem PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-11 is UNSAT
At refinement iteration 6 (OVERLAPS) 17/47 variables, 7/13 constraints. Problems are: Problem set: 13 solved, 1 unsolved
[2024-05-28 06:29:21] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 2 ms to minimize.
[2024-05-28 06:29:21] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 2/15 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/48 variables, 1/16 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/16 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 38/86 variables, 48/64 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/86 variables, 1/65 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/86 variables, 1/66 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/86 variables, 0/66 constraints. Problems are: Problem set: 13 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/86 variables, 0/66 constraints. Problems are: Problem set: 13 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 66 constraints, problems are : Problem set: 13 solved, 1 unsolved in 443 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/14 constraints, Known Traps: 3/3 constraints]
After SMT, in 1302ms problems are : Problem set: 13 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 38/38 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 47 transition count 36
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 45 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 44 transition count 35
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 7 place count 44 transition count 32
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 13 place count 41 transition count 32
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 40 transition count 31
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 40 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 40 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 39 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 21 place count 37 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 36 transition count 30
Applied a total of 23 rules in 70 ms. Remains 36 /48 variables (removed 12) and now considering 30/38 (removed 8) transitions.
Running 27 sub problems to find dead transitions.
// Phase 1: matrix 30 rows 36 cols
[2024-05-28 06:29:21] [INFO ] Computed 12 invariants in 2 ms
[2024-05-28 06:29:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 1/36 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 30/66 variables, 36/48 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 0/66 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 66/66 variables, and 49 constraints, problems are : Problem set: 0 solved, 27 unsolved in 972 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-28 06:29:22] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (OVERLAPS) 1/36 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 30/66 variables, 36/49 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 27/77 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-28 06:29:23] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/66 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (OVERLAPS) 0/66 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 66/66 variables, and 78 constraints, problems are : Problem set: 0 solved, 27 unsolved in 1988 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 36/36 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 2/2 constraints]
After SMT, in 3000ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 3001ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3086 ms. Remains : 36/48 places, 30/38 transitions.
RANDOM walk for 40004 steps (4683 resets) in 216 ms. (184 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40005 steps (1362 resets) in 262 ms. (152 steps per ms) remains 1/1 properties
Probably explored full state space saw : 359 states, properties seen :0
Probabilistic random walk after 955 steps, saw 359 distinct states, run finished after 25 ms. (steps per millisecond=38 ) properties seen :0
Explored full state space saw : 359 states, properties seen :0
Exhaustive walk after 955 steps, saw 359 distinct states, run finished after 8 ms. (steps per millisecond=119 ) properties seen :0
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
[2024-05-28 06:29:24] [INFO ] Flatten gal took : 53 ms
[2024-05-28 06:29:24] [INFO ] Flatten gal took : 9 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 )
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-01 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-02 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-03 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-04 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-05 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-06 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-08 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-09 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-10 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-11 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-12 FALSE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-13 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-14 TRUE TECHNIQUES CPN_APPROX
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-15 TRUE TECHNIQUES CPN_APPROX
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 06:29:24] [INFO ] Unfolded HLPN to a Petri net with 669 places and 1630 transitions 10784 arcs in 102 ms.
[2024-05-28 06:29:24] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Deduced a syphon composed of 40 places in 17 ms
Reduce places removed 40 places and 40 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
RANDOM walk for 3773 steps (264 resets) in 78 ms. (47 steps per ms) remains 0/2 properties
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 9164 ms.
ITS solved all properties within timeout

BK_STOP 1716877765088

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S05J40"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBNT-COL-S05J40, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445800382"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J40.tgz
mv PolyORBNT-COL-S05J40 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;