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.r333-tall-171679077700097.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 RingSingleMessageInMbox-PT-d1m160, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679077700097
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.2M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 23:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 12 23:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 23:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 12 23:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.8M 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 RingSingleMessageInMbox-PT-d1m160-CTLCardinality-2024-00
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-CTLCardinality-2024-01
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-CTLCardinality-2024-02
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-CTLCardinality-2024-03
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-CTLCardinality-2024-04
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-CTLCardinality-2024-05
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-CTLCardinality-2024-06
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-CTLCardinality-2024-07
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-CTLCardinality-2024-08
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-CTLCardinality-2024-09
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-CTLCardinality-2024-10
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-CTLCardinality-2024-11
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-CTLCardinality-2023-12
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-CTLCardinality-2023-13
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-CTLCardinality-2023-14
FORMULA_NAME RingSingleMessageInMbox-PT-d1m160-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716797511172

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RingSingleMessageInMbox-PT-d1m160
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 08:11:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 08:11:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 08:11:52] [INFO ] Load time of PNML (sax parser for PT used): 447 ms
[2024-05-27 08:11:52] [INFO ] Transformed 6690 places.
[2024-05-27 08:11:52] [INFO ] Transformed 11934 transitions.
[2024-05-27 08:11:52] [INFO ] Parsed PT model containing 6690 places and 11934 transitions and 47736 arcs in 625 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
Deduced a syphon composed of 4305 places in 41 ms
Reduce places removed 4305 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA RingSingleMessageInMbox-PT-d1m160-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m160-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m160-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m160-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 2385 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2385/2385 places, 11934/11934 transitions.
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 0 with 102 rules applied. Total rules applied 102 place count 2369 transition count 11848
Discarding 1092 places :
Symmetric choice reduction at 1 with 1092 rule applications. Total rules 1194 place count 1277 transition count 2437
Iterating global reduction 1 with 1092 rules applied. Total rules applied 2286 place count 1277 transition count 2437
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 2352 place count 1277 transition count 2371
Discarding 923 places :
Symmetric choice reduction at 2 with 923 rule applications. Total rules 3275 place count 354 transition count 1448
Iterating global reduction 2 with 923 rules applied. Total rules applied 4198 place count 354 transition count 1448
Ensure Unique test removed 876 transitions
Reduce isomorphic transitions removed 876 transitions.
Iterating post reduction 2 with 876 rules applied. Total rules applied 5074 place count 354 transition count 572
Discarding 130 places :
Symmetric choice reduction at 3 with 130 rule applications. Total rules 5204 place count 224 transition count 442
Iterating global reduction 3 with 130 rules applied. Total rules applied 5334 place count 224 transition count 442
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 98 rules applied. Total rules applied 5432 place count 224 transition count 344
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 5440 place count 216 transition count 336
Iterating global reduction 4 with 8 rules applied. Total rules applied 5448 place count 216 transition count 336
Applied a total of 5448 rules in 360 ms. Remains 216 /2385 variables (removed 2169) and now considering 336/11934 (removed 11598) transitions.
// Phase 1: matrix 336 rows 216 cols
[2024-05-27 08:11:53] [INFO ] Computed 3 invariants in 24 ms
[2024-05-27 08:11:53] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-05-27 08:11:53] [INFO ] Invariant cache hit.
[2024-05-27 08:11:54] [INFO ] State equation strengthened by 134 read => feed constraints.
[2024-05-27 08:11:54] [INFO ] Implicit Places using invariants and state equation in 658 ms returned []
Implicit Place search using SMT with State Equation took 995 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-05-27 08:11:54] [INFO ] Invariant cache hit.
[2024-05-27 08:11:54] [INFO ] State equation strengthened by 134 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/214 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (OVERLAPS) 1/215 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
At refinement iteration 4 (OVERLAPS) 336/551 variables, 215/218 constraints. Problems are: Problem set: 24 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 134/352 constraints. Problems are: Problem set: 24 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 0/352 constraints. Problems are: Problem set: 24 solved, 311 unsolved
At refinement iteration 7 (OVERLAPS) 1/552 variables, 1/353 constraints. Problems are: Problem set: 24 solved, 311 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 0/353 constraints. Problems are: Problem set: 24 solved, 311 unsolved
At refinement iteration 9 (OVERLAPS) 0/552 variables, 0/353 constraints. Problems are: Problem set: 24 solved, 311 unsolved
No progress, stopping.
After SMT solving in domain Real declared 552/552 variables, and 353 constraints, problems are : Problem set: 24 solved, 311 unsolved in 23489 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 311 unsolved
At refinement iteration 1 (OVERLAPS) 17/207 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 311 unsolved
At refinement iteration 3 (OVERLAPS) 8/215 variables, 1/3 constraints. Problems are: Problem set: 24 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/3 constraints. Problems are: Problem set: 24 solved, 311 unsolved
At refinement iteration 5 (OVERLAPS) 336/551 variables, 215/218 constraints. Problems are: Problem set: 24 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 134/352 constraints. Problems are: Problem set: 24 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 291/643 constraints. Problems are: Problem set: 24 solved, 311 unsolved
[2024-05-27 08:12:27] [INFO ] Deduced a trap composed of 82 places in 86 ms of which 15 ms to minimize.
[2024-05-27 08:12:27] [INFO ] Deduced a trap composed of 90 places in 74 ms of which 1 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
[2024-05-27 08:12:29] [INFO ] Deduced a trap composed of 103 places in 60 ms of which 2 ms to minimize.
[2024-05-27 08:12:29] [INFO ] Deduced a trap composed of 79 places in 57 ms of which 2 ms to minimize.
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
[2024-05-27 08:12:33] [INFO ] Deduced a trap composed of 77 places in 49 ms of which 1 ms to minimize.
Problem TDEAD283 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 5/648 constraints. Problems are: Problem set: 46 solved, 289 unsolved
[2024-05-27 08:12:41] [INFO ] Deduced a trap composed of 86 places in 62 ms of which 2 ms to minimize.
[2024-05-27 08:12:42] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/551 variables, 2/650 constraints. Problems are: Problem set: 46 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/552 variables, and 650 constraints, problems are : Problem set: 46 solved, 289 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 215/216 constraints, ReadFeed: 134/134 constraints, PredecessorRefiner: 291/335 constraints, Known Traps: 7/7 constraints]
After SMT, in 54465ms problems are : Problem set: 46 solved, 289 unsolved
Search for dead transitions found 46 dead transitions in 54479ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 216/2385 places, 290/11934 transitions.
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 175 transition count 273
Applied a total of 58 rules in 4 ms. Remains 175 /216 variables (removed 41) and now considering 273/290 (removed 17) transitions.
// Phase 1: matrix 273 rows 175 cols
[2024-05-27 08:12:49] [INFO ] Computed 2 invariants in 3 ms
[2024-05-27 08:12:49] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-27 08:12:49] [INFO ] Invariant cache hit.
[2024-05-27 08:12:49] [INFO ] State equation strengthened by 126 read => feed constraints.
[2024-05-27 08:12:49] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 175/2385 places, 273/11934 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56713 ms. Remains : 175/2385 places, 273/11934 transitions.
Support contains 24 out of 175 places after structural reductions.
[2024-05-27 08:12:50] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-27 08:12:50] [INFO ] Flatten gal took : 51 ms
[2024-05-27 08:12:50] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA RingSingleMessageInMbox-PT-d1m160-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m160-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m160-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m160-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 08:12:50] [INFO ] Flatten gal took : 23 ms
[2024-05-27 08:12:50] [INFO ] Input system was already deterministic with 273 transitions.
Support contains 17 out of 175 places (down from 24) after GAL structural reductions.
RANDOM walk for 40000 steps (7205 resets) in 1374 ms. (29 steps per ms) remains 6/13 properties
BEST_FIRST walk for 40002 steps (1674 resets) in 201 ms. (198 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1888 resets) in 136 ms. (291 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1646 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1909 resets) in 146 ms. (272 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (1634 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (1694 resets) in 68 ms. (579 steps per ms) remains 6/6 properties
[2024-05-27 08:12:51] [INFO ] Invariant cache hit.
[2024-05-27 08:12:51] [INFO ] State equation strengthened by 126 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 61/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 4/72 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 171/243 variables, 72/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 24/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
At refinement iteration 8 (OVERLAPS) 199/442 variables, 97/195 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/442 variables, 102/297 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 0/297 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 6/448 variables, 6/303 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/448 variables, 0/303 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/448 variables, 0/303 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 448/448 variables, and 303 constraints, problems are : Problem set: 5 solved, 1 unsolved in 448 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 175/175 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/62 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/66 variables, 1/2 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 169/235 variables, 66/68 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 22/90 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 1/91 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/91 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 207/442 variables, 103/194 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/442 variables, 104/298 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/442 variables, 0/298 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 6/448 variables, 6/304 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/448 variables, 0/304 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/448 variables, 0/304 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 448/448 variables, and 304 constraints, problems are : Problem set: 5 solved, 1 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 175/175 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 1/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 612ms problems are : Problem set: 5 solved, 1 unsolved
Parikh walk visited 0 properties in 128 ms.
Support contains 1 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 273/273 transitions.
Graph (complete) has 577 edges and 175 vertex of which 172 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 170 transition count 262
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 35 place count 149 transition count 241
Iterating global reduction 1 with 21 rules applied. Total rules applied 56 place count 149 transition count 241
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 68 place count 149 transition count 229
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 81 place count 136 transition count 216
Iterating global reduction 2 with 13 rules applied. Total rules applied 94 place count 136 transition count 216
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 107 place count 136 transition count 203
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 133 transition count 164
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 133 transition count 164
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 131 transition count 162
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 131 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 118 place count 131 transition count 161
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 122 place count 127 transition count 157
Iterating global reduction 4 with 4 rules applied. Total rules applied 126 place count 127 transition count 157
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 130 place count 127 transition count 153
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 5 with 4 rules applied. Total rules applied 134 place count 125 transition count 151
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 136 place count 125 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 138 place count 123 transition count 149
Applied a total of 138 rules in 54 ms. Remains 123 /175 variables (removed 52) and now considering 149/273 (removed 124) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 123/175 places, 149/273 transitions.
RANDOM walk for 40000 steps (8505 resets) in 801 ms. (49 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2815 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2360230 steps, run timeout after 3001 ms. (steps per millisecond=786 ) properties seen :0 out of 1
Probabilistic random walk after 2360230 steps, saw 1015838 distinct states, run finished after 3004 ms. (steps per millisecond=785 ) properties seen :0
// Phase 1: matrix 149 rows 123 cols
[2024-05-27 08:12:55] [INFO ] Computed 1 invariants in 1 ms
[2024-05-27 08:12:55] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/13 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 108/121 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 144/265 variables, 103/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/265 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 41/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/272 variables, 7/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/272 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 174 constraints, problems are : Problem set: 0 solved, 1 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 123/123 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/13 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 108/121 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 9/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 144/265 variables, 103/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/265 variables, 41/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/265 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 7/272 variables, 7/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/272 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/272 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 175 constraints, problems are : Problem set: 0 solved, 1 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 123/123 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 276ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 149/149 transitions.
Applied a total of 0 rules in 10 ms. Remains 123 /123 variables (removed 0) and now considering 149/149 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 123/123 places, 149/149 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 149/149 transitions.
Applied a total of 0 rules in 24 ms. Remains 123 /123 variables (removed 0) and now considering 149/149 (removed 0) transitions.
[2024-05-27 08:12:55] [INFO ] Invariant cache hit.
[2024-05-27 08:12:56] [INFO ] Implicit Places using invariants in 838 ms returned []
[2024-05-27 08:12:56] [INFO ] Invariant cache hit.
[2024-05-27 08:12:56] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-05-27 08:12:56] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 1039 ms to find 0 implicit places.
[2024-05-27 08:12:56] [INFO ] Redundant transitions in 3 ms returned []
Running 148 sub problems to find dead transitions.
[2024-05-27 08:12:56] [INFO ] Invariant cache hit.
[2024-05-27 08:12:56] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 149/272 variables, 123/124 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 50/174 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/272 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 174 constraints, problems are : Problem set: 0 solved, 148 unsolved in 4127 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 123/123 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (OVERLAPS) 149/272 variables, 123/124 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 50/174 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 148/322 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/272 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 7 (OVERLAPS) 0/272 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 322 constraints, problems are : Problem set: 0 solved, 148 unsolved in 6743 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 123/123 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints]
After SMT, in 11071ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 11073ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12144 ms. Remains : 123/123 places, 149/149 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 123 transition count 141
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 117 transition count 141
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 14 place count 117 transition count 117
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 62 place count 93 transition count 117
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 70 place count 89 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 88 transition count 119
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 88 transition count 118
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 88 transition count 116
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 86 transition count 116
Applied a total of 77 rules in 26 ms. Remains 86 /123 variables (removed 37) and now considering 116/149 (removed 33) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 116 rows 86 cols
[2024-05-27 08:13:07] [INFO ] Computed 3 invariants in 0 ms
[2024-05-27 08:13:07] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-27 08:13:07] [INFO ] [Real]Absence check using 1 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-27 08:13:07] [INFO ] After 30ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-27 08:13:07] [INFO ] After 48ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-27 08:13:07] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 124 ms.
Successfully simplified 5 atomic propositions for a total of 7 simplifications.
FORMULA RingSingleMessageInMbox-PT-d1m160-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RingSingleMessageInMbox-PT-d1m160-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 08:13:07] [INFO ] Flatten gal took : 20 ms
[2024-05-27 08:13:07] [INFO ] Flatten gal took : 14 ms
[2024-05-27 08:13:07] [INFO ] Input system was already deterministic with 273 transitions.
Computed a total of 23 stabilizing places and 79 stable transitions
Graph (complete) has 630 edges and 175 vertex of which 172 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 273/273 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 173 transition count 271
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 25 place count 152 transition count 250
Iterating global reduction 1 with 21 rules applied. Total rules applied 46 place count 152 transition count 250
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 58 place count 152 transition count 238
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 71 place count 139 transition count 225
Iterating global reduction 2 with 13 rules applied. Total rules applied 84 place count 139 transition count 225
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 97 place count 139 transition count 212
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 99 place count 137 transition count 186
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 137 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 136 transition count 185
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 136 transition count 185
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 107 place count 132 transition count 181
Iterating global reduction 3 with 4 rules applied. Total rules applied 111 place count 132 transition count 181
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 119 place count 132 transition count 173
Applied a total of 119 rules in 11 ms. Remains 132 /175 variables (removed 43) and now considering 173/273 (removed 100) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 132/175 places, 173/273 transitions.
[2024-05-27 08:13:07] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:13:07] [INFO ] Flatten gal took : 14 ms
[2024-05-27 08:13:07] [INFO ] Input system was already deterministic with 173 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 273/273 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 173 transition count 271
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 25 place count 152 transition count 250
Iterating global reduction 1 with 21 rules applied. Total rules applied 46 place count 152 transition count 250
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 58 place count 152 transition count 238
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 71 place count 139 transition count 225
Iterating global reduction 2 with 13 rules applied. Total rules applied 84 place count 139 transition count 225
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 97 place count 139 transition count 212
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 100 place count 136 transition count 173
Iterating global reduction 3 with 3 rules applied. Total rules applied 103 place count 136 transition count 173
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 105 place count 134 transition count 171
Iterating global reduction 3 with 2 rules applied. Total rules applied 107 place count 134 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 108 place count 134 transition count 170
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 112 place count 130 transition count 166
Iterating global reduction 4 with 4 rules applied. Total rules applied 116 place count 130 transition count 166
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 120 place count 130 transition count 162
Applied a total of 120 rules in 11 ms. Remains 130 /175 variables (removed 45) and now considering 162/273 (removed 111) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 130/175 places, 162/273 transitions.
[2024-05-27 08:13:07] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:13:08] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:13:08] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 273/273 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 173 transition count 271
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 24 place count 153 transition count 251
Iterating global reduction 1 with 20 rules applied. Total rules applied 44 place count 153 transition count 251
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 57 place count 153 transition count 238
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 68 place count 142 transition count 227
Iterating global reduction 2 with 11 rules applied. Total rules applied 79 place count 142 transition count 227
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 90 place count 142 transition count 216
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 91 place count 141 transition count 203
Iterating global reduction 3 with 1 rules applied. Total rules applied 92 place count 141 transition count 203
Applied a total of 92 rules in 8 ms. Remains 141 /175 variables (removed 34) and now considering 203/273 (removed 70) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 141/175 places, 203/273 transitions.
[2024-05-27 08:13:08] [INFO ] Flatten gal took : 10 ms
[2024-05-27 08:13:08] [INFO ] Flatten gal took : 9 ms
[2024-05-27 08:13:08] [INFO ] Input system was already deterministic with 203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 273/273 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 173 transition count 271
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 24 place count 153 transition count 251
Iterating global reduction 1 with 20 rules applied. Total rules applied 44 place count 153 transition count 251
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 52 place count 153 transition count 243
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 64 place count 141 transition count 231
Iterating global reduction 2 with 12 rules applied. Total rules applied 76 place count 141 transition count 231
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 88 place count 141 transition count 219
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 90 place count 139 transition count 191
Iterating global reduction 3 with 2 rules applied. Total rules applied 92 place count 139 transition count 191
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 138 transition count 190
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 138 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 138 transition count 189
Applied a total of 95 rules in 9 ms. Remains 138 /175 variables (removed 37) and now considering 189/273 (removed 84) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 138/175 places, 189/273 transitions.
[2024-05-27 08:13:08] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:13:08] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:13:08] [INFO ] Input system was already deterministic with 189 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 273/273 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 173 transition count 271
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 26 place count 151 transition count 249
Iterating global reduction 1 with 22 rules applied. Total rules applied 48 place count 151 transition count 249
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 61 place count 151 transition count 236
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 74 place count 138 transition count 223
Iterating global reduction 2 with 13 rules applied. Total rules applied 87 place count 138 transition count 223
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 100 place count 138 transition count 210
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 103 place count 135 transition count 171
Iterating global reduction 3 with 3 rules applied. Total rules applied 106 place count 135 transition count 171
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 108 place count 133 transition count 169
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 133 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 111 place count 133 transition count 168
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 115 place count 129 transition count 164
Iterating global reduction 4 with 4 rules applied. Total rules applied 119 place count 129 transition count 164
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 123 place count 129 transition count 160
Applied a total of 123 rules in 19 ms. Remains 129 /175 variables (removed 46) and now considering 160/273 (removed 113) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 129/175 places, 160/273 transitions.
[2024-05-27 08:13:08] [INFO ] Flatten gal took : 7 ms
[2024-05-27 08:13:08] [INFO ] Flatten gal took : 6 ms
[2024-05-27 08:13:08] [INFO ] Input system was already deterministic with 160 transitions.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 273/273 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 173 transition count 271
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 22 place count 155 transition count 253
Iterating global reduction 1 with 18 rules applied. Total rules applied 40 place count 155 transition count 253
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 50 place count 155 transition count 243
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 62 place count 143 transition count 231
Iterating global reduction 2 with 12 rules applied. Total rules applied 74 place count 143 transition count 231
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 86 place count 143 transition count 219
Applied a total of 86 rules in 7 ms. Remains 143 /175 variables (removed 32) and now considering 219/273 (removed 54) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 143/175 places, 219/273 transitions.
[2024-05-27 08:13:08] [INFO ] Flatten gal took : 9 ms
[2024-05-27 08:13:08] [INFO ] Flatten gal took : 8 ms
[2024-05-27 08:13:08] [INFO ] Input system was already deterministic with 219 transitions.
[2024-05-27 08:13:08] [INFO ] Flatten gal took : 23 ms
[2024-05-27 08:13:08] [INFO ] Flatten gal took : 13 ms
[2024-05-27 08:13:08] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-27 08:13:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 175 places, 273 transitions and 1071 arcs took 6 ms.
Total runtime 76005 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running RingSingleMessageInMbox-PT-d1m160

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 619
MODEL NAME: /home/mcc/execution/410/model
175 places, 273 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.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716798043344

--------------------
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
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="RingSingleMessageInMbox-PT-d1m160"
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 RingSingleMessageInMbox-PT-d1m160, 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 r333-tall-171679077700097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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