Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r520-tall-171662337700041.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is QuasiCertifProtocol-COL-28, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337700041
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 7.5K Apr 13 03:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 13 03:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 13 03:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 13 03:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 13 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 03:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 13 03:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 120K 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 QuasiCertifProtocol-COL-28-CTLCardinality-2024-00
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-2024-01
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-2024-02
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-2024-03
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-2024-04
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-2024-05
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-2024-06
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-2024-07
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-2024-08
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-2024-09
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-2024-10
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-2024-11
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-2024-12
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-2024-13
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-2024-14
FORMULA_NAME QuasiCertifProtocol-COL-28-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717218322044

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-28
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:05:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:05:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:05:23] [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-06-01 05:05:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 05:05:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 577 ms
[2024-06-01 05:05:23] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 2998 PT places and 446.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
[2024-06-01 05:05:23] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2024-06-01 05:05:23] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40030 steps (1035 resets) in 915 ms. (43 steps per ms) remains 43/89 properties
BEST_FIRST walk for 4004 steps (32 resets) in 41 ms. (95 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (32 resets) in 59 ms. (66 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4009 steps (34 resets) in 32 ms. (121 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (33 resets) in 27 ms. (142 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (35 resets) in 37 ms. (105 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (34 resets) in 24 ms. (160 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (26 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (21 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (34 resets) in 21 ms. (181 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (32 resets) in 22 ms. (174 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4006 steps (33 resets) in 35 ms. (111 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (56 resets) in 25 ms. (153 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (32 resets) in 22 ms. (174 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4011 steps (34 resets) in 33 ms. (117 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (21 resets) in 23 ms. (166 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (32 resets) in 21 ms. (182 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (33 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (32 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4006 steps (33 resets) in 26 ms. (148 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (33 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (33 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (33 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (28 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (33 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (31 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (34 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (32 resets) in 25 ms. (153 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (34 resets) in 34 ms. (114 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (56 resets) in 83 ms. (47 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (24 resets) in 37 ms. (105 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (33 resets) in 27 ms. (143 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (35 resets) in 12 ms. (307 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4010 steps (33 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (56 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4013 steps (32 resets) in 13 ms. (286 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4001 steps (33 resets) in 12 ms. (307 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (32 resets) in 11 ms. (333 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (37 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4008 steps (32 resets) in 13 ms. (286 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (33 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (34 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (32 resets) in 13 ms. (286 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (34 resets) in 13 ms. (285 steps per ms) remains 43/43 properties
// Phase 1: matrix 26 rows 30 cols
[2024-06-01 05:05:24] [INFO ] Computed 5 invariants in 6 ms
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp87 is UNSAT
Problem AtomicPropp88 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 2/2 constraints. Problems are: Problem set: 18 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 18 solved, 25 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp83 is UNSAT
At refinement iteration 2 (OVERLAPS) 4/30 variables, 3/5 constraints. Problems are: Problem set: 30 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 30 solved, 13 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp73 is UNSAT
At refinement iteration 4 (OVERLAPS) 26/56 variables, 30/35 constraints. Problems are: Problem set: 38 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 38 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 38 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 38 solved, 5 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 38 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 38 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 13/24 variables, 5/5 constraints. Problems are: Problem set: 38 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 38 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 26/50 variables, 24/29 constraints. Problems are: Problem set: 38 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 3/32 constraints. Problems are: Problem set: 38 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/32 constraints. Problems are: Problem set: 38 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 6/56 variables, 6/38 constraints. Problems are: Problem set: 38 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 2/40 constraints. Problems are: Problem set: 38 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/40 constraints. Problems are: Problem set: 38 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/40 constraints. Problems are: Problem set: 38 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 40 constraints, problems are : Problem set: 38 solved, 5 unsolved in 129 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 5/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 514ms problems are : Problem set: 38 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 221 steps, including 0 resets, run visited all 5 properties in 5 ms. (steps per millisecond=44 )
Parikh walk visited 5 properties in 10 ms.
Successfully simplified 38 atomic propositions for a total of 16 simplifications.
[2024-06-01 05:05:25] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2024-06-01 05:05:25] [INFO ] Flatten gal took : 19 ms
[2024-06-01 05:05:25] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-28-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:05:25] [INFO ] Flatten gal took : 4 ms
Domain [tsid(29), tsid(29)] of place n9 breaks symmetries in sort tsid
[2024-06-01 05:05:25] [INFO ] Unfolded HLPN to a Petri net with 2998 places and 446 transitions 6489 arcs in 28 ms.
[2024-06-01 05:05:25] [INFO ] Unfolded 7 HLPN properties in 1 ms.
Support contains 2968 out of 2998 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2997 transition count 446
Applied a total of 1 rules in 31 ms. Remains 2997 /2998 variables (removed 1) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 2997 cols
[2024-06-01 05:05:25] [INFO ] Computed 2552 invariants in 115 ms
[2024-06-01 05:05:26] [INFO ] Implicit Places using invariants in 959 ms returned []
[2024-06-01 05:05:26] [INFO ] Invariant cache hit.
[2024-06-01 05:05:28] [INFO ] Implicit Places using invariants and state equation in 1816 ms returned []
Implicit Place search using SMT with State Equation took 2785 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-06-01 05:05:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 1708/1708 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2935/3443 variables, and 1708 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/3 constraints, Generalized P Invariants (flows): 1708/2549 constraints, State Equation: 0/2997 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2935 variables, 1708/1708 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2935 variables, 0/1708 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 60/2995 variables, 3/1711 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2995 variables, 841/2552 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2995/3443 variables, and 2552 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2549/2549 constraints, State Equation: 0/2997 constraints, PredecessorRefiner: 0/416 constraints, Known Traps: 0/0 constraints]
After SMT, in 60856ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 60866ms
Starting structural reductions in LTL mode, iteration 1 : 2997/2998 places, 446/446 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63700 ms. Remains : 2997/2998 places, 446/446 transitions.
Support contains 2968 out of 2997 places after structural reductions.
[2024-06-01 05:06:29] [INFO ] Flatten gal took : 167 ms
[2024-06-01 05:06:29] [INFO ] Flatten gal took : 134 ms
[2024-06-01 05:06:29] [INFO ] Input system was already deterministic with 446 transitions.
RANDOM walk for 40000 steps (1206 resets) in 5613 ms. (7 steps per ms) remains 31/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 133 ms. (29 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 123 ms. (32 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 126 ms. (31 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 31/31 properties
[2024-06-01 05:06:31] [INFO ] Invariant cache hit.
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp16 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2939 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2939 variables, 2521/2523 constraints. Problems are: Problem set: 2 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2939 variables, 0/2523 constraints. Problems are: Problem set: 2 solved, 29 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp32 is UNSAT
At refinement iteration 3 (OVERLAPS) 29/2968 variables, 1/2524 constraints. Problems are: Problem set: 6 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2968/3443 variables, and 2524 constraints, problems are : Problem set: 6 solved, 25 unsolved in 5027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2521/2549 constraints, State Equation: 0/2997 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2910 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2910 variables, 2521/2523 constraints. Problems are: Problem set: 6 solved, 25 unsolved
[2024-06-01 05:06:39] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 35 ms to minimize.
[2024-06-01 05:06:39] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 4 ms to minimize.
[2024-06-01 05:06:39] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 4 ms to minimize.
[2024-06-01 05:06:40] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 3 ms to minimize.
[2024-06-01 05:06:40] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/2910 variables, 5/2528 constraints. Problems are: Problem set: 6 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2910/3443 variables, and 2528 constraints, problems are : Problem set: 6 solved, 25 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, Generalized P Invariants (flows): 2521/2549 constraints, State Equation: 0/2997 constraints, PredecessorRefiner: 0/31 constraints, Known Traps: 5/5 constraints]
After SMT, in 10374ms problems are : Problem set: 6 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2910 out of 2997 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Applied a total of 0 rules in 46 ms. Remains 2997 /2997 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 2997/2997 places, 446/446 transitions.
RANDOM walk for 40000 steps (1207 resets) in 4160 ms. (9 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 72 ms. (54 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 25/25 properties
Interrupted probabilistic random walk after 281105 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :19 out of 25
Probabilistic random walk after 281105 steps, saw 55518 distinct states, run finished after 3005 ms. (steps per millisecond=93 ) properties seen :19
[2024-06-01 05:06:46] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/992 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 205/1197 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1197 variables, 812/814 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1197 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1/1198 variables, 1/815 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1198 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1740/2938 variables, 1709/2524 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2938 variables, 0/2524 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3384/3443 variables, and 5462 constraints, problems are : Problem set: 5 solved, 1 unsolved in 14132 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2521/2549 constraints, State Equation: 2938/2997 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/930 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 205/1135 variables, 2/2 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1135 variables, 812/814 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-06-01 05:07:01] [INFO ] Deduced a trap composed of 5 places in 399 ms of which 8 ms to minimize.
[2024-06-01 05:07:01] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 05:07:01] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 05:07:01] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 05:07:02] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 05:07:02] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-06-01 05:07:02] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-06-01 05:07:02] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-06-01 05:07:02] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 05:07:02] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 05:07:02] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-06-01 05:07:02] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 05:07:02] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 05:07:02] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 05:07:02] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-06-01 05:07:02] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 05:07:02] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 05:07:03] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-06-01 05:07:03] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-06-01 05:07:03] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1135 variables, 20/834 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-06-01 05:07:03] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 05:07:03] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-06-01 05:07:03] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 05:07:03] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 05:07:03] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-06-01 05:07:03] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 05:07:03] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 05:07:03] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1135 variables, 8/842 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1135 variables, 0/842 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/1136 variables, 1/843 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1136 variables, 0/843 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1682/2818 variables, 1653/2496 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-06-01 05:07:05] [INFO ] Deduced a trap composed of 6 places in 1597 ms of which 20 ms to minimize.
[2024-06-01 05:07:07] [INFO ] Deduced a trap composed of 6 places in 1589 ms of which 19 ms to minimize.
[2024-06-01 05:07:09] [INFO ] Deduced a trap composed of 6 places in 1552 ms of which 21 ms to minimize.
[2024-06-01 05:07:10] [INFO ] Deduced a trap composed of 6 places in 1521 ms of which 17 ms to minimize.
[2024-06-01 05:07:12] [INFO ] Deduced a trap composed of 6 places in 1534 ms of which 18 ms to minimize.
[2024-06-01 05:07:14] [INFO ] Deduced a trap composed of 6 places in 1508 ms of which 17 ms to minimize.
[2024-06-01 05:07:15] [INFO ] Deduced a trap composed of 6 places in 1429 ms of which 18 ms to minimize.
[2024-06-01 05:07:16] [INFO ] Deduced a trap composed of 6 places in 1400 ms of which 16 ms to minimize.
[2024-06-01 05:07:18] [INFO ] Deduced a trap composed of 6 places in 1393 ms of which 16 ms to minimize.
[2024-06-01 05:07:19] [INFO ] Deduced a trap composed of 6 places in 1377 ms of which 17 ms to minimize.
[2024-06-01 05:07:21] [INFO ] Deduced a trap composed of 6 places in 1362 ms of which 16 ms to minimize.
[2024-06-01 05:07:22] [INFO ] Deduced a trap composed of 5 places in 1316 ms of which 15 ms to minimize.
[2024-06-01 05:07:24] [INFO ] Deduced a trap composed of 5 places in 1285 ms of which 16 ms to minimize.
[2024-06-01 05:07:25] [INFO ] Deduced a trap composed of 6 places in 1295 ms of which 15 ms to minimize.
[2024-06-01 05:07:26] [INFO ] Deduced a trap composed of 6 places in 1218 ms of which 16 ms to minimize.
[2024-06-01 05:07:27] [INFO ] Deduced a trap composed of 5 places in 1213 ms of which 16 ms to minimize.
[2024-06-01 05:07:29] [INFO ] Deduced a trap composed of 10 places in 1178 ms of which 16 ms to minimize.
[2024-06-01 05:07:30] [INFO ] Deduced a trap composed of 6 places in 1121 ms of which 15 ms to minimize.
[2024-06-01 05:07:31] [INFO ] Deduced a trap composed of 10 places in 1123 ms of which 15 ms to minimize.
[2024-06-01 05:07:32] [INFO ] Deduced a trap composed of 10 places in 1109 ms of which 15 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2818 variables, 20/2516 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-06-01 05:07:34] [INFO ] Deduced a trap composed of 6 places in 1108 ms of which 14 ms to minimize.
[2024-06-01 05:07:35] [INFO ] Deduced a trap composed of 6 places in 1048 ms of which 14 ms to minimize.
[2024-06-01 05:07:36] [INFO ] Deduced a trap composed of 6 places in 1022 ms of which 14 ms to minimize.
[2024-06-01 05:07:37] [INFO ] Deduced a trap composed of 6 places in 1013 ms of which 21 ms to minimize.
[2024-06-01 05:07:38] [INFO ] Deduced a trap composed of 6 places in 960 ms of which 14 ms to minimize.
[2024-06-01 05:07:39] [INFO ] Deduced a trap composed of 6 places in 952 ms of which 13 ms to minimize.
[2024-06-01 05:07:40] [INFO ] Deduced a trap composed of 5 places in 912 ms of which 12 ms to minimize.
[2024-06-01 05:07:40] [INFO ] Deduced a trap composed of 9 places in 358 ms of which 7 ms to minimize.
[2024-06-01 05:07:41] [INFO ] Deduced a trap composed of 9 places in 355 ms of which 6 ms to minimize.
[2024-06-01 05:07:41] [INFO ] Deduced a trap composed of 8 places in 360 ms of which 7 ms to minimize.
[2024-06-01 05:07:42] [INFO ] Deduced a trap composed of 9 places in 355 ms of which 7 ms to minimize.
[2024-06-01 05:07:42] [INFO ] Deduced a trap composed of 9 places in 353 ms of which 6 ms to minimize.
[2024-06-01 05:07:43] [INFO ] Deduced a trap composed of 9 places in 347 ms of which 7 ms to minimize.
[2024-06-01 05:07:43] [INFO ] Deduced a trap composed of 9 places in 347 ms of which 6 ms to minimize.
[2024-06-01 05:07:43] [INFO ] Deduced a trap composed of 9 places in 348 ms of which 7 ms to minimize.
[2024-06-01 05:07:44] [INFO ] Deduced a trap composed of 9 places in 345 ms of which 7 ms to minimize.
[2024-06-01 05:07:44] [INFO ] Deduced a trap composed of 9 places in 358 ms of which 6 ms to minimize.
[2024-06-01 05:07:45] [INFO ] Deduced a trap composed of 9 places in 346 ms of which 7 ms to minimize.
[2024-06-01 05:07:45] [INFO ] Deduced a trap composed of 9 places in 343 ms of which 7 ms to minimize.
[2024-06-01 05:07:45] [INFO ] Deduced a trap composed of 9 places in 339 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2818 variables, 20/2536 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-06-01 05:07:46] [INFO ] Deduced a trap composed of 9 places in 354 ms of which 6 ms to minimize.
SMT process timed out in 59560ms, After SMT, problems are : Problem set: 5 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 930 out of 2997 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Graph (complete) has 30288 edges and 2997 vertex of which 2964 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.9 ms
Discarding 33 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 176 transitions
Reduce isomorphic transitions removed 176 transitions.
Discarding 58 places :
Implicit places reduction removed 58 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 235 rules applied. Total rules applied 236 place count 2906 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 237 place count 2905 transition count 267
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 58 Pre rules applied. Total rules applied 237 place count 2905 transition count 209
Deduced a syphon composed of 58 places in 1 ms
Ensure Unique test removed 84 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 437 place count 2763 transition count 209
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 438 place count 2762 transition count 209
Applied a total of 438 rules in 388 ms. Remains 2762 /2997 variables (removed 235) and now considering 209/446 (removed 237) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 389 ms. Remains : 2762/2997 places, 209/446 transitions.
RANDOM walk for 40000 steps (2109 resets) in 1375 ms. (29 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (101 resets) in 1005 ms. (39 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 311431 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 1
Probabilistic random walk after 311431 steps, saw 44900 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
// Phase 1: matrix 209 rows 2762 cols
[2024-06-01 05:07:50] [INFO ] Computed 2553 invariants in 56 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/930 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/1017 variables, 870/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1017 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1711/2728 variables, 1682/2552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2728 variables, 0/2552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 209/2937 variables, 2728/5280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2937 variables, 0/5280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2971/2971 variables, and 5314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 16359 ms.
Refiners :[Positive P Invariants (semi-flows): 870/870 constraints, Generalized P Invariants (flows): 1682/1683 constraints, State Equation: 2762/2762 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/930 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/1017 variables, 870/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1017 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1711/2728 variables, 1682/2552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2728 variables, 0/2552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 209/2937 variables, 2728/5280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2937 variables, 0/5280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2971/2971 variables, and 5314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 16270 ms.
Refiners :[Positive P Invariants (semi-flows): 870/870 constraints, Generalized P Invariants (flows): 1682/1683 constraints, State Equation: 2762/2762 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 32747ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 930 out of 2762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2762/2762 places, 209/209 transitions.
Applied a total of 0 rules in 106 ms. Remains 2762 /2762 variables (removed 0) and now considering 209/209 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 2762/2762 places, 209/209 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2762/2762 places, 209/209 transitions.
Applied a total of 0 rules in 252 ms. Remains 2762 /2762 variables (removed 0) and now considering 209/209 (removed 0) transitions.
[2024-06-01 05:08:23] [INFO ] Invariant cache hit.
[2024-06-01 05:08:25] [INFO ] Implicit Places using invariants in 2293 ms returned [2554, 2555, 2556, 2557, 2558, 2559, 2560, 2561, 2562, 2563, 2564, 2565, 2566, 2567, 2568, 2569, 2570, 2571, 2572, 2573, 2574, 2575, 2576, 2577, 2578, 2579, 2580, 2581, 2582, 2612, 2642, 2643, 2644, 2645, 2646, 2647, 2648, 2649, 2650, 2651, 2652, 2653, 2654, 2655, 2656, 2657, 2658, 2659, 2660, 2661, 2662, 2663, 2664, 2665, 2666, 2667, 2668, 2669, 2670]
Discarding 59 places :
Implicit Place search using SMT only with invariants took 2306 ms to find 59 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2703/2762 places, 209/209 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2702 transition count 209
Applied a total of 1 rules in 108 ms. Remains 2702 /2703 variables (removed 1) and now considering 209/209 (removed 0) transitions.
// Phase 1: matrix 209 rows 2702 cols
[2024-06-01 05:08:25] [INFO ] Computed 2494 invariants in 35 ms
[2024-06-01 05:08:28] [INFO ] Implicit Places using invariants in 2343 ms returned []
[2024-06-01 05:08:28] [INFO ] Invariant cache hit.
[2024-06-01 05:08:31] [INFO ] Implicit Places using invariants and state equation in 3324 ms returned [2553, 2554, 2555, 2556, 2557, 2558, 2559, 2560, 2561, 2562, 2563, 2564, 2565, 2566, 2567, 2568, 2569, 2570, 2571, 2572, 2573, 2574, 2575, 2576, 2577, 2578, 2579, 2580, 2581]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 5671 ms to find 29 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 2673/2762 places, 209/209 transitions.
Applied a total of 0 rules in 107 ms. Remains 2673 /2673 variables (removed 0) and now considering 209/209 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 8445 ms. Remains : 2673/2762 places, 209/209 transitions.
Successfully simplified 11 atomic propositions for a total of 7 simplifications.
[2024-06-01 05:08:31] [INFO ] Flatten gal took : 78 ms
[2024-06-01 05:08:31] [INFO ] Flatten gal took : 80 ms
[2024-06-01 05:08:32] [INFO ] Input system was already deterministic with 446 transitions.
Support contains 2822 out of 2997 places (down from 2880) after GAL structural reductions.
Computed a total of 2997 stabilizing places and 446 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2997 transition count 446
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2994 transition count 446
Applied a total of 3 rules in 82 ms. Remains 2994 /2997 variables (removed 3) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 2994/2997 places, 446/446 transitions.
[2024-06-01 05:08:32] [INFO ] Flatten gal took : 65 ms
[2024-06-01 05:08:32] [INFO ] Flatten gal took : 65 ms
[2024-06-01 05:08:32] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Graph (complete) has 30288 edges and 2997 vertex of which 2007 are kept as prefixes of interest. Removing 990 places using SCC suffix rule.18 ms
Discarding 990 places :
Also discarding 60 output transitions
Drop transitions (Output transitions of discarded places.) removed 60 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Iterating post reduction 0 with 57 rules applied. Total rules applied 58 place count 2006 transition count 328
Applied a total of 58 rules in 144 ms. Remains 2006 /2997 variables (removed 991) and now considering 328/446 (removed 118) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 144 ms. Remains : 2006/2997 places, 328/446 transitions.
[2024-06-01 05:08:32] [INFO ] Flatten gal took : 40 ms
[2024-06-01 05:08:32] [INFO ] Flatten gal took : 40 ms
[2024-06-01 05:08:32] [INFO ] Input system was already deterministic with 328 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 2966 transition count 446
Applied a total of 31 rules in 381 ms. Remains 2966 /2997 variables (removed 31) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 381 ms. Remains : 2966/2997 places, 446/446 transitions.
[2024-06-01 05:08:33] [INFO ] Flatten gal took : 58 ms
[2024-06-01 05:08:33] [INFO ] Flatten gal took : 59 ms
[2024-06-01 05:08:33] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 2995 transition count 446
Applied a total of 2 rules in 85 ms. Remains 2995 /2997 variables (removed 2) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 2995/2997 places, 446/446 transitions.
[2024-06-01 05:08:33] [INFO ] Flatten gal took : 57 ms
[2024-06-01 05:08:33] [INFO ] Flatten gal took : 58 ms
[2024-06-01 05:08:33] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 2936 transition count 446
Applied a total of 61 rules in 77 ms. Remains 2936 /2997 variables (removed 61) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 2936/2997 places, 446/446 transitions.
[2024-06-01 05:08:33] [INFO ] Flatten gal took : 55 ms
[2024-06-01 05:08:33] [INFO ] Flatten gal took : 55 ms
[2024-06-01 05:08:33] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Graph (complete) has 30288 edges and 2997 vertex of which 2937 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.11 ms
Discarding 60 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2936 transition count 445
Applied a total of 2 rules in 191 ms. Remains 2936 /2997 variables (removed 61) and now considering 445/446 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 192 ms. Remains : 2936/2997 places, 445/446 transitions.
[2024-06-01 05:08:34] [INFO ] Flatten gal took : 49 ms
[2024-06-01 05:08:34] [INFO ] Flatten gal took : 51 ms
[2024-06-01 05:08:34] [INFO ] Input system was already deterministic with 445 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2997/2997 places, 446/446 transitions.
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 2937 transition count 446
Applied a total of 60 rules in 63 ms. Remains 2937 /2997 variables (removed 60) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 2937/2997 places, 446/446 transitions.
[2024-06-01 05:08:34] [INFO ] Flatten gal took : 54 ms
[2024-06-01 05:08:34] [INFO ] Flatten gal took : 57 ms
[2024-06-01 05:08:34] [INFO ] Input system was already deterministic with 446 transitions.
[2024-06-01 05:08:34] [INFO ] Flatten gal took : 65 ms
[2024-06-01 05:08:34] [INFO ] Flatten gal took : 66 ms
[2024-06-01 05:08:34] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2024-06-01 05:08:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2997 places, 446 transitions and 6488 arcs took 8 ms.
Total runtime 191630 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : QuasiCertifProtocol-COL-28-CTLCardinality-2024-03
Could not compute solution for formula : QuasiCertifProtocol-COL-28-CTLCardinality-2024-05
Could not compute solution for formula : QuasiCertifProtocol-COL-28-CTLCardinality-2024-07
Could not compute solution for formula : QuasiCertifProtocol-COL-28-CTLCardinality-2024-08
Could not compute solution for formula : QuasiCertifProtocol-COL-28-CTLCardinality-2024-11
Could not compute solution for formula : QuasiCertifProtocol-COL-28-CTLCardinality-2024-13
Could not compute solution for formula : QuasiCertifProtocol-COL-28-CTLCardinality-2024-14

BK_STOP 1717218515233

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name QuasiCertifProtocol-COL-28-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/799/ctl_0_
ctl formula name QuasiCertifProtocol-COL-28-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/799/ctl_1_
ctl formula name QuasiCertifProtocol-COL-28-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/799/ctl_2_
ctl formula name QuasiCertifProtocol-COL-28-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/799/ctl_3_
ctl formula name QuasiCertifProtocol-COL-28-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/799/ctl_4_
ctl formula name QuasiCertifProtocol-COL-28-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/799/ctl_5_
ctl formula name QuasiCertifProtocol-COL-28-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/799/ctl_6_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is QuasiCertifProtocol-COL-28, 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 r520-tall-171662337700041"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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