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.r312-tall-171662337600001.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 itstools
Input is QuasiCertifProtocol-COL-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662337600001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 7.4K Apr 13 03:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 13 03:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 13 03:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 13 03:43 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 3.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 8.1K Apr 13 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 13 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 03:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 13 03:46 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 34K 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-02-CTLCardinality-2024-00
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-01
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-02
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-03
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-04
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-05
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-06
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-07
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-08
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-09
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-10
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-11
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-12
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-13
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-14
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716654854292

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
CTLCardinality COL
Running Version 202405141337
[2024-05-25 16:34:15] [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-25 16:34:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:34:15] [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-25 16:34:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 16:34:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 699 ms
[2024-05-25 16:34:16] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 86 PT places and 56.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
[2024-05-25 16:34:16] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2024-05-25 16:34:16] [INFO ] Skeletonized 16 HLPN properties in 3 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).
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 40000 steps (5347 resets) in 2847 ms. (14 steps per ms) remains 52/85 properties
BEST_FIRST walk for 4002 steps (347 resets) in 117 ms. (33 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (278 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (285 resets) in 44 ms. (88 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (284 resets) in 90 ms. (43 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (266 resets) in 27 ms. (142 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (180 resets) in 38 ms. (102 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (178 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (282 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (288 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (294 resets) in 25 ms. (154 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (280 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (284 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (284 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (288 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (219 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (271 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (282 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (345 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (284 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (348 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (281 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (284 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (273 resets) in 32 ms. (121 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (280 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (284 resets) in 21 ms. (181 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (347 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (276 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (348 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (276 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (148 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (294 resets) in 39 ms. (100 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (274 resets) in 45 ms. (87 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (280 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (297 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (283 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (287 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (281 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (278 resets) in 39 ms. (100 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (281 resets) in 27 ms. (142 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (346 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (280 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (282 resets) in 21 ms. (181 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (275 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (271 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (177 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (364 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (211 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (275 resets) in 28 ms. (138 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (32 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (274 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
// Phase 1: matrix 26 rows 30 cols
[2024-05-25 16:34:18] [INFO ] Computed 5 invariants in 4 ms
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 9 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 9 solved, 43 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp84 is UNSAT
At refinement iteration 2 (OVERLAPS) 4/30 variables, 4/5 constraints. Problems are: Problem set: 36 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 36 solved, 16 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
At refinement iteration 4 (OVERLAPS) 26/56 variables, 30/35 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 51 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 51 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 51 solved, 1 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 51 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/21 variables, 4/4 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/23 variables, 1/5 constraints. Problems are: Problem set: 51 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 51 solved, 1 unsolved
Problem AtomicPropp79 is UNSAT
After SMT solving in domain Int declared 49/56 variables, and 28 constraints, problems are : Problem set: 52 solved, 0 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 23/30 constraints, PredecessorRefiner: 0/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 559ms problems are : Problem set: 52 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 52 atomic propositions for a total of 16 simplifications.
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 16:34:18] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-25 16:34:18] [INFO ] Flatten gal took : 20 ms
[2024-05-25 16:34:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 16:34:18] [INFO ] Flatten gal took : 5 ms
Domain [tsid(3), tsid(3)] of place n9 breaks symmetries in sort tsid
[2024-05-25 16:34:18] [INFO ] Unfolded HLPN to a Petri net with 86 places and 56 transitions 223 arcs in 9 ms.
[2024-05-25 16:34:18] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Support contains 86 out of 86 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Applied a total of 0 rules in 5 ms. Remains 86 /86 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 86 cols
[2024-05-25 16:34:18] [INFO ] Computed 31 invariants in 3 ms
[2024-05-25 16:34:18] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-25 16:34:18] [INFO ] Invariant cache hit.
[2024-05-25 16:34:18] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 16:34:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 11/86 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 56/142 variables, 86/117 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/142 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 117 constraints, problems are : Problem set: 0 solved, 52 unsolved in 904 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 11/86 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-25 16:34:20] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 8 ms to minimize.
[2024-05-25 16:34:20] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-25 16:34:20] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 2 ms to minimize.
[2024-05-25 16:34:20] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-25 16:34:20] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-25 16:34:20] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 56/142 variables, 86/123 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 52/175 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 0/142 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 175 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1283 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 6/6 constraints]
After SMT, in 2215ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 2216ms
Finished structural reductions in LTL mode , in 1 iterations and 2340 ms. Remains : 86/86 places, 56/56 transitions.
Support contains 86 out of 86 places after structural reductions.
[2024-05-25 16:34:21] [INFO ] Flatten gal took : 9 ms
[2024-05-25 16:34:21] [INFO ] Flatten gal took : 8 ms
[2024-05-25 16:34:21] [INFO ] Input system was already deterministic with 56 transitions.
RANDOM walk for 40000 steps (6569 resets) in 701 ms. (56 steps per ms) remains 45/60 properties
BEST_FIRST walk for 4000 steps (264 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (229 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (98 resets) in 13 ms. (286 steps per ms) remains 35/45 properties
BEST_FIRST walk for 4004 steps (100 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (223 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (229 resets) in 35 ms. (111 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (218 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (220 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (223 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (219 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (223 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (218 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (213 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (264 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (220 resets) in 29 ms. (133 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (264 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (224 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (140 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (217 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (223 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (225 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (214 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (221 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (217 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (231 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (227 resets) in 29 ms. (133 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (221 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (102 resets) in 9 ms. (400 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (264 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (150 resets) in 12 ms. (307 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (224 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (37 resets) in 11 ms. (333 steps per ms) remains 32/35 properties
BEST_FIRST walk for 4003 steps (222 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (219 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (219 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
[2024-05-25 16:34:21] [INFO ] Invariant cache hit.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp47 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 14/15 constraints. Problems are: Problem set: 5 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/15 constraints. Problems are: Problem set: 5 solved, 27 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp59 is UNSAT
At refinement iteration 3 (OVERLAPS) 11/77 variables, 6/21 constraints. Problems are: Problem set: 21 solved, 11 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp53 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 6/27 constraints. Problems are: Problem set: 23 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/27 constraints. Problems are: Problem set: 23 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 3/80 variables, 2/29 constraints. Problems are: Problem set: 23 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/29 constraints. Problems are: Problem set: 23 solved, 9 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
At refinement iteration 8 (OVERLAPS) 56/136 variables, 80/109 constraints. Problems are: Problem set: 31 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/109 constraints. Problems are: Problem set: 31 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/142 variables, 6/115 constraints. Problems are: Problem set: 31 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/142 variables, 2/117 constraints. Problems are: Problem set: 31 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/142 variables, 0/117 constraints. Problems are: Problem set: 31 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/142 variables, 0/117 constraints. Problems are: Problem set: 31 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 117 constraints, problems are : Problem set: 31 solved, 1 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 86/86 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 31 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 31 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/47 variables, 6/6 constraints. Problems are: Problem set: 31 solved, 1 unsolved
[2024-05-25 16:34:21] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-25 16:34:22] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 2/8 constraints. Problems are: Problem set: 31 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 31 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 6/53 variables, 1/9 constraints. Problems are: Problem set: 31 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 6/15 constraints. Problems are: Problem set: 31 solved, 1 unsolved
[2024-05-25 16:34:22] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-25 16:34:22] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 2/17 constraints. Problems are: Problem set: 31 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 31 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 15/68 variables, 12/29 constraints. Problems are: Problem set: 31 solved, 1 unsolved
[2024-05-25 16:34:22] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-25 16:34:22] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-25 16:34:22] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/68 variables, 3/32 constraints. Problems are: Problem set: 31 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 0/32 constraints. Problems are: Problem set: 31 solved, 1 unsolved
Problem AtomicPropp54 is UNSAT
After SMT solving in domain Int declared 124/142 variables, and 100 constraints, problems are : Problem set: 32 solved, 0 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 18/24 constraints, State Equation: 68/86 constraints, PredecessorRefiner: 0/32 constraints, Known Traps: 7/7 constraints]
After SMT, in 512ms problems are : Problem set: 32 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 32 atomic propositions for a total of 9 simplifications.
[2024-05-25 16:34:22] [INFO ] Flatten gal took : 6 ms
[2024-05-25 16:34:22] [INFO ] Flatten gal took : 6 ms
[2024-05-25 16:34:22] [INFO ] Input system was already deterministic with 56 transitions.
Support contains 79 out of 86 places (down from 85) after GAL structural reductions.
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 86 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 56
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 SI_CTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Graph (complete) has 184 edges and 86 vertex of which 23 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.1 ms
Discarding 63 places :
Also discarding 22 output transitions
Drop transitions (Output transitions of discarded places.) removed 22 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 22 transition count 19
Applied a total of 15 rules in 18 ms. Remains 22 /86 variables (removed 64) and now considering 19/56 (removed 37) transitions.
// Phase 1: matrix 19 rows 22 cols
[2024-05-25 16:34:22] [INFO ] Computed 4 invariants in 3 ms
[2024-05-25 16:34:22] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-25 16:34:22] [INFO ] Invariant cache hit.
[2024-05-25 16:34:22] [INFO ] Implicit Places using invariants and state equation in 32 ms returned [10, 11, 12]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 67 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 19/86 places, 19/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 19/19 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 87 ms. Remains : 19/86 places, 19/56 transitions.
[2024-05-25 16:34:22] [INFO ] Flatten gal took : 1 ms
[2024-05-25 16:34:22] [INFO ] Flatten gal took : 1 ms
[2024-05-25 16:34:22] [INFO ] Input system was already deterministic with 19 transitions.
[2024-05-25 16:34:22] [INFO ] Flatten gal took : 1 ms
[2024-05-25 16:34:22] [INFO ] Flatten gal took : 1 ms
[2024-05-25 16:34:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality5468267068891160.gal : 2 ms
[2024-05-25 16:34:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality15085937600575324066.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5468267068891160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15085937600575324066.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,148,0.013942,3324,2,136,5,509,6,0,89,351,0


Converting to forward existential form...Done !
original formula: EG(AF((a3<=a2)))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((a3<=a2)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t16, Intersection with reachable at each step enable...204
(forward)formula 0,1,0.024957,3936,1,0,67,3998,61,24,544,3718,55
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 79 transition count 56
Applied a total of 7 rules in 3 ms. Remains 79 /86 variables (removed 7) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 79 cols
[2024-05-25 16:34:22] [INFO ] Computed 24 invariants in 6 ms
[2024-05-25 16:34:22] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-25 16:34:22] [INFO ] Invariant cache hit.
[2024-05-25 16:34:22] [INFO ] Implicit Places using invariants and state equation in 67 ms returned [51, 52, 53]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 131 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/86 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137 ms. Remains : 76/86 places, 56/56 transitions.
[2024-05-25 16:34:22] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:34:22] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:34:22] [INFO ] Input system was already deterministic with 56 transitions.
[2024-05-25 16:34:22] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:34:22] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:34:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality983296318083144861.gal : 2 ms
[2024-05-25 16:34:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality7345149773653505050.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality983296318083144861.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7345149773653505050.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1029,0.024456,4460,2,1786,5,4398,6,0,349,2785,0


Converting to forward existential form...Done !
original formula: EG((A((AstopAbort<=SstopAbort) U (((((n7_0+n7_1)+(n7_2+n7_3))+((n7_4+n7_5)+(n7_6+n7_7)))+n7_8)<=a5)) + (EF(EX(TRUE)) * ((((((n9_0+n9_1)+(...253
=> equivalent forward existential formula: [FwdG(Init,(!((E(!((((((n7_0+n7_1)+(n7_2+n7_3))+((n7_4+n7_5)+(n7_6+n7_7)))+n7_8)<=a5)) U (!((AstopAbort<=SstopAb...463
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...295
(forward)formula 0,1,0.557156,25952,1,0,300,103240,148,154,2507,105939,267
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 79 transition count 56
Applied a total of 7 rules in 1 ms. Remains 79 /86 variables (removed 7) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 79 cols
[2024-05-25 16:34:23] [INFO ] Computed 25 invariants in 1 ms
[2024-05-25 16:34:23] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-25 16:34:23] [INFO ] Invariant cache hit.
[2024-05-25 16:34:23] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 16:34:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 3/78 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 56/134 variables, 78/103 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 1/135 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 104 constraints, problems are : Problem set: 0 solved, 52 unsolved in 789 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 3/78 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 56/134 variables, 78/103 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 52/155 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 1/135 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 0/135 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 156 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1058 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1862ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1863ms
Starting structural reductions in LTL mode, iteration 1 : 79/86 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2003 ms. Remains : 79/86 places, 56/56 transitions.
[2024-05-25 16:34:25] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:34:25] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:34:25] [INFO ] Input system was already deterministic with 56 transitions.
[2024-05-25 16:34:25] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:34:25] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:34:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality7701813969107106588.gal : 2 ms
[2024-05-25 16:34:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality17521042024445256753.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7701813969107106588.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17521042024445256753.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1029,0.022779,4204,2,1452,5,3936,6,0,353,2216,0


Converting to forward existential form...Done !
original formula: ((EX(AF(((((n2_0+n2_1)+n2_2)>((s4_0+s4_1)+s4_2))&&(Astart<29)))) * EX((((s6_0+s6_1)+s6_2)<=((s3_0+s3_1)+s3_2)))) * EF(((AX(FALSE) + ((AX(...610
=> equivalent forward existential formula: ([((FwdU((Init * (EX(!(EG(!(((((n2_0+n2_1)+n2_2)>((s4_0+s4_1)+s4_2))&&(Astart<29)))))) * EX((((s6_0+s6_1)+s6_2)<...896
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...285
(forward)formula 0,1,0.447859,23796,1,0,261,110876,137,109,2390,97003,241
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Graph (complete) has 184 edges and 86 vertex of which 23 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.0 ms
Discarding 63 places :
Also discarding 22 output transitions
Drop transitions (Output transitions of discarded places.) removed 22 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 23 transition count 20
Applied a total of 15 rules in 3 ms. Remains 23 /86 variables (removed 63) and now considering 20/56 (removed 36) transitions.
// Phase 1: matrix 20 rows 23 cols
[2024-05-25 16:34:25] [INFO ] Computed 4 invariants in 4 ms
[2024-05-25 16:34:25] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-25 16:34:25] [INFO ] Invariant cache hit.
[2024-05-25 16:34:25] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-25 16:34:25] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-25 16:34:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 20/42 variables, 22/26 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 27 constraints, problems are : Problem set: 0 solved, 15 unsolved in 129 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 20/42 variables, 22/26 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 15/41 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 1/43 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 42 constraints, problems are : Problem set: 0 solved, 15 unsolved in 142 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 276ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 277ms
Starting structural reductions in SI_CTL mode, iteration 1 : 23/86 places, 20/56 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 342 ms. Remains : 23/86 places, 20/56 transitions.
[2024-05-25 16:34:25] [INFO ] Flatten gal took : 2 ms
[2024-05-25 16:34:25] [INFO ] Flatten gal took : 2 ms
[2024-05-25 16:34:25] [INFO ] Input system was already deterministic with 20 transitions.
[2024-05-25 16:34:25] [INFO ] Flatten gal took : 2 ms
[2024-05-25 16:34:25] [INFO ] Flatten gal took : 2 ms
[2024-05-25 16:34:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality10940947081127288332.gal : 0 ms
[2024-05-25 16:34:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality16503446383848780661.ctl : 2 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10940947081127288332.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16503446383848780661.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,153,0.008191,3468,2,185,5,612,6,0,106,505,0


Converting to forward existential form...Done !
original formula: AF(EG((a1<=((n4_0+n4_1)+n4_2))))
=> equivalent forward existential formula: [FwdG(Init,!(EG((a1<=((n4_0+n4_1)+n4_2)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t16, Intersection with reachable at each step enable...204
dead was empty
(forward)formula 0,1,0.033123,4840,1,0,97,7702,61,40,655,8215,86
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 78 transition count 56
Applied a total of 8 rules in 5 ms. Remains 78 /86 variables (removed 8) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 78 cols
[2024-05-25 16:34:26] [INFO ] Computed 23 invariants in 9 ms
[2024-05-25 16:34:26] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-25 16:34:26] [INFO ] Invariant cache hit.
[2024-05-25 16:34:26] [INFO ] Implicit Places using invariants and state equation in 80 ms returned [51, 52, 53]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 160 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 75/86 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 167 ms. Remains : 75/86 places, 56/56 transitions.
[2024-05-25 16:34:26] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:34:26] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:34:26] [INFO ] Input system was already deterministic with 56 transitions.
[2024-05-25 16:34:26] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:34:26] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:34:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality15512067280571047226.gal : 1 ms
[2024-05-25 16:34:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality2060657903789064739.ctl : 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15512067280571047226.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2060657903789064739.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1029,0.025171,4456,2,1594,5,4272,6,0,348,2587,0


Converting to forward existential form...Done !
original formula: EX(EG((AstopAbort<=CstopAbort)))
=> equivalent forward existential formula: [FwdG(EY(Init),(AstopAbort<=CstopAbort))] != FALSE
Hit Full ! (commute/partial/dont) 48/0/8
(forward)formula 0,1,0.208121,13432,1,0,41,40850,18,4,1828,26193,38
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 79 transition count 56
Applied a total of 7 rules in 4 ms. Remains 79 /86 variables (removed 7) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 79 cols
[2024-05-25 16:34:26] [INFO ] Computed 25 invariants in 1 ms
[2024-05-25 16:34:26] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-25 16:34:26] [INFO ] Invariant cache hit.
[2024-05-25 16:34:26] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2024-05-25 16:34:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 3/78 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 56/134 variables, 78/103 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 1/135 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 104 constraints, problems are : Problem set: 0 solved, 52 unsolved in 832 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 3/78 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 56/134 variables, 78/103 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 52/155 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 1/135 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/135 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 0/135 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 156 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1031 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 79/79 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 1875ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1876ms
Starting structural reductions in LTL mode, iteration 1 : 79/86 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2001 ms. Remains : 79/86 places, 56/56 transitions.
[2024-05-25 16:34:28] [INFO ] Flatten gal took : 6 ms
[2024-05-25 16:34:28] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:34:28] [INFO ] Input system was already deterministic with 56 transitions.
[2024-05-25 16:34:28] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:34:28] [INFO ] Flatten gal took : 4 ms
[2024-05-25 16:34:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality15800862764264707432.gal : 1 ms
[2024-05-25 16:34:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality6594766221209660764.ctl : 0 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15800862764264707432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6594766221209660764.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1029,0.022485,4200,2,1452,5,3936,6,0,353,2216,0


Converting to forward existential form...Done !
original formula: (AG(EF((((Cstart_0+Cstart_1)+Cstart_2)>((CstopOK_0+CstopOK_1)+CstopOK_2)))) + AX(((((n2_0+n2_1)+n2_2)<=((((n8_0+n8_1)+(n8_2+n8_3))+((n8_4...215
=> equivalent forward existential formula: ([(EY((Init * !(!(E(TRUE U !(E(TRUE U (((Cstart_0+Cstart_1)+Cstart_2)>((CstopOK_0+CstopOK_1)+CstopOK_2))))))))) ...409
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...285
(forward)formula 0,0,0.31162,18168,1,0,183,75189,139,66,2308,60617,162
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 56/56 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 79 transition count 56
Applied a total of 7 rules in 4 ms. Remains 79 /86 variables (removed 7) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 79 cols
[2024-05-25 16:34:28] [INFO ] Computed 25 invariants in 1 ms
[2024-05-25 16:34:28] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-25 16:34:28] [INFO ] Invariant cache hit.
[2024-05-25 16:34:28] [INFO ] Implicit Places using invariants and state equation in 98 ms returned [49, 50, 51]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 153 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 76/86 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 158 ms. Remains : 76/86 places, 56/56 transitions.
[2024-05-25 16:34:28] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:34:28] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:34:28] [INFO ] Input system was already deterministic with 56 transitions.
[2024-05-25 16:34:28] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:34:28] [INFO ] Flatten gal took : 3 ms
[2024-05-25 16:34:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality17846144256478517826.gal : 1 ms
[2024-05-25 16:34:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality2551121039724946848.ctl : 0 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-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17846144256478517826.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2551121039724946848.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1029,0.027185,4452,2,1542,5,4170,6,0,344,2392,0


Converting to forward existential form...Done !
original formula: EX(AF((EG((a2<=((n3_0+n3_1)+n3_2))) * (((n1_0+n1_1)+n1_2)>((SstopOK_0+SstopOK_1)+SstopOK_2)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((EG((a2<=((n3_0+n3_1)+n3_2))) * (((n1_0+n1_1)+n1_2)>((SstopOK_0+SstopOK_1)+SstopOK_2)))))))]...164
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...300
(forward)formula 0,1,0.591829,27056,1,0,326,134087,137,152,2220,119222,293
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

[2024-05-25 16:34:29] [INFO ] Flatten gal took : 7 ms
[2024-05-25 16:34:29] [INFO ] Flatten gal took : 6 ms
Total runtime 14080 ms.

BK_STOP 1716654869629

--------------------
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="QuasiCertifProtocol-COL-02"
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 QuasiCertifProtocol-COL-02, 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 r312-tall-171662337600001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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