Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 20K Apr 11 17:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 11 17:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 340K Apr 11 17:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Apr 11 17:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.1K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 28K Apr 11 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 374K Apr 11 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M Apr 11 17:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 11M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-PT-S06J06T06-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716873539443

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S06J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 05:19:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 05:19:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 05:19:02] [INFO ] Load time of PNML (sax parser for PT used): 920 ms
[2024-05-28 05:19:02] [INFO ] Transformed 700 places.
[2024-05-28 05:19:02] [INFO ] Transformed 10740 transitions.
[2024-05-28 05:19:02] [INFO ] Parsed PT model containing 700 places and 10740 transitions and 89778 arcs in 1351 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 118 ms.
[2024-05-28 05:19:02] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-28 05:19:02] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-28 05:19:02] [INFO ] Reduced 7020 identical enabling conditions.
[2024-05-28 05:19:02] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-28 05:19:02] [INFO ] Reduced 7020 identical enabling conditions.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Support contains 374 out of 700 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 694 transition count 2664
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 694 transition count 2664
Applied a total of 12 rules in 235 ms. Remains 694 /700 variables (removed 6) and now considering 2664/2670 (removed 6) transitions.
Running 2658 sub problems to find dead transitions.
[2024-05-28 05:19:03] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
// Phase 1: matrix 2628 rows 694 cols
[2024-05-28 05:19:04] [INFO ] Computed 58 invariants in 289 ms
[2024-05-28 05:19:04] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
SMT process timed out in 43247ms, After SMT, problems are : Problem set: 0 solved, 2658 unsolved
Search for dead transitions found 0 dead transitions in 43370ms
[2024-05-28 05:19:47] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
[2024-05-28 05:19:47] [INFO ] Invariant cache hit.
[2024-05-28 05:19:47] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-05-28 05:19:47] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
[2024-05-28 05:19:47] [INFO ] Invariant cache hit.
[2024-05-28 05:19:49] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 05:20:16] [INFO ] Implicit Places using invariants and state equation in 29017 ms returned []
Implicit Place search using SMT with State Equation took 29458 ms to find 0 implicit places.
Running 2658 sub problems to find dead transitions.
[2024-05-28 05:20:16] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
[2024-05-28 05:20:16] [INFO ] Invariant cache hit.
[2024-05-28 05:20:16] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/682 variables, 29/45 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
[2024-05-28 05:21:10] [INFO ] Deduced a trap composed of 151 places in 501 ms of which 44 ms to minimize.
[2024-05-28 05:21:11] [INFO ] Deduced a trap composed of 16 places in 323 ms of which 3 ms to minimize.
[2024-05-28 05:21:11] [INFO ] Deduced a trap composed of 15 places in 312 ms of which 2 ms to minimize.
[2024-05-28 05:21:12] [INFO ] Deduced a trap composed of 319 places in 483 ms of which 5 ms to minimize.
[2024-05-28 05:21:14] [INFO ] Deduced a trap composed of 336 places in 528 ms of which 5 ms to minimize.
[2024-05-28 05:21:15] [INFO ] Deduced a trap composed of 41 places in 366 ms of which 3 ms to minimize.
SMT process timed out in 58795ms, After SMT, problems are : Problem set: 0 solved, 2658 unsolved
Search for dead transitions found 0 dead transitions in 58849ms
Starting structural reductions in LTL mode, iteration 1 : 694/700 places, 2664/2670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132059 ms. Remains : 694/700 places, 2664/2670 transitions.
Support contains 374 out of 694 places after structural reductions.
[2024-05-28 05:21:16] [INFO ] Flatten gal took : 340 ms
[2024-05-28 05:21:16] [INFO ] Flatten gal took : 201 ms
[2024-05-28 05:21:17] [INFO ] Input system was already deterministic with 2664 transitions.
Reduction of identical properties reduced properties to check from 61 to 59
RANDOM walk for 40000 steps (239 resets) in 5960 ms. (6 steps per ms) remains 25/59 properties
BEST_FIRST walk for 4004 steps (13 resets) in 113 ms. (35 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (10 resets) in 149 ms. (26 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (15 resets) in 216 ms. (18 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (16 resets) in 57 ms. (69 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (11 resets) in 34 ms. (114 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (11 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 67 ms. (58 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (8 resets) in 28 ms. (137 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
[2024-05-28 05:21:19] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
[2024-05-28 05:21:19] [INFO ] Invariant cache hit.
[2024-05-28 05:21:19] [INFO ] State equation strengthened by 168 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 1 (OVERLAPS) 197/303 variables, 11/11 constraints. Problems are: Problem set: 2 solved, 23 unsolved
Problem AtomicPropp36 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 3/14 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 23/326 variables, 4/18 constraints. Problems are: Problem set: 3 solved, 22 unsolved
[2024-05-28 05:21:20] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/326 variables, 1/19 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/326 variables, 0/19 constraints. Problems are: Problem set: 3 solved, 22 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp60 is UNSAT
At refinement iteration 7 (OVERLAPS) 364/690 variables, 37/56 constraints. Problems are: Problem set: 21 solved, 4 unsolved
[2024-05-28 05:21:22] [INFO ] Deduced a trap composed of 92 places in 218 ms of which 2 ms to minimize.
[2024-05-28 05:21:22] [INFO ] Deduced a trap composed of 93 places in 196 ms of which 3 ms to minimize.
[2024-05-28 05:21:22] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 2 ms to minimize.
[2024-05-28 05:21:22] [INFO ] Deduced a trap composed of 92 places in 102 ms of which 1 ms to minimize.
[2024-05-28 05:21:22] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/690 variables, 5/61 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/690 variables, 0/61 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/691 variables, 1/62 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/691 variables, 0/62 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 1/692 variables, 1/63 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/692 variables, 0/63 constraints. Problems are: Problem set: 21 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3320/3322 variables, and 755 constraints, problems are : Problem set: 21 solved, 4 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 692/694 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 25/3 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 21 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 82/93 variables, 2/2 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 1/3 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 18/111 variables, 3/6 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/6 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 54/165 variables, 2/8 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 0/8 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 497/662 variables, 25/33 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/662 variables, 1/34 constraints. Problems are: Problem set: 21 solved, 4 unsolved
[2024-05-28 05:21:26] [INFO ] Deduced a trap composed of 92 places in 346 ms of which 3 ms to minimize.
[2024-05-28 05:21:26] [INFO ] Deduced a trap composed of 92 places in 283 ms of which 2 ms to minimize.
[2024-05-28 05:21:27] [INFO ] Deduced a trap composed of 93 places in 192 ms of which 2 ms to minimize.
[2024-05-28 05:21:27] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/662 variables, 4/38 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/662 variables, 0/38 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 13/675 variables, 9/47 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/675 variables, 1/48 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/675 variables, 0/48 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 17/692 variables, 15/63 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/692 variables, 4/67 constraints. Problems are: Problem set: 21 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/692 variables, 0/67 constraints. Problems are: Problem set: 21 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3320/3322 variables, and 759 constraints, problems are : Problem set: 21 solved, 4 unsolved in 5027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 692/694 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 10/10 constraints]
After SMT, in 10720ms problems are : Problem set: 21 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 694/694 places, 2664/2664 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 688 transition count 2628
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 78 place count 652 transition count 2628
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 78 place count 652 transition count 2544
Deduced a syphon composed of 84 places in 3 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 246 place count 568 transition count 2544
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 3 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 402 place count 490 transition count 2466
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 2 with 14 rules applied. Total rules applied 416 place count 490 transition count 2452
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 430 place count 476 transition count 2452
Applied a total of 430 rules in 568 ms. Remains 476 /694 variables (removed 218) and now considering 2452/2664 (removed 212) transitions.
Running 2446 sub problems to find dead transitions.
[2024-05-28 05:21:31] [INFO ] Flow matrix only has 2416 transitions (discarded 36 similar events)
// Phase 1: matrix 2416 rows 476 cols
[2024-05-28 05:21:31] [INFO ] Computed 52 invariants in 136 ms
[2024-05-28 05:21:31] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2446 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 2446 unsolved
[2024-05-28 05:22:17] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 2 ms to minimize.
[2024-05-28 05:22:18] [INFO ] Deduced a trap composed of 27 places in 229 ms of which 3 ms to minimize.
[2024-05-28 05:22:19] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/2892 variables, and 44 constraints, problems are : Problem set: 0 solved, 2446 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 22/33 constraints, State Equation: 0/476 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2446/1192 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2446 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2446 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 2446 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/470 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 2446 unsolved
[2024-05-28 05:22:24] [INFO ] Deduced a trap composed of 56 places in 579 ms of which 3 ms to minimize.
[2024-05-28 05:22:25] [INFO ] Deduced a trap composed of 29 places in 569 ms of which 3 ms to minimize.
[2024-05-28 05:22:25] [INFO ] Deduced a trap composed of 33 places in 572 ms of which 3 ms to minimize.
[2024-05-28 05:22:25] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 1 ms to minimize.
[2024-05-28 05:22:25] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 1 ms to minimize.
[2024-05-28 05:22:26] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 1 ms to minimize.
[2024-05-28 05:22:28] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 1 ms to minimize.
[2024-05-28 05:22:28] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/2892 variables, and 52 constraints, problems are : Problem set: 0 solved, 2446 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 22/33 constraints, State Equation: 0/476 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1192 constraints, Known Traps: 11/11 constraints]
After SMT, in 69700ms problems are : Problem set: 0 solved, 2446 unsolved
Search for dead transitions found 0 dead transitions in 69744ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70322 ms. Remains : 476/694 places, 2452/2664 transitions.
RANDOM walk for 40000 steps (415 resets) in 781 ms. (51 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40001 steps (85 resets) in 308 ms. (129 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (43 resets) in 274 ms. (145 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (32 resets) in 252 ms. (158 steps per ms) remains 1/1 properties
[2024-05-28 05:22:41] [INFO ] Flow matrix only has 2416 transitions (discarded 36 similar events)
[2024-05-28 05:22:41] [INFO ] Invariant cache hit.
[2024-05-28 05:22:41] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 298/303 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/385 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 88/473 variables, 25/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/474 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2890/2892 variables, and 525 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6005 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 474/476 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 298/303 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/303 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 82/385 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/385 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 88/473 variables, 25/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 05:22:47] [INFO ] Deduced a trap composed of 57 places in 203 ms of which 2 ms to minimize.
[2024-05-28 05:22:47] [INFO ] Deduced a trap composed of 57 places in 135 ms of which 2 ms to minimize.
[2024-05-28 05:22:48] [INFO ] Deduced a trap composed of 56 places in 117 ms of which 1 ms to minimize.
[2024-05-28 05:22:48] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/474 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2890/2892 variables, and 529 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6562 ms.
Refiners :[Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 474/476 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 4/4 constraints]
After SMT, in 12607ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 76 ms.
Support contains 5 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 2452/2452 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 476 transition count 2449
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 473 transition count 2449
Applied a total of 6 rules in 163 ms. Remains 473 /476 variables (removed 3) and now considering 2449/2452 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 473/476 places, 2449/2452 transitions.
RANDOM walk for 40000 steps (448 resets) in 1184 ms. (33 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (33 resets) in 391 ms. (102 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 77536 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :0 out of 1
Probabilistic random walk after 77536 steps, saw 30812 distinct states, run finished after 3005 ms. (steps per millisecond=25 ) properties seen :0
[2024-05-28 05:22:57] [INFO ] Flow matrix only has 2413 transitions (discarded 36 similar events)
// Phase 1: matrix 2413 rows 473 cols
[2024-05-28 05:22:57] [INFO ] Computed 52 invariants in 98 ms
[2024-05-28 05:22:57] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 274/279 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 61/340 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/353 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 105/458 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 05:22:58] [INFO ] Deduced a trap composed of 57 places in 192 ms of which 2 ms to minimize.
[2024-05-28 05:22:58] [INFO ] Deduced a trap composed of 56 places in 142 ms of which 1 ms to minimize.
[2024-05-28 05:22:58] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 1 ms to minimize.
[2024-05-28 05:22:58] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/465 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/465 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 6/471 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/471 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2413/2884 variables, 471/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2884 variables, 168/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2884 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/2886 variables, 2/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2886 variables, 1/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2886 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/2886 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2886/2886 variables, and 697 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5197 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 473/473 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 274/279 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/279 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 61/340 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/353 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 105/458 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 05:23:03] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/465 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/465 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/471 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/471 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2413/2884 variables, 471/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2884 variables, 168/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2884 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/2886 variables, 2/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2886 variables, 1/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2886 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/2886 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2886/2886 variables, and 698 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6750 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 473/473 constraints, ReadFeed: 168/168 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 5/5 constraints]
After SMT, in 12102ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 90 ms.
Support contains 5 out of 473 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 473/473 places, 2449/2449 transitions.
Applied a total of 0 rules in 81 ms. Remains 473 /473 variables (removed 0) and now considering 2449/2449 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 473/473 places, 2449/2449 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 473/473 places, 2449/2449 transitions.
Applied a total of 0 rules in 71 ms. Remains 473 /473 variables (removed 0) and now considering 2449/2449 (removed 0) transitions.
[2024-05-28 05:23:10] [INFO ] Flow matrix only has 2413 transitions (discarded 36 similar events)
[2024-05-28 05:23:10] [INFO ] Invariant cache hit.
[2024-05-28 05:23:10] [INFO ] Implicit Places using invariants in 770 ms returned [45, 125, 316, 359, 456, 460]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 788 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 467/473 places, 2449/2449 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 464 transition count 2446
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 464 transition count 2446
Applied a total of 6 rules in 121 ms. Remains 464 /467 variables (removed 3) and now considering 2446/2449 (removed 3) transitions.
[2024-05-28 05:23:10] [INFO ] Flow matrix only has 2410 transitions (discarded 36 similar events)
// Phase 1: matrix 2410 rows 464 cols
[2024-05-28 05:23:10] [INFO ] Computed 46 invariants in 53 ms
[2024-05-28 05:23:11] [INFO ] Implicit Places using invariants in 676 ms returned []
[2024-05-28 05:23:11] [INFO ] Flow matrix only has 2410 transitions (discarded 36 similar events)
[2024-05-28 05:23:11] [INFO ] Invariant cache hit.
[2024-05-28 05:23:13] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-05-28 05:23:35] [INFO ] Implicit Places using invariants and state equation in 23461 ms returned []
Implicit Place search using SMT with State Equation took 24141 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 464/473 places, 2446/2449 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 25129 ms. Remains : 464/473 places, 2446/2449 transitions.
Successfully simplified 21 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-PT-S06J06T06-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T06-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S06J06T06-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 05:23:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 05:23:35] [INFO ] Flatten gal took : 152 ms
FORMULA PolyORBLF-PT-S06J06T06-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 05:23:35] [INFO ] Flatten gal took : 168 ms
[2024-05-28 05:23:36] [INFO ] Input system was already deterministic with 2664 transitions.
Support contains 310 out of 694 places (down from 312) after GAL structural reductions.
FORMULA PolyORBLF-PT-S06J06T06-CTLFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 694/694 places, 2664/2664 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 688 transition count 2664
Applied a total of 6 rules in 36 ms. Remains 688 /694 variables (removed 6) and now considering 2664/2664 (removed 0) transitions.
Running 2658 sub problems to find dead transitions.
[2024-05-28 05:23:36] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
// Phase 1: matrix 2628 rows 688 cols
[2024-05-28 05:23:36] [INFO ] Computed 52 invariants in 104 ms
[2024-05-28 05:23:36] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
SMT process timed out in 41649ms, After SMT, problems are : Problem set: 0 solved, 2658 unsolved
Search for dead transitions found 0 dead transitions in 41674ms
Finished structural reductions in LTL mode , in 1 iterations and 41718 ms. Remains : 688/694 places, 2664/2664 transitions.
[2024-05-28 05:24:18] [INFO ] Flatten gal took : 110 ms
[2024-05-28 05:24:18] [INFO ] Flatten gal took : 141 ms
[2024-05-28 05:24:18] [INFO ] Input system was already deterministic with 2664 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 694/694 places, 2664/2664 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 688 transition count 2622
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 646 transition count 2622
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 84 place count 646 transition count 2538
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 252 place count 562 transition count 2538
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 408 place count 484 transition count 2460
Applied a total of 408 rules in 193 ms. Remains 484 /694 variables (removed 210) and now considering 2460/2664 (removed 204) transitions.
Running 2454 sub problems to find dead transitions.
[2024-05-28 05:24:18] [INFO ] Flow matrix only has 2424 transitions (discarded 36 similar events)
// Phase 1: matrix 2424 rows 484 cols
[2024-05-28 05:24:18] [INFO ] Computed 52 invariants in 71 ms
[2024-05-28 05:24:18] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 25/45 constraints. Problems are: Problem set: 0 solved, 2454 unsolved
[2024-05-28 05:24:55] [INFO ] Deduced a trap composed of 40 places in 291 ms of which 5 ms to minimize.
[2024-05-28 05:24:56] [INFO ] Deduced a trap composed of 40 places in 323 ms of which 1 ms to minimize.
[2024-05-28 05:24:56] [INFO ] Deduced a trap composed of 40 places in 290 ms of which 2 ms to minimize.
[2024-05-28 05:24:56] [INFO ] Deduced a trap composed of 15 places in 247 ms of which 2 ms to minimize.
[2024-05-28 05:24:57] [INFO ] Deduced a trap composed of 26 places in 365 ms of which 2 ms to minimize.
[2024-05-28 05:24:57] [INFO ] Deduced a trap composed of 55 places in 321 ms of which 3 ms to minimize.
[2024-05-28 05:25:00] [INFO ] Deduced a trap composed of 47 places in 294 ms of which 1 ms to minimize.
SMT process timed out in 41300ms, After SMT, problems are : Problem set: 0 solved, 2454 unsolved
Search for dead transitions found 0 dead transitions in 41327ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 41526 ms. Remains : 484/694 places, 2460/2664 transitions.
[2024-05-28 05:25:00] [INFO ] Flatten gal took : 100 ms
[2024-05-28 05:25:00] [INFO ] Flatten gal took : 105 ms
[2024-05-28 05:25:00] [INFO ] Input system was already deterministic with 2460 transitions.
RANDOM walk for 1929 steps (26 resets) in 50 ms. (37 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S06J06T06-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 694/694 places, 2664/2664 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 688 transition count 2622
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 646 transition count 2622
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 84 place count 646 transition count 2574
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 180 place count 598 transition count 2574
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 336 place count 520 transition count 2496
Applied a total of 336 rules in 169 ms. Remains 520 /694 variables (removed 174) and now considering 2496/2664 (removed 168) transitions.
Running 2490 sub problems to find dead transitions.
[2024-05-28 05:25:00] [INFO ] Flow matrix only has 2460 transitions (discarded 36 similar events)
// Phase 1: matrix 2460 rows 520 cols
[2024-05-28 05:25:00] [INFO ] Computed 52 invariants in 82 ms
[2024-05-28 05:25:00] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
[2024-05-28 05:25:39] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 9.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 4.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 4.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 3.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s98 1.0)
(s99 2.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 3.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 2.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 4.0)
(s130 1.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 4.0)
(s141 7.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 2.0)
(s154 0.0)
(s155 1.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 1.0)
(s171 2.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 1.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 4.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 2.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 4.0)
(s223 0.0)
(s224 0.0)
(s225 1.0)
(s226 4.0)
(s227 1.0)
(s228 0.0)
(s229 3.0)
(s230 1.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 3.0)
(s241 1.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 1.0)
(s269 4.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 2.0)
(s284 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 1.0)
(s291 0.0)
(s292 3.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 1.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 4.0)
(s303 1.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 1.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 9.0)
(s347 1.0)
(s348 2.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 3.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 4.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 1.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 1.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 1.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 1.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 2.0)
(s437 0.0)
(s438 4.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 1.0)
(s447 0.0)
(s448 1.0)
(s449 1.0)
(s450 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 1.0)
(s458 0.0)
(s459 4.0)
(s460 1.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 1.0)
(s477 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/2980 variables, and 41 constraints, problems are : Problem set: 0 solved, 2490 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 19/22 constraints, Generalized P Invariants (flows): 21/30 constraints, State Equation: 0/520 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2490/1236 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2490 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/514 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/514 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
[2024-05-28 05:25:59] [INFO ] Deduced a trap composed of 7 places in 500 ms of which 3 ms to minimize.
[2024-05-28 05:25:59] [INFO ] Deduced a trap composed of 35 places in 454 ms of which 2 ms to minimize.
[2024-05-28 05:25:59] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2024-05-28 05:25:59] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-05-28 05:26:00] [INFO ] Deduced a trap composed of 67 places in 419 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 10)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 4)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s98 0)
(s99 0)
(s100 1)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 1)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 1)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 3)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 10)
(s142 0)
(s143 0)
(s144 0)
(s145 1)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 1)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 1)
(s193 0)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 6)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 3)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 1)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s286 0)
(s287 0)
(s288 0)
(s289 1)
(s290 1)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 2)
(s307 0)
(s308 1)
(s309 0)
(s310 1)
(s311 0)
(s312 0)
(s313 0)
(s314 1)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 1)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 8)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 1)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 1)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 1)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 1)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 1)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 3)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 1)
(s458 0)
(s459 3)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 1)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 3)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 1)
(s512 0)
(s513timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 514/2980 variables, and 46 constraints, problems are : Problem set: 0 solved, 2490 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 19/22 constraints, Generalized P Invariants (flows): 21/30 constraints, State Equation: 0/520 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1236 constraints, Known Traps: 6/6 constraints]
After SMT, in 60802ms problems are : Problem set: 0 solved, 2490 unsolved
Search for dead transitions found 0 dead transitions in 60826ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 61001 ms. Remains : 520/694 places, 2496/2664 transitions.
[2024-05-28 05:26:01] [INFO ] Flatten gal took : 98 ms
[2024-05-28 05:26:01] [INFO ] Flatten gal took : 105 ms
[2024-05-28 05:26:01] [INFO ] Input system was already deterministic with 2496 transitions.
RANDOM walk for 159 steps (3 resets) in 8 ms. (17 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S06J06T06-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 694/694 places, 2664/2664 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 688 transition count 2634
Reduce places removed 30 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 36 rules applied. Total rules applied 66 place count 658 transition count 2628
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 72 place count 652 transition count 2628
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 72 place count 652 transition count 2544
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 240 place count 568 transition count 2544
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 324 place count 526 transition count 2502
Applied a total of 324 rules in 235 ms. Remains 526 /694 variables (removed 168) and now considering 2502/2664 (removed 162) transitions.
Running 2496 sub problems to find dead transitions.
[2024-05-28 05:26:02] [INFO ] Flow matrix only has 2466 transitions (discarded 36 similar events)
// Phase 1: matrix 2466 rows 526 cols
[2024-05-28 05:26:02] [INFO ] Computed 52 invariants in 95 ms
[2024-05-28 05:26:02] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 2496 unsolved
[2024-05-28 05:26:41] [INFO ] Deduced a trap composed of 44 places in 154 ms of which 2 ms to minimize.
[2024-05-28 05:26:42] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 14 ms to minimize.
[2024-05-28 05:26:42] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 520/2992 variables, and 44 constraints, problems are : Problem set: 0 solved, 2496 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 26/35 constraints, State Equation: 0/526 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2496/1242 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/520 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/520 variables, 26/41 constraints. Problems are: Problem set: 0 solved, 2496 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/520 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 2496 unsolved
[2024-05-28 05:26:45] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/2992 variables, and 45 constraints, problems are : Problem set: 0 solved, 2496 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 15/17 constraints, Generalized P Invariants (flows): 26/35 constraints, State Equation: 0/526 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1242 constraints, Known Traps: 4/4 constraints]
After SMT, in 60776ms problems are : Problem set: 0 solved, 2496 unsolved
Search for dead transitions found 0 dead transitions in 60800ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 61053 ms. Remains : 526/694 places, 2502/2664 transitions.
[2024-05-28 05:27:03] [INFO ] Flatten gal took : 99 ms
[2024-05-28 05:27:03] [INFO ] Flatten gal took : 111 ms
[2024-05-28 05:27:03] [INFO ] Input system was already deterministic with 2502 transitions.
Starting structural reductions in LTL mode, iteration 0 : 694/694 places, 2664/2664 transitions.
Applied a total of 0 rules in 23 ms. Remains 694 /694 variables (removed 0) and now considering 2664/2664 (removed 0) transitions.
Running 2658 sub problems to find dead transitions.
[2024-05-28 05:27:03] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
// Phase 1: matrix 2628 rows 694 cols
[2024-05-28 05:27:03] [INFO ] Computed 58 invariants in 77 ms
[2024-05-28 05:27:03] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
SMT process timed out in 40469ms, After SMT, problems are : Problem set: 0 solved, 2658 unsolved
Search for dead transitions found 0 dead transitions in 40495ms
Finished structural reductions in LTL mode , in 1 iterations and 40524 ms. Remains : 694/694 places, 2664/2664 transitions.
[2024-05-28 05:27:44] [INFO ] Flatten gal took : 112 ms
[2024-05-28 05:27:44] [INFO ] Flatten gal took : 129 ms
[2024-05-28 05:27:44] [INFO ] Input system was already deterministic with 2664 transitions.
Starting structural reductions in LTL mode, iteration 0 : 694/694 places, 2664/2664 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 688 transition count 2664
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 682 transition count 2658
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 682 transition count 2658
Applied a total of 18 rules in 57 ms. Remains 682 /694 variables (removed 12) and now considering 2658/2664 (removed 6) transitions.
Running 2652 sub problems to find dead transitions.
[2024-05-28 05:27:44] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
// Phase 1: matrix 2622 rows 682 cols
[2024-05-28 05:27:44] [INFO ] Computed 52 invariants in 54 ms
[2024-05-28 05:27:44] [INFO ] State equation strengthened by 168 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 10.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 0.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 4.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 0.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 0.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 4.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 0.0)
(s124 1.0)
(s125 1.0)
(s126 3.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s133 1.0)
(s134 2.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 0.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 3.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 4.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 4.0)
(s194 10.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 1.0)
(s206 0.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 2.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 0.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 0.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 1.0)
(s276 1.0)
(s277 2.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 0.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 0.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 4.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 4.0)
(s310 1.0)
(s311 1.0)
(s312 3.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 0.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 3.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 0.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 4.0)
(s366 0.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 0.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 0.0)
(s377 1.0)
(s378 1.0)
(s379 0.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s385 1.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 3.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 0.0)
(s406 4.0)
(s407 1.0)
(s408 0.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 0.0)
(s424 0.0)
(s425 1.0)
(s426 1.0)
(s427 0.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 0.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 9.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 0.0)
(s470 1.0)
(s471 0.0)
(s472 0.0)
(s473 1.0)
(s474 1.0)
(s475 0.0)
(s476 1.0)
(s477 1.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 0.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 0.0)
(s490 0.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 0.0)
(s496 1.0)
(s497 0.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 4.0)
(s503 0.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 0.0)
(s511 1.0)
(s512 0.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 0.0)
(s525 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 41031ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 41056ms
Finished structural reductions in LTL mode , in 1 iterations and 41119 ms. Remains : 682/694 places, 2658/2664 transitions.
[2024-05-28 05:28:25] [INFO ] Flatten gal took : 111 ms
[2024-05-28 05:28:25] [INFO ] Flatten gal took : 125 ms
[2024-05-28 05:28:26] [INFO ] Input system was already deterministic with 2658 transitions.
Starting structural reductions in LTL mode, iteration 0 : 694/694 places, 2664/2664 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 688 transition count 2664
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 682 transition count 2658
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 682 transition count 2658
Applied a total of 18 rules in 54 ms. Remains 682 /694 variables (removed 12) and now considering 2658/2664 (removed 6) transitions.
Running 2652 sub problems to find dead transitions.
[2024-05-28 05:28:26] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-05-28 05:28:26] [INFO ] Invariant cache hit.
[2024-05-28 05:28:26] [INFO ] State equation strengthened by 168 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 40830ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 40855ms
Finished structural reductions in LTL mode , in 1 iterations and 40915 ms. Remains : 682/694 places, 2658/2664 transitions.
[2024-05-28 05:29:07] [INFO ] Flatten gal took : 102 ms
[2024-05-28 05:29:07] [INFO ] Flatten gal took : 105 ms
[2024-05-28 05:29:07] [INFO ] Input system was already deterministic with 2658 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 694/694 places, 2664/2664 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 688 transition count 2652
Reduce places removed 12 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 24 rules applied. Total rules applied 36 place count 676 transition count 2640
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 48 place count 664 transition count 2640
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 48 place count 664 transition count 2550
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 228 place count 574 transition count 2550
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 348 place count 514 transition count 2490
Applied a total of 348 rules in 172 ms. Remains 514 /694 variables (removed 180) and now considering 2490/2664 (removed 174) transitions.
Running 2484 sub problems to find dead transitions.
[2024-05-28 05:29:07] [INFO ] Flow matrix only has 2454 transitions (discarded 36 similar events)
// Phase 1: matrix 2454 rows 514 cols
[2024-05-28 05:29:07] [INFO ] Computed 52 invariants in 68 ms
[2024-05-28 05:29:07] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2484 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 2484 unsolved
[2024-05-28 05:29:44] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-05-28 05:29:44] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-05-28 05:29:45] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/2968 variables, and 44 constraints, problems are : Problem set: 0 solved, 2484 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 24/33 constraints, State Equation: 0/514 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2484/1230 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2484 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2484 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 24/41 constraints. Problems are: Problem set: 0 solved, 2484 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 2484 unsolved
[2024-05-28 05:29:50] [INFO ] Deduced a trap composed of 29 places in 421 ms of which 6 ms to minimize.
[2024-05-28 05:29:50] [INFO ] Deduced a trap composed of 63 places in 163 ms of which 2 ms to minimize.
[2024-05-28 05:29:50] [INFO ] Deduced a trap composed of 64 places in 124 ms of which 1 ms to minimize.
[2024-05-28 05:29:50] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2024-05-28 05:30:04] [INFO ] Deduced a trap composed of 63 places in 102 ms of which 1 ms to minimize.
[2024-05-28 05:30:04] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/2968 variables, and 50 constraints, problems are : Problem set: 0 solved, 2484 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 24/33 constraints, State Equation: 0/514 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1230 constraints, Known Traps: 9/9 constraints]
After SMT, in 60316ms problems are : Problem set: 0 solved, 2484 unsolved
Search for dead transitions found 0 dead transitions in 60339ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 60517 ms. Remains : 514/694 places, 2490/2664 transitions.
[2024-05-28 05:30:08] [INFO ] Flatten gal took : 99 ms
[2024-05-28 05:30:08] [INFO ] Flatten gal took : 105 ms
[2024-05-28 05:30:08] [INFO ] Input system was already deterministic with 2490 transitions.
Starting structural reductions in LTL mode, iteration 0 : 694/694 places, 2664/2664 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 688 transition count 2664
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 682 transition count 2658
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 682 transition count 2658
Applied a total of 18 rules in 56 ms. Remains 682 /694 variables (removed 12) and now considering 2658/2664 (removed 6) transitions.
Running 2652 sub problems to find dead transitions.
[2024-05-28 05:30:08] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
// Phase 1: matrix 2622 rows 682 cols
[2024-05-28 05:30:08] [INFO ] Computed 52 invariants in 55 ms
[2024-05-28 05:30:08] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 40927ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 40952ms
Finished structural reductions in LTL mode , in 1 iterations and 41015 ms. Remains : 682/694 places, 2658/2664 transitions.
[2024-05-28 05:30:49] [INFO ] Flatten gal took : 124 ms
[2024-05-28 05:30:49] [INFO ] Flatten gal took : 114 ms
[2024-05-28 05:30:49] [INFO ] Input system was already deterministic with 2658 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 694/694 places, 2664/2664 transitions.
Ensure Unique test removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 688 transition count 2628
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 652 transition count 2628
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 72 place count 652 transition count 2544
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 240 place count 568 transition count 2544
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 396 place count 490 transition count 2466
Applied a total of 396 rules in 147 ms. Remains 490 /694 variables (removed 204) and now considering 2466/2664 (removed 198) transitions.
Running 2460 sub problems to find dead transitions.
[2024-05-28 05:30:50] [INFO ] Flow matrix only has 2430 transitions (discarded 36 similar events)
// Phase 1: matrix 2430 rows 490 cols
[2024-05-28 05:30:50] [INFO ] Computed 52 invariants in 50 ms
[2024-05-28 05:30:50] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/484 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/484 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
[2024-05-28 05:31:33] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-28 05:31:34] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 484/2920 variables, and 43 constraints, problems are : Problem set: 0 solved, 2460 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 22/32 constraints, State Equation: 0/490 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2460/1206 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/484 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/484 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/484 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
[2024-05-28 05:31:40] [INFO ] Deduced a trap composed of 60 places in 452 ms of which 3 ms to minimize.
[2024-05-28 05:31:40] [INFO ] Deduced a trap composed of 59 places in 121 ms of which 1 ms to minimize.
[2024-05-28 05:31:40] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 1 ms to minimize.
[2024-05-28 05:31:40] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 0 ms to minimize.
[2024-05-28 05:31:40] [INFO ] Deduced a trap composed of 60 places in 56 ms of which 1 ms to minimize.
[2024-05-28 05:31:47] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 484/2920 variables, and 49 constraints, problems are : Problem set: 0 solved, 2460 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 19/20 constraints, Generalized P Invariants (flows): 22/32 constraints, State Equation: 0/490 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1206 constraints, Known Traps: 8/8 constraints]
After SMT, in 67641ms problems are : Problem set: 0 solved, 2460 unsolved
Search for dead transitions found 0 dead transitions in 67664ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 67817 ms. Remains : 490/694 places, 2466/2664 transitions.
[2024-05-28 05:31:57] [INFO ] Flatten gal took : 101 ms
[2024-05-28 05:31:57] [INFO ] Flatten gal took : 106 ms
[2024-05-28 05:31:58] [INFO ] Input system was already deterministic with 2466 transitions.
Starting structural reductions in LTL mode, iteration 0 : 694/694 places, 2664/2664 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 688 transition count 2664
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 12 place count 682 transition count 2658
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 682 transition count 2658
Applied a total of 18 rules in 57 ms. Remains 682 /694 variables (removed 12) and now considering 2658/2664 (removed 6) transitions.
Running 2652 sub problems to find dead transitions.
[2024-05-28 05:31:58] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
// Phase 1: matrix 2622 rows 682 cols
[2024-05-28 05:31:58] [INFO ] Computed 52 invariants in 60 ms
[2024-05-28 05:31:58] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 41040ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 41067ms
Finished structural reductions in LTL mode , in 1 iterations and 41130 ms. Remains : 682/694 places, 2658/2664 transitions.
[2024-05-28 05:32:39] [INFO ] Flatten gal took : 102 ms
[2024-05-28 05:32:39] [INFO ] Flatten gal took : 107 ms
[2024-05-28 05:32:39] [INFO ] Input system was already deterministic with 2658 transitions.
[2024-05-28 05:32:39] [INFO ] Flatten gal took : 138 ms
[2024-05-28 05:32:40] [INFO ] Flatten gal took : 145 ms
[2024-05-28 05:32:40] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLFireability.sr.xml took 59 ms.
[2024-05-28 05:32:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 694 places, 2664 transitions and 15876 arcs took 26 ms.
Total runtime 819113 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S06J06T06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/417/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 694
TRANSITIONS: 2664
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.111s, Sys 0.012s]


SAVING FILE /home/mcc/execution/417/model (.net / .def) ...
EXPORT TIME: [User 0.012s, 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: 920
MODEL NAME: /home/mcc/execution/417/model
694 places, 2664 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S06J06T06"
export BK_EXAMINATION="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 PolyORBLF-PT-S06J06T06, 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 r289-tajo-171654445700346"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J06T06.tgz
mv PolyORBLF-PT-S06J06T06 execution
cd execution
if [ "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 ;