Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654446500169.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 itstools
Input is PolyORBLF-COL-S06J04T04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654446500169
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 7.2K Apr 11 17:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 11 17:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 11 17:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 17:31 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.5K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 11 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 17:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 11 17:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 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-S06J04T04-CTLCardinality-2024-00
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-01
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-02
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-03
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-04
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-05
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-06
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-07
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-08
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-09
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-10
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-11
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-12
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-13
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-14
FORMULA_NAME PolyORBLF-COL-S06J04T04-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716910344421

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J04T04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202405141337
[2024-05-28 15:32:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 15:32:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 15:32:25] [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-28 15:32:26] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 15:32:26] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 612 ms
[2024-05-28 15:32:26] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 454 PT places and 7036.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
[2024-05-28 15:32:26] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 5 ms.
[2024-05-28 15:32:26] [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 (3886 resets) in 1061 ms. (37 steps per ms) remains 62/72 properties
BEST_FIRST walk for 4001 steps (22 resets) in 119 ms. (33 steps per ms) remains 49/62 properties
BEST_FIRST walk for 4004 steps (12 resets) in 106 ms. (37 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4002 steps (18 resets) in 88 ms. (44 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4000 steps (15 resets) in 81 ms. (48 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (15 resets) in 32 ms. (121 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4003 steps (15 resets) in 39 ms. (100 steps per ms) remains 48/49 properties
BEST_FIRST walk for 4002 steps (22 resets) in 69 ms. (57 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (13 resets) in 34 ms. (114 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (14 resets) in 21 ms. (181 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (16 resets) in 42 ms. (93 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (35 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (24 resets) in 38 ms. (102 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (15 resets) in 21 ms. (181 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (19 resets) in 36 ms. (108 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (24 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (11 resets) in 24 ms. (160 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (208 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (18 resets) in 73 ms. (54 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (12 resets) in 23 ms. (166 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (14 resets) in 50 ms. (78 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (16 resets) in 21 ms. (181 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (17 resets) in 41 ms. (95 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (15 resets) in 23 ms. (166 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (12 resets) in 46 ms. (85 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (17 resets) in 30 ms. (129 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (18 resets) in 34 ms. (114 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (20 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (17 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (16 resets) in 23 ms. (166 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (18 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (27 resets) in 25 ms. (153 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (14 resets) in 19 ms. (200 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (14 resets) in 21 ms. (181 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (11 resets) in 29 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (13 resets) in 21 ms. (181 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (26 resets) in 27 ms. (142 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (16 resets) in 22 ms. (173 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4002 steps (16 resets) in 20 ms. (190 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (12 resets) in 18 ms. (210 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (14 resets) in 23 ms. (166 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (16 resets) in 32 ms. (121 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (19 resets) in 29 ms. (133 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (15 resets) in 24 ms. (160 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4000 steps (16 resets) in 23 ms. (166 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (18 resets) in 14 ms. (266 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4003 steps (11 resets) in 17 ms. (222 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (31 resets) in 23 ms. (166 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4001 steps (14 resets) in 42 ms. (93 steps per ms) remains 48/48 properties
[2024-05-28 15:32:27] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-05-28 15:32:27] [INFO ] Computed 26 invariants in 5 ms
[2024-05-28 15:32:27] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem AtomicPropp10 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 47 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
At refinement iteration 2 (OVERLAPS) 24/71 variables, 11/12 constraints. Problems are: Problem set: 30 solved, 18 unsolved
Problem AtomicPropp70 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 2/14 constraints. Problems are: Problem set: 31 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/14 constraints. Problems are: Problem set: 31 solved, 17 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 5 (OVERLAPS) 10/81 variables, 12/26 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 47 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 47 solved, 1 unsolved in 422 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: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 47 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/38 variables, 2/2 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/48 variables, 6/8 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/49 variables, 1/9 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/73 variables, 12/21 constraints. Problems are: Problem set: 47 solved, 1 unsolved
[2024-05-28 15:32:28] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 1/114 constraints. Problems are: Problem set: 47 solved, 1 unsolved
[2024-05-28 15:32:28] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 1/115 constraints. Problems are: Problem set: 47 solved, 1 unsolved
[2024-05-28 15:32:28] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 1/116 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 0/116 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/145 variables, 2/118 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 1/119 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 0/119 constraints. Problems are: Problem set: 47 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/145 variables, 0/119 constraints. Problems are: Problem set: 47 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 119 constraints, problems are : Problem set: 47 solved, 1 unsolved in 230 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: 1/48 constraints, Known Traps: 3/3 constraints]
After SMT, in 700ms problems are : Problem set: 47 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 2 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 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 80 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 71 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 19 place count 71 transition count 53
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 68 transition count 53
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 37 place count 62 transition count 47
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 62 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 41 place count 60 transition count 45
Applied a total of 41 rules in 26 ms. Remains 60 /81 variables (removed 21) and now considering 45/65 (removed 20) transitions.
Running 44 sub problems to find dead transitions.
[2024-05-28 15:32:28] [INFO ] Flow matrix only has 44 transitions (discarded 1 similar events)
// Phase 1: matrix 44 rows 60 cols
[2024-05-28 15:32:28] [INFO ] Computed 25 invariants in 3 ms
[2024-05-28 15:32:28] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-28 15:32:28] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-28 15:32:28] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-28 15:32:28] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-28 15:32:28] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-28 15:32:28] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-28 15:32:28] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 44/104 variables, 60/91 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 8/99 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-28 15:32:29] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-28 15:32:29] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (OVERLAPS) 0/104 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 101 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1373 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-28 15:32:30] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 15:32:30] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-28 15:32:30] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 3/35 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 1/60 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 44/104 variables, 60/96 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 8/104 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 44/148 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 11 (OVERLAPS) 0/104 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 148 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1545 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 60/60 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 11/11 constraints]
After SMT, in 2940ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 2941ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2977 ms. Remains : 60/81 places, 45/65 transitions.
RANDOM walk for 40005 steps (4335 resets) in 467 ms. (85 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (263 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
Probably explored full state space saw : 111519 states, properties seen :0
Probabilistic random walk after 341852 steps, saw 111519 distinct states, run finished after 678 ms. (steps per millisecond=504 ) properties seen :0
Explored full state space saw : 111522 states, properties seen :0
Exhaustive walk after 341859 steps, saw 111522 distinct states, run finished after 405 ms. (steps per millisecond=844 ) properties seen :0
Successfully simplified 48 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 15:32:32] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-05-28 15:32:32] [INFO ] Flatten gal took : 40 ms
[2024-05-28 15:32:32] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 15:32:32] [INFO ] Flatten gal took : 11 ms
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
[2024-05-28 15:32:32] [INFO ] Unfolded HLPN to a Petri net with 454 places and 6994 transitions 59152 arcs in 203 ms.
[2024-05-28 15:32:32] [INFO ] Unfolded 4 HLPN properties in 1 ms.
Ensure Unique test removed 5380 transitions
Reduce redundant transitions removed 5380 transitions.
Support contains 178 out of 454 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 454/454 places, 1614/1614 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 448 transition count 1614
Applied a total of 6 rules in 61 ms. Remains 448 /454 variables (removed 6) and now considering 1614/1614 (removed 0) transitions.
Running 1608 sub problems to find dead transitions.
[2024-05-28 15:32:33] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
// Phase 1: matrix 1590 rows 448 cols
[2024-05-28 15:32:33] [INFO ] Computed 44 invariants in 124 ms
[2024-05-28 15:32:33] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:32:58] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 2 ms to minimize.
[2024-05-28 15:32:58] [INFO ] Deduced a trap composed of 85 places in 63 ms of which 3 ms to minimize.
[2024-05-28 15:32:58] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 2 ms to minimize.
[2024-05-28 15:32:58] [INFO ] Deduced a trap composed of 224 places in 344 ms of which 4 ms to minimize.
[2024-05-28 15:32:59] [INFO ] Deduced a trap composed of 107 places in 351 ms of which 3 ms to minimize.
[2024-05-28 15:33:00] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
[2024-05-28 15:33:01] [INFO ] Deduced a trap composed of 231 places in 341 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/2038 variables, and 45 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/448 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:33:10] [INFO ] Deduced a trap composed of 220 places in 351 ms of which 4 ms to minimize.
[2024-05-28 15:33:13] [INFO ] Deduced a trap composed of 49 places in 290 ms of which 1 ms to minimize.
[2024-05-28 15:33:16] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/2038 variables, and 48 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/448 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 10/10 constraints]
After SMT, in 55599ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 55626ms
[2024-05-28 15:33:28] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
[2024-05-28 15:33:28] [INFO ] Invariant cache hit.
[2024-05-28 15:33:29] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-28 15:33:29] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
[2024-05-28 15:33:29] [INFO ] Invariant cache hit.
[2024-05-28 15:33:29] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 15:33:34] [INFO ] Implicit Places using invariants and state equation in 5092 ms returned []
Implicit Place search using SMT with State Equation took 5437 ms to find 0 implicit places.
Running 1608 sub problems to find dead transitions.
[2024-05-28 15:33:34] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
[2024-05-28 15:33:34] [INFO ] Invariant cache hit.
[2024-05-28 15:33:34] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:33:58] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 1 ms to minimize.
[2024-05-28 15:33:58] [INFO ] Deduced a trap composed of 85 places in 85 ms of which 1 ms to minimize.
[2024-05-28 15:33:58] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-05-28 15:33:58] [INFO ] Deduced a trap composed of 242 places in 347 ms of which 4 ms to minimize.
[2024-05-28 15:33:59] [INFO ] Deduced a trap composed of 233 places in 365 ms of which 3 ms to minimize.
[2024-05-28 15:33:59] [INFO ] Deduced a trap composed of 110 places in 308 ms of which 2 ms to minimize.
[2024-05-28 15:34:00] [INFO ] Deduced a trap composed of 114 places in 313 ms of which 4 ms to minimize.
[2024-05-28 15:34:00] [INFO ] Deduced a trap composed of 229 places in 325 ms of which 3 ms to minimize.
[2024-05-28 15:34:01] [INFO ] Deduced a trap composed of 247 places in 310 ms of which 4 ms to minimize.
[2024-05-28 15:34:01] [INFO ] Deduced a trap composed of 85 places in 75 ms of which 1 ms to minimize.
[2024-05-28 15:34:02] [INFO ] Deduced a trap composed of 89 places in 298 ms of which 1 ms to minimize.
[2024-05-28 15:34:02] [INFO ] Deduced a trap composed of 48 places in 299 ms of which 2 ms to minimize.
[2024-05-28 15:34:03] [INFO ] Deduced a trap composed of 273 places in 415 ms of which 3 ms to minimize.
[2024-05-28 15:34:03] [INFO ] Deduced a trap composed of 271 places in 367 ms of which 2 ms to minimize.
[2024-05-28 15:34:04] [INFO ] Deduced a trap composed of 275 places in 347 ms of which 3 ms to minimize.
[2024-05-28 15:34:04] [INFO ] Deduced a trap composed of 232 places in 338 ms of which 4 ms to minimize.
[2024-05-28 15:34:04] [INFO ] Deduced a trap composed of 265 places in 339 ms of which 4 ms to minimize.
[2024-05-28 15:34:05] [INFO ] Deduced a trap composed of 258 places in 347 ms of which 2 ms to minimize.
(s200 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 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 9.0)
(s83 1.0)
(s84 0.0)
(s85 1.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 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 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 1.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 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/2038 variables, and 56 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/448 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/442 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
[2024-05-28 15:34:24] [INFO ] Deduced a trap composed of 31 places in 291 ms of which 2 ms to minimize.
[2024-05-28 15:34:26] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 2 ms to minimize.
[2024-05-28 15:34:42] [INFO ] Deduced a trap composed of 232 places in 298 ms of which 4 ms to minimize.
[2024-05-28 15:34:42] [INFO ] Deduced a trap composed of 200 places in 251 ms of which 3 ms to minimize.
[2024-05-28 15:34:43] [INFO ] Deduced a trap composed of 234 places in 297 ms of which 4 ms to minimize.
[2024-05-28 15:34:43] [INFO ] Deduced a trap composed of 228 places in 327 ms of which 4 ms to minimize.
[2024-05-28 15:34:44] [INFO ] Deduced a trap composed of 215 places in 310 ms of which 3 ms to minimize.
[2024-05-28 15:34:44] [INFO ] Deduced a trap composed of 207 places in 247 ms of which 2 ms to minimize.
[2024-05-28 15:34:44] [INFO ] Deduced a trap composed of 238 places in 242 ms of which 4 ms to minimize.
[2024-05-28 15:34:44] [INFO ] Deduced a trap composed of 216 places in 302 ms of which 4 ms to minimize.
[2024-05-28 15:34:45] [INFO ] Deduced a trap composed of 34 places in 389 ms of which 3 ms to minimize.
[2024-05-28 15:34:46] [INFO ] Deduced a trap composed of 3 places in 372 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/2038 variables, and 68 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/448 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 30/30 constraints]
After SMT, in 74640ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 74670ms
Starting structural reductions in LTL mode, iteration 1 : 448/454 places, 1614/1614 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135816 ms. Remains : 448/454 places, 1614/1614 transitions.
Support contains 178 out of 448 places after structural reductions.
[2024-05-28 15:34:49] [INFO ] Flatten gal took : 147 ms
[2024-05-28 15:34:49] [INFO ] Flatten gal took : 125 ms
[2024-05-28 15:34:49] [INFO ] Input system was already deterministic with 1614 transitions.
RANDOM walk for 40000 steps (209 resets) in 904 ms. (44 steps per ms) remains 9/19 properties
BEST_FIRST walk for 40001 steps (105 resets) in 242 ms. (164 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (110 resets) in 173 ms. (229 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (99 resets) in 136 ms. (291 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (103 resets) in 264 ms. (150 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (98 resets) in 187 ms. (212 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (352 resets) in 168 ms. (236 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (69 resets) in 148 ms. (268 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (80 resets) in 128 ms. (310 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (98 resets) in 135 ms. (294 steps per ms) remains 9/9 properties
[2024-05-28 15:34:50] [INFO ] Flow matrix only has 1590 transitions (discarded 24 similar events)
[2024-05-28 15:34:50] [INFO ] Invariant cache hit.
[2024-05-28 15:34:50] [INFO ] State equation strengthened by 112 read => feed constraints.
Problem AtomicPropp4 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 80/176 variables, 5/6 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 10/186 variables, 5/11 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 6 (OVERLAPS) 248/434 variables, 23/34 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 0/34 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/441 variables, 4/38 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 0/38 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/446 variables, 5/43 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 0/43 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1590/2036 variables, 446/489 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2036 variables, 112/601 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2036 variables, 0/601 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/2038 variables, 2/603 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2038 variables, 1/604 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2038 variables, 0/604 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/2038 variables, 0/604 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2038/2038 variables, and 604 constraints, problems are : Problem set: 8 solved, 1 unsolved in 986 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 448/448 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 348/353 variables, 8/8 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/353 variables, 0/8 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 27/380 variables, 14/22 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/22 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 65/445 variables, 20/42 constraints. Problems are: Problem set: 8 solved, 1 unsolved
[2024-05-28 15:34:51] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 1 ms to minimize.
[2024-05-28 15:34:51] [INFO ] Deduced a trap composed of 85 places in 81 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 2/44 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 0/44 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/446 variables, 1/45 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 0/45 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1590/2036 variables, 446/491 constraints. Problems are: Problem set: 8 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2036/2038 variables, and 603 constraints, problems are : Problem set: 8 solved, 1 unsolved in 1582 ms.
Refiners :[Positive P Invariants (semi-flows): 15/16 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 446/448 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 0/9 constraints, Known Traps: 2/2 constraints]
After SMT, in 2637ms problems are : Problem set: 8 solved, 1 unsolved
Parikh walk visited 0 properties in 65 ms.
Support contains 5 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 1614/1614 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 448 transition count 1578
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 412 transition count 1578
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 72 place count 412 transition count 1530
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 168 place count 364 transition count 1530
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 256 place count 320 transition count 1486
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 264 place count 320 transition count 1478
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 272 place count 312 transition count 1478
Applied a total of 272 rules in 265 ms. Remains 312 /448 variables (removed 136) and now considering 1478/1614 (removed 136) transitions.
Running 1472 sub problems to find dead transitions.
[2024-05-28 15:34:53] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
// Phase 1: matrix 1454 rows 312 cols
[2024-05-28 15:34:53] [INFO ] Computed 44 invariants in 34 ms
[2024-05-28 15:34:53] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-05-28 15:35:19] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 3 ms to minimize.
[2024-05-28 15:35:20] [INFO ] Deduced a trap composed of 51 places in 86 ms of which 1 ms to minimize.
[2024-05-28 15:35:20] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:35:20] [INFO ] Deduced a trap composed of 121 places in 280 ms of which 2 ms to minimize.
[2024-05-28 15:35:21] [INFO ] Deduced a trap composed of 18 places in 252 ms of which 1 ms to minimize.
[2024-05-28 15:35:21] [INFO ] Deduced a trap composed of 39 places in 265 ms of which 2 ms to minimize.
[2024-05-28 15:35:21] [INFO ] Deduced a trap composed of 52 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:35:23] [INFO ] Deduced a trap composed of 129 places in 359 ms of which 2 ms to minimize.
[2024-05-28 15:35:23] [INFO ] Deduced a trap composed of 117 places in 337 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/1766 variables, and 47 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/312 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1472/1472 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
[2024-05-28 15:35:34] [INFO ] Deduced a trap composed of 130 places in 256 ms of which 2 ms to minimize.
[2024-05-28 15:35:34] [INFO ] Deduced a trap composed of 141 places in 245 ms of which 2 ms to minimize.
[2024-05-28 15:35:35] [INFO ] Deduced a trap composed of 94 places in 294 ms of which 2 ms to minimize.
[2024-05-28 15:35:41] [INFO ] Deduced a trap composed of 90 places in 289 ms of which 2 ms to minimize.
[2024-05-28 15:35:42] [INFO ] Deduced a trap composed of 94 places in 222 ms of which 1 ms to minimize.
[2024-05-28 15:35:42] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/1766 variables, and 53 constraints, problems are : Problem set: 0 solved, 1472 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/14 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/312 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1472 constraints, Known Traps: 15/15 constraints]
After SMT, in 59317ms problems are : Problem set: 0 solved, 1472 unsolved
Search for dead transitions found 0 dead transitions in 59336ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59606 ms. Remains : 312/448 places, 1478/1614 transitions.
RANDOM walk for 40000 steps (445 resets) in 476 ms. (83 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (192 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 189065 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 1
Probabilistic random walk after 189065 steps, saw 120645 distinct states, run finished after 3005 ms. (steps per millisecond=62 ) properties seen :0
[2024-05-28 15:35:55] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-05-28 15:35:55] [INFO ] Invariant cache hit.
[2024-05-28 15:35:55] [INFO ] State equation strengthened by 112 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 175/180 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/216 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/308 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/310 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1454/1764 variables, 310/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1764 variables, 112/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1764 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/1766 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1766 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1766 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1766 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1766/1766 variables, and 468 constraints, problems are : Problem set: 0 solved, 1 unsolved in 624 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 312/312 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 175/180 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 36/216 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/308 variables, 21/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:35:56] [INFO ] Deduced a trap composed of 33 places in 236 ms of which 1 ms to minimize.
[2024-05-28 15:35:57] [INFO ] Deduced a trap composed of 40 places in 251 ms of which 2 ms to minimize.
[2024-05-28 15:35:57] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 1 ms to minimize.
[2024-05-28 15:35:57] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/310 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/310 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1454/1764 variables, 310/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1764 variables, 112/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1764 variables, 1/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1764 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1766 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1766 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1766 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1766 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1766/1766 variables, and 473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1798 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 312/312 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 2452ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 5 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 1478/1478 transitions.
Applied a total of 0 rules in 53 ms. Remains 312 /312 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 312/312 places, 1478/1478 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 1478/1478 transitions.
Applied a total of 0 rules in 46 ms. Remains 312 /312 variables (removed 0) and now considering 1478/1478 (removed 0) transitions.
[2024-05-28 15:35:58] [INFO ] Flow matrix only has 1454 transitions (discarded 24 similar events)
[2024-05-28 15:35:58] [INFO ] Invariant cache hit.
[2024-05-28 15:35:58] [INFO ] Implicit Places using invariants in 453 ms returned [266, 267, 268, 269]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 478 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 308/312 places, 1478/1478 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 304 transition count 1474
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 304 transition count 1474
Applied a total of 8 rules in 39 ms. Remains 304 /308 variables (removed 4) and now considering 1474/1478 (removed 4) transitions.
[2024-05-28 15:35:59] [INFO ] Flow matrix only has 1450 transitions (discarded 24 similar events)
// Phase 1: matrix 1450 rows 304 cols
[2024-05-28 15:35:59] [INFO ] Computed 40 invariants in 33 ms
[2024-05-28 15:35:59] [INFO ] Implicit Places using invariants in 428 ms returned []
[2024-05-28 15:35:59] [INFO ] Flow matrix only has 1450 transitions (discarded 24 similar events)
[2024-05-28 15:35:59] [INFO ] Invariant cache hit.
[2024-05-28 15:35:59] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 15:36:02] [INFO ] Implicit Places using invariants and state equation in 2901 ms returned []
Implicit Place search using SMT with State Equation took 3331 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 304/312 places, 1474/1478 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3895 ms. Remains : 304/312 places, 1474/1478 transitions.
RANDOM walk for 40000 steps (441 resets) in 557 ms. (71 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (242 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 195381 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 1
Probabilistic random walk after 195381 steps, saw 125234 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
[2024-05-28 15:36:05] [INFO ] Flow matrix only has 1450 transitions (discarded 24 similar events)
[2024-05-28 15:36:05] [INFO ] Invariant cache hit.
[2024-05-28 15:36:05] [INFO ] State equation strengthened by 112 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 224/229 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/250 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 51/301 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/302 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1450/1752 variables, 302/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1752 variables, 112/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1752 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/1754 variables, 2/455 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1754 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1754 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1754 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1754/1754 variables, and 456 constraints, problems are : Problem set: 0 solved, 1 unsolved in 822 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 304/304 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 224/229 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/250 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 51/301 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:36:06] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 1 ms to minimize.
[2024-05-28 15:36:06] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 1 ms to minimize.
[2024-05-28 15:36:06] [INFO ] Deduced a trap composed of 51 places in 46 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/302 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1450/1752 variables, 302/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1752 variables, 112/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1752 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1752 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1754 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1754 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 15:36:08] [INFO ] Deduced a trap composed of 44 places in 265 ms of which 2 ms to minimize.
[2024-05-28 15:36:08] [INFO ] Deduced a trap composed of 27 places in 255 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1754 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1754 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1754 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1754/1754 variables, and 462 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2041 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 304/304 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 2877ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 120 ms.
Support contains 5 out of 304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 304/304 places, 1474/1474 transitions.
Applied a total of 0 rules in 32 ms. Remains 304 /304 variables (removed 0) and now considering 1474/1474 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 304/304 places, 1474/1474 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 304/304 places, 1474/1474 transitions.
Applied a total of 0 rules in 30 ms. Remains 304 /304 variables (removed 0) and now considering 1474/1474 (removed 0) transitions.
[2024-05-28 15:36:08] [INFO ] Flow matrix only has 1450 transitions (discarded 24 similar events)
[2024-05-28 15:36:08] [INFO ] Invariant cache hit.
[2024-05-28 15:36:09] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-05-28 15:36:09] [INFO ] Flow matrix only has 1450 transitions (discarded 24 similar events)
[2024-05-28 15:36:09] [INFO ] Invariant cache hit.
[2024-05-28 15:36:09] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 15:36:12] [INFO ] Implicit Places using invariants and state equation in 3125 ms returned []
Implicit Place search using SMT with State Equation took 3559 ms to find 0 implicit places.
[2024-05-28 15:36:12] [INFO ] Redundant transitions in 89 ms returned []
Running 1468 sub problems to find dead transitions.
[2024-05-28 15:36:12] [INFO ] Flow matrix only has 1450 transitions (discarded 24 similar events)
[2024-05-28 15:36:12] [INFO ] Invariant cache hit.
[2024-05-28 15:36:12] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
[2024-05-28 15:36:39] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-05-28 15:36:39] [INFO ] Deduced a trap composed of 51 places in 34 ms of which 1 ms to minimize.
[2024-05-28 15:36:39] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2024-05-28 15:36:39] [INFO ] Deduced a trap composed of 120 places in 356 ms of which 2 ms to minimize.
[2024-05-28 15:36:40] [INFO ] Deduced a trap composed of 138 places in 323 ms of which 2 ms to minimize.
[2024-05-28 15:36:40] [INFO ] Deduced a trap composed of 51 places in 58 ms of which 1 ms to minimize.
[2024-05-28 15:36:40] [INFO ] Deduced a trap composed of 28 places in 214 ms of which 1 ms to minimize.
[2024-05-28 15:36:42] [INFO ] Deduced a trap composed of 124 places in 349 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
[2024-05-28 15:36:55] [INFO ] Deduced a trap composed of 22 places in 320 ms of which 3 ms to minimize.
[2024-05-28 15:36:58] [INFO ] Deduced a trap composed of 91 places in 300 ms of which 1 ms to minimize.
[2024-05-28 15:36:59] [INFO ] Deduced a trap composed of 85 places in 297 ms of which 2 ms to minimize.
[2024-05-28 15:36:59] [INFO ] Deduced a trap composed of 118 places in 296 ms of which 3 ms to minimize.
[2024-05-28 15:37:00] [INFO ] Deduced a trap composed of 119 places in 304 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 298/1754 variables, and 47 constraints, problems are : Problem set: 0 solved, 1468 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/304 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1468/1468 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1468 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 13/47 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
[2024-05-28 15:37:11] [INFO ] Deduced a trap composed of 3 places in 345 ms of which 2 ms to minimize.
[2024-05-28 15:37:11] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 1 ms to minimize.
[2024-05-28 15:37:11] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 298/1754 variables, and 50 constraints, problems are : Problem set: 0 solved, 1468 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 11/17 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 0/304 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1468 constraints, Known Traps: 16/16 constraints]
After SMT, in 79921ms problems are : Problem set: 0 solved, 1468 unsolved
Search for dead transitions found 0 dead transitions in 79941ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83632 ms. Remains : 304/304 places, 1474/1474 transitions.
Successfully simplified 8 atomic propositions for a total of 4 simplifications.
[2024-05-28 15:37:32] [INFO ] Flatten gal took : 118 ms
[2024-05-28 15:37:32] [INFO ] Flatten gal took : 110 ms
[2024-05-28 15:37:32] [INFO ] Input system was already deterministic with 1614 transitions.
Support contains 48 out of 448 places (down from 82) after GAL structural reductions.
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 448/448 places, 1614/1614 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 448 transition count 1578
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 412 transition count 1578
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 72 place count 412 transition count 1530
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 168 place count 364 transition count 1530
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 256 place count 320 transition count 1486
Applied a total of 256 rules in 145 ms. Remains 320 /448 variables (removed 128) and now considering 1486/1614 (removed 128) transitions.
Running 1480 sub problems to find dead transitions.
[2024-05-28 15:37:32] [INFO ] Flow matrix only has 1462 transitions (discarded 24 similar events)
// Phase 1: matrix 1462 rows 320 cols
[2024-05-28 15:37:32] [INFO ] Computed 44 invariants in 31 ms
[2024-05-28 15:37:32] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1480 unsolved
[2024-05-28 15:37:56] [INFO ] Deduced a trap composed of 53 places in 43 ms of which 1 ms to minimize.
[2024-05-28 15:37:56] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2024-05-28 15:37:56] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 2 ms to minimize.
[2024-05-28 15:37:58] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 314/1782 variables, and 42 constraints, problems are : Problem set: 0 solved, 1480 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/320 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1480/1480 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1480 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1480 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1480 unsolved
[2024-05-28 15:38:11] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2024-05-28 15:38:11] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 1 ms to minimize.
[2024-05-28 15:38:11] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2024-05-28 15:38:25] [INFO ] Deduced a trap composed of 94 places in 322 ms of which 2 ms to minimize.
[2024-05-28 15:38:25] [INFO ] Deduced a trap composed of 145 places in 277 ms of which 2 ms to minimize.
[2024-05-28 15:38:26] [INFO ] Deduced a trap composed of 134 places in 351 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/314 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 1480 unsolved
[2024-05-28 15:38:28] [INFO ] Deduced a trap composed of 43 places in 289 ms of which 2 ms to minimize.
SMT process timed out in 55649ms, After SMT, problems are : Problem set: 0 solved, 1480 unsolved
Search for dead transitions found 0 dead transitions in 55667ms
[2024-05-28 15:38:28] [INFO ] Flow matrix only has 1462 transitions (discarded 24 similar events)
[2024-05-28 15:38:28] [INFO ] Invariant cache hit.
[2024-05-28 15:38:28] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-28 15:38:28] [INFO ] Flow matrix only has 1462 transitions (discarded 24 similar events)
[2024-05-28 15:38:28] [INFO ] Invariant cache hit.
[2024-05-28 15:38:29] [INFO ] State equation strengthened by 112 read => feed constraints.
[2024-05-28 15:38:32] [INFO ] Implicit Places using invariants and state equation in 3870 ms returned []
Implicit Place search using SMT with State Equation took 4232 ms to find 0 implicit places.
[2024-05-28 15:38:32] [INFO ] Redundant transitions in 34 ms returned []
Running 1480 sub problems to find dead transitions.
[2024-05-28 15:38:32] [INFO ] Flow matrix only has 1462 transitions (discarded 24 similar events)
[2024-05-28 15:38:32] [INFO ] Invariant cache hit.
[2024-05-28 15:38:32] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1480 unsolved
[2024-05-28 15:38:59] [INFO ] Deduced a trap composed of 53 places in 1673 ms of which 55 ms to minimize.
[2024-05-28 15:39:00] [INFO ] Deduced a trap composed of 53 places in 306 ms of which 53 ms to minimize.
[2024-05-28 15:39:00] [INFO ] Deduced a trap composed of 54 places in 388 ms of which 14 ms to minimize.
[2024-05-28 15:39:03] [INFO ] Deduced a trap composed of 53 places in 302 ms of which 49 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 314/1782 variables, and 42 constraints, problems are : Problem set: 0 solved, 1480 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/320 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 1480/1480 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1480 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1480 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 27/38 constraints. Problems are: Problem set: 0 solved, 1480 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/314 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1480 unsolved
[2024-05-28 15:39:48] [INFO ] Deduced a trap composed of 11 places in 618 ms of which 51 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 314/1782 variables, and 43 constraints, problems are : Problem set: 0 solved, 1480 unsolved in 30084 ms.
Refiners :[Positive P Invariants (semi-flows): 11/16 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 0/320 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 0/1480 constraints, Known Traps: 5/5 constraints]
After SMT, in 75846ms problems are : Problem set: 0 solved, 1480 unsolved
Search for dead transitions found 0 dead transitions in 75869ms
Starting structural reductions in SI_CTL mode, iteration 1 : 320/448 places, 1486/1614 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 135961 ms. Remains : 320/448 places, 1486/1614 transitions.
[2024-05-28 15:39:48] [INFO ] Flatten gal took : 77 ms
[2024-05-28 15:39:48] [INFO ] Flatten gal took : 72 ms
[2024-05-28 15:39:49] [INFO ] Input system was already deterministic with 1486 transitions.
RANDOM walk for 443 steps (7 resets) in 7 ms. (55 steps per ms) remains 0/1 properties
FORMULA PolyORBLF-COL-S06J04T04-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 15:39:49] [INFO ] Flatten gal took : 105 ms
[2024-05-28 15:39:49] [INFO ] Flatten gal took : 103 ms
[2024-05-28 15:39:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1854482237957448028.gal : 64 ms
[2024-05-28 15:39:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12410382343520982754.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1854482237957448028.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12410382343520982754.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329

BK_STOP 1716910793263

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-S06J04T04"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is PolyORBLF-COL-S06J04T04, 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 r290-tajo-171654446500169"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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