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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 34K Apr 11 17:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 11 17:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 170K Apr 11 17:07 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 14K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 11 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 223K Apr 11 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 38K Apr 11 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 191K Apr 11 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.2K Apr 23 07:43 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 1.1M 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-S02J06T10-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S02J06T10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716863129790

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 02:25:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 02:25:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:25:31] [INFO ] Load time of PNML (sax parser for PT used): 148 ms
[2024-05-28 02:25:31] [INFO ] Transformed 844 places.
[2024-05-28 02:25:31] [INFO ] Transformed 1812 transitions.
[2024-05-28 02:25:31] [INFO ] Parsed PT model containing 844 places and 1812 transitions and 8302 arcs in 270 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 22 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 633 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 842 transition count 1652
Applied a total of 2 rules in 54 ms. Remains 842 /844 variables (removed 2) and now considering 1652/1652 (removed 0) transitions.
Running 1650 sub problems to find dead transitions.
[2024-05-28 02:25:31] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 842 cols
[2024-05-28 02:25:31] [INFO ] Computed 56 invariants in 87 ms
[2024-05-28 02:25:31] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
[2024-05-28 02:25:54] [INFO ] Deduced a trap composed of 73 places in 421 ms of which 42 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 840/2474 variables, and 55 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 20133 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/842 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1650/1650 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/840 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
[2024-05-28 02:26:11] [INFO ] Deduced a trap composed of 74 places in 136 ms of which 3 ms to minimize.
[2024-05-28 02:26:11] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 2 ms to minimize.
[2024-05-28 02:26:11] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 2 ms to minimize.
[2024-05-28 02:26:11] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-05-28 02:26:11] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 1 ms to minimize.
[2024-05-28 02:26:12] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 1 ms to minimize.
[2024-05-28 02:26:12] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 1 ms to minimize.
[2024-05-28 02:26:12] [INFO ] Deduced a trap composed of 73 places in 52 ms of which 2 ms to minimize.
[2024-05-28 02:26:12] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 0 ms to minimize.
[2024-05-28 02:26:13] [INFO ] Deduced a trap composed of 220 places in 449 ms of which 5 ms to minimize.
[2024-05-28 02:26:14] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/2474 variables, and 66 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/842 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1650 constraints, Known Traps: 12/12 constraints]
After SMT, in 43110ms problems are : Problem set: 0 solved, 1650 unsolved
Search for dead transitions found 0 dead transitions in 43156ms
[2024-05-28 02:26:14] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2024-05-28 02:26:14] [INFO ] Invariant cache hit.
[2024-05-28 02:26:15] [INFO ] Implicit Places using invariants in 487 ms returned []
[2024-05-28 02:26:15] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2024-05-28 02:26:15] [INFO ] Invariant cache hit.
[2024-05-28 02:26:16] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:26:26] [INFO ] Implicit Places using invariants and state equation in 10881 ms returned []
Implicit Place search using SMT with State Equation took 11379 ms to find 0 implicit places.
Running 1650 sub problems to find dead transitions.
[2024-05-28 02:26:26] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2024-05-28 02:26:26] [INFO ] Invariant cache hit.
[2024-05-28 02:26:26] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
[2024-05-28 02:26:48] [INFO ] Deduced a trap composed of 23 places in 277 ms of which 3 ms to minimize.
[2024-05-28 02:26:48] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 1 ms to minimize.
[2024-05-28 02:26:48] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 2 ms to minimize.
[2024-05-28 02:26:48] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 0 ms to minimize.
[2024-05-28 02:26:48] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 1 ms to minimize.
[2024-05-28 02:26:48] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 1 ms to minimize.
[2024-05-28 02:26:48] [INFO ] Deduced a trap composed of 74 places in 45 ms of which 1 ms to minimize.
[2024-05-28 02:26:48] [INFO ] Deduced a trap composed of 73 places in 44 ms of which 0 ms to minimize.
[2024-05-28 02:26:48] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 1 ms to minimize.
[2024-05-28 02:26:49] [INFO ] Deduced a trap composed of 416 places in 469 ms of which 5 ms to minimize.
[2024-05-28 02:26:50] [INFO ] Deduced a trap composed of 180 places in 428 ms of which 6 ms to minimize.
[2024-05-28 02:26:50] [INFO ] Deduced a trap composed of 220 places in 369 ms of which 5 ms to minimize.
[2024-05-28 02:26:51] [INFO ] Deduced a trap composed of 439 places in 454 ms of which 5 ms to minimize.
[2024-05-28 02:26:52] [INFO ] Deduced a trap composed of 3 places in 381 ms of which 5 ms to minimize.
[2024-05-28 02:26:52] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 1 ms to minimize.
[2024-05-28 02:26:53] [INFO ] Deduced a trap composed of 73 places in 355 ms of which 4 ms to minimize.
[2024-05-28 02:26:53] [INFO ] Deduced a trap composed of 426 places in 359 ms of which 5 ms to minimize.
[2024-05-28 02:26:55] [INFO ] Deduced a trap composed of 454 places in 452 ms of which 6 ms to minimize.
[2024-05-28 02:26:56] [INFO ] Deduced a trap composed of 445 places in 455 ms of which 6 ms to minimize.
[2024-05-28 02:26:57] [INFO ] Deduced a trap composed of 57 places in 171 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/840 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 840/2474 variables, and 74 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/842 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1650/1650 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/840 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/840 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/840 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(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 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 9)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 1)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(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 1)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(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 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 1)
(s139 6)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 5)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/2474 variables, and 74 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/842 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1650 constraints, Known Traps: 20/20 constraints]
After SMT, in 63511ms problems are : Problem set: 0 solved, 1650 unsolved
Search for dead transitions found 0 dead transitions in 63537ms
Starting structural reductions in LTL mode, iteration 1 : 842/844 places, 1652/1652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118193 ms. Remains : 842/844 places, 1652/1652 transitions.
Support contains 633 out of 842 places after structural reductions.
[2024-05-28 02:27:30] [INFO ] Flatten gal took : 204 ms
[2024-05-28 02:27:30] [INFO ] Flatten gal took : 118 ms
[2024-05-28 02:27:30] [INFO ] Input system was already deterministic with 1652 transitions.
RANDOM walk for 40000 steps (10 resets) in 3250 ms. (12 steps per ms) remains 65/100 properties
BEST_FIRST walk for 4003 steps (8 resets) in 188 ms. (21 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 185 ms. (21 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 91 ms. (43 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 97 ms. (40 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (9 resets) in 94 ms. (42 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 94 ms. (42 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 134 ms. (29 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 105 ms. (37 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 65 ms. (60 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 79 ms. (50 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 76 ms. (51 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 94 ms. (42 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 75 ms. (52 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 84 ms. (47 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 91 ms. (43 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 99 ms. (40 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 114 ms. (34 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 104 ms. (38 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 109 ms. (36 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 115 ms. (34 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 116 ms. (34 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 121 ms. (32 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 96 ms. (41 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 90 ms. (43 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (9 resets) in 121 ms. (32 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 85 ms. (46 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 87 ms. (45 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 97 ms. (40 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 77 ms. (51 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (9 resets) in 94 ms. (42 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 88 ms. (44 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 78 ms. (50 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 86 ms. (45 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 71 ms. (55 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 95 ms. (41 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 78 ms. (50 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 84 ms. (47 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 85 ms. (46 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 89 ms. (44 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 207 ms. (19 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 73 ms. (54 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4001 steps (8 resets) in 70 ms. (56 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (8 resets) in 67 ms. (58 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4000 steps (8 resets) in 83 ms. (47 steps per ms) remains 65/65 properties
[2024-05-28 02:27:33] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2024-05-28 02:27:33] [INFO ] Invariant cache hit.
[2024-05-28 02:27:33] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/539 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/539 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp90 is UNSAT
Problem AtomicPropp92 is UNSAT
Problem AtomicPropp93 is UNSAT
Problem AtomicPropp99 is UNSAT
At refinement iteration 2 (OVERLAPS) 96/635 variables, 16/17 constraints. Problems are: Problem set: 21 solved, 44 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp45 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/635 variables, 5/22 constraints. Problems are: Problem set: 23 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/635 variables, 0/22 constraints. Problems are: Problem set: 23 solved, 42 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp96 is UNSAT
Problem AtomicPropp98 is UNSAT
At refinement iteration 5 (OVERLAPS) 192/827 variables, 24/46 constraints. Problems are: Problem set: 61 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/827 variables, 0/46 constraints. Problems are: Problem set: 61 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 15/842 variables, 10/56 constraints. Problems are: Problem set: 61 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/842 variables, 0/56 constraints. Problems are: Problem set: 61 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1632/2474 variables, 842/898 constraints. Problems are: Problem set: 61 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2474 variables, 120/1018 constraints. Problems are: Problem set: 61 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2474 variables, 0/1018 constraints. Problems are: Problem set: 61 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/2474 variables, 0/1018 constraints. Problems are: Problem set: 61 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2474/2474 variables, and 1018 constraints, problems are : Problem set: 61 solved, 4 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 842/842 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 61 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 61 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 70/192 variables, 8/8 constraints. Problems are: Problem set: 61 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 1/9 constraints. Problems are: Problem set: 61 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/9 constraints. Problems are: Problem set: 61 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 130/322 variables, 4/13 constraints. Problems are: Problem set: 61 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 0/13 constraints. Problems are: Problem set: 61 solved, 4 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 6 (OVERLAPS) 501/823 variables, 29/42 constraints. Problems are: Problem set: 62 solved, 3 unsolved
[2024-05-28 02:27:39] [INFO ] Deduced a trap composed of 73 places in 442 ms of which 5 ms to minimize.
[2024-05-28 02:27:40] [INFO ] Deduced a trap composed of 74 places in 464 ms of which 6 ms to minimize.
[2024-05-28 02:27:40] [INFO ] Deduced a trap composed of 74 places in 457 ms of which 5 ms to minimize.
[2024-05-28 02:27:41] [INFO ] Deduced a trap composed of 74 places in 487 ms of which 6 ms to minimize.
[2024-05-28 02:27:41] [INFO ] Deduced a trap composed of 73 places in 406 ms of which 5 ms to minimize.
[2024-05-28 02:27:42] [INFO ] Deduced a trap composed of 73 places in 454 ms of which 5 ms to minimize.
[2024-05-28 02:27:42] [INFO ] Deduced a trap composed of 73 places in 384 ms of which 9 ms to minimize.
[2024-05-28 02:27:42] [INFO ] Deduced a trap composed of 74 places in 474 ms of which 7 ms to minimize.
[2024-05-28 02:27:43] [INFO ] Deduced a trap composed of 73 places in 412 ms of which 5 ms to minimize.
[2024-05-28 02:27:43] [INFO ] Deduced a trap composed of 118 places in 478 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 823/2474 variables, and 52 constraints, problems are : Problem set: 62 solved, 3 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 30/40 constraints, State Equation: 0/842 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/65 constraints, Known Traps: 10/10 constraints]
After SMT, in 10250ms problems are : Problem set: 62 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 842 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 842/842 places, 1652/1652 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 842 transition count 1592
Reduce places removed 60 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 70 rules applied. Total rules applied 130 place count 782 transition count 1582
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 140 place count 772 transition count 1582
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 140 place count 772 transition count 1483
Deduced a syphon composed of 99 places in 2 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 338 place count 673 transition count 1483
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 3 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 478 place count 603 transition count 1413
Free-agglomeration rule (complex) applied 30 times.
Iterating global reduction 3 with 30 rules applied. Total rules applied 508 place count 603 transition count 1383
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 3 with 30 rules applied. Total rules applied 538 place count 573 transition count 1383
Applied a total of 538 rules in 324 ms. Remains 573 /842 variables (removed 269) and now considering 1383/1652 (removed 269) transitions.
Running 1381 sub problems to find dead transitions.
[2024-05-28 02:27:44] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
// Phase 1: matrix 1363 rows 573 cols
[2024-05-28 02:27:44] [INFO ] Computed 56 invariants in 65 ms
[2024-05-28 02:27:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
[2024-05-28 02:27:59] [INFO ] Deduced a trap composed of 47 places in 209 ms of which 3 ms to minimize.
[2024-05-28 02:27:59] [INFO ] Deduced a trap composed of 47 places in 199 ms of which 2 ms to minimize.
[2024-05-28 02:27:59] [INFO ] Deduced a trap composed of 46 places in 197 ms of which 3 ms to minimize.
[2024-05-28 02:28:00] [INFO ] Deduced a trap composed of 46 places in 207 ms of which 3 ms to minimize.
[2024-05-28 02:28:00] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 2 ms to minimize.
[2024-05-28 02:28:00] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-28 02:28:00] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-05-28 02:28:00] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 0 ms to minimize.
[2024-05-28 02:28:00] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 6 ms to minimize.
[2024-05-28 02:28:00] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2024-05-28 02:28:00] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 1 ms to minimize.
[2024-05-28 02:28:01] [INFO ] Deduced a trap composed of 100 places in 294 ms of which 3 ms to minimize.
[2024-05-28 02:28:01] [INFO ] Deduced a trap composed of 46 places in 297 ms of which 4 ms to minimize.
[2024-05-28 02:28:03] [INFO ] Deduced a trap composed of 207 places in 312 ms of which 4 ms to minimize.
[2024-05-28 02:28:04] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/1936 variables, and 69 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/573 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1381/1381 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 15/69 constraints. Problems are: Problem set: 0 solved, 1381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/1936 variables, and 69 constraints, problems are : Problem set: 0 solved, 1381 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/573 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1381 constraints, Known Traps: 15/15 constraints]
After SMT, in 43713ms problems are : Problem set: 0 solved, 1381 unsolved
Search for dead transitions found 0 dead transitions in 43734ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44065 ms. Remains : 573/842 places, 1383/1652 transitions.
RANDOM walk for 40000 steps (14 resets) in 750 ms. (53 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 280 ms. (142 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (10 resets) in 283 ms. (140 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 342 ms. (116 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 105390 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 3
Probabilistic random walk after 105390 steps, saw 72775 distinct states, run finished after 3014 ms. (steps per millisecond=34 ) properties seen :0
[2024-05-28 02:28:31] [INFO ] Flow matrix only has 1363 transitions (discarded 20 similar events)
[2024-05-28 02:28:31] [INFO ] Invariant cache hit.
[2024-05-28 02:28:31] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 84/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 99/222 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 313/535 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 11/546 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 25/571 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/571 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1363/1934 variables, 571/626 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1934 variables, 120/746 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1934 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/1936 variables, 2/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1936 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1936 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1936 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1936/1936 variables, and 749 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2360 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 573/573 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 84/123 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 99/222 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 313/535 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 02:28:34] [INFO ] Deduced a trap composed of 47 places in 255 ms of which 4 ms to minimize.
[2024-05-28 02:28:34] [INFO ] Deduced a trap composed of 46 places in 250 ms of which 3 ms to minimize.
[2024-05-28 02:28:34] [INFO ] Deduced a trap composed of 47 places in 255 ms of which 3 ms to minimize.
[2024-05-28 02:28:35] [INFO ] Deduced a trap composed of 46 places in 248 ms of which 3 ms to minimize.
[2024-05-28 02:28:35] [INFO ] Deduced a trap composed of 46 places in 284 ms of which 4 ms to minimize.
[2024-05-28 02:28:35] [INFO ] Deduced a trap composed of 47 places in 253 ms of which 3 ms to minimize.
[2024-05-28 02:28:36] [INFO ] Deduced a trap composed of 46 places in 252 ms of which 4 ms to minimize.
[2024-05-28 02:28:36] [INFO ] Deduced a trap composed of 242 places in 248 ms of which 4 ms to minimize.
[2024-05-28 02:28:36] [INFO ] Deduced a trap composed of 47 places in 248 ms of which 3 ms to minimize.
[2024-05-28 02:28:36] [INFO ] Deduced a trap composed of 46 places in 280 ms of which 4 ms to minimize.
[2024-05-28 02:28:37] [INFO ] Deduced a trap composed of 235 places in 293 ms of which 3 ms to minimize.
[2024-05-28 02:28:37] [INFO ] Deduced a trap composed of 231 places in 296 ms of which 4 ms to minimize.
[2024-05-28 02:28:37] [INFO ] Deduced a trap composed of 206 places in 269 ms of which 3 ms to minimize.
[2024-05-28 02:28:38] [INFO ] Deduced a trap composed of 47 places in 284 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/535 variables, 14/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/535 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 11/546 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 02:28:38] [INFO ] Deduced a trap composed of 208 places in 276 ms of which 4 ms to minimize.
[2024-05-28 02:28:38] [INFO ] Deduced a trap composed of 239 places in 275 ms of which 3 ms to minimize.
[2024-05-28 02:28:39] [INFO ] Deduced a trap composed of 229 places in 280 ms of which 3 ms to minimize.
[2024-05-28 02:28:39] [INFO ] Deduced a trap composed of 225 places in 249 ms of which 4 ms to minimize.
[2024-05-28 02:28:39] [INFO ] Deduced a trap composed of 235 places in 273 ms of which 3 ms to minimize.
[2024-05-28 02:28:39] [INFO ] Deduced a trap composed of 208 places in 272 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/546 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 25/571 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-28 02:28:40] [INFO ] Deduced a trap composed of 80 places in 257 ms of which 3 ms to minimize.
[2024-05-28 02:28:40] [INFO ] Deduced a trap composed of 247 places in 349 ms of which 3 ms to minimize.
Problem AtomicPropp37 is UNSAT
At refinement iteration 13 (INCLUDED_ONLY) 0/571 variables, 2/77 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/571 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1363/1934 variables, 571/648 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1934 variables, 120/768 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1934 variables, 2/770 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1934 variables, 0/770 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 2/1936 variables, 2/772 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1936 variables, 1/773 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1936 variables, 0/773 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1936 variables, 0/773 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1936/1936 variables, and 773 constraints, problems are : Problem set: 1 solved, 2 unsolved in 15545 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 573/573 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 22/22 constraints]
After SMT, in 17932ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 1294 ms.
Support contains 5 out of 573 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 573/573 places, 1383/1383 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 573 transition count 1373
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 563 transition count 1373
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 40 place count 553 transition count 1363
Applied a total of 40 rules in 67 ms. Remains 553 /573 variables (removed 20) and now considering 1363/1383 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 553/573 places, 1363/1383 transitions.
RANDOM walk for 40000 steps (13 resets) in 444 ms. (89 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (11 resets) in 299 ms. (133 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 139070 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :0 out of 2
Probabilistic random walk after 139070 steps, saw 96562 distinct states, run finished after 3003 ms. (steps per millisecond=46 ) properties seen :0
[2024-05-28 02:28:54] [INFO ] Flow matrix only has 1343 transitions (discarded 20 similar events)
// Phase 1: matrix 1343 rows 553 cols
[2024-05-28 02:28:54] [INFO ] Computed 56 invariants in 46 ms
[2024-05-28 02:28:54] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 465/505 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 18/523 variables, 11/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/551 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1343/1894 variables, 551/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1894 variables, 120/726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1894 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/1896 variables, 2/728 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1896 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1896 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1896 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1896/1896 variables, and 729 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1505 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 553/553 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 465/505 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 02:28:56] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 3 ms to minimize.
[2024-05-28 02:28:56] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 2 ms to minimize.
[2024-05-28 02:28:56] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 2 ms to minimize.
[2024-05-28 02:28:56] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 2 ms to minimize.
[2024-05-28 02:28:56] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
[2024-05-28 02:28:56] [INFO ] Deduced a trap composed of 45 places in 84 ms of which 1 ms to minimize.
[2024-05-28 02:28:56] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
[2024-05-28 02:28:56] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 1 ms to minimize.
[2024-05-28 02:28:56] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 18/523 variables, 11/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/551 variables, 23/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 02:28:57] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/551 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/551 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1343/1894 variables, 551/616 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1894 variables, 120/736 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1894 variables, 2/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1894 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/1896 variables, 2/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1896 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1896 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1896 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1896/1896 variables, and 741 constraints, problems are : Problem set: 0 solved, 2 unsolved in 8130 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 553/553 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 9716ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 385 ms.
Support contains 5 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1363/1363 transitions.
Applied a total of 0 rules in 42 ms. Remains 553 /553 variables (removed 0) and now considering 1363/1363 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 553/553 places, 1363/1363 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1363/1363 transitions.
Applied a total of 0 rules in 41 ms. Remains 553 /553 variables (removed 0) and now considering 1363/1363 (removed 0) transitions.
[2024-05-28 02:29:04] [INFO ] Flow matrix only has 1343 transitions (discarded 20 similar events)
[2024-05-28 02:29:04] [INFO ] Invariant cache hit.
[2024-05-28 02:29:05] [INFO ] Implicit Places using invariants in 1093 ms returned [66, 133, 165, 292, 339, 368, 371, 409, 520, 551]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 1102 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 543/553 places, 1363/1363 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 534 transition count 1354
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 534 transition count 1354
Applied a total of 18 rules in 113 ms. Remains 534 /543 variables (removed 9) and now considering 1354/1363 (removed 9) transitions.
[2024-05-28 02:29:05] [INFO ] Flow matrix only has 1334 transitions (discarded 20 similar events)
// Phase 1: matrix 1334 rows 534 cols
[2024-05-28 02:29:05] [INFO ] Computed 46 invariants in 37 ms
[2024-05-28 02:29:06] [INFO ] Implicit Places using invariants in 845 ms returned []
[2024-05-28 02:29:06] [INFO ] Flow matrix only has 1334 transitions (discarded 20 similar events)
[2024-05-28 02:29:06] [INFO ] Invariant cache hit.
[2024-05-28 02:29:07] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:29:22] [INFO ] Implicit Places using invariants and state equation in 15879 ms returned []
Implicit Place search using SMT with State Equation took 16726 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 534/553 places, 1354/1363 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 17982 ms. Remains : 534/553 places, 1354/1363 transitions.
Successfully simplified 63 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-PT-S02J06T10-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 02:29:22] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-05-28 02:29:22] [INFO ] Flatten gal took : 73 ms
[2024-05-28 02:29:22] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA PolyORBLF-PT-S02J06T10-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 02:29:22] [INFO ] Flatten gal took : 72 ms
[2024-05-28 02:29:22] [INFO ] Input system was already deterministic with 1652 transitions.
Support contains 16 out of 842 places (down from 224) after GAL structural reductions.
FORMULA PolyORBLF-PT-S02J06T10-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 842/842 places, 1652/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 832 transition count 1642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 832 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 822 transition count 1632
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 822 transition count 1632
Applied a total of 40 rules in 38 ms. Remains 822 /842 variables (removed 20) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-28 02:29:22] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 822 cols
[2024-05-28 02:29:22] [INFO ] Computed 56 invariants in 55 ms
[2024-05-28 02:29:22] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-28 02:29:45] [INFO ] Deduced a trap composed of 72 places in 242 ms of which 3 ms to minimize.
[2024-05-28 02:29:45] [INFO ] Deduced a trap composed of 71 places in 233 ms of which 3 ms to minimize.
[2024-05-28 02:29:45] [INFO ] Deduced a trap composed of 72 places in 246 ms of which 4 ms to minimize.
[2024-05-28 02:29:45] [INFO ] Deduced a trap composed of 133 places in 232 ms of which 4 ms to minimize.
[2024-05-28 02:29:45] [INFO ] Deduced a trap composed of 71 places in 67 ms of which 2 ms to minimize.
[2024-05-28 02:29:46] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
[2024-05-28 02:29:46] [INFO ] Deduced a trap composed of 71 places in 48 ms of which 1 ms to minimize.
[2024-05-28 02:29:46] [INFO ] Deduced a trap composed of 71 places in 46 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 820/2434 variables, and 62 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/822 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-28 02:30:00] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 2 ms to minimize.
[2024-05-28 02:30:00] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2024-05-28 02:30:00] [INFO ] Deduced a trap composed of 73 places in 62 ms of which 1 ms to minimize.
[2024-05-28 02:30:01] [INFO ] Deduced a trap composed of 206 places in 474 ms of which 6 ms to minimize.
[2024-05-28 02:30:02] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 3 ms to minimize.
[2024-05-28 02:30:03] [INFO ] Deduced a trap composed of 3 places in 460 ms of which 4 ms to minimize.
[2024-05-28 02:30:04] [INFO ] Deduced a trap composed of 406 places in 471 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/2434 variables, and 69 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/822 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 15/15 constraints]
After SMT, in 43463ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 43486ms
Finished structural reductions in LTL mode , in 1 iterations and 43532 ms. Remains : 822/842 places, 1632/1652 transitions.
[2024-05-28 02:30:06] [INFO ] Flatten gal took : 52 ms
[2024-05-28 02:30:06] [INFO ] Flatten gal took : 54 ms
[2024-05-28 02:30:06] [INFO ] Input system was already deterministic with 1632 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 842/842 places, 1652/1652 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 842 transition count 1565
Reduce places removed 87 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 88 rules applied. Total rules applied 175 place count 755 transition count 1564
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 176 place count 754 transition count 1564
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 176 place count 754 transition count 1463
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 378 place count 653 transition count 1463
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 379 place count 652 transition count 1462
Iterating global reduction 3 with 1 rules applied. Total rules applied 380 place count 652 transition count 1462
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 3 with 156 rules applied. Total rules applied 536 place count 574 transition count 1384
Applied a total of 536 rules in 100 ms. Remains 574 /842 variables (removed 268) and now considering 1384/1652 (removed 268) transitions.
Running 1382 sub problems to find dead transitions.
[2024-05-28 02:30:06] [INFO ] Flow matrix only has 1364 transitions (discarded 20 similar events)
// Phase 1: matrix 1364 rows 574 cols
[2024-05-28 02:30:06] [INFO ] Computed 56 invariants in 34 ms
[2024-05-28 02:30:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 36/53 constraints. Problems are: Problem set: 0 solved, 1382 unsolved
[2024-05-28 02:30:21] [INFO ] Deduced a trap composed of 47 places in 127 ms of which 2 ms to minimize.
[2024-05-28 02:30:21] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 2 ms to minimize.
[2024-05-28 02:30:21] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 1 ms to minimize.
[2024-05-28 02:30:21] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2024-05-28 02:30:21] [INFO ] Deduced a trap composed of 46 places in 333 ms of which 5 ms to minimize.
[2024-05-28 02:30:22] [INFO ] Deduced a trap composed of 221 places in 312 ms of which 3 ms to minimize.
[2024-05-28 02:30:22] [INFO ] Deduced a trap composed of 207 places in 360 ms of which 4 ms to minimize.
[2024-05-28 02:30:22] [INFO ] Deduced a trap composed of 23 places in 313 ms of which 4 ms to minimize.
[2024-05-28 02:30:23] [INFO ] Deduced a trap composed of 232 places in 356 ms of which 4 ms to minimize.
[2024-05-28 02:30:23] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-05-28 02:30:23] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 0 ms to minimize.
[2024-05-28 02:30:23] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-05-28 02:30:23] [INFO ] Deduced a trap composed of 47 places in 40 ms of which 1 ms to minimize.
[2024-05-28 02:30:23] [INFO ] Deduced a trap composed of 46 places in 54 ms of which 1 ms to minimize.
[2024-05-28 02:30:24] [INFO ] Deduced a trap composed of 199 places in 325 ms of which 3 ms to minimize.
[2024-05-28 02:30:24] [INFO ] Deduced a trap composed of 93 places in 385 ms of which 4 ms to minimize.
[2024-05-28 02:30:26] [INFO ] Deduced a trap composed of 208 places in 356 ms of which 4 ms to minimize.
[2024-05-28 02:30:27] [INFO ] Deduced a trap composed of 57 places in 151 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/1938 variables, and 71 constraints, problems are : Problem set: 0 solved, 1382 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 36/39 constraints, State Equation: 0/574 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1382/1382 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/572 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/572 variables, 36/53 constraints. Problems are: Problem set: 0 solved, 1382 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/572 variables, 18/71 constraints. Problems are: Problem set: 0 solved, 1382 unsolved
[2024-05-28 02:30:39] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
[2024-05-28 02:30:39] [INFO ] Deduced a trap composed of 244 places in 166 ms of which 2 ms to minimize.
[2024-05-28 02:30:46] [INFO ] Deduced a trap composed of 370 places in 236 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/1938 variables, and 74 constraints, problems are : Problem set: 0 solved, 1382 unsolved in 20049 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 36/39 constraints, State Equation: 0/574 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1382 constraints, Known Traps: 21/21 constraints]
After SMT, in 43083ms problems are : Problem set: 0 solved, 1382 unsolved
Search for dead transitions found 0 dead transitions in 43103ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 43208 ms. Remains : 574/842 places, 1384/1652 transitions.
[2024-05-28 02:30:49] [INFO ] Flatten gal took : 70 ms
[2024-05-28 02:30:49] [INFO ] Flatten gal took : 64 ms
[2024-05-28 02:30:50] [INFO ] Input system was already deterministic with 1384 transitions.
Starting structural reductions in LTL mode, iteration 0 : 842/842 places, 1652/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 832 transition count 1642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 832 transition count 1642
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 823 transition count 1633
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 823 transition count 1633
Applied a total of 38 rules in 59 ms. Remains 823 /842 variables (removed 19) and now considering 1633/1652 (removed 19) transitions.
Running 1631 sub problems to find dead transitions.
[2024-05-28 02:30:50] [INFO ] Flow matrix only has 1613 transitions (discarded 20 similar events)
// Phase 1: matrix 1613 rows 823 cols
[2024-05-28 02:30:50] [INFO ] Computed 56 invariants in 56 ms
[2024-05-28 02:30:50] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/821 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1631 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/821 variables, 38/54 constraints. Problems are: Problem set: 0 solved, 1631 unsolved
[2024-05-28 02:31:11] [INFO ] Deduced a trap composed of 71 places in 306 ms of which 5 ms to minimize.
[2024-05-28 02:31:11] [INFO ] Deduced a trap composed of 71 places in 263 ms of which 4 ms to minimize.
[2024-05-28 02:31:11] [INFO ] Deduced a trap composed of 60 places in 220 ms of which 10 ms to minimize.
[2024-05-28 02:31:11] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 2 ms to minimize.
[2024-05-28 02:31:11] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 1 ms to minimize.
[2024-05-28 02:31:11] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 2 ms to minimize.
[2024-05-28 02:31:12] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 1 ms to minimize.
[2024-05-28 02:31:12] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 0 ms to minimize.
[2024-05-28 02:31:12] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 1 ms to minimize.
[2024-05-28 02:31:12] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
[2024-05-28 02:31:13] [INFO ] Deduced a trap composed of 207 places in 502 ms of which 7 ms to minimize.
[2024-05-28 02:31:13] [INFO ] Deduced a trap composed of 423 places in 504 ms of which 5 ms to minimize.
SMT process timed out in 23640ms, After SMT, problems are : Problem set: 0 solved, 1631 unsolved
Search for dead transitions found 0 dead transitions in 23665ms
Finished structural reductions in LTL mode , in 1 iterations and 23731 ms. Remains : 823/842 places, 1633/1652 transitions.
[2024-05-28 02:31:13] [INFO ] Flatten gal took : 59 ms
[2024-05-28 02:31:13] [INFO ] Flatten gal took : 63 ms
[2024-05-28 02:31:14] [INFO ] Input system was already deterministic with 1633 transitions.
Starting structural reductions in LTL mode, iteration 0 : 842/842 places, 1652/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 832 transition count 1642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 832 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 822 transition count 1632
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 822 transition count 1632
Applied a total of 40 rules in 37 ms. Remains 822 /842 variables (removed 20) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-28 02:31:14] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
// Phase 1: matrix 1612 rows 822 cols
[2024-05-28 02:31:14] [INFO ] Computed 56 invariants in 50 ms
[2024-05-28 02:31:14] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-28 02:31:35] [INFO ] Deduced a trap composed of 72 places in 258 ms of which 4 ms to minimize.
[2024-05-28 02:31:35] [INFO ] Deduced a trap composed of 71 places in 225 ms of which 6 ms to minimize.
[2024-05-28 02:31:36] [INFO ] Deduced a trap composed of 72 places in 230 ms of which 3 ms to minimize.
[2024-05-28 02:31:36] [INFO ] Deduced a trap composed of 133 places in 238 ms of which 4 ms to minimize.
[2024-05-28 02:31:36] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 1 ms to minimize.
[2024-05-28 02:31:36] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 1 ms to minimize.
[2024-05-28 02:31:36] [INFO ] Deduced a trap composed of 71 places in 41 ms of which 1 ms to minimize.
[2024-05-28 02:31:36] [INFO ] Deduced a trap composed of 71 places in 40 ms of which 1 ms to minimize.
[2024-05-28 02:31:36] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 1 ms to minimize.
[2024-05-28 02:31:36] [INFO ] Deduced a trap composed of 71 places in 42 ms of which 1 ms to minimize.
[2024-05-28 02:31:37] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 2 ms to minimize.
[2024-05-28 02:31:37] [INFO ] Deduced a trap composed of 203 places in 504 ms of which 7 ms to minimize.
SMT process timed out in 23538ms, After SMT, problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 23561ms
Finished structural reductions in LTL mode , in 1 iterations and 23603 ms. Remains : 822/842 places, 1632/1652 transitions.
[2024-05-28 02:31:37] [INFO ] Flatten gal took : 64 ms
[2024-05-28 02:31:37] [INFO ] Flatten gal took : 68 ms
[2024-05-28 02:31:37] [INFO ] Input system was already deterministic with 1632 transitions.
Starting structural reductions in LTL mode, iteration 0 : 842/842 places, 1652/1652 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 832 transition count 1642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 832 transition count 1642
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 822 transition count 1632
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 822 transition count 1632
Applied a total of 40 rules in 39 ms. Remains 822 /842 variables (removed 20) and now considering 1632/1652 (removed 20) transitions.
Running 1630 sub problems to find dead transitions.
[2024-05-28 02:31:38] [INFO ] Flow matrix only has 1612 transitions (discarded 20 similar events)
[2024-05-28 02:31:38] [INFO ] Invariant cache hit.
[2024-05-28 02:31:38] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
[2024-05-28 02:31:59] [INFO ] Deduced a trap composed of 23 places in 279 ms of which 4 ms to minimize.
[2024-05-28 02:31:59] [INFO ] Deduced a trap composed of 71 places in 83 ms of which 2 ms to minimize.
[2024-05-28 02:31:59] [INFO ] Deduced a trap composed of 71 places in 47 ms of which 1 ms to minimize.
[2024-05-28 02:31:59] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 1 ms to minimize.
[2024-05-28 02:31:59] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 1 ms to minimize.
[2024-05-28 02:31:59] [INFO ] Deduced a trap composed of 71 places in 43 ms of which 1 ms to minimize.
[2024-05-28 02:31:59] [INFO ] Deduced a trap composed of 72 places in 64 ms of which 1 ms to minimize.
[2024-05-28 02:32:00] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 1 ms to minimize.
[2024-05-28 02:32:00] [INFO ] Deduced a trap composed of 71 places in 83 ms of which 2 ms to minimize.
[2024-05-28 02:32:00] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 1 ms to minimize.
[2024-05-28 02:32:01] [INFO ] Deduced a trap composed of 203 places in 516 ms of which 5 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 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 6.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 5.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.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 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.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 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 4.0)
(s282 1.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 1.0)
(s358 0.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 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 1.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 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.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 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 1.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 (/ 2.0 3.0))
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 (/ 1.0 3.0))
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 1.0)
(s567 0.0)
(s568 0.0)
(s569 1.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 1.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 (/ 1.0 3.0))
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 1.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 1.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 5.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 1.0)
(s704 1.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 10.0)
(s719 0.0)
(s720 1.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 (/ 2.0 3.0))
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 1.0)
(s735 0.0)
(s736 1.0)
(s737 0.0)
(s738 0.0)timeout

(s739 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 820/2434 variables, and 65 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20053 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/822 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/820 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/820 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/2434 variables, and 65 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/822 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1630 constraints, Known Traps: 11/11 constraints]
After SMT, in 43362ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 43379ms
Finished structural reductions in LTL mode , in 1 iterations and 43424 ms. Remains : 822/842 places, 1632/1652 transitions.
[2024-05-28 02:32:21] [INFO ] Flatten gal took : 42 ms
[2024-05-28 02:32:21] [INFO ] Flatten gal took : 45 ms
[2024-05-28 02:32:21] [INFO ] Input system was already deterministic with 1632 transitions.
[2024-05-28 02:32:21] [INFO ] Flatten gal took : 81 ms
[2024-05-28 02:32:21] [INFO ] Flatten gal took : 60 ms
[2024-05-28 02:32:21] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-28 02:32:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 842 places, 1652 transitions and 7160 arcs took 13 ms.
Total runtime 410682 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-PT-S02J06T10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 842
TRANSITIONS: 1652
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.031s, Sys 0.008s]


SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.005s, 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: 1146
MODEL NAME: /home/mcc/execution/416/model
842 places, 1652 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 CTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S02J06T10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBLF-PT-S02J06T10, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r289-tajo-171654445500257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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