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.r179-tall-171640601200282.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 FunctionPointer-PT-c004, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601200282
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:42 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 FunctionPointer-PT-c004-CTLFireability-2024-00
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2024-01
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2024-02
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2024-03
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2024-04
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2024-05
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2024-06
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2024-07
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2024-08
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2024-09
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2024-10
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2024-11
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2023-12
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2023-13
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2023-14
FORMULA_NAME FunctionPointer-PT-c004-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716436957082

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 04:02:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 04:02:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 04:02:38] [INFO ] Load time of PNML (sax parser for PT used): 363 ms
[2024-05-23 04:02:38] [INFO ] Transformed 2826 places.
[2024-05-23 04:02:38] [INFO ] Transformed 8960 transitions.
[2024-05-23 04:02:38] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 545 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Deduced a syphon composed of 1198 places in 36 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c004-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 65 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 277 places :
Symmetric choice reduction at 1 with 277 rule applications. Total rules 294 place count 1334 transition count 3928
Iterating global reduction 1 with 277 rules applied. Total rules applied 571 place count 1334 transition count 3928
Ensure Unique test removed 474 transitions
Reduce isomorphic transitions removed 474 transitions.
Iterating post reduction 1 with 474 rules applied. Total rules applied 1045 place count 1334 transition count 3454
Discarding 136 places :
Symmetric choice reduction at 2 with 136 rule applications. Total rules 1181 place count 1198 transition count 3182
Iterating global reduction 2 with 136 rules applied. Total rules applied 1317 place count 1198 transition count 3182
Ensure Unique test removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 2 with 116 rules applied. Total rules applied 1433 place count 1198 transition count 3066
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1447 place count 1184 transition count 3038
Iterating global reduction 3 with 14 rules applied. Total rules applied 1461 place count 1184 transition count 3038
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1475 place count 1170 transition count 3010
Iterating global reduction 3 with 14 rules applied. Total rules applied 1489 place count 1170 transition count 3010
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1503 place count 1156 transition count 2982
Iterating global reduction 3 with 14 rules applied. Total rules applied 1517 place count 1156 transition count 2982
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1531 place count 1142 transition count 2954
Iterating global reduction 3 with 14 rules applied. Total rules applied 1545 place count 1142 transition count 2954
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1559 place count 1128 transition count 2926
Iterating global reduction 3 with 14 rules applied. Total rules applied 1573 place count 1128 transition count 2926
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1584 place count 1117 transition count 2904
Iterating global reduction 3 with 11 rules applied. Total rules applied 1595 place count 1117 transition count 2904
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1603 place count 1109 transition count 2888
Iterating global reduction 3 with 8 rules applied. Total rules applied 1611 place count 1109 transition count 2888
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1637 place count 1083 transition count 2792
Iterating global reduction 3 with 26 rules applied. Total rules applied 1663 place count 1083 transition count 2792
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 1696 place count 1050 transition count 2660
Iterating global reduction 3 with 33 rules applied. Total rules applied 1729 place count 1050 transition count 2660
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1759 place count 1020 transition count 2578
Iterating global reduction 3 with 30 rules applied. Total rules applied 1789 place count 1020 transition count 2578
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 1819 place count 990 transition count 2518
Iterating global reduction 3 with 30 rules applied. Total rules applied 1849 place count 990 transition count 2518
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 1878 place count 961 transition count 2460
Iterating global reduction 3 with 29 rules applied. Total rules applied 1907 place count 961 transition count 2460
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 1936 place count 932 transition count 2402
Iterating global reduction 3 with 29 rules applied. Total rules applied 1965 place count 932 transition count 2402
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1991 place count 906 transition count 2350
Iterating global reduction 3 with 26 rules applied. Total rules applied 2017 place count 906 transition count 2350
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 2028 place count 895 transition count 2328
Iterating global reduction 3 with 11 rules applied. Total rules applied 2039 place count 895 transition count 2328
Applied a total of 2039 rules in 1235 ms. Remains 895 /1628 variables (removed 733) and now considering 2328/5962 (removed 3634) transitions.
[2024-05-23 04:02:40] [INFO ] Flow matrix only has 1570 transitions (discarded 758 similar events)
// Phase 1: matrix 1570 rows 895 cols
[2024-05-23 04:02:40] [INFO ] Computed 2 invariants in 44 ms
[2024-05-23 04:02:40] [INFO ] Implicit Places using invariants in 723 ms returned []
[2024-05-23 04:02:40] [INFO ] Flow matrix only has 1570 transitions (discarded 758 similar events)
[2024-05-23 04:02:40] [INFO ] Invariant cache hit.
[2024-05-23 04:02:41] [INFO ] State equation strengthened by 369 read => feed constraints.
[2024-05-23 04:02:43] [INFO ] Implicit Places using invariants and state equation in 2433 ms returned []
Implicit Place search using SMT with State Equation took 3184 ms to find 0 implicit places.
Running 2326 sub problems to find dead transitions.
[2024-05-23 04:02:43] [INFO ] Flow matrix only has 1570 transitions (discarded 758 similar events)
[2024-05-23 04:02:43] [INFO ] Invariant cache hit.
[2024-05-23 04:02:43] [INFO ] State equation strengthened by 369 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/895 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2326 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/895 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2326 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 895/2465 variables, and 2 constraints, problems are : Problem set: 0 solved, 2326 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/895 constraints, ReadFeed: 0/369 constraints, PredecessorRefiner: 2326/2326 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2326 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/895 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2326 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/895 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2326 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 895/2465 variables, and 2 constraints, problems are : Problem set: 0 solved, 2326 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/895 constraints, ReadFeed: 0/369 constraints, PredecessorRefiner: 0/2326 constraints, Known Traps: 0/0 constraints]
After SMT, in 72408ms problems are : Problem set: 0 solved, 2326 unsolved
Search for dead transitions found 0 dead transitions in 72451ms
Starting structural reductions in LTL mode, iteration 1 : 895/1628 places, 2328/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76905 ms. Remains : 895/1628 places, 2328/5962 transitions.
Support contains 65 out of 895 places after structural reductions.
[2024-05-23 04:03:56] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-23 04:03:56] [INFO ] Flatten gal took : 150 ms
[2024-05-23 04:03:56] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FunctionPointer-PT-c004-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 04:03:56] [INFO ] Flatten gal took : 104 ms
[2024-05-23 04:03:56] [INFO ] Input system was already deterministic with 2328 transitions.
Support contains 50 out of 895 places (down from 65) after GAL structural reductions.
RANDOM walk for 40002 steps (8 resets) in 3850 ms. (10 steps per ms) remains 31/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 28/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
[2024-05-23 04:03:57] [INFO ] Flow matrix only has 1570 transitions (discarded 758 similar events)
[2024-05-23 04:03:57] [INFO ] Invariant cache hit.
[2024-05-23 04:03:57] [INFO ] State equation strengthened by 369 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 378/412 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 1107/1519 variables, 412/413 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1519 variables, 270/683 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1519 variables, 0/683 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp15 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 744/2263 variables, 334/1017 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2263 variables, 1/1018 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2263 variables, 99/1117 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2263 variables, 0/1117 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 192/2455 variables, 141/1258 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2455 variables, 0/1258 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 12 (OVERLAPS) 10/2465 variables, 8/1266 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2465 variables, 0/1266 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 14 (OVERLAPS) 0/2465 variables, 0/1266 constraints. Problems are: Problem set: 2 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2465/2465 variables, and 1266 constraints, problems are : Problem set: 2 solved, 22 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 895/895 constraints, ReadFeed: 369/369 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 379/409 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 1103/1512 variables, 409/410 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1512 variables, 270/680 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1512 variables, 0/680 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 745/2257 variables, 334/1014 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2257 variables, 1/1015 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2257 variables, 99/1114 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2257 variables, 22/1136 constraints. Problems are: Problem set: 2 solved, 22 unsolved
[2024-05-23 04:04:05] [INFO ] Deduced a trap composed of 135 places in 194 ms of which 24 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2257 variables, 1/1137 constraints. Problems are: Problem set: 2 solved, 22 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2257/2465 variables, and 1137 constraints, problems are : Problem set: 2 solved, 22 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 743/895 constraints, ReadFeed: 369/369 constraints, PredecessorRefiner: 22/24 constraints, Known Traps: 1/1 constraints]
After SMT, in 10292ms problems are : Problem set: 2 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 895 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 895/895 places, 2328/2328 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 877 transition count 2280
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 877 transition count 2280
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 50 place count 877 transition count 2266
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 65 place count 862 transition count 2234
Iterating global reduction 1 with 15 rules applied. Total rules applied 80 place count 862 transition count 2234
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 84 place count 862 transition count 2230
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 95 place count 851 transition count 2198
Iterating global reduction 2 with 11 rules applied. Total rules applied 106 place count 851 transition count 2198
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 121 place count 836 transition count 2144
Iterating global reduction 2 with 15 rules applied. Total rules applied 136 place count 836 transition count 2144
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 153 place count 819 transition count 2090
Iterating global reduction 2 with 17 rules applied. Total rules applied 170 place count 819 transition count 2090
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 186 place count 803 transition count 2052
Iterating global reduction 2 with 16 rules applied. Total rules applied 202 place count 803 transition count 2052
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 218 place count 787 transition count 2020
Iterating global reduction 2 with 16 rules applied. Total rules applied 234 place count 787 transition count 2020
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 249 place count 772 transition count 1990
Iterating global reduction 2 with 15 rules applied. Total rules applied 264 place count 772 transition count 1990
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 279 place count 757 transition count 1960
Iterating global reduction 2 with 15 rules applied. Total rules applied 294 place count 757 transition count 1960
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 304 place count 747 transition count 1940
Iterating global reduction 2 with 10 rules applied. Total rules applied 314 place count 747 transition count 1940
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 317 place count 744 transition count 1934
Iterating global reduction 2 with 3 rules applied. Total rules applied 320 place count 744 transition count 1934
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 2 with 32 rules applied. Total rules applied 352 place count 744 transition count 1902
Applied a total of 352 rules in 660 ms. Remains 744 /895 variables (removed 151) and now considering 1902/2328 (removed 426) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 660 ms. Remains : 744/895 places, 1902/2328 transitions.
RANDOM walk for 40002 steps (8 resets) in 474 ms. (84 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 161132 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 21
Probabilistic random walk after 161132 steps, saw 105062 distinct states, run finished after 3004 ms. (steps per millisecond=53 ) properties seen :0
[2024-05-23 04:04:12] [INFO ] Flow matrix only has 1286 transitions (discarded 616 similar events)
// Phase 1: matrix 1286 rows 744 cols
[2024-05-23 04:04:12] [INFO ] Computed 2 invariants in 9 ms
[2024-05-23 04:04:12] [INFO ] State equation strengthened by 315 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 379/408 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 987/1395 variables, 408/409 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1395 variables, 234/643 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1395 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 21 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 523/1918 variables, 239/882 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1918 variables, 1/883 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1918 variables, 81/964 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1918 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 112/2030 variables, 97/1061 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2030 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 0/2030 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2030/2030 variables, and 1061 constraints, problems are : Problem set: 0 solved, 21 unsolved in 3773 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 744/744 constraints, ReadFeed: 315/315 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 379/408 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/408 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 987/1395 variables, 408/409 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1395 variables, 234/643 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1395 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 523/1918 variables, 239/882 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1918 variables, 1/883 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1918 variables, 81/964 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1918 variables, 21/985 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-23 04:04:18] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1918 variables, 1/986 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1918 variables, 0/986 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 112/2030 variables, 97/1083 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2030 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (OVERLAPS) 0/2030 variables, 0/1083 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2030/2030 variables, and 1083 constraints, problems are : Problem set: 0 solved, 21 unsolved in 9799 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 744/744 constraints, ReadFeed: 315/315 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 1/1 constraints]
After SMT, in 13767ms problems are : Problem set: 0 solved, 21 unsolved
Parikh walk visited 14 properties in 13316 ms.
Support contains 11 out of 744 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 744/744 places, 1902/1902 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 732 transition count 1874
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 732 transition count 1874
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 30 place count 732 transition count 1868
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 41 place count 721 transition count 1844
Iterating global reduction 1 with 11 rules applied. Total rules applied 52 place count 721 transition count 1844
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 62 place count 711 transition count 1812
Iterating global reduction 1 with 10 rules applied. Total rules applied 72 place count 711 transition count 1812
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 81 place count 702 transition count 1792
Iterating global reduction 1 with 9 rules applied. Total rules applied 90 place count 702 transition count 1792
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 99 place count 693 transition count 1774
Iterating global reduction 1 with 9 rules applied. Total rules applied 108 place count 693 transition count 1774
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 117 place count 684 transition count 1756
Iterating global reduction 1 with 9 rules applied. Total rules applied 126 place count 684 transition count 1756
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 134 place count 676 transition count 1740
Iterating global reduction 1 with 8 rules applied. Total rules applied 142 place count 676 transition count 1740
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 150 place count 668 transition count 1724
Iterating global reduction 1 with 8 rules applied. Total rules applied 158 place count 668 transition count 1724
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 165 place count 661 transition count 1710
Iterating global reduction 1 with 7 rules applied. Total rules applied 172 place count 661 transition count 1710
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 173 place count 660 transition count 1708
Iterating global reduction 1 with 1 rules applied. Total rules applied 174 place count 660 transition count 1708
Applied a total of 174 rules in 284 ms. Remains 660 /744 variables (removed 84) and now considering 1708/1902 (removed 194) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 285 ms. Remains : 660/744 places, 1708/1902 transitions.
RANDOM walk for 40002 steps (9 resets) in 233 ms. (170 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 184957 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 7
Probabilistic random walk after 184957 steps, saw 120068 distinct states, run finished after 3002 ms. (steps per millisecond=61 ) properties seen :0
[2024-05-23 04:04:42] [INFO ] Flow matrix only has 1148 transitions (discarded 560 similar events)
// Phase 1: matrix 1148 rows 660 cols
[2024-05-23 04:04:42] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 04:04:42] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 383/394 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 813/1207 variables, 394/395 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1207 variables, 73/468 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1207 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 516/1723 variables, 186/654 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1723 variables, 1/655 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1723 variables, 211/866 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1723 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 85/1808 variables, 80/946 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1808 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/1808 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1808/1808 variables, and 946 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1220 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 660/660 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 383/394 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 813/1207 variables, 394/395 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1207 variables, 73/468 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1207 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 516/1723 variables, 186/654 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1723 variables, 1/655 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1723 variables, 211/866 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1723 variables, 7/873 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1723 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 85/1808 variables, 80/953 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1808 variables, 0/953 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 04:04:46] [INFO ] Deduced a trap composed of 139 places in 155 ms of which 4 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/1808 variables, 1/954 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1808 variables, 0/954 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/1808 variables, 0/954 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1808/1808 variables, and 954 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3263 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 660/660 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 4551ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 3844 ms.
Support contains 11 out of 660 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 660/660 places, 1708/1708 transitions.
Applied a total of 0 rules in 94 ms. Remains 660 /660 variables (removed 0) and now considering 1708/1708 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 660/660 places, 1708/1708 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 660/660 places, 1708/1708 transitions.
Applied a total of 0 rules in 81 ms. Remains 660 /660 variables (removed 0) and now considering 1708/1708 (removed 0) transitions.
[2024-05-23 04:04:51] [INFO ] Flow matrix only has 1148 transitions (discarded 560 similar events)
[2024-05-23 04:04:51] [INFO ] Invariant cache hit.
[2024-05-23 04:04:51] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-05-23 04:04:51] [INFO ] Flow matrix only has 1148 transitions (discarded 560 similar events)
[2024-05-23 04:04:51] [INFO ] Invariant cache hit.
[2024-05-23 04:04:52] [INFO ] State equation strengthened by 284 read => feed constraints.
[2024-05-23 04:04:53] [INFO ] Implicit Places using invariants and state equation in 1888 ms returned []
Implicit Place search using SMT with State Equation took 2248 ms to find 0 implicit places.
[2024-05-23 04:04:53] [INFO ] Redundant transitions in 98 ms returned []
Running 1706 sub problems to find dead transitions.
[2024-05-23 04:04:53] [INFO ] Flow matrix only has 1148 transitions (discarded 560 similar events)
[2024-05-23 04:04:53] [INFO ] Invariant cache hit.
[2024-05-23 04:04:53] [INFO ] State equation strengthened by 284 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/660 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/660 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 660/1808 variables, and 2 constraints, problems are : Problem set: 0 solved, 1706 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/660 constraints, ReadFeed: 0/284 constraints, PredecessorRefiner: 1706/1706 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1706 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/660 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/660 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/660 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 3 (OVERLAPS) 1148/1808 variables, 660/662 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1808 variables, 284/946 constraints. Problems are: Problem set: 0 solved, 1706 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1808/1808 variables, and 2652 constraints, problems are : Problem set: 0 solved, 1706 unsolved in 31654 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 660/660 constraints, ReadFeed: 284/284 constraints, PredecessorRefiner: 1706/1706 constraints, Known Traps: 0/0 constraints]
After SMT, in 70062ms problems are : Problem set: 0 solved, 1706 unsolved
Search for dead transitions found 0 dead transitions in 70078ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72520 ms. Remains : 660/660 places, 1708/1708 transitions.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA FunctionPointer-PT-c004-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 04:06:03] [INFO ] Flatten gal took : 71 ms
[2024-05-23 04:06:04] [INFO ] Flatten gal took : 100 ms
[2024-05-23 04:06:04] [INFO ] Input system was already deterministic with 2328 transitions.
Support contains 39 out of 895 places (down from 40) after GAL structural reductions.
FORMULA FunctionPointer-PT-c004-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 192 stabilizing places and 512 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 895/895 places, 2328/2328 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 859 transition count 2232
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 859 transition count 2232
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 92 place count 859 transition count 2212
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 124 place count 827 transition count 2142
Iterating global reduction 1 with 32 rules applied. Total rules applied 156 place count 827 transition count 2142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 160 place count 827 transition count 2138
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 184 place count 803 transition count 2066
Iterating global reduction 2 with 24 rules applied. Total rules applied 208 place count 803 transition count 2066
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 240 place count 771 transition count 1954
Iterating global reduction 2 with 32 rules applied. Total rules applied 272 place count 771 transition count 1954
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 304 place count 739 transition count 1860
Iterating global reduction 2 with 32 rules applied. Total rules applied 336 place count 739 transition count 1860
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 366 place count 709 transition count 1798
Iterating global reduction 2 with 30 rules applied. Total rules applied 396 place count 709 transition count 1798
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 424 place count 681 transition count 1742
Iterating global reduction 2 with 28 rules applied. Total rules applied 452 place count 681 transition count 1742
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 479 place count 654 transition count 1688
Iterating global reduction 2 with 27 rules applied. Total rules applied 506 place count 654 transition count 1688
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 531 place count 629 transition count 1638
Iterating global reduction 2 with 25 rules applied. Total rules applied 556 place count 629 transition count 1638
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 571 place count 614 transition count 1608
Iterating global reduction 2 with 15 rules applied. Total rules applied 586 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 587 place count 613 transition count 1606
Iterating global reduction 2 with 1 rules applied. Total rules applied 588 place count 613 transition count 1606
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 592 place count 613 transition count 1602
Applied a total of 592 rules in 516 ms. Remains 613 /895 variables (removed 282) and now considering 1602/2328 (removed 726) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 517 ms. Remains : 613/895 places, 1602/2328 transitions.
[2024-05-23 04:06:04] [INFO ] Flatten gal took : 40 ms
[2024-05-23 04:06:04] [INFO ] Flatten gal took : 45 ms
[2024-05-23 04:06:04] [INFO ] Input system was already deterministic with 1602 transitions.
RANDOM walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 475039 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :0 out of 1
Probabilistic random walk after 475039 steps, saw 308333 distinct states, run finished after 3001 ms. (steps per millisecond=158 ) properties seen :0
[2024-05-23 04:06:07] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2024-05-23 04:06:08] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 04:06:08] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1537 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1537 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1538 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 139/1677 variables, 135/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/1683 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1683 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1683 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1683/1683 variables, and 880 constraints, problems are : Problem set: 0 solved, 1 unsolved in 520 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1475 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1537 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1537 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1538 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 139/1677 variables, 135/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 04:06:09] [INFO ] Deduced a trap composed of 131 places in 154 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 1/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1677 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/1682 variables, 3/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1682 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1683 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1683 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1683 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 882 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1293 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1855ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1602/1602 transitions.
Applied a total of 0 rules in 72 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1602 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 613/613 places, 1602/1602 transitions.
RANDOM walk for 400000 steps (8 resets) in 3737 ms. (107 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-05-23 04:06:10] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-23 04:06:10] [INFO ] Invariant cache hit.
[2024-05-23 04:06:11] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-23 04:06:11] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 04:06:11] [INFO ] After 243ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 04:06:11] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 04:06:11] [INFO ] After 44ms SMT Verify possible using 265 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 04:06:11] [INFO ] After 97ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:06:11] [INFO ] After 447ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:06:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-23 04:06:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 04:06:11] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 04:06:11] [INFO ] After 41ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 04:06:11] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 04:06:11] [INFO ] After 400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (8 resets) in 15698 ms. (254 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3310 ms. (1208 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2520525 steps, run timeout after 15001 ms. (steps per millisecond=168 ) properties seen :0 out of 1
Probabilistic random walk after 2520525 steps, saw 1635861 distinct states, run finished after 15001 ms. (steps per millisecond=168 ) properties seen :0
[2024-05-23 04:06:31] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-23 04:06:31] [INFO ] Invariant cache hit.
[2024-05-23 04:06:31] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1537 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1537 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1538 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 139/1677 variables, 135/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/1683 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1683 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1683 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1683/1683 variables, and 880 constraints, problems are : Problem set: 0 solved, 1 unsolved in 445 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1475 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1537 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1537 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1538 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 139/1677 variables, 135/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 04:06:33] [INFO ] Deduced a trap composed of 131 places in 154 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 1/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1677 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/1682 variables, 3/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1682 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1683 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1683 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1683 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 882 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1240 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1712ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1602/1602 transitions.
Applied a total of 0 rules in 71 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1602 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 613/613 places, 1602/1602 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1602/1602 transitions.
Applied a total of 0 rules in 71 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1602 (removed 0) transitions.
[2024-05-23 04:06:33] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-23 04:06:33] [INFO ] Invariant cache hit.
[2024-05-23 04:06:34] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-23 04:06:34] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-23 04:06:34] [INFO ] Invariant cache hit.
[2024-05-23 04:06:34] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 04:06:35] [INFO ] Implicit Places using invariants and state equation in 1758 ms returned []
Implicit Place search using SMT with State Equation took 2113 ms to find 0 implicit places.
[2024-05-23 04:06:36] [INFO ] Redundant transitions in 93 ms returned []
Running 1600 sub problems to find dead transitions.
[2024-05-23 04:06:36] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-23 04:06:36] [INFO ] Invariant cache hit.
[2024-05-23 04:06:36] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/1683 variables, and 2 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/613 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 3 (OVERLAPS) 1070/1683 variables, 613/615 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1683 variables, 265/880 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 2480 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 31225 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints]
After SMT, in 68633ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 68649ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70933 ms. Remains : 613/613 places, 1602/1602 transitions.
RANDOM walk for 400002 steps (8 resets) in 1437 ms. (278 steps per ms) remains 1/2 properties
Running SMT prover for 1 properties.
[2024-05-23 04:07:45] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-23 04:07:45] [INFO ] Invariant cache hit.
[2024-05-23 04:07:45] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-23 04:07:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:07:45] [INFO ] After 234ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 04:07:45] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 04:07:45] [INFO ] After 59ms SMT Verify possible using 265 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 04:07:45] [INFO ] After 120ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:07:45] [INFO ] After 443ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:07:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-23 04:07:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 04:07:45] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 04:07:45] [INFO ] After 43ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 04:07:45] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 04:07:45] [INFO ] After 410ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 74 steps (0 resets) in 5 ms. (12 steps per ms) remains 0/1 properties
RANDOM walk for 40002 steps (8 resets) in 233 ms. (170 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 505099 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 1
Probabilistic random walk after 505099 steps, saw 327842 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
[2024-05-23 04:07:49] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-23 04:07:49] [INFO ] Invariant cache hit.
[2024-05-23 04:07:49] [INFO ] State equation strengthened by 265 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) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 542/561 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/561 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/566 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 926/1492 variables, 467/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1492 variables, 264/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/1492 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 62/1554 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1554 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 129/1683 variables, 130/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1683 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1683 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1683/1683 variables, and 880 constraints, problems are : Problem set: 0 solved, 1 unsolved in 438 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 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) 6/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/19 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 542/561 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/561 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/561 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/566 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/566 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 926/1492 variables, 467/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1492 variables, 264/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1492 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 62/1554 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1554 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 129/1683 variables, 130/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1683 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1683 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 881 constraints, problems are : Problem set: 0 solved, 1 unsolved in 442 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 895ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1602/1602 transitions.
Graph (complete) has 2677 edges and 613 vertex of which 421 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 421 transition count 1218
Applied a total of 385 rules in 50 ms. Remains 421 /613 variables (removed 192) and now considering 1218/1602 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 421/613 places, 1218/1602 transitions.
RANDOM walk for 30314 steps (6 resets) in 89 ms. (336 steps per ms) remains 0/1 properties
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 942 edges and 613 vertex of which 192 / 613 are part of one of the 64 SCC in 2 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 404 transitions
Reduce isomorphic transitions removed 724 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 485 transition count 868
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 475 transition count 868
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 475 transition count 795
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 167 place count 402 transition count 795
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 339 transition count 732
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 339 transition count 732
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 339 transition count 606
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 673 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 148 transition count 351
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 85 transition count 224
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 22 transition count 98
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 22 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 20 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1122 place count 20 transition count 32
Applied a total of 1122 rules in 109 ms. Remains 20 /613 variables (removed 593) and now considering 32/1602 (removed 1570) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 32 rows 20 cols
[2024-05-23 04:07:50] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 04:07:50] [INFO ] [Real]Absence check using 1 positive place invariants in 27 ms returned sat
[2024-05-23 04:07:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 25 ms returned sat
[2024-05-23 04:07:50] [INFO ] After 233ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 04:07:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:07:50] [INFO ] After 51ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:07:50] [INFO ] After 478ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:07:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 04:07:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 10 ms returned sat
[2024-05-23 04:07:50] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 04:07:50] [INFO ] After 33ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 04:07:50] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 04:07:50] [INFO ] After 141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 746 ms.
Starting structural reductions in LTL mode, iteration 0 : 895/895 places, 2328/2328 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 863 transition count 2242
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 863 transition count 2242
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 78 place count 863 transition count 2228
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 105 place count 836 transition count 2168
Iterating global reduction 1 with 27 rules applied. Total rules applied 132 place count 836 transition count 2168
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 152 place count 816 transition count 2104
Iterating global reduction 1 with 20 rules applied. Total rules applied 172 place count 816 transition count 2104
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 198 place count 790 transition count 2012
Iterating global reduction 1 with 26 rules applied. Total rules applied 224 place count 790 transition count 2012
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 250 place count 764 transition count 1940
Iterating global reduction 1 with 26 rules applied. Total rules applied 276 place count 764 transition count 1940
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 300 place count 740 transition count 1892
Iterating global reduction 1 with 24 rules applied. Total rules applied 324 place count 740 transition count 1892
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 347 place count 717 transition count 1846
Iterating global reduction 1 with 23 rules applied. Total rules applied 370 place count 717 transition count 1846
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 392 place count 695 transition count 1802
Iterating global reduction 1 with 22 rules applied. Total rules applied 414 place count 695 transition count 1802
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 433 place count 676 transition count 1764
Iterating global reduction 1 with 19 rules applied. Total rules applied 452 place count 676 transition count 1764
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 462 place count 666 transition count 1744
Iterating global reduction 1 with 10 rules applied. Total rules applied 472 place count 666 transition count 1744
Applied a total of 472 rules in 291 ms. Remains 666 /895 variables (removed 229) and now considering 1744/2328 (removed 584) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 292 ms. Remains : 666/895 places, 1744/2328 transitions.
[2024-05-23 04:07:51] [INFO ] Flatten gal took : 36 ms
[2024-05-23 04:07:51] [INFO ] Flatten gal took : 40 ms
[2024-05-23 04:07:51] [INFO ] Input system was already deterministic with 1744 transitions.
Starting structural reductions in LTL mode, iteration 0 : 895/895 places, 2328/2328 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 859 transition count 2232
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 859 transition count 2232
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 92 place count 859 transition count 2212
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 124 place count 827 transition count 2140
Iterating global reduction 1 with 32 rules applied. Total rules applied 156 place count 827 transition count 2140
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 160 place count 827 transition count 2136
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 184 place count 803 transition count 2064
Iterating global reduction 2 with 24 rules applied. Total rules applied 208 place count 803 transition count 2064
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 240 place count 771 transition count 1954
Iterating global reduction 2 with 32 rules applied. Total rules applied 272 place count 771 transition count 1954
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 304 place count 739 transition count 1860
Iterating global reduction 2 with 32 rules applied. Total rules applied 336 place count 739 transition count 1860
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 366 place count 709 transition count 1798
Iterating global reduction 2 with 30 rules applied. Total rules applied 396 place count 709 transition count 1798
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 424 place count 681 transition count 1742
Iterating global reduction 2 with 28 rules applied. Total rules applied 452 place count 681 transition count 1742
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 479 place count 654 transition count 1688
Iterating global reduction 2 with 27 rules applied. Total rules applied 506 place count 654 transition count 1688
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 530 place count 630 transition count 1640
Iterating global reduction 2 with 24 rules applied. Total rules applied 554 place count 630 transition count 1640
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 569 place count 615 transition count 1610
Iterating global reduction 2 with 15 rules applied. Total rules applied 584 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 585 place count 614 transition count 1608
Iterating global reduction 2 with 1 rules applied. Total rules applied 586 place count 614 transition count 1608
Applied a total of 586 rules in 200 ms. Remains 614 /895 variables (removed 281) and now considering 1608/2328 (removed 720) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 614/895 places, 1608/2328 transitions.
[2024-05-23 04:07:51] [INFO ] Flatten gal took : 34 ms
[2024-05-23 04:07:51] [INFO ] Flatten gal took : 38 ms
[2024-05-23 04:07:51] [INFO ] Input system was already deterministic with 1608 transitions.
Starting structural reductions in LTL mode, iteration 0 : 895/895 places, 2328/2328 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 859 transition count 2234
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 859 transition count 2234
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 94 place count 859 transition count 2212
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 126 place count 827 transition count 2140
Iterating global reduction 1 with 32 rules applied. Total rules applied 158 place count 827 transition count 2140
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 162 place count 827 transition count 2136
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 187 place count 802 transition count 2060
Iterating global reduction 2 with 25 rules applied. Total rules applied 212 place count 802 transition count 2060
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 244 place count 770 transition count 1950
Iterating global reduction 2 with 32 rules applied. Total rules applied 276 place count 770 transition count 1950
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 308 place count 738 transition count 1858
Iterating global reduction 2 with 32 rules applied. Total rules applied 340 place count 738 transition count 1858
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 370 place count 708 transition count 1796
Iterating global reduction 2 with 30 rules applied. Total rules applied 400 place count 708 transition count 1796
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 428 place count 680 transition count 1740
Iterating global reduction 2 with 28 rules applied. Total rules applied 456 place count 680 transition count 1740
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 483 place count 653 transition count 1686
Iterating global reduction 2 with 27 rules applied. Total rules applied 510 place count 653 transition count 1686
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 534 place count 629 transition count 1638
Iterating global reduction 2 with 24 rules applied. Total rules applied 558 place count 629 transition count 1638
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 572 place count 615 transition count 1610
Iterating global reduction 2 with 14 rules applied. Total rules applied 586 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 587 place count 614 transition count 1608
Iterating global reduction 2 with 1 rules applied. Total rules applied 588 place count 614 transition count 1608
Applied a total of 588 rules in 199 ms. Remains 614 /895 variables (removed 281) and now considering 1608/2328 (removed 720) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 614/895 places, 1608/2328 transitions.
[2024-05-23 04:07:51] [INFO ] Flatten gal took : 35 ms
[2024-05-23 04:07:51] [INFO ] Flatten gal took : 39 ms
[2024-05-23 04:07:52] [INFO ] Input system was already deterministic with 1608 transitions.
Starting structural reductions in LTL mode, iteration 0 : 895/895 places, 2328/2328 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 858 transition count 2230
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 858 transition count 2230
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 94 place count 858 transition count 2210
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 127 place count 825 transition count 2136
Iterating global reduction 1 with 33 rules applied. Total rules applied 160 place count 825 transition count 2136
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 164 place count 825 transition count 2132
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 189 place count 800 transition count 2056
Iterating global reduction 2 with 25 rules applied. Total rules applied 214 place count 800 transition count 2056
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 247 place count 767 transition count 1942
Iterating global reduction 2 with 33 rules applied. Total rules applied 280 place count 767 transition count 1942
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 313 place count 734 transition count 1846
Iterating global reduction 2 with 33 rules applied. Total rules applied 346 place count 734 transition count 1846
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 377 place count 703 transition count 1782
Iterating global reduction 2 with 31 rules applied. Total rules applied 408 place count 703 transition count 1782
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 437 place count 674 transition count 1724
Iterating global reduction 2 with 29 rules applied. Total rules applied 466 place count 674 transition count 1724
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 494 place count 646 transition count 1668
Iterating global reduction 2 with 28 rules applied. Total rules applied 522 place count 646 transition count 1668
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 547 place count 621 transition count 1618
Iterating global reduction 2 with 25 rules applied. Total rules applied 572 place count 621 transition count 1618
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 587 place count 606 transition count 1588
Iterating global reduction 2 with 15 rules applied. Total rules applied 602 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 603 place count 605 transition count 1586
Iterating global reduction 2 with 1 rules applied. Total rules applied 604 place count 605 transition count 1586
Applied a total of 604 rules in 189 ms. Remains 605 /895 variables (removed 290) and now considering 1586/2328 (removed 742) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 605/895 places, 1586/2328 transitions.
[2024-05-23 04:07:52] [INFO ] Flatten gal took : 33 ms
[2024-05-23 04:07:52] [INFO ] Flatten gal took : 36 ms
[2024-05-23 04:07:52] [INFO ] Input system was already deterministic with 1586 transitions.
Starting structural reductions in LTL mode, iteration 0 : 895/895 places, 2328/2328 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 861 transition count 2236
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 861 transition count 2236
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 86 place count 861 transition count 2218
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 118 place count 829 transition count 2146
Iterating global reduction 1 with 32 rules applied. Total rules applied 150 place count 829 transition count 2146
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 154 place count 829 transition count 2142
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 178 place count 805 transition count 2070
Iterating global reduction 2 with 24 rules applied. Total rules applied 202 place count 805 transition count 2070
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 234 place count 773 transition count 1960
Iterating global reduction 2 with 32 rules applied. Total rules applied 266 place count 773 transition count 1960
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 298 place count 741 transition count 1866
Iterating global reduction 2 with 32 rules applied. Total rules applied 330 place count 741 transition count 1866
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 360 place count 711 transition count 1804
Iterating global reduction 2 with 30 rules applied. Total rules applied 390 place count 711 transition count 1804
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 418 place count 683 transition count 1748
Iterating global reduction 2 with 28 rules applied. Total rules applied 446 place count 683 transition count 1748
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 473 place count 656 transition count 1694
Iterating global reduction 2 with 27 rules applied. Total rules applied 500 place count 656 transition count 1694
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 524 place count 632 transition count 1646
Iterating global reduction 2 with 24 rules applied. Total rules applied 548 place count 632 transition count 1646
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 562 place count 618 transition count 1618
Iterating global reduction 2 with 14 rules applied. Total rules applied 576 place count 618 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 577 place count 617 transition count 1616
Iterating global reduction 2 with 1 rules applied. Total rules applied 578 place count 617 transition count 1616
Applied a total of 578 rules in 188 ms. Remains 617 /895 variables (removed 278) and now considering 1616/2328 (removed 712) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 617/895 places, 1616/2328 transitions.
[2024-05-23 04:07:52] [INFO ] Flatten gal took : 31 ms
[2024-05-23 04:07:52] [INFO ] Flatten gal took : 36 ms
[2024-05-23 04:07:52] [INFO ] Input system was already deterministic with 1616 transitions.
Starting structural reductions in LTL mode, iteration 0 : 895/895 places, 2328/2328 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 859 transition count 2234
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 859 transition count 2234
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 92 place count 859 transition count 2214
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 124 place count 827 transition count 2142
Iterating global reduction 1 with 32 rules applied. Total rules applied 156 place count 827 transition count 2142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 160 place count 827 transition count 2138
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 184 place count 803 transition count 2064
Iterating global reduction 2 with 24 rules applied. Total rules applied 208 place count 803 transition count 2064
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 240 place count 771 transition count 1952
Iterating global reduction 2 with 32 rules applied. Total rules applied 272 place count 771 transition count 1952
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 304 place count 739 transition count 1858
Iterating global reduction 2 with 32 rules applied. Total rules applied 336 place count 739 transition count 1858
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 366 place count 709 transition count 1796
Iterating global reduction 2 with 30 rules applied. Total rules applied 396 place count 709 transition count 1796
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 425 place count 680 transition count 1738
Iterating global reduction 2 with 29 rules applied. Total rules applied 454 place count 680 transition count 1738
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 482 place count 652 transition count 1682
Iterating global reduction 2 with 28 rules applied. Total rules applied 510 place count 652 transition count 1682
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 535 place count 627 transition count 1632
Iterating global reduction 2 with 25 rules applied. Total rules applied 560 place count 627 transition count 1632
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 575 place count 612 transition count 1602
Iterating global reduction 2 with 15 rules applied. Total rules applied 590 place count 612 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 591 place count 611 transition count 1600
Iterating global reduction 2 with 1 rules applied. Total rules applied 592 place count 611 transition count 1600
Applied a total of 592 rules in 182 ms. Remains 611 /895 variables (removed 284) and now considering 1600/2328 (removed 728) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 182 ms. Remains : 611/895 places, 1600/2328 transitions.
[2024-05-23 04:07:52] [INFO ] Flatten gal took : 29 ms
[2024-05-23 04:07:52] [INFO ] Flatten gal took : 33 ms
[2024-05-23 04:07:52] [INFO ] Input system was already deterministic with 1600 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 895/895 places, 2328/2328 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 859 transition count 2232
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 859 transition count 2232
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 90 place count 859 transition count 2214
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 122 place count 827 transition count 2142
Iterating global reduction 1 with 32 rules applied. Total rules applied 154 place count 827 transition count 2142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 158 place count 827 transition count 2138
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 182 place count 803 transition count 2064
Iterating global reduction 2 with 24 rules applied. Total rules applied 206 place count 803 transition count 2064
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 237 place count 772 transition count 1958
Iterating global reduction 2 with 31 rules applied. Total rules applied 268 place count 772 transition count 1958
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 300 place count 740 transition count 1866
Iterating global reduction 2 with 32 rules applied. Total rules applied 332 place count 740 transition count 1866
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 362 place count 710 transition count 1802
Iterating global reduction 2 with 30 rules applied. Total rules applied 392 place count 710 transition count 1802
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 420 place count 682 transition count 1746
Iterating global reduction 2 with 28 rules applied. Total rules applied 448 place count 682 transition count 1746
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 475 place count 655 transition count 1692
Iterating global reduction 2 with 27 rules applied. Total rules applied 502 place count 655 transition count 1692
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 526 place count 631 transition count 1644
Iterating global reduction 2 with 24 rules applied. Total rules applied 550 place count 631 transition count 1644
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 564 place count 617 transition count 1616
Iterating global reduction 2 with 14 rules applied. Total rules applied 578 place count 617 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 580 place count 615 transition count 1612
Iterating global reduction 2 with 2 rules applied. Total rules applied 582 place count 615 transition count 1612
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 586 place count 615 transition count 1608
Applied a total of 586 rules in 360 ms. Remains 615 /895 variables (removed 280) and now considering 1608/2328 (removed 720) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 361 ms. Remains : 615/895 places, 1608/2328 transitions.
[2024-05-23 04:07:53] [INFO ] Flatten gal took : 31 ms
[2024-05-23 04:07:53] [INFO ] Flatten gal took : 34 ms
[2024-05-23 04:07:53] [INFO ] Input system was already deterministic with 1608 transitions.
Starting structural reductions in LTL mode, iteration 0 : 895/895 places, 2328/2328 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 860 transition count 2234
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 860 transition count 2234
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 90 place count 860 transition count 2214
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 121 place count 829 transition count 2144
Iterating global reduction 1 with 31 rules applied. Total rules applied 152 place count 829 transition count 2144
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 156 place count 829 transition count 2140
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 179 place count 806 transition count 2070
Iterating global reduction 2 with 23 rules applied. Total rules applied 202 place count 806 transition count 2070
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 234 place count 774 transition count 1960
Iterating global reduction 2 with 32 rules applied. Total rules applied 266 place count 774 transition count 1960
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 298 place count 742 transition count 1866
Iterating global reduction 2 with 32 rules applied. Total rules applied 330 place count 742 transition count 1866
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 360 place count 712 transition count 1804
Iterating global reduction 2 with 30 rules applied. Total rules applied 390 place count 712 transition count 1804
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 418 place count 684 transition count 1748
Iterating global reduction 2 with 28 rules applied. Total rules applied 446 place count 684 transition count 1748
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 473 place count 657 transition count 1694
Iterating global reduction 2 with 27 rules applied. Total rules applied 500 place count 657 transition count 1694
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 524 place count 633 transition count 1646
Iterating global reduction 2 with 24 rules applied. Total rules applied 548 place count 633 transition count 1646
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 563 place count 618 transition count 1616
Iterating global reduction 2 with 15 rules applied. Total rules applied 578 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 579 place count 617 transition count 1614
Iterating global reduction 2 with 1 rules applied. Total rules applied 580 place count 617 transition count 1614
Applied a total of 580 rules in 187 ms. Remains 617 /895 variables (removed 278) and now considering 1614/2328 (removed 714) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 617/895 places, 1614/2328 transitions.
[2024-05-23 04:07:53] [INFO ] Flatten gal took : 31 ms
[2024-05-23 04:07:53] [INFO ] Flatten gal took : 34 ms
[2024-05-23 04:07:53] [INFO ] Input system was already deterministic with 1614 transitions.
Starting structural reductions in LTL mode, iteration 0 : 895/895 places, 2328/2328 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 865 transition count 2252
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 865 transition count 2252
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 80 place count 865 transition count 2232
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 106 place count 839 transition count 2176
Iterating global reduction 1 with 26 rules applied. Total rules applied 132 place count 839 transition count 2176
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 140 place count 839 transition count 2168
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 159 place count 820 transition count 2112
Iterating global reduction 2 with 19 rules applied. Total rules applied 178 place count 820 transition count 2112
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 204 place count 794 transition count 2020
Iterating global reduction 2 with 26 rules applied. Total rules applied 230 place count 794 transition count 2020
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 256 place count 768 transition count 1940
Iterating global reduction 2 with 26 rules applied. Total rules applied 282 place count 768 transition count 1940
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 307 place count 743 transition count 1888
Iterating global reduction 2 with 25 rules applied. Total rules applied 332 place count 743 transition count 1888
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 355 place count 720 transition count 1842
Iterating global reduction 2 with 23 rules applied. Total rules applied 378 place count 720 transition count 1842
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 401 place count 697 transition count 1796
Iterating global reduction 2 with 23 rules applied. Total rules applied 424 place count 697 transition count 1796
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 445 place count 676 transition count 1754
Iterating global reduction 2 with 21 rules applied. Total rules applied 466 place count 676 transition count 1754
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 480 place count 662 transition count 1726
Iterating global reduction 2 with 14 rules applied. Total rules applied 494 place count 662 transition count 1726
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 495 place count 661 transition count 1724
Iterating global reduction 2 with 1 rules applied. Total rules applied 496 place count 661 transition count 1724
Applied a total of 496 rules in 190 ms. Remains 661 /895 variables (removed 234) and now considering 1724/2328 (removed 604) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 661/895 places, 1724/2328 transitions.
[2024-05-23 04:07:54] [INFO ] Flatten gal took : 31 ms
[2024-05-23 04:07:54] [INFO ] Flatten gal took : 35 ms
[2024-05-23 04:07:54] [INFO ] Input system was already deterministic with 1724 transitions.
[2024-05-23 04:07:54] [INFO ] Flatten gal took : 47 ms
[2024-05-23 04:07:54] [INFO ] Flatten gal took : 48 ms
[2024-05-23 04:07:54] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-05-23 04:07:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 895 places, 2328 transitions and 9438 arcs took 13 ms.
Total runtime 316094 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FunctionPointer-PT-c004

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.007s, 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: 688
MODEL NAME: /home/mcc/execution/415/model
895 places, 2328 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 1716437956472

--------------------
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 CTLFireability -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="FunctionPointer-PT-c004"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FunctionPointer-PT-c004, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-171640601200282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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