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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 7.5K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 17:06 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 4.1K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 17:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 11 17:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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-COL-S04J06T06-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-COL-S04J06T06-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716851801298

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 23:16:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-27 23:16:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 23:16:42] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-27 23:16:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 23:16:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 663 ms
[2024-05-27 23:16:43] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 618 PT places and 3232.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
[2024-05-27 23:16:43] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-05-27 23:16:43] [INFO ] Skeletonized 13 HLPN properties in 3 ms. Removed 3 properties that had guard overlaps.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (10 resets) in 1617 ms. (24 steps per ms) remains 4/50 properties
BEST_FIRST walk for 40002 steps (8 resets) in 326 ms. (122 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (9 resets) in 215 ms. (185 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (11 resets) in 156 ms. (254 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (8 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
[2024-05-27 23:16:44] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 23:16:44] [INFO ] Computed 26 invariants in 8 ms
[2024-05-27 23:16:44] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp47 is UNSAT
At refinement iteration 1 (OVERLAPS) 39/54 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 2/56 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp40 is UNSAT
After SMT solving in domain Real declared 75/145 variables, and 22 constraints, problems are : Problem set: 4 solved, 0 unsolved in 677 ms.
Refiners :[Positive P Invariants (semi-flows): 9/11 constraints, Generalized P Invariants (flows): 13/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 728ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
[2024-05-27 23:16:45] [INFO ] Flatten gal took : 64 ms
[2024-05-27 23:16:45] [INFO ] Flatten gal took : 29 ms
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-27 23:16:45] [INFO ] Unfolded HLPN to a Petri net with 618 places and 3190 transitions 21570 arcs in 174 ms.
[2024-05-27 23:16:45] [INFO ] Unfolded 16 HLPN properties in 15 ms.
[2024-05-27 23:16:45] [INFO ] Reduced 36 identical enabling conditions.
[2024-05-27 23:16:45] [INFO ] Reduced 1326 identical enabling conditions.
[2024-05-27 23:16:45] [INFO ] Reduced 36 identical enabling conditions.
[2024-05-27 23:16:45] [INFO ] Reduced 1326 identical enabling conditions.
[2024-05-27 23:16:45] [INFO ] Reduced 264 identical enabling conditions.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Support contains 512 out of 618 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 1564/1564 transitions.
Applied a total of 0 rules in 64 ms. Remains 618 /618 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
Running 1560 sub problems to find dead transitions.
[2024-05-27 23:16:45] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
// Phase 1: matrix 1540 rows 618 cols
[2024-05-27 23:16:45] [INFO ] Computed 54 invariants in 139 ms
[2024-05-27 23:16:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
[2024-05-27 23:17:06] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 22 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 610/2158 variables, and 41 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20063 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 26/36 constraints, State Equation: 0/618 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1560/1560 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
[2024-05-27 23:17:30] [INFO ] Deduced a trap composed of 110 places in 211 ms of which 4 ms to minimize.
[2024-05-27 23:17:30] [INFO ] Deduced a trap composed of 83 places in 353 ms of which 4 ms to minimize.
[2024-05-27 23:17:30] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 2 ms to minimize.
[2024-05-27 23:17:30] [INFO ] Deduced a trap composed of 83 places in 93 ms of which 2 ms to minimize.
[2024-05-27 23:17:31] [INFO ] Deduced a trap composed of 88 places in 316 ms of which 6 ms to minimize.
[2024-05-27 23:17:31] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 1 ms to minimize.
[2024-05-27 23:17:31] [INFO ] Deduced a trap composed of 39 places in 297 ms of which 3 ms to minimize.
[2024-05-27 23:17:32] [INFO ] Deduced a trap composed of 33 places in 269 ms of which 2 ms to minimize.
SMT process timed out in 46322ms, After SMT, problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 46380ms
[2024-05-27 23:17:32] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
[2024-05-27 23:17:32] [INFO ] Invariant cache hit.
[2024-05-27 23:17:32] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-27 23:17:32] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
[2024-05-27 23:17:32] [INFO ] Invariant cache hit.
[2024-05-27 23:17:33] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 23:17:35] [INFO ] Implicit Places using invariants and state equation in 3441 ms returned []
Implicit Place search using SMT with State Equation took 3691 ms to find 0 implicit places.
Running 1560 sub problems to find dead transitions.
[2024-05-27 23:17:35] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
[2024-05-27 23:17:35] [INFO ] Invariant cache hit.
[2024-05-27 23:17:35] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
[2024-05-27 23:17:53] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/2158 variables, and 41 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 26/36 constraints, State Equation: 0/618 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1560/1560 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
[2024-05-27 23:18:29] [INFO ] Deduced a trap composed of 110 places in 218 ms of which 4 ms to minimize.
[2024-05-27 23:18:29] [INFO ] Deduced a trap composed of 83 places in 273 ms of which 3 ms to minimize.
[2024-05-27 23:18:29] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-05-27 23:18:30] [INFO ] Deduced a trap composed of 69 places in 228 ms of which 2 ms to minimize.
[2024-05-27 23:18:30] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 2 ms to minimize.
[2024-05-27 23:18:30] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 1 ms to minimize.
[2024-05-27 23:18:30] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 2 ms to minimize.
[2024-05-27 23:18:30] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 2 ms to minimize.
[2024-05-27 23:18:31] [INFO ] Deduced a trap composed of 87 places in 311 ms of which 3 ms to minimize.
[2024-05-27 23:18:31] [INFO ] Deduced a trap composed of 90 places in 310 ms of which 3 ms to minimize.
[2024-05-27 23:18:32] [INFO ] Deduced a trap composed of 33 places in 286 ms of which 3 ms to minimize.
[2024-05-27 23:18:33] [INFO ] Deduced a trap composed of 287 places in 312 ms of which 5 ms to minimize.
[2024-05-27 23:18:33] [INFO ] Deduced a trap composed of 269 places in 283 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/610 variables, 13/54 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 4)
(s1 6)
(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 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(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 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(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 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 timeout
0)
(s96 0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/2158 variables, and 54 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/18 constraints, Generalized P Invariants (flows): 26/36 constraints, State Equation: 0/618 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1560 constraints, Known Traps: 14/14 constraints]
After SMT, in 65452ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 65492ms
Finished structural reductions in LTL mode , in 1 iterations and 115691 ms. Remains : 618/618 places, 1564/1564 transitions.
Support contains 512 out of 618 places after structural reductions.
[2024-05-27 23:18:41] [INFO ] Flatten gal took : 165 ms
[2024-05-27 23:18:41] [INFO ] Flatten gal took : 135 ms
[2024-05-27 23:18:42] [INFO ] Input system was already deterministic with 1564 transitions.
Support contains 506 out of 618 places (down from 512) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 69 to 68
RANDOM walk for 40000 steps (8 resets) in 1247 ms. (32 steps per ms) remains 7/68 properties
BEST_FIRST walk for 40003 steps (8 resets) in 700 ms. (57 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 653 ms. (61 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (9 resets) in 770 ms. (51 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 516 ms. (77 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 493 ms. (80 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 393 ms. (101 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 394 ms. (101 steps per ms) remains 7/7 properties
[2024-05-27 23:18:44] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
[2024-05-27 23:18:44] [INFO ] Invariant cache hit.
[2024-05-27 23:18:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/246 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/246 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 235/481 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/482 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/482 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp66 is UNSAT
After SMT solving in domain Real declared 615/2158 variables, and 51 constraints, problems are : Problem set: 7 solved, 0 unsolved in 869 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 34/36 constraints, State Equation: 0/618 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 1092ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
[2024-05-27 23:18:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-27 23:18:45] [INFO ] Flatten gal took : 153 ms
FORMULA PolyORBLF-COL-S04J06T06-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 23:18:45] [INFO ] Flatten gal took : 98 ms
[2024-05-27 23:18:45] [INFO ] Input system was already deterministic with 1564 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
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
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 608 transition count 1558
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 608 transition count 1558
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 602 transition count 1552
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 602 transition count 1552
Applied a total of 28 rules in 88 ms. Remains 602 /618 variables (removed 16) and now considering 1552/1564 (removed 12) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-27 23:18:46] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 602 cols
[2024-05-27 23:18:46] [INFO ] Computed 50 invariants in 81 ms
[2024-05-27 23:18:46] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-27 23:19:06] [INFO ] Deduced a trap composed of 81 places in 89 ms of which 1 ms to minimize.
[2024-05-27 23:19:06] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 1 ms to minimize.
[2024-05-27 23:19:06] [INFO ] Deduced a trap composed of 81 places in 85 ms of which 1 ms to minimize.
[2024-05-27 23:19:06] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 1 ms to minimize.
[2024-05-27 23:19:06] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 1 ms to minimize.
[2024-05-27 23:19:07] [INFO ] Deduced a trap composed of 340 places in 371 ms of which 3 ms to minimize.
[2024-05-27 23:19:07] [INFO ] Deduced a trap composed of 139 places in 328 ms of which 4 ms to minimize.
[2024-05-27 23:19:08] [INFO ] Deduced a trap composed of 336 places in 377 ms of which 5 ms to minimize.
[2024-05-27 23:19:10] [INFO ] Deduced a trap composed of 377 places in 413 ms of which 5 ms to minimize.
[2024-05-27 23:19:10] [INFO ] Deduced a trap composed of 326 places in 443 ms of which 5 ms to minimize.
[2024-05-27 23:19:11] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/2130 variables, and 57 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-27 23:19:24] [INFO ] Deduced a trap composed of 92 places in 191 ms of which 6 ms to minimize.
[2024-05-27 23:19:25] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/2130 variables, and 59 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 13/13 constraints]
After SMT, in 46733ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 46757ms
Finished structural reductions in LTL mode , in 1 iterations and 46852 ms. Remains : 602/618 places, 1552/1564 transitions.
[2024-05-27 23:19:32] [INFO ] Flatten gal took : 74 ms
[2024-05-27 23:19:33] [INFO ] Flatten gal took : 83 ms
[2024-05-27 23:19:33] [INFO ] Input system was already deterministic with 1552 transitions.
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
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 608 transition count 1558
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 608 transition count 1558
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 602 transition count 1552
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 602 transition count 1552
Applied a total of 28 rules in 48 ms. Remains 602 /618 variables (removed 16) and now considering 1552/1564 (removed 12) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-27 23:19:33] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-27 23:19:33] [INFO ] Invariant cache hit.
[2024-05-27 23:19:33] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-27 23:19:52] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 3 ms to minimize.
[2024-05-27 23:19:52] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 1 ms to minimize.
[2024-05-27 23:19:53] [INFO ] Deduced a trap composed of 82 places in 76 ms of which 1 ms to minimize.
[2024-05-27 23:19:53] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 3 ms to minimize.
[2024-05-27 23:19:53] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 2 ms to minimize.
[2024-05-27 23:19:53] [INFO ] Deduced a trap composed of 314 places in 384 ms of which 5 ms to minimize.
[2024-05-27 23:19:54] [INFO ] Deduced a trap composed of 142 places in 366 ms of which 4 ms to minimize.
[2024-05-27 23:19:56] [INFO ] Deduced a trap composed of 82 places in 407 ms of which 5 ms to minimize.
[2024-05-27 23:19:56] [INFO ] Deduced a trap composed of 341 places in 389 ms of which 5 ms to minimize.
[2024-05-27 23:19:57] [INFO ] Deduced a trap composed of 358 places in 401 ms of which 5 ms to minimize.
[2024-05-27 23:19:57] [INFO ] Deduced a trap composed of 340 places in 442 ms of which 4 ms to minimize.
[2024-05-27 23:19:58] [INFO ] Deduced a trap composed of 412 places in 429 ms of which 4 ms to minimize.
[2024-05-27 23:19:58] [INFO ] Deduced a trap composed of 332 places in 456 ms of which 4 ms to minimize.
[2024-05-27 23:19:59] [INFO ] Deduced a trap composed of 340 places in 412 ms of which 4 ms to minimize.
[2024-05-27 23:19:59] [INFO ] Deduced a trap composed of 349 places in 429 ms of which 4 ms to minimize.
SMT process timed out in 26547ms, After SMT, problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 26570ms
Finished structural reductions in LTL mode , in 1 iterations and 26622 ms. Remains : 602/618 places, 1552/1564 transitions.
[2024-05-27 23:19:59] [INFO ] Flatten gal took : 76 ms
[2024-05-27 23:19:59] [INFO ] Flatten gal took : 81 ms
[2024-05-27 23:20:00] [INFO ] Input system was already deterministic with 1552 transitions.
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
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 608 transition count 1558
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 608 transition count 1558
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 602 transition count 1552
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 602 transition count 1552
Applied a total of 28 rules in 80 ms. Remains 602 /618 variables (removed 16) and now considering 1552/1564 (removed 12) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-27 23:20:00] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-27 23:20:00] [INFO ] Invariant cache hit.
[2024-05-27 23:20:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-27 23:20:19] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 2 ms to minimize.
[2024-05-27 23:20:19] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 1 ms to minimize.
[2024-05-27 23:20:19] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 1 ms to minimize.
[2024-05-27 23:20:19] [INFO ] Deduced a trap composed of 81 places in 78 ms of which 1 ms to minimize.
[2024-05-27 23:20:19] [INFO ] Deduced a trap composed of 81 places in 65 ms of which 7 ms to minimize.
[2024-05-27 23:20:20] [INFO ] Deduced a trap composed of 314 places in 390 ms of which 15 ms to minimize.
[2024-05-27 23:20:20] [INFO ] Deduced a trap composed of 142 places in 347 ms of which 5 ms to minimize.
[2024-05-27 23:20:22] [INFO ] Deduced a trap composed of 82 places in 317 ms of which 3 ms to minimize.
[2024-05-27 23:20:22] [INFO ] Deduced a trap composed of 341 places in 403 ms of which 5 ms to minimize.
[2024-05-27 23:20:23] [INFO ] Deduced a trap composed of 358 places in 383 ms of which 5 ms to minimize.
[2024-05-27 23:20:23] [INFO ] Deduced a trap composed of 340 places in 377 ms of which 5 ms to minimize.
[2024-05-27 23:20:24] [INFO ] Deduced a trap composed of 412 places in 361 ms of which 4 ms to minimize.
[2024-05-27 23:20:24] [INFO ] Deduced a trap composed of 332 places in 415 ms of which 6 ms to minimize.
[2024-05-27 23:20:25] [INFO ] Deduced a trap composed of 340 places in 397 ms of which 4 ms to minimize.
[2024-05-27 23:20:25] [INFO ] Deduced a trap composed of 349 places in 399 ms of which 4 ms to minimize.
[2024-05-27 23:20:26] [INFO ] Deduced a trap composed of 331 places in 427 ms of which 5 ms to minimize.
SMT process timed out in 25746ms, After SMT, problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 25770ms
Finished structural reductions in LTL mode , in 1 iterations and 25855 ms. Remains : 602/618 places, 1552/1564 transitions.
[2024-05-27 23:20:26] [INFO ] Flatten gal took : 79 ms
[2024-05-27 23:20:26] [INFO ] Flatten gal took : 85 ms
[2024-05-27 23:20:26] [INFO ] Input system was already deterministic with 1552 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 618/618 places, 1564/1564 transitions.
Ensure Unique test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 614 transition count 1552
Reduce places removed 12 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 30 rules applied. Total rules applied 42 place count 602 transition count 1534
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 60 place count 584 transition count 1534
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 60 place count 584 transition count 1468
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 192 place count 518 transition count 1468
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 198 place count 512 transition count 1462
Iterating global reduction 3 with 6 rules applied. Total rules applied 204 place count 512 transition count 1462
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 228 place count 500 transition count 1450
Applied a total of 228 rules in 181 ms. Remains 500 /618 variables (removed 118) and now considering 1450/1564 (removed 114) transitions.
Running 1446 sub problems to find dead transitions.
[2024-05-27 23:20:26] [INFO ] Flow matrix only has 1426 transitions (discarded 24 similar events)
// Phase 1: matrix 1426 rows 500 cols
[2024-05-27 23:20:26] [INFO ] Computed 50 invariants in 49 ms
[2024-05-27 23:20:26] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1446 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/496 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 1446 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/1926 variables, and 45 constraints, problems are : Problem set: 0 solved, 1446 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 31/35 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1446/1446 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1446 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/496 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1446 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/496 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 1446 unsolved
[2024-05-27 23:20:57] [INFO ] Deduced a trap composed of 199 places in 303 ms of which 2 ms to minimize.
[2024-05-27 23:20:57] [INFO ] Deduced a trap composed of 192 places in 212 ms of which 2 ms to minimize.
[2024-05-27 23:20:59] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 3 ms to minimize.
[2024-05-27 23:20:59] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 3 ms to minimize.
[2024-05-27 23:20:59] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-27 23:20:59] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 2 ms to minimize.
[2024-05-27 23:21:07] [INFO ] Deduced a trap composed of 186 places in 231 ms of which 3 ms to minimize.
[2024-05-27 23:21:07] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 3 ms to minimize.
[2024-05-27 23:21:07] [INFO ] Deduced a trap composed of 199 places in 210 ms of which 3 ms to minimize.
[2024-05-27 23:21:08] [INFO ] Deduced a trap composed of 193 places in 199 ms of which 2 ms to minimize.
[2024-05-27 23:21:08] [INFO ] Deduced a trap composed of 181 places in 194 ms of which 3 ms to minimize.
[2024-05-27 23:21:08] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-27 23:21:08] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 0 ms to minimize.
[2024-05-27 23:21:09] [INFO ] Deduced a trap composed of 87 places in 309 ms of which 3 ms to minimize.
[2024-05-27 23:21:09] [INFO ] Deduced a trap composed of 109 places in 262 ms of which 3 ms to minimize.
[2024-05-27 23:21:09] [INFO ] Deduced a trap composed of 80 places in 243 ms of which 3 ms to minimize.
[2024-05-27 23:21:09] [INFO ] Deduced a trap composed of 149 places in 252 ms of which 3 ms to minimize.
[2024-05-27 23:21:10] [INFO ] Deduced a trap composed of 112 places in 235 ms of which 3 ms to minimize.
[2024-05-27 23:21:10] [INFO ] Deduced a trap composed of 109 places in 223 ms of which 3 ms to minimize.
[2024-05-27 23:21:10] [INFO ] Deduced a trap composed of 103 places in 226 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 1446 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 496/1926 variables, and 65 constraints, problems are : Problem set: 0 solved, 1446 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 31/35 constraints, State Equation: 0/500 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1446 constraints, Known Traps: 20/20 constraints]
After SMT, in 46469ms problems are : Problem set: 0 solved, 1446 unsolved
Search for dead transitions found 0 dead transitions in 46491ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 46676 ms. Remains : 500/618 places, 1450/1564 transitions.
[2024-05-27 23:21:13] [INFO ] Flatten gal took : 87 ms
[2024-05-27 23:21:13] [INFO ] Flatten gal took : 81 ms
[2024-05-27 23:21:13] [INFO ] Input system was already deterministic with 1450 transitions.
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
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 608 transition count 1558
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 608 transition count 1558
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 602 transition count 1552
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 602 transition count 1552
Applied a total of 28 rules in 42 ms. Remains 602 /618 variables (removed 16) and now considering 1552/1564 (removed 12) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-27 23:21:13] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 602 cols
[2024-05-27 23:21:13] [INFO ] Computed 50 invariants in 82 ms
[2024-05-27 23:21:13] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-27 23:21:33] [INFO ] Deduced a trap composed of 81 places in 59 ms of which 1 ms to minimize.
[2024-05-27 23:21:33] [INFO ] Deduced a trap composed of 81 places in 50 ms of which 1 ms to minimize.
[2024-05-27 23:21:33] [INFO ] Deduced a trap composed of 81 places in 52 ms of which 0 ms to minimize.
[2024-05-27 23:21:34] [INFO ] Deduced a trap composed of 81 places in 52 ms of which 1 ms to minimize.
[2024-05-27 23:21:34] [INFO ] Deduced a trap composed of 81 places in 54 ms of which 1 ms to minimize.
[2024-05-27 23:21:34] [INFO ] Deduced a trap composed of 340 places in 298 ms of which 3 ms to minimize.
[2024-05-27 23:21:35] [INFO ] Deduced a trap composed of 139 places in 281 ms of which 3 ms to minimize.
[2024-05-27 23:21:35] [INFO ] Deduced a trap composed of 336 places in 382 ms of which 5 ms to minimize.
[2024-05-27 23:21:37] [INFO ] Deduced a trap composed of 377 places in 420 ms of which 5 ms to minimize.
[2024-05-27 23:21:37] [INFO ] Deduced a trap composed of 326 places in 309 ms of which 5 ms to minimize.
[2024-05-27 23:21:38] [INFO ] Deduced a trap composed of 82 places in 73 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/2130 variables, and 57 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-27 23:21:51] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 2 ms to minimize.
[2024-05-27 23:21:51] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10)
(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 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 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 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(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 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 9)
(s147 1)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/2130 variables, and 59 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 13/13 constraints]
After SMT, in 46732ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 46757ms
Finished structural reductions in LTL mode , in 1 iterations and 46804 ms. Remains : 602/618 places, 1552/1564 transitions.
[2024-05-27 23:22:00] [INFO ] Flatten gal took : 64 ms
[2024-05-27 23:22:00] [INFO ] Flatten gal took : 70 ms
[2024-05-27 23:22:00] [INFO ] Input system was already deterministic with 1552 transitions.
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
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 608 transition count 1558
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 608 transition count 1558
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 602 transition count 1552
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 602 transition count 1552
Applied a total of 28 rules in 28 ms. Remains 602 /618 variables (removed 16) and now considering 1552/1564 (removed 12) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-27 23:22:00] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-27 23:22:00] [INFO ] Invariant cache hit.
[2024-05-27 23:22:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-27 23:22:20] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 2 ms to minimize.
[2024-05-27 23:22:20] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 1 ms to minimize.
[2024-05-27 23:22:20] [INFO ] Deduced a trap composed of 82 places in 56 ms of which 1 ms to minimize.
[2024-05-27 23:22:20] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 1 ms to minimize.
[2024-05-27 23:22:21] [INFO ] Deduced a trap composed of 81 places in 81 ms of which 1 ms to minimize.
[2024-05-27 23:22:21] [INFO ] Deduced a trap composed of 314 places in 324 ms of which 4 ms to minimize.
[2024-05-27 23:22:21] [INFO ] Deduced a trap composed of 142 places in 278 ms of which 3 ms to minimize.
[2024-05-27 23:22:23] [INFO ] Deduced a trap composed of 82 places in 393 ms of which 4 ms to minimize.
[2024-05-27 23:22:23] [INFO ] Deduced a trap composed of 341 places in 295 ms of which 3 ms to minimize.
[2024-05-27 23:22:24] [INFO ] Deduced a trap composed of 358 places in 309 ms of which 4 ms to minimize.
[2024-05-27 23:22:24] [INFO ] Deduced a trap composed of 340 places in 395 ms of which 16 ms to minimize.
[2024-05-27 23:22:25] [INFO ] Deduced a trap composed of 412 places in 425 ms of which 5 ms to minimize.
[2024-05-27 23:22:25] [INFO ] Deduced a trap composed of 332 places in 427 ms of which 5 ms to minimize.
[2024-05-27 23:22:26] [INFO ] Deduced a trap composed of 340 places in 399 ms of which 4 ms to minimize.
[2024-05-27 23:22:26] [INFO ] Deduced a trap composed of 349 places in 440 ms of which 4 ms to minimize.
[2024-05-27 23:22:27] [INFO ] Deduced a trap composed of 331 places in 376 ms of which 4 ms to minimize.
SMT process timed out in 26525ms, After SMT, problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 26558ms
Finished structural reductions in LTL mode , in 1 iterations and 26593 ms. Remains : 602/618 places, 1552/1564 transitions.
[2024-05-27 23:22:27] [INFO ] Flatten gal took : 59 ms
[2024-05-27 23:22:27] [INFO ] Flatten gal took : 64 ms
[2024-05-27 23:22:27] [INFO ] Input system was already deterministic with 1552 transitions.
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
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 608 transition count 1558
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 608 transition count 1558
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 602 transition count 1552
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 602 transition count 1552
Applied a total of 28 rules in 21 ms. Remains 602 /618 variables (removed 16) and now considering 1552/1564 (removed 12) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-27 23:22:27] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-27 23:22:27] [INFO ] Invariant cache hit.
[2024-05-27 23:22:27] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-27 23:22:46] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 2 ms to minimize.
[2024-05-27 23:22:47] [INFO ] Deduced a trap composed of 81 places in 64 ms of which 1 ms to minimize.
[2024-05-27 23:22:47] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 1 ms to minimize.
[2024-05-27 23:22:47] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 1 ms to minimize.
[2024-05-27 23:22:47] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 1 ms to minimize.
[2024-05-27 23:22:47] [INFO ] Deduced a trap composed of 314 places in 373 ms of which 4 ms to minimize.
[2024-05-27 23:22:48] [INFO ] Deduced a trap composed of 142 places in 354 ms of which 5 ms to minimize.
[2024-05-27 23:22:50] [INFO ] Deduced a trap composed of 82 places in 366 ms of which 5 ms to minimize.
[2024-05-27 23:22:50] [INFO ] Deduced a trap composed of 341 places in 393 ms of which 3 ms to minimize.
[2024-05-27 23:22:51] [INFO ] Deduced a trap composed of 358 places in 352 ms of which 3 ms to minimize.
[2024-05-27 23:22:51] [INFO ] Deduced a trap composed of 340 places in 388 ms of which 3 ms to minimize.
[2024-05-27 23:22:51] [INFO ] Deduced a trap composed of 412 places in 320 ms of which 3 ms to minimize.
[2024-05-27 23:22:52] [INFO ] Deduced a trap composed of 332 places in 323 ms of which 3 ms to minimize.
[2024-05-27 23:22:52] [INFO ] Deduced a trap composed of 340 places in 337 ms of which 3 ms to minimize.
[2024-05-27 23:22:53] [INFO ] Deduced a trap composed of 349 places in 399 ms of which 5 ms to minimize.
[2024-05-27 23:22:53] [INFO ] Deduced a trap composed of 331 places in 341 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/2130 variables, and 62 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/602 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/598 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-27 23:22:56] [INFO ] Deduced a trap composed of 304 places in 303 ms of which 3 ms to minimize.
[2024-05-27 23:22:57] [INFO ] Deduced a trap composed of 60 places in 405 ms of which 5 ms to minimize.
[2024-05-27 23:22:58] [INFO ] Deduced a trap composed of 336 places in 443 ms of which 4 ms to minimize.
[2024-05-27 23:22:58] [INFO ] Deduced a trap composed of 369 places in 398 ms of which 5 ms to minimize.
[2024-05-27 23:22:59] [INFO ] Deduced a trap composed of 315 places in 387 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/2130 variables, and 67 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 21/21 constraints]
After SMT, in 46483ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 46499ms
Finished structural reductions in LTL mode , in 1 iterations and 46524 ms. Remains : 602/618 places, 1552/1564 transitions.
[2024-05-27 23:23:13] [INFO ] Flatten gal took : 105 ms
[2024-05-27 23:23:14] [INFO ] Flatten gal took : 85 ms
[2024-05-27 23:23:14] [INFO ] Input system was already deterministic with 1552 transitions.
Starting structural reductions in LTL mode, iteration 0 : 618/618 places, 1564/1564 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 612 transition count 1558
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 612 transition count 1558
Applied a total of 12 rules in 31 ms. Remains 612 /618 variables (removed 6) and now considering 1558/1564 (removed 6) transitions.
Running 1554 sub problems to find dead transitions.
[2024-05-27 23:23:14] [INFO ] Flow matrix only has 1534 transitions (discarded 24 similar events)
// Phase 1: matrix 1534 rows 612 cols
[2024-05-27 23:23:14] [INFO ] Computed 54 invariants in 33 ms
[2024-05-27 23:23:14] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/604 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/604 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1554 unsolved
[2024-05-27 23:23:32] [INFO ] Deduced a trap composed of 83 places in 148 ms of which 3 ms to minimize.
[2024-05-27 23:23:32] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 1 ms to minimize.
[2024-05-27 23:23:32] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 1 ms to minimize.
[2024-05-27 23:23:33] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 1 ms to minimize.
[2024-05-27 23:23:33] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 1 ms to minimize.
[2024-05-27 23:23:33] [INFO ] Deduced a trap composed of 329 places in 305 ms of which 5 ms to minimize.
[2024-05-27 23:23:34] [INFO ] Deduced a trap composed of 139 places in 345 ms of which 4 ms to minimize.
[2024-05-27 23:23:35] [INFO ] Deduced a trap composed of 340 places in 391 ms of which 5 ms to minimize.
[2024-05-27 23:23:35] [INFO ] Deduced a trap composed of 82 places in 74 ms of which 1 ms to minimize.
[2024-05-27 23:23:36] [INFO ] Deduced a trap composed of 343 places in 321 ms of which 4 ms to minimize.
[2024-05-27 23:23:37] [INFO ] Deduced a trap composed of 329 places in 320 ms of which 3 ms to minimize.
[2024-05-27 23:23:37] [INFO ] Deduced a trap composed of 359 places in 390 ms of which 4 ms to minimize.
[2024-05-27 23:23:37] [INFO ] Deduced a trap composed of 330 places in 317 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 604/2146 variables, and 59 constraints, problems are : Problem set: 0 solved, 1554 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 32/38 constraints, State Equation: 0/612 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1554/1554 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1554 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/604 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/604 variables, 32/46 constraints. Problems are: Problem set: 0 solved, 1554 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/604 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 1554 unsolved
[2024-05-27 23:23:43] [INFO ] Deduced a trap composed of 93 places in 193 ms of which 2 ms to minimize.
[2024-05-27 23:23:43] [INFO ] Deduced a trap composed of 15 places in 180 ms of which 3 ms to minimize.
[2024-05-27 23:23:49] [INFO ] Deduced a trap composed of 302 places in 382 ms of which 5 ms to minimize.
[2024-05-27 23:23:50] [INFO ] Deduced a trap composed of 309 places in 286 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/2146 variables, and 63 constraints, problems are : Problem set: 0 solved, 1554 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 32/38 constraints, State Equation: 0/612 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1554 constraints, Known Traps: 17/17 constraints]
After SMT, in 45599ms problems are : Problem set: 0 solved, 1554 unsolved
Search for dead transitions found 0 dead transitions in 45648ms
Finished structural reductions in LTL mode , in 1 iterations and 45686 ms. Remains : 612/618 places, 1558/1564 transitions.
[2024-05-27 23:24:00] [INFO ] Flatten gal took : 63 ms
[2024-05-27 23:24:00] [INFO ] Flatten gal took : 69 ms
[2024-05-27 23:24:00] [INFO ] Input system was already deterministic with 1558 transitions.
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 11 ms. Remains 614 /618 variables (removed 4) and now considering 1564/1564 (removed 0) transitions.
Running 1560 sub problems to find dead transitions.
[2024-05-27 23:24:00] [INFO ] Flow matrix only has 1540 transitions (discarded 24 similar events)
// Phase 1: matrix 1540 rows 614 cols
[2024-05-27 23:24:00] [INFO ] Computed 50 invariants in 26 ms
[2024-05-27 23:24:00] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
[2024-05-27 23:24:19] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 2 ms to minimize.
[2024-05-27 23:24:19] [INFO ] Deduced a trap composed of 84 places in 67 ms of which 1 ms to minimize.
[2024-05-27 23:24:19] [INFO ] Deduced a trap composed of 83 places in 62 ms of which 1 ms to minimize.
[2024-05-27 23:24:20] [INFO ] Deduced a trap composed of 83 places in 77 ms of which 2 ms to minimize.
[2024-05-27 23:24:20] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 1 ms to minimize.
[2024-05-27 23:24:20] [INFO ] Deduced a trap composed of 322 places in 386 ms of which 5 ms to minimize.
[2024-05-27 23:24:21] [INFO ] Deduced a trap composed of 119 places in 366 ms of which 4 ms to minimize.
[2024-05-27 23:24:21] [INFO ] Deduced a trap composed of 172 places in 332 ms of which 5 ms to minimize.
[2024-05-27 23:24:22] [INFO ] Deduced a trap composed of 347 places in 384 ms of which 5 ms to minimize.
[2024-05-27 23:24:23] [INFO ] Deduced a trap composed of 63 places in 235 ms of which 2 ms to minimize.
[2024-05-27 23:24:24] [INFO ] Deduced a trap composed of 331 places in 353 ms of which 3 ms to minimize.
[2024-05-27 23:24:24] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/2154 variables, and 58 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/34 constraints, State Equation: 0/614 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1560/1560 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 31/46 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 12/58 constraints. Problems are: Problem set: 0 solved, 1560 unsolved
[2024-05-27 23:24:33] [INFO ] Deduced a trap composed of 39 places in 270 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 610/2154 variables, and 59 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 31/34 constraints, State Equation: 0/614 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1560 constraints, Known Traps: 13/13 constraints]
After SMT, in 45779ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 45802ms
Finished structural reductions in LTL mode , in 1 iterations and 45819 ms. Remains : 614/618 places, 1564/1564 transitions.
[2024-05-27 23:24:46] [INFO ] Flatten gal took : 62 ms
[2024-05-27 23:24:46] [INFO ] Flatten gal took : 70 ms
[2024-05-27 23:24:46] [INFO ] Input system was already deterministic with 1564 transitions.
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
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 608 transition count 1558
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 608 transition count 1558
Applied a total of 16 rules in 15 ms. Remains 608 /618 variables (removed 10) and now considering 1558/1564 (removed 6) transitions.
Running 1554 sub problems to find dead transitions.
[2024-05-27 23:24:46] [INFO ] Flow matrix only has 1534 transitions (discarded 24 similar events)
// Phase 1: matrix 1534 rows 608 cols
[2024-05-27 23:24:46] [INFO ] Computed 50 invariants in 26 ms
[2024-05-27 23:24:46] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/604 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/604 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1554 unsolved
[2024-05-27 23:25:05] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 2 ms to minimize.
[2024-05-27 23:25:05] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 1 ms to minimize.
[2024-05-27 23:25:05] [INFO ] Deduced a trap composed of 83 places in 61 ms of which 1 ms to minimize.
[2024-05-27 23:25:06] [INFO ] Deduced a trap composed of 82 places in 58 ms of which 1 ms to minimize.
[2024-05-27 23:25:06] [INFO ] Deduced a trap composed of 82 places in 59 ms of which 1 ms to minimize.
[2024-05-27 23:25:06] [INFO ] Deduced a trap composed of 347 places in 369 ms of which 5 ms to minimize.
[2024-05-27 23:25:07] [INFO ] Deduced a trap composed of 142 places in 238 ms of which 3 ms to minimize.
[2024-05-27 23:25:07] [INFO ] Deduced a trap composed of 82 places in 62 ms of which 1 ms to minimize.
[2024-05-27 23:25:08] [INFO ] Deduced a trap composed of 343 places in 322 ms of which 4 ms to minimize.
[2024-05-27 23:25:09] [INFO ] Deduced a trap composed of 355 places in 396 ms of which 5 ms to minimize.
[2024-05-27 23:25:09] [INFO ] Deduced a trap composed of 354 places in 379 ms of which 4 ms to minimize.
[2024-05-27 23:25:09] [INFO ] Deduced a trap composed of 336 places in 312 ms of which 3 ms to minimize.
[2024-05-27 23:25:10] [INFO ] Deduced a trap composed of 94 places in 389 ms of which 5 ms to minimize.
[2024-05-27 23:25:10] [INFO ] Deduced a trap composed of 15 places in 377 ms of which 4 ms to minimize.
[2024-05-27 23:25:11] [INFO ] Deduced a trap composed of 341 places in 385 ms of which 4 ms to minimize.
[2024-05-27 23:25:11] [INFO ] Deduced a trap composed of 377 places in 332 ms of which 4 ms to minimize.
[2024-05-27 23:25:11] [INFO ] Deduced a trap composed of 380 places in 340 ms of which 4 ms to minimize.
SMT process timed out in 25362ms, After SMT, problems are : Problem set: 0 solved, 1554 unsolved
Search for dead transitions found 0 dead transitions in 25396ms
Finished structural reductions in LTL mode , in 1 iterations and 25417 ms. Remains : 608/618 places, 1558/1564 transitions.
[2024-05-27 23:25:11] [INFO ] Flatten gal took : 63 ms
[2024-05-27 23:25:11] [INFO ] Flatten gal took : 69 ms
[2024-05-27 23:25:12] [INFO ] Input system was already deterministic with 1558 transitions.
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
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 608 transition count 1558
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 608 transition count 1558
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 602 transition count 1552
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 602 transition count 1552
Applied a total of 28 rules in 26 ms. Remains 602 /618 variables (removed 16) and now considering 1552/1564 (removed 12) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-27 23:25:12] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 602 cols
[2024-05-27 23:25:12] [INFO ] Computed 50 invariants in 42 ms
[2024-05-27 23:25:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-27 23:25:31] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 1 ms to minimize.
[2024-05-27 23:25:32] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 1 ms to minimize.
[2024-05-27 23:25:32] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 0 ms to minimize.
[2024-05-27 23:25:32] [INFO ] Deduced a trap composed of 81 places in 52 ms of which 1 ms to minimize.
[2024-05-27 23:25:32] [INFO ] Deduced a trap composed of 81 places in 69 ms of which 1 ms to minimize.
[2024-05-27 23:25:32] [INFO ] Deduced a trap composed of 340 places in 275 ms of which 4 ms to minimize.
[2024-05-27 23:25:33] [INFO ] Deduced a trap composed of 139 places in 255 ms of which 3 ms to minimize.
[2024-05-27 23:25:33] [INFO ] Deduced a trap composed of 336 places in 314 ms of which 4 ms to minimize.
[2024-05-27 23:25:35] [INFO ] Deduced a trap composed of 377 places in 397 ms of which 5 ms to minimize.
[2024-05-27 23:25:35] [INFO ] Deduced a trap composed of 326 places in 380 ms of which 5 ms to minimize.
[2024-05-27 23:25:36] [INFO ] Deduced a trap composed of 82 places in 84 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/2130 variables, and 57 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-27 23:25:49] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 3 ms to minimize.
[2024-05-27 23:25:49] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/2130 variables, and 59 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 13/13 constraints]
After SMT, in 46159ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 46181ms
Finished structural reductions in LTL mode , in 1 iterations and 46212 ms. Remains : 602/618 places, 1552/1564 transitions.
[2024-05-27 23:25:58] [INFO ] Flatten gal took : 59 ms
[2024-05-27 23:25:58] [INFO ] Flatten gal took : 63 ms
[2024-05-27 23:25:58] [INFO ] Input system was already deterministic with 1552 transitions.
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
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 608 transition count 1558
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 608 transition count 1558
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 602 transition count 1552
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 602 transition count 1552
Applied a total of 28 rules in 44 ms. Remains 602 /618 variables (removed 16) and now considering 1552/1564 (removed 12) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-27 23:25:58] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
[2024-05-27 23:25:58] [INFO ] Invariant cache hit.
[2024-05-27 23:25:58] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-27 23:26:17] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 1 ms to minimize.
[2024-05-27 23:26:17] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 1 ms to minimize.
[2024-05-27 23:26:17] [INFO ] Deduced a trap composed of 82 places in 66 ms of which 1 ms to minimize.
[2024-05-27 23:26:18] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 1 ms to minimize.
[2024-05-27 23:26:18] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 1 ms to minimize.
[2024-05-27 23:26:18] [INFO ] Deduced a trap composed of 314 places in 403 ms of which 4 ms to minimize.
[2024-05-27 23:26:19] [INFO ] Deduced a trap composed of 142 places in 299 ms of which 3 ms to minimize.
[2024-05-27 23:26:20] [INFO ] Deduced a trap composed of 82 places in 344 ms of which 3 ms to minimize.
[2024-05-27 23:26:21] [INFO ] Deduced a trap composed of 341 places in 354 ms of which 4 ms to minimize.
[2024-05-27 23:26:21] [INFO ] Deduced a trap composed of 358 places in 310 ms of which 4 ms to minimize.
[2024-05-27 23:26:21] [INFO ] Deduced a trap composed of 340 places in 398 ms of which 5 ms to minimize.
[2024-05-27 23:26:22] [INFO ] Deduced a trap composed of 412 places in 413 ms of which 5 ms to minimize.
[2024-05-27 23:26:22] [INFO ] Deduced a trap composed of 332 places in 325 ms of which 4 ms to minimize.
[2024-05-27 23:26:23] [INFO ] Deduced a trap composed of 340 places in 314 ms of which 4 ms to minimize.
[2024-05-27 23:26:23] [INFO ] Deduced a trap composed of 349 places in 342 ms of which 3 ms to minimize.
[2024-05-27 23:26:23] [INFO ] Deduced a trap composed of 331 places in 302 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/2130 variables, and 62 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/602 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/598 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-27 23:26:27] [INFO ] Deduced a trap composed of 304 places in 361 ms of which 4 ms to minimize.
[2024-05-27 23:26:28] [INFO ] Deduced a trap composed of 60 places in 308 ms of which 3 ms to minimize.
[2024-05-27 23:26:28] [INFO ] Deduced a trap composed of 336 places in 302 ms of which 4 ms to minimize.
[2024-05-27 23:26:29] [INFO ] Deduced a trap composed of 369 places in 387 ms of which 4 ms to minimize.
[2024-05-27 23:26:29] [INFO ] Deduced a trap composed of 315 places in 399 ms of which 4 ms to minimize.
(s511 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 10)
(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 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 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 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(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 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 9)
(s147 1)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 1)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 1)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 1)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 6)
(s416 0)
(s417 0)
(s418 0)
(s419 1)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 3)
(s478 1)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 1)
(s495 0)
(s496 0)
(s497 1)
(s498 1)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/2130 variables, and 67 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 21/21 constraints]
After SMT, in 45666ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 45692ms
Finished structural reductions in LTL mode , in 1 iterations and 45742 ms. Remains : 602/618 places, 1552/1564 transitions.
[2024-05-27 23:26:44] [INFO ] Flatten gal took : 57 ms
[2024-05-27 23:26:44] [INFO ] Flatten gal took : 69 ms
[2024-05-27 23:26:44] [INFO ] Input system was already deterministic with 1552 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 618/618 places, 1564/1564 transitions.
Ensure Unique test removed 4 places
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 614 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 560 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 560 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 488 transition count 1438
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 348 place count 440 transition count 1390
Applied a total of 348 rules in 59 ms. Remains 440 /618 variables (removed 178) and now considering 1390/1564 (removed 174) transitions.
Running 1386 sub problems to find dead transitions.
[2024-05-27 23:26:44] [INFO ] Flow matrix only has 1366 transitions (discarded 24 similar events)
// Phase 1: matrix 1366 rows 440 cols
[2024-05-27 23:26:44] [INFO ] Computed 50 invariants in 18 ms
[2024-05-27 23:26:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/436 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/436 variables, 28/46 constraints. Problems are: Problem set: 0 solved, 1386 unsolved
[2024-05-27 23:27:01] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 1 ms to minimize.
[2024-05-27 23:27:01] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 0 ms to minimize.
[2024-05-27 23:27:01] [INFO ] Deduced a trap composed of 54 places in 91 ms of which 1 ms to minimize.
[2024-05-27 23:27:01] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 1 ms to minimize.
[2024-05-27 23:27:02] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 1 ms to minimize.
[2024-05-27 23:27:03] [INFO ] Deduced a trap composed of 228 places in 274 ms of which 3 ms to minimize.
[2024-05-27 23:27:04] [INFO ] Deduced a trap composed of 54 places in 40 ms of which 1 ms to minimize.
[2024-05-27 23:27:10] [INFO ] Deduced a trap composed of 138 places in 251 ms of which 2 ms to minimize.
SMT process timed out in 25425ms, After SMT, problems are : Problem set: 0 solved, 1386 unsolved
Search for dead transitions found 0 dead transitions in 25440ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 25503 ms. Remains : 440/618 places, 1390/1564 transitions.
[2024-05-27 23:27:10] [INFO ] Flatten gal took : 47 ms
[2024-05-27 23:27:10] [INFO ] Flatten gal took : 49 ms
[2024-05-27 23:27:10] [INFO ] Input system was already deterministic with 1390 transitions.
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
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 608 transition count 1558
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 608 transition count 1558
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 22 place count 602 transition count 1552
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 602 transition count 1552
Applied a total of 28 rules in 25 ms. Remains 602 /618 variables (removed 16) and now considering 1552/1564 (removed 12) transitions.
Running 1548 sub problems to find dead transitions.
[2024-05-27 23:27:10] [INFO ] Flow matrix only has 1528 transitions (discarded 24 similar events)
// Phase 1: matrix 1528 rows 602 cols
[2024-05-27 23:27:10] [INFO ] Computed 50 invariants in 22 ms
[2024-05-27 23:27:10] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-27 23:27:28] [INFO ] Deduced a trap composed of 81 places in 59 ms of which 1 ms to minimize.
[2024-05-27 23:27:28] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 1 ms to minimize.
[2024-05-27 23:27:28] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 1 ms to minimize.
[2024-05-27 23:27:28] [INFO ] Deduced a trap composed of 81 places in 75 ms of which 1 ms to minimize.
[2024-05-27 23:27:28] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 1 ms to minimize.
[2024-05-27 23:27:28] [INFO ] Deduced a trap composed of 340 places in 363 ms of which 5 ms to minimize.
[2024-05-27 23:27:29] [INFO ] Deduced a trap composed of 139 places in 257 ms of which 4 ms to minimize.
[2024-05-27 23:27:30] [INFO ] Deduced a trap composed of 336 places in 336 ms of which 4 ms to minimize.
[2024-05-27 23:27:31] [INFO ] Deduced a trap composed of 377 places in 293 ms of which 3 ms to minimize.
[2024-05-27 23:27:31] [INFO ] Deduced a trap composed of 326 places in 343 ms of which 4 ms to minimize.
[2024-05-27 23:27:32] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 1 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 598/2130 variables, and 57 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1548/1548 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/598 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/598 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 1548 unsolved
[2024-05-27 23:27:46] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 2 ms to minimize.
[2024-05-27 23:27:46] [INFO ] Deduced a trap composed of 15 places in 155 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/2130 variables, and 59 constraints, problems are : Problem set: 0 solved, 1548 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 17/19 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/602 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1548 constraints, Known Traps: 13/13 constraints]
After SMT, in 45283ms problems are : Problem set: 0 solved, 1548 unsolved
Search for dead transitions found 0 dead transitions in 45299ms
Finished structural reductions in LTL mode , in 1 iterations and 45327 ms. Remains : 602/618 places, 1552/1564 transitions.
[2024-05-27 23:27:55] [INFO ] Flatten gal took : 69 ms
[2024-05-27 23:27:55] [INFO ] Flatten gal took : 78 ms
[2024-05-27 23:27:55] [INFO ] Input system was already deterministic with 1552 transitions.
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
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 10 place count 608 transition count 1558
Iterating global reduction 1 with 6 rules applied. Total rules applied 16 place count 608 transition count 1558
Applied a total of 16 rules in 32 ms. Remains 608 /618 variables (removed 10) and now considering 1558/1564 (removed 6) transitions.
Running 1554 sub problems to find dead transitions.
[2024-05-27 23:27:56] [INFO ] Flow matrix only has 1534 transitions (discarded 24 similar events)
// Phase 1: matrix 1534 rows 608 cols
[2024-05-27 23:27:56] [INFO ] Computed 50 invariants in 25 ms
[2024-05-27 23:27:56] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/604 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/604 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1554 unsolved
[2024-05-27 23:28:14] [INFO ] Deduced a trap composed of 82 places in 78 ms of which 1 ms to minimize.
[2024-05-27 23:28:14] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 1 ms to minimize.
[2024-05-27 23:28:14] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 1 ms to minimize.
[2024-05-27 23:28:14] [INFO ] Deduced a trap composed of 82 places in 68 ms of which 1 ms to minimize.
[2024-05-27 23:28:15] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
[2024-05-27 23:28:15] [INFO ] Deduced a trap composed of 347 places in 393 ms of which 4 ms to minimize.
[2024-05-27 23:28:15] [INFO ] Deduced a trap composed of 142 places in 248 ms of which 4 ms to minimize.
[2024-05-27 23:28:16] [INFO ] Deduced a trap composed of 82 places in 168 ms of which 1 ms to minimize.
[2024-05-27 23:28:17] [INFO ] Deduced a trap composed of 343 places in 289 ms of which 4 ms to minimize.
[2024-05-27 23:28:17] [INFO ] Deduced a trap composed of 355 places in 286 ms of which 5 ms to minimize.
[2024-05-27 23:28:18] [INFO ] Deduced a trap composed of 354 places in 381 ms of which 5 ms to minimize.
[2024-05-27 23:28:18] [INFO ] Deduced a trap composed of 336 places in 318 ms of which 3 ms to minimize.
[2024-05-27 23:28:19] [INFO ] Deduced a trap composed of 94 places in 316 ms of which 4 ms to minimize.
[2024-05-27 23:28:19] [INFO ] Deduced a trap composed of 15 places in 296 ms of which 4 ms to minimize.
[2024-05-27 23:28:19] [INFO ] Deduced a trap composed of 341 places in 302 ms of which 4 ms to minimize.
[2024-05-27 23:28:19] [INFO ] Deduced a trap composed of 377 places in 302 ms of which 4 ms to minimize.
[2024-05-27 23:28:20] [INFO ] Deduced a trap composed of 380 places in 302 ms of which 6 ms to minimize.
[2024-05-27 23:28:20] [INFO ] Deduced a trap composed of 369 places in 304 ms of which 3 ms to minimize.
[2024-05-27 23:28:20] [INFO ] Deduced a trap composed of 357 places in 311 ms of which 3 ms to minimize.
[2024-05-27 23:28:21] [INFO ] Deduced a trap composed of 352 places in 288 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/604 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1554 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 604/2142 variables, and 66 constraints, problems are : Problem set: 0 solved, 1554 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/608 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1554/1554 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1554 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/604 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/604 variables, 29/46 constraints. Problems are: Problem set: 0 solved, 1554 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/604 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 1554 unsolved
[2024-05-27 23:28:24] [INFO ] Deduced a trap composed of 310 places in 345 ms of which 4 ms to minimize.
[2024-05-27 23:28:25] [INFO ] Deduced a trap composed of 372 places in 333 ms of which 4 ms to minimize.
[2024-05-27 23:28:25] [INFO ] Deduced a trap composed of 329 places in 304 ms of which 3 ms to minimize.
[2024-05-27 23:28:26] [INFO ] Deduced a trap composed of 316 places in 273 ms of which 3 ms to minimize.
[2024-05-27 23:28:32] [INFO ] Deduced a trap composed of 388 places in 303 ms of which 3 ms to minimize.
[2024-05-27 23:28:32] [INFO ] Deduced a trap composed of 374 places in 303 ms of which 4 ms to minimize.
[2024-05-27 23:28:32] [INFO ] Deduced a trap composed of 365 places in 273 ms of which 4 ms to minimize.
[2024-05-27 23:28:33] [INFO ] Deduced a trap composed of 303 places in 271 ms of which 3 ms to minimize.
[2024-05-27 23:28:33] [INFO ] Deduced a trap composed of 308 places in 304 ms of which 3 ms to minimize.
[2024-05-27 23:28:35] [INFO ] Deduced a trap composed of 284 places in 316 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 604/2142 variables, and 76 constraints, problems are : Problem set: 0 solved, 1554 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 17/18 constraints, Generalized P Invariants (flows): 29/32 constraints, State Equation: 0/608 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1554 constraints, Known Traps: 30/30 constraints]
After SMT, in 45504ms problems are : Problem set: 0 solved, 1554 unsolved
Search for dead transitions found 0 dead transitions in 45519ms
Finished structural reductions in LTL mode , in 1 iterations and 45557 ms. Remains : 608/618 places, 1558/1564 transitions.
[2024-05-27 23:28:41] [INFO ] Flatten gal took : 63 ms
[2024-05-27 23:28:41] [INFO ] Flatten gal took : 68 ms
[2024-05-27 23:28:41] [INFO ] Input system was already deterministic with 1558 transitions.
[2024-05-27 23:28:41] [INFO ] Flatten gal took : 90 ms
[2024-05-27 23:28:42] [INFO ] Flatten gal took : 93 ms
[2024-05-27 23:28:42] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 24 ms.
[2024-05-27 23:28:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 618 places, 1564 transitions and 7812 arcs took 12 ms.
Total runtime 719817 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S04J06T06

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.006s, 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: 1511
MODEL NAME: /home/mcc/execution/414/model
618 places, 1564 transitions.

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..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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