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

About the Execution of GreatSPN+red for PermAdmissibility-PT-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15231.432 3600000.00 11611554.00 7545.30 ???T???T?F?????? 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-171654405800162.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 PermAdmissibility-PT-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654405800162
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 11K Apr 12 09:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 09:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K Apr 12 09:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 268K Apr 12 09:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 09:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 12 09:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113K Apr 12 09:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 575K Apr 12 09:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 336K 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 PermAdmissibility-PT-02-CTLFireability-2024-00
FORMULA_NAME PermAdmissibility-PT-02-CTLFireability-2024-01
FORMULA_NAME PermAdmissibility-PT-02-CTLFireability-2024-02
FORMULA_NAME PermAdmissibility-PT-02-CTLFireability-2024-03
FORMULA_NAME PermAdmissibility-PT-02-CTLFireability-2024-04
FORMULA_NAME PermAdmissibility-PT-02-CTLFireability-2024-05
FORMULA_NAME PermAdmissibility-PT-02-CTLFireability-2024-06
FORMULA_NAME PermAdmissibility-PT-02-CTLFireability-2024-07
FORMULA_NAME PermAdmissibility-PT-02-CTLFireability-2024-08
FORMULA_NAME PermAdmissibility-PT-02-CTLFireability-2024-09
FORMULA_NAME PermAdmissibility-PT-02-CTLFireability-2024-10
FORMULA_NAME PermAdmissibility-PT-02-CTLFireability-2024-11
FORMULA_NAME PermAdmissibility-PT-02-CTLFireability-2024-12
FORMULA_NAME PermAdmissibility-PT-02-CTLFireability-2024-13
FORMULA_NAME PermAdmissibility-PT-02-CTLFireability-2024-14
FORMULA_NAME PermAdmissibility-PT-02-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716682532759

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 00:15:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 00:15:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 00:15:35] [INFO ] Load time of PNML (sax parser for PT used): 242 ms
[2024-05-26 00:15:35] [INFO ] Transformed 168 places.
[2024-05-26 00:15:35] [INFO ] Transformed 592 transitions.
[2024-05-26 00:15:35] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 581 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 66 ms.
Support contains 104 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 104 transition count 592
Applied a total of 64 rules in 62 ms. Remains 104 /168 variables (removed 64) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 104 cols
[2024-05-26 00:15:36] [INFO ] Computed 16 invariants in 50 ms
[2024-05-26 00:15:36] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-05-26 00:15:36] [INFO ] Invariant cache hit.
[2024-05-26 00:15:37] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 1006 ms to find 0 implicit places.
Running 588 sub problems to find dead transitions.
[2024-05-26 00:15:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (OVERLAPS) 592/696 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/696 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/696 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 588 unsolved
No progress, stopping.
After SMT solving in domain Real declared 696/696 variables, and 120 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 588 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 4 (OVERLAPS) 592/696 variables, 104/120 constraints. Problems are: Problem set: 0 solved, 588 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/696 variables, 588/708 constraints. Problems are: Problem set: 0 solved, 588 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 696/696 variables, and 708 constraints, problems are : Problem set: 0 solved, 588 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 16/16 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 588/588 constraints, Known Traps: 0/0 constraints]
After SMT, in 62293ms problems are : Problem set: 0 solved, 588 unsolved
Search for dead transitions found 0 dead transitions in 62358ms
Starting structural reductions in LTL mode, iteration 1 : 104/168 places, 592/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63485 ms. Remains : 104/168 places, 592/592 transitions.
Support contains 104 out of 104 places after structural reductions.
[2024-05-26 00:16:40] [INFO ] Flatten gal took : 194 ms
[2024-05-26 00:16:40] [INFO ] Flatten gal took : 142 ms
[2024-05-26 00:16:41] [INFO ] Input system was already deterministic with 592 transitions.
Reduction of identical properties reduced properties to check from 65 to 62
RANDOM walk for 40000 steps (849 resets) in 2997 ms. (13 steps per ms) remains 6/62 properties
BEST_FIRST walk for 40004 steps (186 resets) in 2255 ms. (17 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (189 resets) in 130 ms. (305 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (225 resets) in 202 ms. (197 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (192 resets) in 141 ms. (281 steps per ms) remains 1/2 properties
[2024-05-26 00:16:43] [INFO ] Invariant cache hit.
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Real declared 23/696 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 35 ms.
Refiners :[Generalized P Invariants (flows): 0/16 constraints, State Equation: 0/104 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 190ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-26 00:16:43] [INFO ] Flatten gal took : 81 ms
[2024-05-26 00:16:43] [INFO ] Flatten gal took : 80 ms
[2024-05-26 00:16:44] [INFO ] Input system was already deterministic with 592 transitions.
Computed a total of 104 stabilizing places and 592 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 592
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA PermAdmissibility-PT-02-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Applied a total of 0 rules in 5 ms. Remains 104 /104 variables (removed 0) and now considering 592/592 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 104/104 places, 592/592 transitions.
[2024-05-26 00:16:44] [INFO ] Flatten gal took : 40 ms
[2024-05-26 00:16:44] [INFO ] Flatten gal took : 43 ms
[2024-05-26 00:16:44] [INFO ] Input system was already deterministic with 592 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 91 transition count 468
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 91 transition count 468
Applied a total of 26 rules in 50 ms. Remains 91 /104 variables (removed 13) and now considering 468/592 (removed 124) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 91/104 places, 468/592 transitions.
[2024-05-26 00:16:44] [INFO ] Flatten gal took : 28 ms
[2024-05-26 00:16:44] [INFO ] Flatten gal took : 33 ms
[2024-05-26 00:16:44] [INFO ] Input system was already deterministic with 468 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 592/592 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 104/104 places, 592/592 transitions.
[2024-05-26 00:16:44] [INFO ] Flatten gal took : 37 ms
[2024-05-26 00:16:44] [INFO ] Flatten gal took : 44 ms
[2024-05-26 00:16:45] [INFO ] Input system was already deterministic with 592 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 592/592 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 104/104 places, 592/592 transitions.
[2024-05-26 00:16:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-26 00:16:45] [INFO ] Flatten gal took : 40 ms
FORMULA PermAdmissibility-PT-02-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 00:16:45] [INFO ] Flatten gal took : 37 ms
[2024-05-26 00:16:45] [INFO ] Input system was already deterministic with 592 transitions.
Support contains 0 out of 104 places (down from 89) after GAL structural reductions.
Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 86 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.4 ms
Discarding 18 places :
Also discarding 128 output transitions
Drop transitions (Output transitions of discarded places.) removed 128 transitions
Applied a total of 1 rules in 42 ms. Remains 86 /104 variables (removed 18) and now considering 464/592 (removed 128) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 86/104 places, 464/592 transitions.
[2024-05-26 00:16:45] [INFO ] Flatten gal took : 23 ms
[2024-05-26 00:16:45] [INFO ] Flatten gal took : 25 ms
[2024-05-26 00:16:45] [INFO ] Input system was already deterministic with 464 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 91 transition count 468
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 91 transition count 468
Applied a total of 26 rules in 39 ms. Remains 91 /104 variables (removed 13) and now considering 468/592 (removed 124) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 91/104 places, 468/592 transitions.
[2024-05-26 00:16:45] [INFO ] Flatten gal took : 22 ms
[2024-05-26 00:16:45] [INFO ] Flatten gal took : 27 ms
[2024-05-26 00:16:45] [INFO ] Input system was already deterministic with 468 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 91 transition count 468
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 91 transition count 468
Applied a total of 26 rules in 26 ms. Remains 91 /104 variables (removed 13) and now considering 468/592 (removed 124) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 91/104 places, 468/592 transitions.
[2024-05-26 00:16:45] [INFO ] Flatten gal took : 24 ms
[2024-05-26 00:16:45] [INFO ] Flatten gal took : 27 ms
[2024-05-26 00:16:45] [INFO ] Input system was already deterministic with 468 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 32 are kept as prefixes of interest. Removing 72 places using SCC suffix rule.2 ms
Discarding 72 places :
Also discarding 512 output transitions
Drop transitions (Output transitions of discarded places.) removed 512 transitions
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 27 transition count 52
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 27 transition count 52
Applied a total of 11 rules in 7 ms. Remains 27 /104 variables (removed 77) and now considering 52/592 (removed 540) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 27/104 places, 52/592 transitions.
[2024-05-26 00:16:45] [INFO ] Flatten gal took : 3 ms
[2024-05-26 00:16:45] [INFO ] Flatten gal took : 3 ms
[2024-05-26 00:16:45] [INFO ] Input system was already deterministic with 52 transitions.
RANDOM walk for 63 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/1 properties
FORMULA PermAdmissibility-PT-02-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 89 transition count 410
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 89 transition count 410
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 86 transition count 366
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 86 transition count 366
Applied a total of 36 rules in 14 ms. Remains 86 /104 variables (removed 18) and now considering 366/592 (removed 226) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 86/104 places, 366/592 transitions.
[2024-05-26 00:16:45] [INFO ] Flatten gal took : 16 ms
[2024-05-26 00:16:45] [INFO ] Flatten gal took : 17 ms
[2024-05-26 00:16:45] [INFO ] Input system was already deterministic with 366 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 82 transition count 360
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 82 transition count 360
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 62 place count 64 transition count 162
Iterating global reduction 0 with 18 rules applied. Total rules applied 80 place count 64 transition count 162
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 63 transition count 154
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 63 transition count 154
Applied a total of 82 rules in 26 ms. Remains 63 /104 variables (removed 41) and now considering 154/592 (removed 438) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 63/104 places, 154/592 transitions.
[2024-05-26 00:16:45] [INFO ] Flatten gal took : 7 ms
[2024-05-26 00:16:45] [INFO ] Flatten gal took : 8 ms
[2024-05-26 00:16:45] [INFO ] Input system was already deterministic with 154 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 92 transition count 436
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 92 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 90 transition count 406
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 90 transition count 406
Applied a total of 28 rules in 26 ms. Remains 90 /104 variables (removed 14) and now considering 406/592 (removed 186) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 90/104 places, 406/592 transitions.
[2024-05-26 00:16:45] [INFO ] Flatten gal took : 17 ms
[2024-05-26 00:16:46] [INFO ] Flatten gal took : 19 ms
[2024-05-26 00:16:46] [INFO ] Input system was already deterministic with 406 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 86 transition count 388
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 86 transition count 388
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 46 place count 76 transition count 252
Iterating global reduction 0 with 10 rules applied. Total rules applied 56 place count 76 transition count 252
Applied a total of 56 rules in 8 ms. Remains 76 /104 variables (removed 28) and now considering 252/592 (removed 340) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 76/104 places, 252/592 transitions.
[2024-05-26 00:16:46] [INFO ] Flatten gal took : 11 ms
[2024-05-26 00:16:46] [INFO ] Flatten gal took : 12 ms
[2024-05-26 00:16:46] [INFO ] Input system was already deterministic with 252 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 83 transition count 372
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 83 transition count 372
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 56 place count 69 transition count 198
Iterating global reduction 0 with 14 rules applied. Total rules applied 70 place count 69 transition count 198
Applied a total of 70 rules in 19 ms. Remains 69 /104 variables (removed 35) and now considering 198/592 (removed 394) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 69/104 places, 198/592 transitions.
[2024-05-26 00:16:46] [INFO ] Flatten gal took : 8 ms
[2024-05-26 00:16:46] [INFO ] Flatten gal took : 10 ms
[2024-05-26 00:16:46] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 96 transition count 480
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 96 transition count 480
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 95 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 95 transition count 464
Applied a total of 18 rules in 7 ms. Remains 95 /104 variables (removed 9) and now considering 464/592 (removed 128) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 95/104 places, 464/592 transitions.
[2024-05-26 00:16:46] [INFO ] Flatten gal took : 19 ms
[2024-05-26 00:16:46] [INFO ] Flatten gal took : 22 ms
[2024-05-26 00:16:46] [INFO ] Input system was already deterministic with 464 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 104/104 places, 592/592 transitions.
Graph (complete) has 975 edges and 104 vertex of which 22 are kept as prefixes of interest. Removing 82 places using SCC suffix rule.1 ms
Discarding 82 places :
Also discarding 544 output transitions
Drop transitions (Output transitions of discarded places.) removed 544 transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 19 transition count 28
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 19 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 9 place count 17 transition count 20
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 17 transition count 20
Applied a total of 11 rules in 7 ms. Remains 17 /104 variables (removed 87) and now considering 20/592 (removed 572) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 17/104 places, 20/592 transitions.
[2024-05-26 00:16:46] [INFO ] Flatten gal took : 2 ms
[2024-05-26 00:16:46] [INFO ] Flatten gal took : 1 ms
[2024-05-26 00:16:46] [INFO ] Input system was already deterministic with 20 transitions.
[2024-05-26 00:16:46] [INFO ] Flatten gal took : 55 ms
[2024-05-26 00:16:46] [INFO ] Flatten gal took : 52 ms
[2024-05-26 00:16:46] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 37 ms.
[2024-05-26 00:16:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 104 places, 592 transitions and 2944 arcs took 8 ms.
Total runtime 71495 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PermAdmissibility-PT-02

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/412/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: 564
MODEL NAME: /home/mcc/execution/412/model
104 places, 592 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.
Building monolithic NSF...

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="PermAdmissibility-PT-02"
export BK_EXAMINATION="CTLFireability"
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 PermAdmissibility-PT-02, examination is CTLFireability"
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-171654405800162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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