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.r516-tajo-171654446800289.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 ltsminxred
Input is PolyORBLF-PT-S04J06T06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446800289
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 19K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K 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 8.2K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Apr 11 17:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 180K Apr 11 17:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 90K Apr 11 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 427K Apr 11 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K 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 2.6M 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-S04J06T06-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-PT-S04J06T06-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717254380082

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S04J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:06:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:06:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:06:22] [INFO ] Load time of PNML (sax parser for PT used): 343 ms
[2024-06-01 15:06:22] [INFO ] Transformed 618 places.
[2024-06-01 15:06:22] [INFO ] Transformed 3190 transitions.
[2024-06-01 15:06:22] [INFO ] Parsed PT model containing 618 places and 3190 transitions and 21570 arcs in 513 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 40 ms.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Support contains 397 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 1564/1564 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 614 transition count 1564
Applied a total of 4 rules in 78 ms. Remains 614 /618 variables (removed 4) and now considering 1564/1564 (removed 0) transitions.
Running 1560 sub problems to find dead transitions.
[2024-06-01 15:06:22] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
// Phase 1: matrix 1540 rows 614 cols
[2024-06-01 15:06:22] [INFO ] Computed 50 invariants in 139 ms
[2024-06-01 15:06:22] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
[2024-06-01 15:06:42] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 21 ms to minimize.
[2024-06-01 15:06:45] [INFO ] Deduced a trap composed of 110 places in 232 ms of which 4 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 0.0)
(s9 1.0)
(s10 0.0)
(s11 3.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 4.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 2.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 2.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 2.0)
(s91 1.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 3.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.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 1.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 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 610/2154 variables, and 43 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20144 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 22/31 constraints, State Equation: 0/614 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1560/1560 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
[2024-06-01 15:06:55] [INFO ] Deduced a trap composed of 84 places in 446 ms of which 7 ms to minimize.
[2024-06-01 15:06:55] [INFO ] Deduced a trap composed of 42 places in 400 ms of which 4 ms to minimize.
[2024-06-01 15:06:55] [INFO ] Deduced a trap composed of 83 places in 388 ms of which 4 ms to minimize.
[2024-06-01 15:06:56] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 1 ms to minimize.
[2024-06-01 15:06:56] [INFO ] Deduced a trap composed of 84 places in 73 ms of which 1 ms to minimize.
[2024-06-01 15:06:56] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 2 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 Int declared 610/2154 variables, and 49 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 22/31 constraints, State Equation: 0/614 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1560 constraints, Known Traps: 8/8 constraints]
After SMT, in 45496ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 45571ms
[2024-06-01 15:07:08] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
[2024-06-01 15:07:08] [INFO ] Invariant cache hit.
[2024-06-01 15:07:08] [INFO ] Implicit Places using invariants in 215 ms returned [137, 203, 331, 366, 488, 556]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 225 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 608/618 places, 1564/1564 transitions.
Applied a total of 0 rules in 15 ms. Remains 608 /608 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45964 ms. Remains : 608/618 places, 1564/1564 transitions.
Support contains 397 out of 608 places after structural reductions.
[2024-06-01 15:07:08] [INFO ] Flatten gal took : 132 ms
[2024-06-01 15:07:08] [INFO ] Flatten gal took : 89 ms
[2024-06-01 15:07:08] [INFO ] Input system was already deterministic with 1564 transitions.
Support contains 396 out of 608 places (down from 397) after GAL structural reductions.
RANDOM walk for 40000 steps (9 resets) in 2427 ms. (16 steps per ms) remains 48/77 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (8 resets) in 64 ms. (61 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 95 ms. (41 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 51 ms. (76 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (8 resets) in 60 ms. (65 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 48/48 properties
[2024-06-01 15:07:10] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
// Phase 1: matrix 1540 rows 608 cols
[2024-06-01 15:07:10] [INFO ] Computed 44 invariants in 38 ms
[2024-06-01 15:07:10] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp68 is UNSAT
At refinement iteration 1 (OVERLAPS) 119/328 variables, 16/16 constraints. Problems are: Problem set: 18 solved, 30 unsolved
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/328 variables, 2/18 constraints. Problems are: Problem set: 20 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/328 variables, 0/18 constraints. Problems are: Problem set: 20 solved, 28 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp75 is UNSAT
At refinement iteration 4 (OVERLAPS) 276/604 variables, 23/41 constraints. Problems are: Problem set: 47 solved, 1 unsolved
[2024-06-01 15:07:11] [INFO ] Deduced a trap composed of 84 places in 348 ms of which 3 ms to minimize.
[2024-06-01 15:07:11] [INFO ] Deduced a trap composed of 84 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:07:12] [INFO ] Deduced a trap composed of 84 places in 387 ms of which 4 ms to minimize.
[2024-06-01 15:07:12] [INFO ] Deduced a trap composed of 84 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/604 variables, 4/45 constraints. Problems are: Problem set: 47 solved, 1 unsolved
[2024-06-01 15:07:12] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/604 variables, 1/46 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/604 variables, 0/46 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/605 variables, 1/47 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/605 variables, 0/47 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/606 variables, 1/48 constraints. Problems are: Problem set: 47 solved, 1 unsolved
[2024-06-01 15:07:12] [INFO ] Deduced a trap composed of 341 places in 413 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/606 variables, 1/49 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/606 variables, 0/49 constraints. Problems are: Problem set: 47 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2146/2148 variables, and 655 constraints, problems are : Problem set: 47 solved, 1 unsolved in 4302 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 606/608 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 47 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 1/1 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 457/472 variables, 7/8 constraints. Problems are: Problem set: 47 solved, 1 unsolved
[2024-06-01 15:07:15] [INFO ] Deduced a trap composed of 140 places in 238 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 1/9 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 0/9 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 96/568 variables, 16/25 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/568 variables, 0/25 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 38/606 variables, 19/44 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/606 variables, 6/50 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/606 variables, 0/50 constraints. Problems are: Problem set: 47 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2146/2148 variables, and 656 constraints, problems are : Problem set: 47 solved, 1 unsolved in 2674 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 606/608 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/48 constraints, Known Traps: 7/7 constraints]
After SMT, in 7159ms problems are : Problem set: 47 solved, 1 unsolved
Parikh walk visited 0 properties in 281 ms.
Support contains 3 out of 608 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 608/608 places, 1564/1564 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 608 transition count 1512
Reduce places removed 52 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 54 rules applied. Total rules applied 106 place count 556 transition count 1510
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 108 place count 554 transition count 1510
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 108 place count 554 transition count 1439
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 250 place count 483 transition count 1439
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 253 place count 480 transition count 1436
Iterating global reduction 3 with 3 rules applied. Total rules applied 256 place count 480 transition count 1436
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 372 place count 422 transition count 1378
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 3 with 12 rules applied. Total rules applied 384 place count 422 transition count 1366
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 396 place count 410 transition count 1366
Applied a total of 396 rules in 292 ms. Remains 410 /608 variables (removed 198) and now considering 1366/1564 (removed 198) transitions.
Running 1362 sub problems to find dead transitions.
[2024-06-01 15:07:18] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
// Phase 1: matrix 1342 rows 410 cols
[2024-06-01 15:07:18] [INFO ] Computed 44 invariants in 44 ms
[2024-06-01 15:07:18] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-06-01 15:07:33] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 2 ms to minimize.
[2024-06-01 15:07:33] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 1 ms to minimize.
[2024-06-01 15:07:33] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2024-06-01 15:07:33] [INFO ] Deduced a trap composed of 51 places in 205 ms of which 2 ms to minimize.
[2024-06-01 15:07:39] [INFO ] Deduced a trap composed of 130 places in 211 ms of which 3 ms to minimize.
[2024-06-01 15:07:39] [INFO ] Deduced a trap composed of 128 places in 136 ms of which 2 ms to minimize.
[2024-06-01 15:07:40] [INFO ] Deduced a trap composed of 110 places in 213 ms of which 2 ms to minimize.
[2024-06-01 15:07:40] [INFO ] Deduced a trap composed of 28 places in 258 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 406/1752 variables, and 47 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 23/27 constraints, State Equation: 0/410 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1362/1362 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-06-01 15:07:47] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 2 ms to minimize.
[2024-06-01 15:07:47] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:07:50] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:07:51] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:07:51] [INFO ] Deduced a trap composed of 130 places in 328 ms of which 3 ms to minimize.
[2024-06-01 15:07:51] [INFO ] Deduced a trap composed of 131 places in 279 ms of which 3 ms to minimize.
[2024-06-01 15:07:51] [INFO ] Deduced a trap composed of 130 places in 263 ms of which 2 ms to minimize.
[2024-06-01 15:07:52] [INFO ] Deduced a trap composed of 129 places in 263 ms of which 2 ms to minimize.
[2024-06-01 15:07:52] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
[2024-06-01 15:07:52] [INFO ] Deduced a trap composed of 50 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/1752 variables, and 57 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 23/27 constraints, State Equation: 0/410 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1362 constraints, Known Traps: 18/18 constraints]
After SMT, in 47154ms problems are : Problem set: 0 solved, 1362 unsolved
Search for dead transitions found 0 dead transitions in 47171ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47470 ms. Remains : 410/608 places, 1366/1564 transitions.
RANDOM walk for 40000 steps (10 resets) in 462 ms. (86 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 177411 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 1
Probabilistic random walk after 177411 steps, saw 125665 distinct states, run finished after 3005 ms. (steps per millisecond=59 ) properties seen :0
[2024-06-01 15:08:08] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
[2024-06-01 15:08:08] [INFO ] Invariant cache hit.
[2024-06-01 15:08:08] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 158/168 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 115/283 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/295 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 112/407 variables, 25/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:08:09] [INFO ] Deduced a trap composed of 52 places in 285 ms of which 3 ms to minimize.
[2024-06-01 15:08:09] [INFO ] Deduced a trap composed of 132 places in 315 ms of which 6 ms to minimize.
[2024-06-01 15:08:09] [INFO ] Deduced a trap composed of 53 places in 303 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/408 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1750/1752 variables, and 454 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6129 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 408/410 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 158/168 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 115/283 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/295 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/295 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 112/407 variables, 25/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 15:08:15] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 2 ms to minimize.
[2024-06-01 15:08:15] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 2 ms to minimize.
[2024-06-01 15:08:15] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:08:15] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/407 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/408 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1750/1752 variables, and 458 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 408/410 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 51166ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 1366/1366 transitions.
Applied a total of 0 rules in 73 ms. Remains 410 /410 variables (removed 0) and now considering 1366/1366 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 410/410 places, 1366/1366 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 410/410 places, 1366/1366 transitions.
Applied a total of 0 rules in 46 ms. Remains 410 /410 variables (removed 0) and now considering 1366/1366 (removed 0) transitions.
[2024-06-01 15:08:59] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
[2024-06-01 15:08:59] [INFO ] Invariant cache hit.
[2024-06-01 15:09:00] [INFO ] Implicit Places using invariants in 657 ms returned []
[2024-06-01 15:09:00] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
[2024-06-01 15:09:00] [INFO ] Invariant cache hit.
[2024-06-01 15:09:01] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 15:09:09] [INFO ] Implicit Places using invariants and state equation in 9033 ms returned []
Implicit Place search using SMT with State Equation took 9695 ms to find 0 implicit places.
[2024-06-01 15:09:09] [INFO ] Redundant transitions in 110 ms returned []
Running 1362 sub problems to find dead transitions.
[2024-06-01 15:09:09] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
[2024-06-01 15:09:09] [INFO ] Invariant cache hit.
[2024-06-01 15:09:09] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-06-01 15:09:25] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 1 ms to minimize.
[2024-06-01 15:09:25] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 1 ms to minimize.
[2024-06-01 15:09:26] [INFO ] Deduced a trap composed of 50 places in 247 ms of which 2 ms to minimize.
[2024-06-01 15:09:32] [INFO ] Deduced a trap composed of 128 places in 232 ms of which 3 ms to minimize.
[2024-06-01 15:09:34] [INFO ] Deduced a trap composed of 56 places in 144 ms of which 2 ms to minimize.
[2024-06-01 15:09:34] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 1 ms to minimize.
[2024-06-01 15:09:34] [INFO ] Deduced a trap composed of 28 places in 271 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 7/46 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-06-01 15:09:40] [INFO ] Deduced a trap composed of 136 places in 215 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 406/1752 variables, and 47 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 23/27 constraints, State Equation: 0/410 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1362/1362 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-06-01 15:09:49] [INFO ] Deduced a trap composed of 50 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:09:50] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:09:50] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 0 ms to minimize.
[2024-06-01 15:09:51] [INFO ] Deduced a trap composed of 129 places in 192 ms of which 2 ms to minimize.
[2024-06-01 15:09:52] [INFO ] Deduced a trap composed of 51 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:09:52] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:09:57] [INFO ] Deduced a trap composed of 110 places in 184 ms of which 2 ms to minimize.
[2024-06-01 15:10:01] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/406 variables, 8/55 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/1752 variables, and 55 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 23/27 constraints, State Equation: 0/410 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1362 constraints, Known Traps: 16/16 constraints]
After SMT, in 67867ms problems are : Problem set: 0 solved, 1362 unsolved
Search for dead transitions found 0 dead transitions in 67889ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77758 ms. Remains : 410/410 places, 1366/1366 transitions.
Successfully simplified 47 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-PT-S04J06T06-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:10:17] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 15:10:17] [INFO ] Flatten gal took : 84 ms
[2024-06-01 15:10:17] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA PolyORBLF-PT-S04J06T06-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S04J06T06-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:10:17] [INFO ] Flatten gal took : 86 ms
[2024-06-01 15:10:18] [INFO ] Input system was already deterministic with 1564 transitions.
Support contains 57 out of 608 places (down from 153) after GAL structural reductions.
FORMULA PolyORBLF-PT-S04J06T06-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 608/608 places, 1564/1564 transitions.
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 608 transition count 1522
Reduce places removed 42 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 54 rules applied. Total rules applied 96 place count 566 transition count 1510
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 108 place count 554 transition count 1510
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 108 place count 554 transition count 1444
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 240 place count 488 transition count 1444
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 2 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 348 place count 434 transition count 1390
Applied a total of 348 rules in 89 ms. Remains 434 /608 variables (removed 174) and now considering 1390/1564 (removed 174) transitions.
Running 1386 sub problems to find dead transitions.
[2024-06-01 15:10:18] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
// Phase 1: matrix 1366 rows 434 cols
[2024-06-01 15:10:18] [INFO ] Computed 44 invariants in 38 ms
[2024-06-01 15:10:18] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
[2024-06-01 15:10:30] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 5 ms to minimize.
[2024-06-01 15:10:32] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/1800 variables, and 37 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/434 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1386/1386 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/430 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/430 variables, 18/35 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/430 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
[2024-06-01 15:10:45] [INFO ] Deduced a trap composed of 27 places in 273 ms of which 2 ms to minimize.
[2024-06-01 15:10:45] [INFO ] Deduced a trap composed of 55 places in 253 ms of which 2 ms to minimize.
[2024-06-01 15:10:45] [INFO ] Deduced a trap composed of 55 places in 206 ms of which 2 ms to minimize.
[2024-06-01 15:10:45] [INFO ] Deduced a trap composed of 55 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:10:45] [INFO ] Deduced a trap composed of 55 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:10:46] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/1800 variables, and 43 constraints, problems are : Problem set: 0 solved, 1386 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 18/27 constraints, State Equation: 0/434 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1386 constraints, Known Traps: 8/8 constraints]
After SMT, in 45422ms problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 45436ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 45529 ms. Remains : 434/608 places, 1390/1564 transitions.
[2024-06-01 15:11:03] [INFO ] Flatten gal took : 115 ms
[2024-06-01 15:11:03] [INFO ] Flatten gal took : 101 ms
[2024-06-01 15:11:03] [INFO ] Input system was already deterministic with 1390 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 608/608 places, 1564/1564 transitions.
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 608 transition count 1522
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 566 transition count 1516
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 560 transition count 1516
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 72 Pre rules applied. Total rules applied 96 place count 560 transition count 1444
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 240 place count 488 transition count 1444
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 243 place count 485 transition count 1441
Iterating global reduction 3 with 3 rules applied. Total rules applied 246 place count 485 transition count 1441
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 282 place count 467 transition count 1423
Applied a total of 282 rules in 113 ms. Remains 467 /608 variables (removed 141) and now considering 1423/1564 (removed 141) transitions.
Running 1419 sub problems to find dead transitions.
[2024-06-01 15:11:04] [INFO ] Flow matrix only has 1399 transitions (discarded 24 similar events)
// Phase 1: matrix 1399 rows 467 cols
[2024-06-01 15:11:04] [INFO ] Computed 44 invariants in 49 ms
[2024-06-01 15:11:04] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1419 unsolved
[2024-06-01 15:11:17] [INFO ] Deduced a trap composed of 18 places in 210 ms of which 2 ms to minimize.
[2024-06-01 15:11:18] [INFO ] Deduced a trap composed of 42 places in 196 ms of which 3 ms to minimize.
[2024-06-01 15:11:18] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:11:18] [INFO ] Deduced a trap composed of 60 places in 206 ms of which 2 ms to minimize.
[2024-06-01 15:11:18] [INFO ] Deduced a trap composed of 33 places in 192 ms of which 2 ms to minimize.
[2024-06-01 15:11:18] [INFO ] Deduced a trap composed of 61 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:11:18] [INFO ] Deduced a trap composed of 238 places in 316 ms of which 4 ms to minimize.
[2024-06-01 15:11:19] [INFO ] Deduced a trap composed of 60 places in 301 ms of which 3 ms to minimize.
[2024-06-01 15:11:19] [INFO ] Deduced a trap composed of 223 places in 321 ms of which 3 ms to minimize.
[2024-06-01 15:11:19] [INFO ] Deduced a trap composed of 61 places in 303 ms of which 3 ms to minimize.
[2024-06-01 15:11:20] [INFO ] Deduced a trap composed of 218 places in 323 ms of which 3 ms to minimize.
[2024-06-01 15:11:20] [INFO ] Deduced a trap composed of 61 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:11:21] [INFO ] Deduced a trap composed of 174 places in 333 ms of which 3 ms to minimize.
[2024-06-01 15:11:22] [INFO ] Deduced a trap composed of 62 places in 256 ms of which 3 ms to minimize.
[2024-06-01 15:11:22] [INFO ] Deduced a trap composed of 97 places in 258 ms of which 2 ms to minimize.
[2024-06-01 15:11:25] [INFO ] Deduced a trap composed of 193 places in 319 ms of which 4 ms to minimize.
[2024-06-01 15:11:25] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 2 ms to minimize.
[2024-06-01 15:11:26] [INFO ] Deduced a trap composed of 179 places in 294 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/1866 variables, and 58 constraints, problems are : Problem set: 0 solved, 1419 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/467 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1419/1419 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1419 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/463 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1419 unsolved
[2024-06-01 15:11:47] [INFO ] Deduced a trap composed of 264 places in 289 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 463/1866 variables, and 59 constraints, problems are : Problem set: 0 solved, 1419 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/467 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1419 constraints, Known Traps: 19/19 constraints]
After SMT, in 45145ms problems are : Problem set: 0 solved, 1419 unsolved
Search for dead transitions found 0 dead transitions in 45162ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 45281 ms. Remains : 467/608 places, 1423/1564 transitions.
[2024-06-01 15:11:49] [INFO ] Flatten gal took : 100 ms
[2024-06-01 15:11:49] [INFO ] Flatten gal took : 68 ms
[2024-06-01 15:11:49] [INFO ] Input system was already deterministic with 1423 transitions.
RANDOM walk for 103 steps (0 resets) in 6 ms. (14 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S04J06T06-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 1564/1564 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 602 transition count 1558
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 602 transition count 1558
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 596 transition count 1552
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 596 transition count 1552
Applied a total of 24 rules in 34 ms. Remains 596 /608 variables (removed 12) and now considering 1552/1564 (removed 12) transitions.
Running 1548 sub problems to find dead transitions.
[2024-06-01 15:11:49] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-06-01 15:11:49] [INFO ] Computed 44 invariants in 56 ms
[2024-06-01 15:11:49] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 15:12:06] [INFO ] Deduced a trap composed of 82 places in 119 ms of which 2 ms to minimize.
[2024-06-01 15:12:06] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 2 ms to minimize.
[2024-06-01 15:12:06] [INFO ] Deduced a trap composed of 82 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:12:06] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 2 ms to minimize.
[2024-06-01 15:12:07] [INFO ] Deduced a trap composed of 98 places in 325 ms of which 4 ms to minimize.
[2024-06-01 15:12:07] [INFO ] Deduced a trap composed of 133 places in 313 ms of which 4 ms to minimize.
[2024-06-01 15:12:07] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 2 ms to minimize.
[2024-06-01 15:12:07] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:12:08] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 2 ms to minimize.
[2024-06-01 15:12:08] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 2 ms to minimize.
[2024-06-01 15:12:09] [INFO ] Deduced a trap composed of 39 places in 230 ms of which 2 ms to minimize.
[2024-06-01 15:12:10] [INFO ] Deduced a trap composed of 282 places in 333 ms of which 3 ms to minimize.
[2024-06-01 15:12:11] [INFO ] Deduced a trap composed of 310 places in 344 ms of which 4 ms to minimize.
[2024-06-01 15:12:13] [INFO ] Deduced a trap composed of 379 places in 367 ms of which 3 ms to minimize.
[2024-06-01 15:12:13] [INFO ] Deduced a trap composed of 330 places in 375 ms of which 4 ms to minimize.
[2024-06-01 15:12:13] [INFO ] Deduced a trap composed of 431 places in 268 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 56 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 16/56 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 15:12:28] [INFO ] Deduced a trap composed of 403 places in 323 ms of which 3 ms to minimize.
[2024-06-01 15:12:29] [INFO ] Deduced a trap composed of 64 places in 300 ms of which 3 ms to minimize.
[2024-06-01 15:12:30] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 2 ms to minimize.
[2024-06-01 15:12:32] [INFO ] Deduced a trap composed of 313 places in 358 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 592/2124 variables, and 60 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 20/20 constraints]
After SMT, in 44853ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 44872ms
Finished structural reductions in LTL mode , in 1 iterations and 44909 ms. Remains : 596/608 places, 1552/1564 transitions.
[2024-06-01 15:12:34] [INFO ] Flatten gal took : 59 ms
[2024-06-01 15:12:34] [INFO ] Flatten gal took : 60 ms
[2024-06-01 15:12:34] [INFO ] Input system was already deterministic with 1552 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 608/608 places, 1564/1564 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 608 transition count 1510
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 554 transition count 1510
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 72 Pre rules applied. Total rules applied 108 place count 554 transition count 1438
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 252 place count 482 transition count 1438
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 255 place count 479 transition count 1435
Iterating global reduction 2 with 3 rules applied. Total rules applied 258 place count 479 transition count 1435
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 378 place count 419 transition count 1375
Applied a total of 378 rules in 87 ms. Remains 419 /608 variables (removed 189) and now considering 1375/1564 (removed 189) transitions.
Running 1371 sub problems to find dead transitions.
[2024-06-01 15:12:34] [INFO ] Flow matrix only has 1351 transitions (discarded 24 similar events)
// Phase 1: matrix 1351 rows 419 cols
[2024-06-01 15:12:34] [INFO ] Computed 44 invariants in 24 ms
[2024-06-01 15:12:34] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
[2024-06-01 15:12:48] [INFO ] Deduced a trap composed of 53 places in 157 ms of which 2 ms to minimize.
[2024-06-01 15:12:49] [INFO ] Deduced a trap composed of 52 places in 189 ms of which 2 ms to minimize.
[2024-06-01 15:12:49] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 1 ms to minimize.
[2024-06-01 15:12:49] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2024-06-01 15:12:49] [INFO ] Deduced a trap composed of 53 places in 30 ms of which 0 ms to minimize.
[2024-06-01 15:12:49] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:12:49] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 2 ms to minimize.
[2024-06-01 15:12:50] [INFO ] Deduced a trap composed of 57 places in 205 ms of which 2 ms to minimize.
[2024-06-01 15:12:50] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 1 ms to minimize.
[2024-06-01 15:12:50] [INFO ] Deduced a trap composed of 132 places in 188 ms of which 2 ms to minimize.
[2024-06-01 15:12:51] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 1 ms to minimize.
[2024-06-01 15:12:53] [INFO ] Deduced a trap composed of 180 places in 314 ms of which 3 ms to minimize.
[2024-06-01 15:12:54] [INFO ] Deduced a trap composed of 184 places in 228 ms of which 3 ms to minimize.
[2024-06-01 15:12:59] [INFO ] Deduced a trap composed of 216 places in 313 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 415/1770 variables, and 54 constraints, problems are : Problem set: 0 solved, 1371 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/419 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1371/1371 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1371 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 415/1770 variables, and 54 constraints, problems are : Problem set: 0 solved, 1371 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 23/25 constraints, State Equation: 0/419 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1371 constraints, Known Traps: 14/14 constraints]
After SMT, in 45138ms problems are : Problem set: 0 solved, 1371 unsolved
Search for dead transitions found 0 dead transitions in 45155ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 45246 ms. Remains : 419/608 places, 1375/1564 transitions.
[2024-06-01 15:13:20] [INFO ] Flatten gal took : 55 ms
[2024-06-01 15:13:20] [INFO ] Flatten gal took : 66 ms
[2024-06-01 15:13:20] [INFO ] Input system was already deterministic with 1375 transitions.
RANDOM walk for 214 steps (0 resets) in 9 ms. (21 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-PT-S04J06T06-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 1564/1564 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 602 transition count 1558
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 602 transition count 1558
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 596 transition count 1552
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 596 transition count 1552
Applied a total of 24 rules in 46 ms. Remains 596 /608 variables (removed 12) and now considering 1552/1564 (removed 12) transitions.
Running 1548 sub problems to find dead transitions.
[2024-06-01 15:13:20] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-06-01 15:13:20] [INFO ] Computed 44 invariants in 22 ms
[2024-06-01 15:13:20] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 15:13:39] [INFO ] Deduced a trap composed of 82 places in 131 ms of which 2 ms to minimize.
[2024-06-01 15:13:39] [INFO ] Deduced a trap composed of 82 places in 99 ms of which 2 ms to minimize.
[2024-06-01 15:13:39] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:13:39] [INFO ] Deduced a trap composed of 82 places in 49 ms of which 1 ms to minimize.
[2024-06-01 15:13:39] [INFO ] Deduced a trap composed of 98 places in 322 ms of which 4 ms to minimize.
[2024-06-01 15:13:40] [INFO ] Deduced a trap composed of 133 places in 258 ms of which 3 ms to minimize.
[2024-06-01 15:13:40] [INFO ] Deduced a trap composed of 47 places in 192 ms of which 2 ms to minimize.
[2024-06-01 15:13:40] [INFO ] Deduced a trap composed of 82 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:13:40] [INFO ] Deduced a trap composed of 82 places in 70 ms of which 2 ms to minimize.
[2024-06-01 15:13:41] [INFO ] Deduced a trap composed of 18 places in 231 ms of which 2 ms to minimize.
[2024-06-01 15:13:42] [INFO ] Deduced a trap composed of 39 places in 247 ms of which 3 ms to minimize.
[2024-06-01 15:13:43] [INFO ] Deduced a trap composed of 282 places in 368 ms of which 4 ms to minimize.
[2024-06-01 15:13:44] [INFO ] Deduced a trap composed of 310 places in 365 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 592/2124 variables, and 53 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 15:13:58] [INFO ] Deduced a trap composed of 325 places in 417 ms of which 5 ms to minimize.
[2024-06-01 15:13:59] [INFO ] Deduced a trap composed of 42 places in 373 ms of which 4 ms to minimize.
[2024-06-01 15:14:01] [INFO ] Deduced a trap composed of 265 places in 381 ms of which 4 ms to minimize.
[2024-06-01 15:14:02] [INFO ] Deduced a trap composed of 308 places in 345 ms of which 4 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 Int declared 592/2124 variables, and 57 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/596 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 17/17 constraints]
After SMT, in 45123ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 45145ms
Finished structural reductions in LTL mode , in 1 iterations and 45197 ms. Remains : 596/608 places, 1552/1564 transitions.
[2024-06-01 15:14:05] [INFO ] Flatten gal took : 38 ms
[2024-06-01 15:14:05] [INFO ] Flatten gal took : 40 ms
[2024-06-01 15:14:05] [INFO ] Input system was already deterministic with 1552 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 608/608 places, 1564/1564 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 608 transition count 1512
Reduce places removed 52 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 54 rules applied. Total rules applied 106 place count 556 transition count 1510
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 108 place count 554 transition count 1510
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 108 place count 554 transition count 1439
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 250 place count 483 transition count 1439
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 253 place count 480 transition count 1436
Iterating global reduction 3 with 3 rules applied. Total rules applied 256 place count 480 transition count 1436
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 372 place count 422 transition count 1378
Applied a total of 372 rules in 66 ms. Remains 422 /608 variables (removed 186) and now considering 1378/1564 (removed 186) transitions.
Running 1374 sub problems to find dead transitions.
[2024-06-01 15:14:05] [INFO ] Flow matrix only has 1354 transitions (discarded 24 similar events)
// Phase 1: matrix 1354 rows 422 cols
[2024-06-01 15:14:05] [INFO ] Computed 44 invariants in 17 ms
[2024-06-01 15:14:05] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-06-01 15:14:18] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
[2024-06-01 15:14:19] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
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 418/1776 variables, and 37 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 16/25 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1374/1374 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1374 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/418 variables, 16/35 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-06-01 15:14:36] [INFO ] Deduced a trap composed of 53 places in 243 ms of which 2 ms to minimize.
[2024-06-01 15:14:36] [INFO ] Deduced a trap composed of 52 places in 182 ms of which 2 ms to minimize.
[2024-06-01 15:14:36] [INFO ] Deduced a trap composed of 27 places in 179 ms of which 2 ms to minimize.
[2024-06-01 15:14:36] [INFO ] Deduced a trap composed of 54 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:14:37] [INFO ] Deduced a trap composed of 52 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:14:38] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 2 ms to minimize.
[2024-06-01 15:14:38] [INFO ] Deduced a trap composed of 54 places in 35 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 1374 unsolved
[2024-06-01 15:14:43] [INFO ] Deduced a trap composed of 135 places in 252 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 9)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s20 0)
(s21 1)
(s22 0)
(s23 1)
(s24 1)
(s25 0)
(s26 0)
(s27 0)
(s28 1)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 2)
(s50 1)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s65 0)
(s66 0)
(s67 1)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 1)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 1)
(s101 1)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 1)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 1)
(s117 1)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 4)
(s125 0)
(s126 1)
(s127 1)
(s128 0)
(s129 1)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 9)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 1)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 4)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 1)
(s177 1)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 1)
(s185 0)
(s186 1)
(s187 1)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 1)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 5)
(s209 1)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 1)
(s216 0)
(s217 0)
(s218 4)
(s219 1)
(s220 0)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 1)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 1)
(s231 0)
(s232 1)
(s233 1)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 1)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 4)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 1)
(s261 1)
(s262 1)
(s263 0)
(s264 1)
(s265 1)
(s266 0)
(s267 0)
(s268 1)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 1)
(s275 0)
(s276 0)
(s277 1)
(s278 0)
(s279 0)
(s280 0)
(s281 5)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(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 1)
(s306 0)
(s307 0)
(s308 0)
(s309 1)
(s310 0)
(s312 0)
(s313 0)
(s314 0)
(s315 1)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 1)
(s323 0)
(s324 0)
(s325 1)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 1)
(s345 0)
(s346 0)
(s347 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/1776 variables, and 45 constraints, problems are : Problem set: 0 solved, 1374 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 16/25 constraints, State Equation: 0/422 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1374 constraints, Known Traps: 10/10 constraints]
After SMT, in 45186ms problems are : Problem set: 0 solved, 1374 unsolved
Search for dead transitions found 0 dead transitions in 45198ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 45268 ms. Remains : 422/608 places, 1378/1564 transitions.
[2024-06-01 15:14:50] [INFO ] Flatten gal took : 44 ms
[2024-06-01 15:14:51] [INFO ] Flatten gal took : 48 ms
[2024-06-01 15:14:51] [INFO ] Input system was already deterministic with 1378 transitions.
Starting structural reductions in LTL mode, iteration 0 : 608/608 places, 1564/1564 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 602 transition count 1558
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 602 transition count 1558
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 596 transition count 1552
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 596 transition count 1552
Applied a total of 24 rules in 23 ms. Remains 596 /608 variables (removed 12) and now considering 1552/1564 (removed 12) transitions.
Running 1548 sub problems to find dead transitions.
[2024-06-01 15:14:51] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 596 cols
[2024-06-01 15:14:51] [INFO ] Computed 44 invariants in 23 ms
[2024-06-01 15:14:51] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/592 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-06-01 15:15:08] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 3 ms to minimize.
[2024-06-01 15:15:08] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 2 ms to minimize.
[2024-06-01 15:15:09] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:15:09] [INFO ] Deduced a trap composed of 82 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:15:09] [INFO ] Deduced a trap composed of 98 places in 357 ms of which 4 ms to minimize.
[2024-06-01 15:15:09] [INFO ] Deduced a trap composed of 133 places in 305 ms of which 4 ms to minimize.
[2024-06-01 15:15:10] [INFO ] Deduced a trap composed of 47 places in 208 ms of which 3 ms to minimize.
[2024-06-01 15:15:10] [INFO ] Deduced a trap composed of 82 places in 79 ms of which 1 ms to minimize.
[2024-06-01 15:15:10] [INFO ] Deduced a trap composed of 82 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:15:11] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 3 ms to minimize.
[2024-06-01 15:15:11] [INFO ] Deduced a trap composed of 39 places in 272 ms of which 3 ms to minimize.
[2024-06-01 15:15:13] [INFO ] Deduced a trap composed of 282 places in 393 ms of which 5 ms to minimize.
[2024-06-01 15:15:13] [INFO ] Deduced a trap composed of 310 places in 360 ms of which 3 ms to minimize.
[2024-06-01 15:15:16] [INFO ] Deduced a trap composed of 379 places in 334 ms of which 4 ms to minimize.
SMT process timed out in 24931ms, After SMT, problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 24946ms
Finished structural reductions in LTL mode , in 1 iterations and 24972 ms. Remains : 596/608 places, 1552/1564 transitions.
[2024-06-01 15:15:16] [INFO ] Flatten gal took : 44 ms
[2024-06-01 15:15:16] [INFO ] Flatten gal took : 48 ms
[2024-06-01 15:15:16] [INFO ] Input system was already deterministic with 1552 transitions.
[2024-06-01 15:15:16] [INFO ] Flatten gal took : 49 ms
[2024-06-01 15:15:16] [INFO ] Flatten gal took : 46 ms
[2024-06-01 15:15:16] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 15:15:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 608 places, 1564 transitions and 7772 arcs took 14 ms.
Total runtime 534783 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBLF-PT-S04J06T06-CTLCardinality-2024-02
Could not compute solution for formula : PolyORBLF-PT-S04J06T06-CTLCardinality-2024-06
Could not compute solution for formula : PolyORBLF-PT-S04J06T06-CTLCardinality-2024-10
Could not compute solution for formula : PolyORBLF-PT-S04J06T06-CTLCardinality-2024-13
Could not compute solution for formula : PolyORBLF-PT-S04J06T06-CTLCardinality-2024-14

BK_STOP 1717254916730

--------------------
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
mcc2024
ctl formula name PolyORBLF-PT-S04J06T06-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1122/ctl_0_
ctl formula name PolyORBLF-PT-S04J06T06-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1122/ctl_1_
ctl formula name PolyORBLF-PT-S04J06T06-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1122/ctl_2_
ctl formula name PolyORBLF-PT-S04J06T06-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/1122/ctl_3_
ctl formula name PolyORBLF-PT-S04J06T06-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/1122/ctl_4_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-S04J06T06"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBLF-PT-S04J06T06, 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 r516-tajo-171654446800289"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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