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-171654445700345.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 PolyORBLF-PT-S06J06T06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445700345
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 20K Apr 11 17:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 11 17:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 340K Apr 11 17:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Apr 11 17:18 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 9.1K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 28K Apr 11 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 374K Apr 11 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 11 17:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 11M 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 PolyORBLF-PT-S06J06T06-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716873525798

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 05:18:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 05:18:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 05:18:48] [INFO ] Load time of PNML (sax parser for PT used): 755 ms
[2024-05-28 05:18:48] [INFO ] Transformed 700 places.
[2024-05-28 05:18:48] [INFO ] Transformed 10740 transitions.
[2024-05-28 05:18:48] [INFO ] Parsed PT model containing 700 places and 10740 transitions and 89778 arcs in 1054 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Support contains 494 out of 700 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 694 transition count 2664
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 694 transition count 2664
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 688 transition count 2658
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 688 transition count 2658
Applied a total of 24 rules in 140 ms. Remains 688 /700 variables (removed 12) and now considering 2658/2670 (removed 12) transitions.
Running 2652 sub problems to find dead transitions.
[2024-05-28 05:18:48] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
// Phase 1: matrix 2622 rows 688 cols
[2024-05-28 05:18:49] [INFO ] Computed 58 invariants in 171 ms
[2024-05-28 05:18:49] [INFO ] State equation strengthened by 168 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 38245ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 38304ms
[2024-05-28 05:19:27] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 05:19:27] [INFO ] Invariant cache hit.
[2024-05-28 05:19:27] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-28 05:19:27] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 05:19:27] [INFO ] Invariant cache hit.
[2024-05-28 05:19:30] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 05:19:45] [INFO ] Implicit Places using invariants and state equation in 18089 ms returned []
Implicit Place search using SMT with State Equation took 18463 ms to find 0 implicit places.
Running 2652 sub problems to find dead transitions.
[2024-05-28 05:19:45] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 05:19:45] [INFO ] Invariant cache hit.
[2024-05-28 05:19:45] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/676 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
[2024-05-28 05:20:28] [INFO ] Deduced a trap composed of 110 places in 229 ms of which 28 ms to minimize.
[2024-05-28 05:20:30] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 676/3310 variables, and 43 constraints, problems are : Problem set: 0 solved, 2652 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 24/41 constraints, State Equation: 0/688 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2652/1398 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2652 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/676 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/676 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
[2024-05-28 05:21:02] [INFO ] Deduced a trap composed of 15 places in 644 ms of which 5 ms to minimize.
[2024-05-28 05:21:03] [INFO ] Deduced a trap composed of 47 places in 596 ms of which 4 ms to minimize.
[2024-05-28 05:21:03] [INFO ] Deduced a trap composed of 92 places in 545 ms of which 3 ms to minimize.
[2024-05-28 05:21:04] [INFO ] Deduced a trap composed of 41 places in 574 ms of which 4 ms to minimize.
[2024-05-28 05:21:04] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 1 ms to minimize.
[2024-05-28 05:21:04] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 1 ms to minimize.
[2024-05-28 05:21:05] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 2 ms to minimize.
[2024-05-28 05:21:05] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 676/3310 variables, and 51 constraints, problems are : Problem set: 0 solved, 2652 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 24/41 constraints, State Equation: 0/688 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1398 constraints, Known Traps: 10/10 constraints]
After SMT, in 81302ms problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 81339ms
Starting structural reductions in LTL mode, iteration 1 : 688/700 places, 2658/2670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138341 ms. Remains : 688/700 places, 2658/2670 transitions.
Support contains 494 out of 688 places after structural reductions.
[2024-05-28 05:21:07] [INFO ] Flatten gal took : 384 ms
[2024-05-28 05:21:07] [INFO ] Flatten gal took : 221 ms
[2024-05-28 05:21:08] [INFO ] Input system was already deterministic with 2658 transitions.
RANDOM walk for 40000 steps (242 resets) in 3721 ms. (10 steps per ms) remains 52/68 properties
BEST_FIRST walk for 4002 steps (9 resets) in 48 ms. (81 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (13 resets) in 40 ms. (97 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (11 resets) in 40 ms. (97 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (112 resets) in 115 ms. (34 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (12 resets) in 56 ms. (70 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (12 resets) in 37 ms. (105 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (17 resets) in 42 ms. (93 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (14 resets) in 48 ms. (81 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (10 resets) in 39 ms. (100 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (12 resets) in 49 ms. (80 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (13 resets) in 41 ms. (95 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (11 resets) in 36 ms. (108 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (15 resets) in 40 ms. (97 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (12 resets) in 39 ms. (100 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (12 resets) in 34 ms. (114 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (9 resets) in 68 ms. (58 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (10 resets) in 48 ms. (81 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (13 resets) in 49 ms. (80 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (112 resets) in 50 ms. (78 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (16 resets) in 58 ms. (67 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (12 resets) in 41 ms. (95 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (16 resets) in 50 ms. (78 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (18 resets) in 40 ms. (97 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (30 resets) in 46 ms. (85 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (13 resets) in 59 ms. (66 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (13 resets) in 59 ms. (66 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (16 resets) in 41 ms. (95 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (12 resets) in 46 ms. (85 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (9 resets) in 48 ms. (81 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (11 resets) in 46 ms. (85 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (11 resets) in 54 ms. (72 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (10 resets) in 41 ms. (95 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (20 resets) in 47 ms. (83 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (16 resets) in 51 ms. (76 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (12 resets) in 37 ms. (105 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (10 resets) in 37 ms. (105 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (14 resets) in 57 ms. (68 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (14 resets) in 57 ms. (69 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (14 resets) in 39 ms. (100 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (18 resets) in 47 ms. (83 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (19 resets) in 52 ms. (75 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (13 resets) in 40 ms. (97 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (17 resets) in 41 ms. (95 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (15 resets) in 46 ms. (85 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (12 resets) in 43 ms. (90 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (21 resets) in 42 ms. (93 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (13 resets) in 43 ms. (90 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (11 resets) in 34 ms. (114 steps per ms) remains 52/52 properties
[2024-05-28 05:21:10] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 05:21:10] [INFO ] Invariant cache hit.
[2024-05-28 05:21:10] [INFO ] State equation strengthened by 168 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
At refinement iteration 2 (OVERLAPS) 67/468 variables, 13/17 constraints. Problems are: Problem set: 18 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 0/17 constraints. Problems are: Problem set: 18 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 7/475 variables, 2/19 constraints. Problems are: Problem set: 18 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/475 variables, 0/19 constraints. Problems are: Problem set: 18 solved, 34 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp67 is UNSAT
At refinement iteration 6 (OVERLAPS) 211/686 variables, 37/56 constraints. Problems are: Problem set: 50 solved, 2 unsolved
[2024-05-28 05:21:12] [INFO ] Deduced a trap composed of 91 places in 589 ms of which 5 ms to minimize.
Problem AtomicPropp36 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/686 variables, 1/57 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/686 variables, 0/57 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/688 variables, 2/59 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/688 variables, 0/59 constraints. Problems are: Problem set: 51 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3310/3310 variables, and 747 constraints, problems are : Problem set: 51 solved, 1 unsolved in 4213 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 688/688 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 52/49 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 51 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 577/613 variables, 14/14 constraints. Problems are: Problem set: 51 solved, 1 unsolved
[2024-05-28 05:21:15] [INFO ] Deduced a trap composed of 306 places in 660 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 1/15 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/613 variables, 0/15 constraints. Problems are: Problem set: 51 solved, 1 unsolved
Problem AtomicPropp1 is UNSAT
After SMT solving in domain Int declared 648/3310 variables, and 30 constraints, problems are : Problem set: 52 solved, 0 unsolved in 939 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 14/41 constraints, State Equation: 0/688 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 0/49 constraints, Known Traps: 1/2 constraints]
After SMT, in 5369ms problems are : Problem set: 52 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 52 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-PT-S06J06T06-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T06-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T06-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T06-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 05:21:16] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-05-28 05:21:16] [INFO ] Flatten gal took : 139 ms
[2024-05-28 05:21:16] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA PolyORBLF-PT-S06J06T06-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T06-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T06-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T06-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T06-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T06-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T06-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 05:21:16] [INFO ] Flatten gal took : 145 ms
[2024-05-28 05:21:16] [INFO ] Input system was already deterministic with 2658 transitions.
Support contains 5 out of 688 places (down from 217) after GAL structural reductions.
FORMULA PolyORBLF-PT-S06J06T06-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2658/2658 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 682 transition count 2658
Applied a total of 6 rules in 69 ms. Remains 682 /688 variables (removed 6) and now considering 2658/2658 (removed 0) transitions.
Running 2652 sub problems to find dead transitions.
[2024-05-28 05:21:16] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
// Phase 1: matrix 2622 rows 682 cols
[2024-05-28 05:21:16] [INFO ] Computed 52 invariants in 92 ms
[2024-05-28 05:21:16] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 44478ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 44522ms
Finished structural reductions in LTL mode , in 1 iterations and 44601 ms. Remains : 682/688 places, 2658/2658 transitions.
[2024-05-28 05:22:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 05:22:01] [INFO ] Flatten gal took : 154 ms
FORMULA PolyORBLF-PT-S06J06T06-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 05:22:01] [INFO ] Flatten gal took : 165 ms
[2024-05-28 05:22:01] [INFO ] Input system was already deterministic with 2658 transitions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2658/2658 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 682 transition count 2658
Applied a total of 6 rules in 47 ms. Remains 682 /688 variables (removed 6) and now considering 2658/2658 (removed 0) transitions.
Running 2652 sub problems to find dead transitions.
[2024-05-28 05:22:02] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 05:22:02] [INFO ] Invariant cache hit.
[2024-05-28 05:22:02] [INFO ] State equation strengthened by 168 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 40024ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 40047ms
Finished structural reductions in LTL mode , in 1 iterations and 40101 ms. Remains : 682/688 places, 2658/2658 transitions.
[2024-05-28 05:22:42] [INFO ] Flatten gal took : 112 ms
[2024-05-28 05:22:42] [INFO ] Flatten gal took : 117 ms
[2024-05-28 05:22:42] [INFO ] Input system was already deterministic with 2658 transitions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2658/2658 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 682 transition count 2658
Applied a total of 6 rules in 45 ms. Remains 682 /688 variables (removed 6) and now considering 2658/2658 (removed 0) transitions.
Running 2652 sub problems to find dead transitions.
[2024-05-28 05:22:42] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 05:22:42] [INFO ] Invariant cache hit.
[2024-05-28 05:22:42] [INFO ] State equation strengthened by 168 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 39010ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 39034ms
Finished structural reductions in LTL mode , in 1 iterations and 39092 ms. Remains : 682/688 places, 2658/2658 transitions.
[2024-05-28 05:23:21] [INFO ] Flatten gal took : 101 ms
[2024-05-28 05:23:21] [INFO ] Flatten gal took : 109 ms
[2024-05-28 05:23:22] [INFO ] Input system was already deterministic with 2658 transitions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2658/2658 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 682 transition count 2658
Applied a total of 6 rules in 73 ms. Remains 682 /688 variables (removed 6) and now considering 2658/2658 (removed 0) transitions.
Running 2652 sub problems to find dead transitions.
[2024-05-28 05:23:22] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 05:23:22] [INFO ] Invariant cache hit.
[2024-05-28 05:23:22] [INFO ] State equation strengthened by 168 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 39144ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 39173ms
Finished structural reductions in LTL mode , in 1 iterations and 39253 ms. Remains : 682/688 places, 2658/2658 transitions.
[2024-05-28 05:24:01] [INFO ] Flatten gal took : 103 ms
[2024-05-28 05:24:01] [INFO ] Flatten gal took : 111 ms
[2024-05-28 05:24:01] [INFO ] Input system was already deterministic with 2658 transitions.
[2024-05-28 05:24:01] [INFO ] Flatten gal took : 107 ms
[2024-05-28 05:24:01] [INFO ] Flatten gal took : 113 ms
[2024-05-28 05:24:01] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-28 05:24:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 688 places, 2658 transitions and 15864 arcs took 36 ms.
Total runtime 314658 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S06J06T06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/418/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 688
TRANSITIONS: 2658
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.076s, Sys 0.000s]


SAVING FILE /home/mcc/execution/418/model (.net / .def) ...
EXPORT TIME: [User 0.009s, 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: 653
MODEL NAME: /home/mcc/execution/418/model
688 places, 2658 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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="PolyORBLF-PT-S06J06T06"
export BK_EXAMINATION="CTLCardinality"
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 PolyORBLF-PT-S06J06T06, examination is CTLCardinality"
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-171654445700345"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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