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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 8.8K Apr 11 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 11 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 11 16:45 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.7K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 11 16:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 16:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 16:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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-S02J04T10-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-COL-S02J04T10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716845292305

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S02J04T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 21:28:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 21:28:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 21:28:13] [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 21:28:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 21:28:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 649 ms
[2024-05-27 21:28:14] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 752 PT places and 1664.0 transition bindings in 24 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
[2024-05-27 21:28:14] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-27 21:28:14] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 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 (13 resets) in 1734 ms. (23 steps per ms) remains 74/95 properties
BEST_FIRST walk for 4000 steps (8 resets) in 250 ms. (15 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4000 steps (8 resets) in 263 ms. (15 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 202 ms. (19 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4000 steps (8 resets) in 67 ms. (58 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 63 ms. (62 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4000 steps (8 resets) in 38 ms. (102 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4000 steps (8 resets) in 43 ms. (90 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4000 steps (8 resets) in 52 ms. (75 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4000 steps (8 resets) in 42 ms. (93 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4000 steps (8 resets) in 34 ms. (114 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4004 steps (9 resets) in 53 ms. (74 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 47 ms. (83 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4000 steps (8 resets) in 28 ms. (137 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4000 steps (8 resets) in 29 ms. (133 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4000 steps (8 resets) in 30 ms. (129 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4000 steps (8 resets) in 30 ms. (129 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 74/74 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 74/74 properties
[2024-05-27 21:28:16] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-27 21:28:16] [INFO ] Computed 26 invariants in 7 ms
[2024-05-27 21:28:16] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp70 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 4/4 constraints. Problems are: Problem set: 10 solved, 64 unsolved
Problem AtomicPropp81 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 2/6 constraints. Problems are: Problem set: 11 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/6 constraints. Problems are: Problem set: 11 solved, 63 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp91 is UNSAT
Problem AtomicPropp92 is UNSAT
Problem AtomicPropp93 is UNSAT
At refinement iteration 3 (OVERLAPS) 9/75 variables, 7/13 constraints. Problems are: Problem set: 49 solved, 25 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 2/15 constraints. Problems are: Problem set: 50 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/15 constraints. Problems are: Problem set: 50 solved, 24 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp88 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp90 is UNSAT
Problem AtomicPropp94 is UNSAT
At refinement iteration 6 (OVERLAPS) 6/81 variables, 11/26 constraints. Problems are: Problem set: 70 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 70 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 70 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 70 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 70 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 70 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 70 solved, 4 unsolved in 719 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 70 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 70 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 38/52 variables, 8/8 constraints. Problems are: Problem set: 70 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 70 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 2/10 constraints. Problems are: Problem set: 70 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 70 solved, 4 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 5 (OVERLAPS) 24/78 variables, 13/23 constraints. Problems are: Problem set: 71 solved, 3 unsolved
[2024-05-27 21:28:16] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 12 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 1/24 constraints. Problems are: Problem set: 71 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/24 constraints. Problems are: Problem set: 71 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/79 variables, 1/25 constraints. Problems are: Problem set: 71 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/25 constraints. Problems are: Problem set: 71 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/81 variables, 2/27 constraints. Problems are: Problem set: 71 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/81 variables, 0/27 constraints. Problems are: Problem set: 71 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 64/145 variables, 81/108 constraints. Problems are: Problem set: 71 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 8/116 constraints. Problems are: Problem set: 71 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/145 variables, 3/119 constraints. Problems are: Problem set: 71 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/145 variables, 0/119 constraints. Problems are: Problem set: 71 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/145 variables, 0/119 constraints. Problems are: Problem set: 71 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 119 constraints, problems are : Problem set: 71 solved, 3 unsolved in 594 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 3/74 constraints, Known Traps: 1/1 constraints]
After SMT, in 1373ms problems are : Problem set: 71 solved, 3 unsolved
Parikh walk visited 0 properties in 951 ms.
Support contains 10 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 80 transition count 60
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 75 transition count 60
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 11 place count 75 transition count 57
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 17 place count 72 transition count 57
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 27 place count 67 transition count 52
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 67 transition count 49
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 33 place count 64 transition count 49
Applied a total of 33 rules in 30 ms. Remains 64 /81 variables (removed 17) and now considering 49/65 (removed 16) transitions.
Running 48 sub problems to find dead transitions.
[2024-05-27 21:28:18] [INFO ] Flow matrix only has 48 transitions (discarded 1 similar events)
// Phase 1: matrix 48 rows 64 cols
[2024-05-27 21:28:18] [INFO ] Computed 25 invariants in 5 ms
[2024-05-27 21:28:18] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-27 21:28:18] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
[2024-05-27 21:28:18] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-27 21:28:18] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 2 ms to minimize.
[2024-05-27 21:28:18] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-27 21:28:18] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-27 21:28:18] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-27 21:28:18] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 3/31 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/64 variables, 1/32 constraints. Problems are: Problem set: 2 solved, 46 unsolved
[2024-05-27 21:28:19] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-27 21:28:19] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 2/34 constraints. Problems are: Problem set: 2 solved, 46 unsolved
[2024-05-27 21:28:19] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-27 21:28:19] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 2/36 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 48/112 variables, 64/100 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 8/108 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/112 variables, 0/108 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 12 (OVERLAPS) 0/112 variables, 0/108 constraints. Problems are: Problem set: 2 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/112 variables, and 108 constraints, problems are : Problem set: 2 solved, 46 unsolved in 1555 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 64/64 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 2 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 15/24 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 8/32 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 3/36 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 48/112 variables, 64/100 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 8/108 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 46/154 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/112 variables, 0/154 constraints. Problems are: Problem set: 2 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 0/112 variables, 0/154 constraints. Problems are: Problem set: 2 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/112 variables, and 154 constraints, problems are : Problem set: 2 solved, 46 unsolved in 1074 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 64/64 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 46/48 constraints, Known Traps: 11/11 constraints]
After SMT, in 2653ms problems are : Problem set: 2 solved, 46 unsolved
Search for dead transitions found 2 dead transitions in 2655ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 2 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 64/81 places, 47/65 transitions.
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 61 transition count 43
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 7 ms. Remains 61 /64 variables (removed 3) and now considering 43/47 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2706 ms. Remains : 61/81 places, 43/65 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
RANDOM walk for 40000 steps (32 resets) in 550 ms. (72 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
BEST_FIRST walk for 5728 steps (0 resets) in 19 ms. (286 steps per ms) remains 0/2 properties
Successfully simplified 72 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S02J04T10-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 21:28:21] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-27 21:28:21] [INFO ] Flatten gal took : 29 ms
[2024-05-27 21:28:21] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-COL-S02J04T10-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S02J04T10-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 21:28:21] [INFO ] Flatten gal took : 10 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-05-27 21:28:21] [INFO ] Unfolded HLPN to a Petri net with 752 places and 1572 transitions 7262 arcs in 37 ms.
[2024-05-27 21:28:21] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Support contains 595 out of 752 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Applied a total of 0 rules in 19 ms. Remains 752 /752 variables (removed 0) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2024-05-27 21:28:21] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2024-05-27 21:28:21] [INFO ] Computed 54 invariants in 55 ms
[2024-05-27 21:28:21] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-27 21:28:38] [INFO ] Deduced a trap composed of 65 places in 173 ms of which 3 ms to minimize.
[2024-05-27 21:28:38] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 3 ms to minimize.
[2024-05-27 21:28:38] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
[2024-05-27 21:28:38] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 1 ms to minimize.
[2024-05-27 21:28:38] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2024-05-27 21:28:38] [INFO ] Deduced a trap composed of 65 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:28:38] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2024-05-27 21:28:38] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2024-05-27 21:28:38] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 1 ms to minimize.
[2024-05-27 21:28:40] [INFO ] Deduced a trap composed of 373 places in 507 ms of which 19 ms to minimize.
[2024-05-27 21:28:40] [INFO ] Deduced a trap composed of 381 places in 336 ms of which 5 ms to minimize.
[2024-05-27 21:28:41] [INFO ] Deduced a trap composed of 237 places in 484 ms of which 4 ms to minimize.
[2024-05-27 21:28:42] [INFO ] Deduced a trap composed of 57 places in 179 ms of which 3 ms to minimize.
[2024-05-27 21:28:43] [INFO ] Deduced a trap composed of 407 places in 361 ms of which 5 ms to minimize.
[2024-05-27 21:28:43] [INFO ] Deduced a trap composed of 441 places in 334 ms of which 5 ms to minimize.
[2024-05-27 21:28:44] [INFO ] Deduced a trap composed of 432 places in 312 ms of which 4 ms to minimize.
SMT process timed out in 22544ms, After SMT, problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 22567ms
[2024-05-27 21:28:44] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 21:28:44] [INFO ] Invariant cache hit.
[2024-05-27 21:28:44] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-27 21:28:44] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 21:28:44] [INFO ] Invariant cache hit.
[2024-05-27 21:28:45] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-27 21:28:49] [INFO ] Implicit Places using invariants and state equation in 4712 ms returned []
Implicit Place search using SMT with State Equation took 4980 ms to find 0 implicit places.
Running 1410 sub problems to find dead transitions.
[2024-05-27 21:28:49] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 21:28:49] [INFO ] Invariant cache hit.
[2024-05-27 21:28:49] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-27 21:29:06] [INFO ] Deduced a trap composed of 65 places in 44 ms of which 1 ms to minimize.
[2024-05-27 21:29:11] [INFO ] Deduced a trap composed of 66 places in 146 ms of which 3 ms to minimize.
[2024-05-27 21:29:11] [INFO ] Deduced a trap composed of 65 places in 154 ms of which 2 ms to minimize.
[2024-05-27 21:29:12] [INFO ] Deduced a trap composed of 65 places in 169 ms of which 2 ms to minimize.
[2024-05-27 21:29:12] [INFO ] Deduced a trap composed of 66 places in 152 ms of which 2 ms to minimize.
[2024-05-27 21:29:12] [INFO ] Deduced a trap composed of 59 places in 174 ms of which 3 ms to minimize.
[2024-05-27 21:29:12] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 5 ms to minimize.
[2024-05-27 21:29:12] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2024-05-27 21:29:12] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 2 ms to minimize.
[2024-05-27 21:29:12] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-05-27 21:29:13] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2024-05-27 21:29:15] [INFO ] Deduced a trap composed of 432 places in 404 ms of which 6 ms to minimize.
[2024-05-27 21:29:15] [INFO ] Deduced a trap composed of 397 places in 371 ms of which 6 ms to minimize.
[2024-05-27 21:29:16] [INFO ] Deduced a trap composed of 369 places in 344 ms of which 8 ms to minimize.
[2024-05-27 21:29:16] [INFO ] Deduced a trap composed of 384 places in 381 ms of which 6 ms to minimize.
[2024-05-27 21:29:16] [INFO ] Deduced a trap composed of 424 places in 339 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 748/2144 variables, and 66 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1410/1410 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/748 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-27 21:29:23] [INFO ] Deduced a trap composed of 205 places in 275 ms of which 5 ms to minimize.
[2024-05-27 21:29:23] [INFO ] Deduced a trap composed of 246 places in 329 ms of which 5 ms to minimize.
[2024-05-27 21:29:24] [INFO ] Deduced a trap composed of 381 places in 333 ms of which 5 ms to minimize.
[2024-05-27 21:29:25] [INFO ] Deduced a trap composed of 451 places in 329 ms of which 4 ms to minimize.
[2024-05-27 21:29:25] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 3 ms to minimize.
[2024-05-27 21:29:33] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
[2024-05-27 21:29:35] [INFO ] Deduced a trap composed of 415 places in 394 ms of which 5 ms to minimize.
[2024-05-27 21:29:42] [INFO ] Deduced a trap composed of 402 places in 324 ms of which 5 ms to minimize.
[2024-05-27 21:29:44] [INFO ] Deduced a trap composed of 377 places in 311 ms of which 4 ms to minimize.
[2024-05-27 21:29:44] [INFO ] Deduced a trap composed of 402 places in 307 ms of which 4 ms to minimize.
[2024-05-27 21:29:45] [INFO ] Deduced a trap composed of 369 places in 298 ms of which 5 ms to minimize.
[2024-05-27 21:29:48] [INFO ] Deduced a trap composed of 524 places in 336 ms of which 11 ms to minimize.
[2024-05-27 21:29:48] [INFO ] Deduced a trap composed of 462 places in 308 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 748/2144 variables, and 79 constraints, problems are : Problem set: 0 solved, 1410 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/752 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1410 constraints, Known Traps: 29/29 constraints]
After SMT, in 62201ms problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 62219ms
Finished structural reductions in LTL mode , in 1 iterations and 89798 ms. Remains : 752/752 places, 1412/1412 transitions.
Support contains 595 out of 752 places after structural reductions.
[2024-05-27 21:29:51] [INFO ] Flatten gal took : 208 ms
[2024-05-27 21:29:51] [INFO ] Flatten gal took : 140 ms
[2024-05-27 21:29:52] [INFO ] Input system was already deterministic with 1412 transitions.
RANDOM walk for 40000 steps (12 resets) in 1494 ms. (26 steps per ms) remains 54/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 68 ms. (58 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 75 ms. (52 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (8 resets) in 49 ms. (80 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 66 ms. (59 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 90 ms. (43 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 60 ms. (65 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 76 ms. (51 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 69 ms. (57 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 68 ms. (58 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 62 ms. (63 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 71 ms. (55 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 68 ms. (58 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 57 ms. (68 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (8 resets) in 96 ms. (41 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 54/54 properties
[2024-05-27 21:29:53] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
[2024-05-27 21:29:53] [INFO ] Invariant cache hit.
[2024-05-27 21:29:53] [INFO ] State equation strengthened by 120 read => feed constraints.
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp44 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 19/21 constraints. Problems are: Problem set: 3 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/473 variables, 0/21 constraints. Problems are: Problem set: 3 solved, 51 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
At refinement iteration 3 (OVERLAPS) 174/647 variables, 13/34 constraints. Problems are: Problem set: 19 solved, 35 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp55 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/647 variables, 5/39 constraints. Problems are: Problem set: 24 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/647 variables, 0/39 constraints. Problems are: Problem set: 24 solved, 30 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
At refinement iteration 6 (OVERLAPS) 105/752 variables, 15/54 constraints. Problems are: Problem set: 50 solved, 4 unsolved
[2024-05-27 21:29:56] [INFO ] Deduced a trap composed of 216 places in 566 ms of which 9 ms to minimize.
[2024-05-27 21:29:56] [INFO ] Deduced a trap composed of 286 places in 643 ms of which 5 ms to minimize.
[2024-05-27 21:29:57] [INFO ] Deduced a trap composed of 67 places in 201 ms of which 4 ms to minimize.
[2024-05-27 21:29:57] [INFO ] Deduced a trap composed of 66 places in 342 ms of which 5 ms to minimize.
[2024-05-27 21:29:57] [INFO ] Deduced a trap composed of 66 places in 292 ms of which 18 ms to minimize.
[2024-05-27 21:29:57] [INFO ] Deduced a trap composed of 65 places in 255 ms of which 5 ms to minimize.
[2024-05-27 21:29:58] [INFO ] Deduced a trap composed of 65 places in 252 ms of which 31 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/752 variables, 7/61 constraints. Problems are: Problem set: 50 solved, 4 unsolved
[2024-05-27 21:29:58] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 1 ms to minimize.
[2024-05-27 21:29:58] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2024-05-27 21:29:58] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2024-05-27 21:29:58] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2024-05-27 21:29:58] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/752 variables, 5/66 constraints. Problems are: Problem set: 50 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/752 variables, 0/66 constraints. Problems are: Problem set: 50 solved, 4 unsolved
SMT process timed out in 5154ms, After SMT, problems are : Problem set: 50 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 106 out of 752 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 750 transition count 1372
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 82 place count 710 transition count 1372
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 82 place count 710 transition count 1292
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 242 place count 630 transition count 1292
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 2 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 362 place count 570 transition count 1232
Free-agglomeration rule (complex) applied 30 times.
Iterating global reduction 2 with 30 rules applied. Total rules applied 392 place count 570 transition count 1202
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 422 place count 540 transition count 1202
Applied a total of 422 rules in 258 ms. Remains 540 /752 variables (removed 212) and now considering 1202/1412 (removed 210) transitions.
Running 1200 sub problems to find dead transitions.
[2024-05-27 21:29:59] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
// Phase 1: matrix 1182 rows 540 cols
[2024-05-27 21:29:59] [INFO ] Computed 52 invariants in 58 ms
[2024-05-27 21:29:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-27 21:30:12] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 2 ms to minimize.
[2024-05-27 21:30:12] [INFO ] Deduced a trap composed of 48 places in 156 ms of which 2 ms to minimize.
[2024-05-27 21:30:12] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:30:12] [INFO ] Deduced a trap composed of 44 places in 28 ms of which 1 ms to minimize.
[2024-05-27 21:30:12] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 2 ms to minimize.
[2024-05-27 21:30:12] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-27 21:30:12] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2024-05-27 21:30:12] [INFO ] Deduced a trap composed of 44 places in 33 ms of which 0 ms to minimize.
[2024-05-27 21:30:13] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 0 ms to minimize.
[2024-05-27 21:30:13] [INFO ] Deduced a trap composed of 44 places in 36 ms of which 1 ms to minimize.
[2024-05-27 21:30:13] [INFO ] Deduced a trap composed of 44 places in 34 ms of which 1 ms to minimize.
[2024-05-27 21:30:13] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 2 ms to minimize.
[2024-05-27 21:30:16] [INFO ] Deduced a trap composed of 217 places in 244 ms of which 3 ms to minimize.
[2024-05-27 21:30:16] [INFO ] Deduced a trap composed of 218 places in 249 ms of which 3 ms to minimize.
[2024-05-27 21:30:17] [INFO ] Deduced a trap composed of 232 places in 286 ms of which 3 ms to minimize.
[2024-05-27 21:30:17] [INFO ] Deduced a trap composed of 46 places in 256 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 5.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 9.0)
(s183 1.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 (/ 2.0 3.0))
(s194 1.0)
(s195 0.0)
(s196 (/ 1.0 3.0))
(s197 0.0)
(s198 (/ 1.0 3.0))
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 (/ 2.0 3.0))
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/1722 variables, and 66 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/540 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/538 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-05-27 21:30:25] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
[2024-05-27 21:30:38] [INFO ] Deduced a trap composed of 206 places in 207 ms of which 3 ms to minimize.
[2024-05-27 21:30:38] [INFO ] Deduced a trap composed of 302 places in 221 ms of which 3 ms to minimize.
[2024-05-27 21:30:39] [INFO ] Deduced a trap composed of 292 places in 217 ms of which 3 ms to minimize.
[2024-05-27 21:30:39] [INFO ] Deduced a trap composed of 326 places in 246 ms of which 3 ms to minimize.
[2024-05-27 21:30:39] [INFO ] Deduced a trap composed of 330 places in 232 ms of which 3 ms to minimize.
[2024-05-27 21:30:40] [INFO ] Deduced a trap composed of 270 places in 218 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/1722 variables, and 73 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/540 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 23/23 constraints]
After SMT, in 43070ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 43087ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43349 ms. Remains : 540/752 places, 1202/1412 transitions.
RANDOM walk for 40001 steps (13 resets) in 759 ms. (52 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (8 resets) in 342 ms. (116 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (11 resets) in 238 ms. (167 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 344 ms. (115 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 286 ms. (139 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 108147 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 4
Probabilistic random walk after 108147 steps, saw 60951 distinct states, run finished after 3006 ms. (steps per millisecond=35 ) properties seen :0
[2024-05-27 21:30:46] [INFO ] Flow matrix only has 1182 transitions (discarded 20 similar events)
[2024-05-27 21:30:46] [INFO ] Invariant cache hit.
[2024-05-27 21:30:46] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 214/320 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 23/343 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 193/536 variables, 36/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/538 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2/540 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1182/1722 variables, 540/592 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1722 variables, 120/712 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1722 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1722 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1722/1722 variables, and 712 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1677 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 540/540 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 214/320 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 23/343 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 5 (OVERLAPS) 193/536 variables, 36/48 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-27 21:30:48] [INFO ] Deduced a trap composed of 44 places in 244 ms of which 4 ms to minimize.
[2024-05-27 21:30:48] [INFO ] Deduced a trap composed of 246 places in 232 ms of which 3 ms to minimize.
[2024-05-27 21:30:48] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 2 ms to minimize.
[2024-05-27 21:30:48] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 2 ms to minimize.
[2024-05-27 21:30:48] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 1 ms to minimize.
[2024-05-27 21:30:48] [INFO ] Deduced a trap composed of 44 places in 67 ms of which 1 ms to minimize.
[2024-05-27 21:30:49] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-05-27 21:30:49] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/536 variables, 8/56 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/536 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/538 variables, 2/58 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 0/58 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/540 variables, 2/60 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1182/1722 variables, 540/600 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1722 variables, 120/720 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1722 variables, 3/723 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-27 21:30:53] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1722 variables, 1/724 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1722/1722 variables, and 724 constraints, problems are : Problem set: 1 solved, 3 unsolved in 45006 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 540/540 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 46724ms problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 74 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 1202/1202 transitions.
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 540 transition count 1192
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 20 place count 530 transition count 1192
Applied a total of 20 rules in 118 ms. Remains 530 /540 variables (removed 10) and now considering 1192/1202 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 530/540 places, 1192/1202 transitions.
Successfully simplified 51 atomic propositions for a total of 11 simplifications.
[2024-05-27 21:31:33] [INFO ] Flatten gal took : 97 ms
[2024-05-27 21:31:33] [INFO ] Flatten gal took : 97 ms
[2024-05-27 21:31:33] [INFO ] Input system was already deterministic with 1412 transitions.
Support contains 206 out of 752 places (down from 297) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 128 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-27 21:31:33] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-05-27 21:31:33] [INFO ] Computed 52 invariants in 82 ms
[2024-05-27 21:31:33] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 21:31:49] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 1 ms to minimize.
[2024-05-27 21:31:49] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 1 ms to minimize.
[2024-05-27 21:31:49] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2024-05-27 21:31:50] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-05-27 21:31:50] [INFO ] Deduced a trap composed of 63 places in 68 ms of which 0 ms to minimize.
[2024-05-27 21:31:50] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-05-27 21:31:50] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 0 ms to minimize.
[2024-05-27 21:31:50] [INFO ] Deduced a trap composed of 63 places in 45 ms of which 0 ms to minimize.
[2024-05-27 21:31:50] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2024-05-27 21:31:50] [INFO ] Deduced a trap composed of 404 places in 273 ms of which 3 ms to minimize.
[2024-05-27 21:31:51] [INFO ] Deduced a trap composed of 209 places in 245 ms of which 4 ms to minimize.
[2024-05-27 21:31:52] [INFO ] Deduced a trap composed of 75 places in 148 ms of which 2 ms to minimize.
[2024-05-27 21:31:52] [INFO ] Deduced a trap composed of 440 places in 274 ms of which 4 ms to minimize.
[2024-05-27 21:31:53] [INFO ] Deduced a trap composed of 432 places in 285 ms of which 4 ms to minimize.
[2024-05-27 21:31:53] [INFO ] Deduced a trap composed of 393 places in 310 ms of which 4 ms to minimize.
[2024-05-27 21:31:53] [INFO ] Deduced a trap composed of 411 places in 295 ms of which 4 ms to minimize.
[2024-05-27 21:31:54] [INFO ] Deduced a trap composed of 392 places in 323 ms of which 4 ms to minimize.
[2024-05-27 21:31:54] [INFO ] Deduced a trap composed of 370 places in 303 ms of which 4 ms to minimize.
[2024-05-27 21:31:54] [INFO ] Deduced a trap composed of 404 places in 309 ms of which 4 ms to minimize.
[2024-05-27 21:31:55] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 70 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 21:31:58] [INFO ] Deduced a trap composed of 360 places in 300 ms of which 4 ms to minimize.
[2024-05-27 21:32:06] [INFO ] Deduced a trap composed of 491 places in 273 ms of which 9 ms to minimize.
[2024-05-27 21:32:07] [INFO ] Deduced a trap composed of 493 places in 276 ms of which 4 ms to minimize.
[2024-05-27 21:32:07] [INFO ] Deduced a trap composed of 389 places in 341 ms of which 4 ms to minimize.
[2024-05-27 21:32:07] [INFO ] Deduced a trap composed of 381 places in 288 ms of which 4 ms to minimize.
[2024-05-27 21:32:08] [INFO ] Deduced a trap composed of 379 places in 281 ms of which 4 ms to minimize.
[2024-05-27 21:32:08] [INFO ] Deduced a trap composed of 448 places in 292 ms of which 4 ms to minimize.
[2024-05-27 21:32:08] [INFO ] Deduced a trap composed of 357 places in 336 ms of which 4 ms to minimize.
[2024-05-27 21:32:11] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 2 ms to minimize.
[2024-05-27 21:32:11] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 80 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 30/30 constraints]
After SMT, in 42478ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42500ms
Finished structural reductions in LTL mode , in 1 iterations and 42635 ms. Remains : 730/752 places, 1392/1412 transitions.
[2024-05-27 21:32:16] [INFO ] Flatten gal took : 51 ms
[2024-05-27 21:32:16] [INFO ] Flatten gal took : 51 ms
[2024-05-27 21:32:16] [INFO ] Input system was already deterministic with 1392 transitions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 56 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-27 21:32:16] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-27 21:32:16] [INFO ] Invariant cache hit.
[2024-05-27 21:32:16] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 21:32:33] [INFO ] Deduced a trap composed of 63 places in 42 ms of which 1 ms to minimize.
[2024-05-27 21:32:35] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 0 ms to minimize.
[2024-05-27 21:32:35] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 0 ms to minimize.
[2024-05-27 21:32:35] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 1 ms to minimize.
[2024-05-27 21:32:35] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 0 ms to minimize.
[2024-05-27 21:32:35] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 1 ms to minimize.
[2024-05-27 21:32:36] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2024-05-27 21:32:36] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 0 ms to minimize.
[2024-05-27 21:32:36] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 59 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 21:32:41] [INFO ] Deduced a trap composed of 203 places in 349 ms of which 5 ms to minimize.
[2024-05-27 21:32:41] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 2 ms to minimize.
[2024-05-27 21:32:42] [INFO ] Deduced a trap composed of 367 places in 409 ms of which 6 ms to minimize.
[2024-05-27 21:32:50] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 2 ms to minimize.
[2024-05-27 21:32:51] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 3 ms to minimize.
[2024-05-27 21:32:51] [INFO ] Deduced a trap composed of 491 places in 265 ms of which 4 ms to minimize.
[2024-05-27 21:32:52] [INFO ] Deduced a trap composed of 491 places in 363 ms of which 5 ms to minimize.
[2024-05-27 21:32:52] [INFO ] Deduced a trap composed of 491 places in 256 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 67 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 17/17 constraints]
After SMT, in 42306ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42330ms
Finished structural reductions in LTL mode , in 1 iterations and 42389 ms. Remains : 730/752 places, 1392/1412 transitions.
[2024-05-27 21:32:58] [INFO ] Flatten gal took : 52 ms
[2024-05-27 21:32:58] [INFO ] Flatten gal took : 54 ms
[2024-05-27 21:32:58] [INFO ] Input system was already deterministic with 1392 transitions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 31 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-27 21:32:58] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-27 21:32:58] [INFO ] Invariant cache hit.
[2024-05-27 21:32:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 21:33:16] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
[2024-05-27 21:33:19] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 1 ms to minimize.
[2024-05-27 21:33:19] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
[2024-05-27 21:33:19] [INFO ] Deduced a trap composed of 63 places in 40 ms of which 1 ms to minimize.
[2024-05-27 21:33:19] [INFO ] Deduced a trap composed of 63 places in 41 ms of which 2 ms to minimize.
[2024-05-27 21:33:19] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 2 ms to minimize.
[2024-05-27 21:33:19] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 10 ms to minimize.
[2024-05-27 21:33:19] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-27 21:33:19] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 0 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 59 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 21:33:23] [INFO ] Deduced a trap composed of 203 places in 350 ms of which 4 ms to minimize.
[2024-05-27 21:33:23] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 1 ms to minimize.
[2024-05-27 21:33:24] [INFO ] Deduced a trap composed of 367 places in 347 ms of which 5 ms to minimize.
[2024-05-27 21:33:32] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 3 ms to minimize.
[2024-05-27 21:33:33] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 4 ms to minimize.
[2024-05-27 21:33:33] [INFO ] Deduced a trap composed of 491 places in 364 ms of which 5 ms to minimize.
[2024-05-27 21:33:34] [INFO ] Deduced a trap composed of 491 places in 336 ms of which 6 ms to minimize.
[2024-05-27 21:33:34] [INFO ] Deduced a trap composed of 491 places in 311 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 67 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 17/17 constraints]
After SMT, in 42243ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42262ms
Finished structural reductions in LTL mode , in 1 iterations and 42297 ms. Remains : 730/752 places, 1392/1412 transitions.
[2024-05-27 21:33:41] [INFO ] Flatten gal took : 45 ms
[2024-05-27 21:33:41] [INFO ] Flatten gal took : 45 ms
[2024-05-27 21:33:41] [INFO ] Input system was already deterministic with 1392 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 750 transition count 1332
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 670 transition count 1332
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 160 place count 670 transition count 1302
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 220 place count 640 transition count 1302
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 380 place count 560 transition count 1222
Applied a total of 380 rules in 72 ms. Remains 560 /752 variables (removed 192) and now considering 1222/1412 (removed 190) transitions.
Running 1220 sub problems to find dead transitions.
[2024-05-27 21:33:41] [INFO ] Flow matrix only has 1202 transitions (discarded 20 similar events)
// Phase 1: matrix 1202 rows 560 cols
[2024-05-27 21:33:41] [INFO ] Computed 52 invariants in 15 ms
[2024-05-27 21:33:41] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/558 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/558 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
[2024-05-27 21:33:53] [INFO ] Deduced a trap composed of 46 places in 176 ms of which 3 ms to minimize.
[2024-05-27 21:33:53] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 2 ms to minimize.
[2024-05-27 21:33:53] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 1 ms to minimize.
[2024-05-27 21:33:54] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 2 ms to minimize.
[2024-05-27 21:33:54] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 1 ms to minimize.
[2024-05-27 21:33:54] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-27 21:33:54] [INFO ] Deduced a trap composed of 46 places in 36 ms of which 1 ms to minimize.
[2024-05-27 21:33:54] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-05-27 21:33:54] [INFO ] Deduced a trap composed of 46 places in 34 ms of which 1 ms to minimize.
[2024-05-27 21:33:54] [INFO ] Deduced a trap composed of 259 places in 220 ms of which 3 ms to minimize.
[2024-05-27 21:33:54] [INFO ] Deduced a trap composed of 272 places in 231 ms of which 3 ms to minimize.
[2024-05-27 21:33:55] [INFO ] Deduced a trap composed of 248 places in 261 ms of which 4 ms to minimize.
[2024-05-27 21:33:55] [INFO ] Deduced a trap composed of 276 places in 250 ms of which 3 ms to minimize.
[2024-05-27 21:33:55] [INFO ] Deduced a trap composed of 281 places in 232 ms of which 3 ms to minimize.
[2024-05-27 21:33:55] [INFO ] Deduced a trap composed of 296 places in 233 ms of which 3 ms to minimize.
[2024-05-27 21:33:56] [INFO ] Deduced a trap composed of 222 places in 269 ms of which 3 ms to minimize.
[2024-05-27 21:33:56] [INFO ] Deduced a trap composed of 265 places in 252 ms of which 4 ms to minimize.
[2024-05-27 21:33:56] [INFO ] Deduced a trap composed of 259 places in 235 ms of which 4 ms to minimize.
[2024-05-27 21:33:57] [INFO ] Deduced a trap composed of 251 places in 216 ms of which 3 ms to minimize.
[2024-05-27 21:33:58] [INFO ] Deduced a trap composed of 46 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/558 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
[2024-05-27 21:33:58] [INFO ] Deduced a trap composed of 54 places in 158 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 558/1762 variables, and 71 constraints, problems are : Problem set: 0 solved, 1220 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/560 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1220/1220 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/558 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/558 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/558 variables, 21/71 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
[2024-05-27 21:34:11] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 2 ms to minimize.
[2024-05-27 21:34:11] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-27 21:34:21] [INFO ] Deduced a trap composed of 244 places in 215 ms of which 3 ms to minimize.
[2024-05-27 21:34:21] [INFO ] Deduced a trap composed of 245 places in 274 ms of which 5 ms to minimize.
[2024-05-27 21:34:21] [INFO ] Deduced a trap composed of 226 places in 225 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 558/1762 variables, and 76 constraints, problems are : Problem set: 0 solved, 1220 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/560 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1220 constraints, Known Traps: 26/26 constraints]
After SMT, in 42013ms problems are : Problem set: 0 solved, 1220 unsolved
Search for dead transitions found 0 dead transitions in 42025ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 42099 ms. Remains : 560/752 places, 1222/1412 transitions.
[2024-05-27 21:34:23] [INFO ] Flatten gal took : 73 ms
[2024-05-27 21:34:23] [INFO ] Flatten gal took : 65 ms
[2024-05-27 21:34:23] [INFO ] Input system was already deterministic with 1222 transitions.
RANDOM walk for 111 steps (0 resets) in 5 ms. (18 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S02J04T10-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 44 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-27 21:34:23] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-05-27 21:34:23] [INFO ] Computed 52 invariants in 29 ms
[2024-05-27 21:34:23] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 21:34:39] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 2 ms to minimize.
[2024-05-27 21:34:40] [INFO ] Deduced a trap composed of 63 places in 111 ms of which 2 ms to minimize.
[2024-05-27 21:34:40] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 2 ms to minimize.
[2024-05-27 21:34:40] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 1 ms to minimize.
[2024-05-27 21:34:40] [INFO ] Deduced a trap composed of 63 places in 48 ms of which 0 ms to minimize.
[2024-05-27 21:34:40] [INFO ] Deduced a trap composed of 63 places in 49 ms of which 1 ms to minimize.
[2024-05-27 21:34:40] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-27 21:34:40] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 1 ms to minimize.
[2024-05-27 21:34:40] [INFO ] Deduced a trap composed of 63 places in 37 ms of which 1 ms to minimize.
[2024-05-27 21:34:41] [INFO ] Deduced a trap composed of 404 places in 378 ms of which 5 ms to minimize.
[2024-05-27 21:34:41] [INFO ] Deduced a trap composed of 209 places in 356 ms of which 5 ms to minimize.
[2024-05-27 21:34:42] [INFO ] Deduced a trap composed of 75 places in 190 ms of which 6 ms to minimize.
[2024-05-27 21:34:43] [INFO ] Deduced a trap composed of 440 places in 383 ms of which 6 ms to minimize.
[2024-05-27 21:34:44] [INFO ] Deduced a trap composed of 432 places in 340 ms of which 5 ms to minimize.
[2024-05-27 21:34:44] [INFO ] Deduced a trap composed of 393 places in 308 ms of which 4 ms to minimize.
[2024-05-27 21:34:44] [INFO ] Deduced a trap composed of 411 places in 321 ms of which 5 ms to minimize.
[2024-05-27 21:34:45] [INFO ] Deduced a trap composed of 392 places in 272 ms of which 4 ms to minimize.
[2024-05-27 21:34:45] [INFO ] Deduced a trap composed of 370 places in 268 ms of which 4 ms to minimize.
[2024-05-27 21:34:45] [INFO ] Deduced a trap composed of 404 places in 277 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 69 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 19/69 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 21:34:47] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-05-27 21:34:49] [INFO ] Deduced a trap composed of 324 places in 312 ms of which 4 ms to minimize.
[2024-05-27 21:34:50] [INFO ] Deduced a trap composed of 49 places in 303 ms of which 5 ms to minimize.
[2024-05-27 21:34:50] [INFO ] Deduced a trap composed of 383 places in 322 ms of which 4 ms to minimize.
[2024-05-27 21:34:50] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 3 ms to minimize.
[2024-05-27 21:34:58] [INFO ] Deduced a trap composed of 507 places in 266 ms of which 4 ms to minimize.
[2024-05-27 21:34:58] [INFO ] Deduced a trap composed of 491 places in 270 ms of which 4 ms to minimize.
[2024-05-27 21:34:59] [INFO ] Deduced a trap composed of 491 places in 253 ms of which 4 ms to minimize.
[2024-05-27 21:34:59] [INFO ] Deduced a trap composed of 514 places in 260 ms of which 4 ms to minimize.
[2024-05-27 21:34:59] [INFO ] Deduced a trap composed of 491 places in 263 ms of which 4 ms to minimize.
[2024-05-27 21:34:59] [INFO ] Deduced a trap composed of 502 places in 267 ms of which 4 ms to minimize.
[2024-05-27 21:35:02] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 81 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 31/31 constraints]
After SMT, in 42758ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42779ms
Finished structural reductions in LTL mode , in 1 iterations and 42828 ms. Remains : 730/752 places, 1392/1412 transitions.
[2024-05-27 21:35:06] [INFO ] Flatten gal took : 39 ms
[2024-05-27 21:35:06] [INFO ] Flatten gal took : 42 ms
[2024-05-27 21:35:06] [INFO ] Input system was already deterministic with 1392 transitions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 25 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-27 21:35:06] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-27 21:35:06] [INFO ] Invariant cache hit.
[2024-05-27 21:35:06] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 21:35:25] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
[2024-05-27 21:35:27] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 2 ms to minimize.
[2024-05-27 21:35:27] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2024-05-27 21:35:27] [INFO ] Deduced a trap composed of 63 places in 53 ms of which 1 ms to minimize.
[2024-05-27 21:35:27] [INFO ] Deduced a trap composed of 63 places in 51 ms of which 1 ms to minimize.
[2024-05-27 21:35:27] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 2 ms to minimize.
[2024-05-27 21:35:28] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 1 ms to minimize.
[2024-05-27 21:35:28] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 0 ms to minimize.
[2024-05-27 21:35:28] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 59 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 21:35:30] [INFO ] Deduced a trap composed of 203 places in 336 ms of which 5 ms to minimize.
[2024-05-27 21:35:31] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 2 ms to minimize.
[2024-05-27 21:35:31] [INFO ] Deduced a trap composed of 367 places in 295 ms of which 5 ms to minimize.
[2024-05-27 21:35:40] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 3 ms to minimize.
[2024-05-27 21:35:41] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 4 ms to minimize.
[2024-05-27 21:35:42] [INFO ] Deduced a trap composed of 491 places in 370 ms of which 6 ms to minimize.
[2024-05-27 21:35:42] [INFO ] Deduced a trap composed of 491 places in 317 ms of which 5 ms to minimize.
[2024-05-27 21:35:42] [INFO ] Deduced a trap composed of 491 places in 349 ms of which 5 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 67 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 17/17 constraints]
After SMT, in 41985ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 41999ms
Finished structural reductions in LTL mode , in 1 iterations and 42027 ms. Remains : 730/752 places, 1392/1412 transitions.
[2024-05-27 21:35:48] [INFO ] Flatten gal took : 56 ms
[2024-05-27 21:35:49] [INFO ] Flatten gal took : 47 ms
[2024-05-27 21:35:49] [INFO ] Input system was already deterministic with 1392 transitions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 24 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-27 21:35:49] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-27 21:35:49] [INFO ] Invariant cache hit.
[2024-05-27 21:35:49] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 21:36:07] [INFO ] Deduced a trap composed of 63 places in 54 ms of which 1 ms to minimize.
[2024-05-27 21:36:09] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 1 ms to minimize.
[2024-05-27 21:36:09] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 1 ms to minimize.
[2024-05-27 21:36:09] [INFO ] Deduced a trap composed of 63 places in 56 ms of which 1 ms to minimize.
[2024-05-27 21:36:09] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 1 ms to minimize.
[2024-05-27 21:36:09] [INFO ] Deduced a trap composed of 63 places in 122 ms of which 2 ms to minimize.
[2024-05-27 21:36:10] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 2 ms to minimize.
[2024-05-27 21:36:10] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 1 ms to minimize.
[2024-05-27 21:36:10] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 59 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 21:36:13] [INFO ] Deduced a trap composed of 203 places in 321 ms of which 4 ms to minimize.
[2024-05-27 21:36:13] [INFO ] Deduced a trap composed of 63 places in 43 ms of which 1 ms to minimize.
[2024-05-27 21:36:14] [INFO ] Deduced a trap composed of 367 places in 411 ms of which 6 ms to minimize.
[2024-05-27 21:36:24] [INFO ] Deduced a trap composed of 45 places in 148 ms of which 3 ms to minimize.
[2024-05-27 21:36:24] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 3 ms to minimize.
[2024-05-27 21:36:25] [INFO ] Deduced a trap composed of 491 places in 367 ms of which 5 ms to minimize.
[2024-05-27 21:36:25] [INFO ] Deduced a trap composed of 491 places in 389 ms of which 7 ms to minimize.
[2024-05-27 21:36:26] [INFO ] Deduced a trap composed of 491 places in 335 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 67 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 17/17 constraints]
After SMT, in 42196ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 42210ms
Finished structural reductions in LTL mode , in 1 iterations and 42237 ms. Remains : 730/752 places, 1392/1412 transitions.
[2024-05-27 21:36:31] [INFO ] Flatten gal took : 68 ms
[2024-05-27 21:36:31] [INFO ] Flatten gal took : 56 ms
[2024-05-27 21:36:31] [INFO ] Input system was already deterministic with 1392 transitions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 32 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-27 21:36:31] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
[2024-05-27 21:36:31] [INFO ] Invariant cache hit.
[2024-05-27 21:36:31] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 21:36:50] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2024-05-27 21:36:53] [INFO ] Deduced a trap composed of 63 places in 59 ms of which 2 ms to minimize.
[2024-05-27 21:36:53] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-05-27 21:36:53] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
[2024-05-27 21:36:53] [INFO ] Deduced a trap composed of 63 places in 50 ms of which 1 ms to minimize.
[2024-05-27 21:36:53] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 2 ms to minimize.
SMT process timed out in 22123ms, After SMT, problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 22139ms
Finished structural reductions in LTL mode , in 1 iterations and 22175 ms. Remains : 730/752 places, 1392/1412 transitions.
[2024-05-27 21:36:53] [INFO ] Flatten gal took : 53 ms
[2024-05-27 21:36:53] [INFO ] Flatten gal took : 57 ms
[2024-05-27 21:36:54] [INFO ] Input system was already deterministic with 1392 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 750 transition count 1332
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 670 transition count 1332
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 160 place count 670 transition count 1252
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 320 place count 590 transition count 1252
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 460 place count 520 transition count 1182
Applied a total of 460 rules in 57 ms. Remains 520 /752 variables (removed 232) and now considering 1182/1412 (removed 230) transitions.
Running 1180 sub problems to find dead transitions.
[2024-05-27 21:36:54] [INFO ] Flow matrix only has 1162 transitions (discarded 20 similar events)
// Phase 1: matrix 1162 rows 520 cols
[2024-05-27 21:36:54] [INFO ] Computed 52 invariants in 34 ms
[2024-05-27 21:36:54] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-05-27 21:37:05] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 3 ms to minimize.
[2024-05-27 21:37:05] [INFO ] Deduced a trap composed of 43 places in 260 ms of which 2 ms to minimize.
[2024-05-27 21:37:05] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 1 ms to minimize.
[2024-05-27 21:37:05] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 1 ms to minimize.
[2024-05-27 21:37:05] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-05-27 21:37:05] [INFO ] Deduced a trap composed of 42 places in 61 ms of which 1 ms to minimize.
[2024-05-27 21:37:05] [INFO ] Deduced a trap composed of 42 places in 46 ms of which 1 ms to minimize.
[2024-05-27 21:37:05] [INFO ] Deduced a trap composed of 42 places in 28 ms of which 0 ms to minimize.
[2024-05-27 21:37:05] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-05-27 21:37:06] [INFO ] Deduced a trap composed of 214 places in 216 ms of which 3 ms to minimize.
[2024-05-27 21:37:06] [INFO ] Deduced a trap composed of 235 places in 224 ms of which 3 ms to minimize.
[2024-05-27 21:37:06] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 3 ms to minimize.
[2024-05-27 21:37:06] [INFO ] Deduced a trap composed of 216 places in 221 ms of which 3 ms to minimize.
[2024-05-27 21:37:07] [INFO ] Deduced a trap composed of 213 places in 195 ms of which 3 ms to minimize.
[2024-05-27 21:37:07] [INFO ] Deduced a trap composed of 181 places in 295 ms of which 3 ms to minimize.
[2024-05-27 21:37:07] [INFO ] Deduced a trap composed of 210 places in 226 ms of which 3 ms to minimize.
[2024-05-27 21:37:07] [INFO ] Deduced a trap composed of 219 places in 262 ms of which 3 ms to minimize.
[2024-05-27 21:37:08] [INFO ] Deduced a trap composed of 208 places in 259 ms of which 4 ms to minimize.
[2024-05-27 21:37:08] [INFO ] Deduced a trap composed of 214 places in 307 ms of which 4 ms to minimize.
[2024-05-27 21:37:08] [INFO ] Deduced a trap composed of 208 places in 262 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-05-27 21:37:09] [INFO ] Deduced a trap composed of 42 places in 28 ms of which 1 ms to minimize.
[2024-05-27 21:37:10] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 518/1682 variables, and 72 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1180/1180 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/518 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/518 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 22/72 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
[2024-05-27 21:37:22] [INFO ] Deduced a trap composed of 315 places in 257 ms of which 3 ms to minimize.
[2024-05-27 21:37:23] [INFO ] Deduced a trap composed of 326 places in 349 ms of which 6 ms to minimize.
[2024-05-27 21:37:27] [INFO ] Deduced a trap composed of 229 places in 319 ms of which 5 ms to minimize.
[2024-05-27 21:37:28] [INFO ] Deduced a trap composed of 237 places in 274 ms of which 3 ms to minimize.
[2024-05-27 21:37:28] [INFO ] Deduced a trap composed of 222 places in 314 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 5/77 constraints. Problems are: Problem set: 0 solved, 1180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/1682 variables, and 77 constraints, problems are : Problem set: 0 solved, 1180 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/14 constraints, Generalized P Invariants (flows): 37/38 constraints, State Equation: 0/520 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1180 constraints, Known Traps: 27/27 constraints]
After SMT, in 42295ms problems are : Problem set: 0 solved, 1180 unsolved
Search for dead transitions found 0 dead transitions in 42308ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 42368 ms. Remains : 520/752 places, 1182/1412 transitions.
[2024-05-27 21:37:36] [INFO ] Flatten gal took : 56 ms
[2024-05-27 21:37:36] [INFO ] Flatten gal took : 52 ms
[2024-05-27 21:37:36] [INFO ] Input system was already deterministic with 1182 transitions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Applied a total of 2 rules in 12 ms. Remains 750 /752 variables (removed 2) and now considering 1412/1412 (removed 0) transitions.
Running 1410 sub problems to find dead transitions.
[2024-05-27 21:37:36] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 750 cols
[2024-05-27 21:37:36] [INFO ] Computed 52 invariants in 25 ms
[2024-05-27 21:37:36] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/748 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/748 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1410 unsolved
[2024-05-27 21:37:58] [INFO ] Deduced a trap composed of 66 places in 181 ms of which 4 ms to minimize.
[2024-05-27 21:37:59] [INFO ] Deduced a trap composed of 65 places in 133 ms of which 2 ms to minimize.
[2024-05-27 21:37:59] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 3 ms to minimize.
SMT process timed out in 22490ms, After SMT, problems are : Problem set: 0 solved, 1410 unsolved
Search for dead transitions found 0 dead transitions in 22510ms
Finished structural reductions in LTL mode , in 1 iterations and 22526 ms. Remains : 750/752 places, 1412/1412 transitions.
[2024-05-27 21:37:59] [INFO ] Flatten gal took : 42 ms
[2024-05-27 21:37:59] [INFO ] Flatten gal took : 45 ms
[2024-05-27 21:37:59] [INFO ] Input system was already deterministic with 1412 transitions.
Starting structural reductions in LTL mode, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 750 transition count 1412
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 740 transition count 1402
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 740 transition count 1402
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 32 place count 730 transition count 1392
Iterating global reduction 1 with 10 rules applied. Total rules applied 42 place count 730 transition count 1392
Applied a total of 42 rules in 29 ms. Remains 730 /752 variables (removed 22) and now considering 1392/1412 (removed 20) transitions.
Running 1390 sub problems to find dead transitions.
[2024-05-27 21:37:59] [INFO ] Flow matrix only has 1372 transitions (discarded 20 similar events)
// Phase 1: matrix 1372 rows 730 cols
[2024-05-27 21:37:59] [INFO ] Computed 52 invariants in 44 ms
[2024-05-27 21:37:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 21:38:14] [INFO ] Deduced a trap composed of 63 places in 131 ms of which 2 ms to minimize.
[2024-05-27 21:38:15] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 2 ms to minimize.
[2024-05-27 21:38:15] [INFO ] Deduced a trap composed of 64 places in 92 ms of which 1 ms to minimize.
[2024-05-27 21:38:15] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 2 ms to minimize.
[2024-05-27 21:38:15] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
[2024-05-27 21:38:15] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2024-05-27 21:38:15] [INFO ] Deduced a trap composed of 64 places in 139 ms of which 1 ms to minimize.
[2024-05-27 21:38:15] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 1 ms to minimize.
[2024-05-27 21:38:15] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 2 ms to minimize.
[2024-05-27 21:38:16] [INFO ] Deduced a trap composed of 404 places in 396 ms of which 5 ms to minimize.
[2024-05-27 21:38:17] [INFO ] Deduced a trap composed of 209 places in 383 ms of which 5 ms to minimize.
[2024-05-27 21:38:18] [INFO ] Deduced a trap composed of 75 places in 186 ms of which 2 ms to minimize.
[2024-05-27 21:38:19] [INFO ] Deduced a trap composed of 440 places in 419 ms of which 5 ms to minimize.
[2024-05-27 21:38:19] [INFO ] Deduced a trap composed of 432 places in 317 ms of which 5 ms to minimize.
[2024-05-27 21:38:20] [INFO ] Deduced a trap composed of 393 places in 375 ms of which 5 ms to minimize.
[2024-05-27 21:38:20] [INFO ] Deduced a trap composed of 411 places in 358 ms of which 5 ms to minimize.
[2024-05-27 21:38:20] [INFO ] Deduced a trap composed of 392 places in 381 ms of which 5 ms to minimize.
[2024-05-27 21:38:21] [INFO ] Deduced a trap composed of 370 places in 353 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 728/2102 variables, and 68 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1390/1390 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/728 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/728 variables, 38/50 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/728 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 1390 unsolved
[2024-05-27 21:38:23] [INFO ] Deduced a trap composed of 63 places in 65 ms of which 2 ms to minimize.
[2024-05-27 21:38:24] [INFO ] Deduced a trap composed of 360 places in 383 ms of which 5 ms to minimize.
[2024-05-27 21:38:26] [INFO ] Deduced a trap composed of 423 places in 398 ms of which 5 ms to minimize.
[2024-05-27 21:38:26] [INFO ] Deduced a trap composed of 399 places in 367 ms of which 5 ms to minimize.
[2024-05-27 21:38:27] [INFO ] Deduced a trap composed of 401 places in 372 ms of which 5 ms to minimize.
[2024-05-27 21:38:27] [INFO ] Deduced a trap composed of 401 places in 370 ms of which 6 ms to minimize.
[2024-05-27 21:38:27] [INFO ] Deduced a trap composed of 444 places in 340 ms of which 5 ms to minimize.
[2024-05-27 21:38:28] [INFO ] Deduced a trap composed of 398 places in 375 ms of which 6 ms to minimize.
[2024-05-27 21:38:28] [INFO ] Deduced a trap composed of 372 places in 355 ms of which 5 ms to minimize.
[2024-05-27 21:38:37] [INFO ] Deduced a trap composed of 491 places in 266 ms of which 4 ms to minimize.
[2024-05-27 21:38:37] [INFO ] Deduced a trap composed of 492 places in 328 ms of which 5 ms to minimize.
[2024-05-27 21:38:37] [INFO ] Deduced a trap composed of 493 places in 434 ms of which 5 ms to minimize.
[2024-05-27 21:38:40] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 728/2102 variables, and 81 constraints, problems are : Problem set: 0 solved, 1390 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 38/40 constraints, State Equation: 0/730 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1390 constraints, Known Traps: 31/31 constraints]
After SMT, in 41984ms problems are : Problem set: 0 solved, 1390 unsolved
Search for dead transitions found 0 dead transitions in 41997ms
Finished structural reductions in LTL mode , in 1 iterations and 42030 ms. Remains : 730/752 places, 1392/1412 transitions.
[2024-05-27 21:38:41] [INFO ] Flatten gal took : 44 ms
[2024-05-27 21:38:41] [INFO ] Flatten gal took : 49 ms
[2024-05-27 21:38:41] [INFO ] Input system was already deterministic with 1392 transitions.
[2024-05-27 21:38:41] [INFO ] Flatten gal took : 43 ms
[2024-05-27 21:38:41] [INFO ] Flatten gal took : 48 ms
[2024-05-27 21:38:41] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2024-05-27 21:38:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 752 places, 1412 transitions and 6142 arcs took 34 ms.
Total runtime 628251 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBLF-COL-S02J04T10

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/418/model (.net / .def) ...
EXPORT TIME: [User 0.007s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1726
MODEL NAME: /home/mcc/execution/418/model
752 places, 1412 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 CTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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