Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254500721.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
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 r156-tall-174881254500721
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 34K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2025-00
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2025-01
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2025-02
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2025-03
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2025-04
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2025-05
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2025-06
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2025-07
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2025-08
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2025-09
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2025-10
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2025-11
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2025-12
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2025-13
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2025-14
FORMULA_NAME QuasiCertifProtocol-COL-02-CTLCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749122215344

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 202505121319
[2025-06-05 11:16:56] [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]
[2025-06-05 11:16:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 11:16:56] [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.
[2025-06-05 11:16:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-05 11:16:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 582 ms
[2025-06-05 11:16:57] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 86 PT places and 56.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
[2025-06-05 11:16:57] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2025-06-05 11:16:57] [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).
AF dead knowledge conclusive for 1 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 40001 steps (5320 resets) in 1347 ms. (29 steps per ms) remains 54/68 properties
BEST_FIRST walk for 4001 steps (347 resets) in 104 ms. (38 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (273 resets) in 38 ms. (102 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (204 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (279 resets) in 25 ms. (153 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (279 resets) in 25 ms. (153 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (279 resets) in 21 ms. (181 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (281 resets) in 25 ms. (153 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (279 resets) in 22 ms. (173 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (347 resets) in 35 ms. (111 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (275 resets) in 40 ms. (97 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (277 resets) in 30 ms. (129 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (279 resets) in 28 ms. (138 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (280 resets) in 23 ms. (166 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (274 resets) in 23 ms. (166 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (295 resets) in 22 ms. (173 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (274 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (275 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (253 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (281 resets) in 19 ms. (200 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (347 resets) in 23 ms. (166 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (206 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (284 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (281 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (294 resets) in 49 ms. (80 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (201 resets) in 29 ms. (133 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (281 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (278 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (215 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (236 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (287 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (332 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (281 resets) in 21 ms. (181 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (284 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (284 resets) in 14 ms. (266 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (202 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (332 resets) in 18 ms. (210 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (288 resets) in 52 ms. (75 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (281 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (285 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (281 resets) in 17 ms. (222 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (281 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (284 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (189 resets) in 16 ms. (235 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (276 resets) in 20 ms. (190 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (282 resets) in 29 ms. (133 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (278 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (277 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4003 steps (181 resets) in 15 ms. (250 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (332 resets) in 57 ms. (68 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4004 steps (284 resets) in 38 ms. (102 steps per ms) remains 54/54 properties
// Phase 1: matrix 26 rows 30 cols
[2025-06-05 11:16:58] [INFO ] Computed 5 invariants in 9 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 5/5 constraints. Problems are: Problem set: 34 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/5 constraints. Problems are: Problem set: 34 solved, 20 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
At refinement iteration 2 (OVERLAPS) 26/56 variables, 30/35 constraints. Problems are: Problem set: 52 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 52 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 52 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 52 solved, 2 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 52 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 52 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/26 variables, 5/5 constraints. Problems are: Problem set: 52 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 52 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/52 variables, 26/31 constraints. Problems are: Problem set: 52 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/32 constraints. Problems are: Problem set: 52 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/32 constraints. Problems are: Problem set: 52 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 4/56 variables, 4/36 constraints. Problems are: Problem set: 52 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 1/37 constraints. Problems are: Problem set: 52 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/37 constraints. Problems are: Problem set: 52 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/37 constraints. Problems are: Problem set: 52 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 37 constraints, problems are : Problem set: 52 solved, 2 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 2/54 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 486ms problems are : Problem set: 52 solved, 2 unsolved
Finished Parikh walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Parikh walk visited 2 properties in 8 ms.
Successfully simplified 52 atomic propositions for a total of 16 simplifications.
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 11:16:59] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2025-06-05 11:16:59] [INFO ] Flatten gal took : 16 ms
[2025-06-05 11:16:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 11:16:59] [INFO ] Flatten gal took : 4 ms
Domain [tsid(3), tsid(3)] of place n9 breaks symmetries in sort tsid
[2025-06-05 11:16:59] [INFO ] Unfolded HLPN to a Petri net with 86 places and 56 transitions 223 arcs in 7 ms.
[2025-06-05 11:16:59] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Support contains 73 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 4 ms. Remains 86 /86 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 86 cols
[2025-06-05 11:16:59] [INFO ] Computed 31 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:16:59] [INFO ] Implicit Places using invariants in 54 ms returned []
[2025-06-05 11:16:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:16:59] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [52, 53, 54]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 126 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/86 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 137 ms. Remains : 83/86 places, 56/56 transitions.
Support contains 73 out of 83 places after structural reductions.
[2025-06-05 11:16:59] [INFO ] Flatten gal took : 9 ms
[2025-06-05 11:16:59] [INFO ] Flatten gal took : 8 ms
[2025-06-05 11:16:59] [INFO ] Input system was already deterministic with 56 transitions.
RANDOM walk for 40000 steps (6565 resets) in 1316 ms. (30 steps per ms) remains 24/28 properties
BEST_FIRST walk for 4003 steps (221 resets) in 49 ms. (80 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (153 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (214 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (228 resets) in 25 ms. (154 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (264 resets) in 40 ms. (97 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (264 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (218 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (223 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (221 resets) in 21 ms. (181 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (264 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (224 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (225 resets) in 28 ms. (138 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (217 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (228 resets) in 25 ms. (154 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (264 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (174 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (172 resets) in 25 ms. (153 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (225 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (225 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (171 resets) in 27 ms. (142 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (221 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (175 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (264 resets) in 22 ms. (173 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (226 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
// Phase 1: matrix 56 rows 83 cols
[2025-06-05 11:16:59] [INFO ] Computed 28 invariants in 3 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp10 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 14/15 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 23 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 3 (OVERLAPS) 10/71 variables, 2/17 constraints. Problems are: Problem set: 13 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 0/17 constraints. Problems are: Problem set: 13 solved, 11 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 5 (OVERLAPS) 12/83 variables, 11/28 constraints. Problems are: Problem set: 14 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/28 constraints. Problems are: Problem set: 14 solved, 10 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 7 (OVERLAPS) 56/139 variables, 83/111 constraints. Problems are: Problem set: 21 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/111 constraints. Problems are: Problem set: 21 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/139 variables, 0/111 constraints. Problems are: Problem set: 21 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 111 constraints, problems are : Problem set: 21 solved, 3 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 21 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 6/6 constraints. Problems are: Problem set: 21 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 21 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 24/50 variables, 3/9 constraints. Problems are: Problem set: 21 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:00] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:00] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:00] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 3/12 constraints. Problems are: Problem set: 21 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 21 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 24/74 variables, 17/29 constraints. Problems are: Problem set: 21 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:00] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:00] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 2/31 constraints. Problems are: Problem set: 21 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:17:00] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 1/32 constraints. Problems are: Problem set: 21 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 0/32 constraints. Problems are: Problem set: 21 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 56/130 variables, 74/106 constraints. Problems are: Problem set: 21 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 2/108 constraints. Problems are: Problem set: 21 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 0/108 constraints. Problems are: Problem set: 21 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 9/139 variables, 9/117 constraints. Problems are: Problem set: 21 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/139 variables, 2/119 constraints. Problems are: Problem set: 21 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/139 variables, 1/120 constraints. Problems are: Problem set: 21 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/139 variables, 0/120 constraints. Problems are: Problem set: 21 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/139 variables, 0/120 constraints. Problems are: Problem set: 21 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 120 constraints, problems are : Problem set: 21 solved, 3 unsolved in 559 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 83/83 constraints, PredecessorRefiner: 3/24 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 928ms problems are : Problem set: 21 solved, 3 unsolved
Finished Parikh walk after 25 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 3 properties in 17 ms.
Successfully simplified 21 atomic propositions for a total of 6 simplifications.
[2025-06-05 11:17:00] [INFO ] Flatten gal took : 7 ms
[2025-06-05 11:17:00] [INFO ] Flatten gal took : 6 ms
[2025-06-05 11:17:00] [INFO ] Input system was already deterministic with 56 transitions.
Support contains 40 out of 83 places (down from 41) after GAL structural reductions.
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 83 stabilizing places and 56 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 83 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 LTL mode, iteration 0 : 83/83 places, 56/56 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 73 transition count 56
Applied a total of 10 rules in 9 ms. Remains 73 /83 variables (removed 10) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2025-06-05 11:17:00] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:17:00] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-05 11:17:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:17:01] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2025-06-05 11:17:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 1/129 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 93 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1234 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 52/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 1/129 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 145 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2908 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4155ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 4156ms
Starting structural reductions in LTL mode, iteration 1 : 73/83 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4309 ms. Remains : 73/83 places, 56/56 transitions.
[2025-06-05 11:17:05] [INFO ] Flatten gal took : 9 ms
[2025-06-05 11:17:05] [INFO ] Flatten gal took : 4 ms
[2025-06-05 11:17:05] [INFO ] Input system was already deterministic with 56 transitions.
[2025-06-05 11:17:05] [INFO ] Flatten gal took : 3 ms
[2025-06-05 11:17:05] [INFO ] Flatten gal took : 4 ms
[2025-06-05 11:17:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality14142377636266847236.gal : 2 ms
[2025-06-05 11:17:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality10504249158100137019.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14142377636266847236.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10504249158100137019.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,1029,0.029199,4672,2,1337,5,3810,6,0,341,2303,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,0.030208,4672,1,0,6,3810,7,1,457,2303,1
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 83/83 places, 56/56 transitions.
Graph (complete) has 172 edges and 83 vertex of which 30 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.1 ms
Discarding 53 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 30 transition count 28
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 30 transition count 28
Applied a total of 13 rules in 13 ms. Remains 30 /83 variables (removed 53) and now considering 28/56 (removed 28) transitions.
// Phase 1: matrix 28 rows 30 cols
[2025-06-05 11:17:05] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:17:05] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-05 11:17:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:17:05] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:17:05] [INFO ] Redundant transitions in 14 ms returned []
Running 23 sub problems to find dead transitions.
[2025-06-05 11:17:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 28/57 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 1/58 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 0/58 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/58 variables, and 34 constraints, problems are : Problem set: 0 solved, 23 unsolved in 322 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 28/57 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 23/56 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 1/58 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/58 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/58 variables, and 57 constraints, problems are : Problem set: 0 solved, 23 unsolved in 476 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 806ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 806ms
Starting structural reductions in SI_CTL mode, iteration 1 : 30/83 places, 28/56 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 908 ms. Remains : 30/83 places, 28/56 transitions.
[2025-06-05 11:17:06] [INFO ] Flatten gal took : 4 ms
[2025-06-05 11:17:06] [INFO ] Flatten gal took : 3 ms
[2025-06-05 11:17:06] [INFO ] Input system was already deterministic with 28 transitions.
[2025-06-05 11:17:06] [INFO ] Flatten gal took : 2 ms
[2025-06-05 11:17:06] [INFO ] Flatten gal took : 1 ms
[2025-06-05 11:17:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality12218395646466191152.gal : 1 ms
[2025-06-05 11:17:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality4508129968142130893.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12218395646466191152.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4508129968142130893.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,213,0.015646,4036,2,332,5,1017,6,0,142,717,0


Converting to forward existential form...Done !
original formula: EG((((n5_0+n5_1)+n5_2)<=a1))
=> equivalent forward existential formula: [FwdG(Init,(((n5_0+n5_1)+n5_2)<=a1))] != FALSE
Hit Full ! (commute/partial/dont) 21/0/7
(forward)formula 0,1,0.036399,5188,1,0,26,6418,18,4,735,5718,22
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2025-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 56/56 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 73 transition count 56
Applied a total of 10 rules in 2 ms. Remains 73 /83 variables (removed 10) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 73 cols
[2025-06-05 11:17:06] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:17:06] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-05 11:17:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:17:06] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2025-06-05 11:17:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 1/129 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/129 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 93 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1189 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 56/128 variables, 72/92 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 52/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 1/129 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/129 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 145 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2925 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4125ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 4126ms
Starting structural reductions in LTL mode, iteration 1 : 73/83 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4278 ms. Remains : 73/83 places, 56/56 transitions.
[2025-06-05 11:17:10] [INFO ] Flatten gal took : 8 ms
[2025-06-05 11:17:10] [INFO ] Flatten gal took : 4 ms
[2025-06-05 11:17:10] [INFO ] Input system was already deterministic with 56 transitions.
[2025-06-05 11:17:10] [INFO ] Flatten gal took : 4 ms
[2025-06-05 11:17:10] [INFO ] Flatten gal took : 3 ms
[2025-06-05 11:17:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality3959790381025172300.gal : 1 ms
[2025-06-05 11:17:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality5127939728216553106.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3959790381025172300.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5127939728216553106.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
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.021381,4628,2,1337,5,3810,6,0,341,2303,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.022394,4628,1,0,6,3810,7,1,457,2303,1
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 83/83 places, 56/56 transitions.
Graph (complete) has 172 edges and 83 vertex of which 13 are kept as prefixes of interest. Removing 70 places using SCC suffix rule.1 ms
Discarding 70 places :
Also discarding 27 output transitions
Drop transitions (Output transitions of discarded places.) removed 27 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 13 transition count 11
Applied a total of 19 rules in 2 ms. Remains 13 /83 variables (removed 70) and now considering 11/56 (removed 45) transitions.
// Phase 1: matrix 11 rows 13 cols
[2025-06-05 11:17:10] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:17:10] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-05 11:17:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:17:10] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:17:10] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-05 11:17:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 10/21 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 3/24 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/24 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 15 constraints, problems are : Problem set: 0 solved, 6 unsolved in 67 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 10/21 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 3/24 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 21 constraints, problems are : Problem set: 0 solved, 6 unsolved in 85 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 156ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 156ms
Starting structural reductions in SI_CTL mode, iteration 1 : 13/83 places, 11/56 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 216 ms. Remains : 13/83 places, 11/56 transitions.
[2025-06-05 11:17:10] [INFO ] Flatten gal took : 1 ms
[2025-06-05 11:17:10] [INFO ] Flatten gal took : 1 ms
[2025-06-05 11:17:10] [INFO ] Input system was already deterministic with 11 transitions.
[2025-06-05 11:17:10] [INFO ] Flatten gal took : 1 ms
[2025-06-05 11:17:10] [INFO ] Flatten gal took : 1 ms
[2025-06-05 11:17:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality8468632142306866036.gal : 0 ms
[2025-06-05 11:17:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality12366530104072091578.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8468632142306866036.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12366530104072091578.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,65,0.004852,3756,2,68,5,235,6,0,58,186,0


Converting to forward existential form...Done !
original formula: EG((a2<=((n1_0+n1_1)+n1_2)))
=> equivalent forward existential formula: [FwdG(Init,(a2<=((n1_0+n1_1)+n1_2)))] != FALSE
Hit Full ! (commute/partial/dont) 5/0/6
(forward)formula 0,1,0.010808,4012,1,0,17,1237,18,4,299,1108,14
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2025-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 56/56 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 77 transition count 56
Applied a total of 6 rules in 1 ms. Remains 77 /83 variables (removed 6) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 77 cols
[2025-06-05 11:17:10] [INFO ] Computed 22 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:17:10] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-05 11:17:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:17:10] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 52 sub problems to find dead transitions.
[2025-06-05 11:17:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 5/77 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 56/133 variables, 77/99 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 0/133 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 99 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1128 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 5/77 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 56/133 variables, 77/99 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 52/151 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 0/133 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 151 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2394 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 77/77 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3531ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 3532ms
Starting structural reductions in LTL mode, iteration 1 : 77/83 places, 56/56 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3635 ms. Remains : 77/83 places, 56/56 transitions.
[2025-06-05 11:17:14] [INFO ] Flatten gal took : 4 ms
[2025-06-05 11:17:14] [INFO ] Flatten gal took : 4 ms
[2025-06-05 11:17:14] [INFO ] Input system was already deterministic with 56 transitions.
[2025-06-05 11:17:14] [INFO ] Flatten gal took : 3 ms
[2025-06-05 11:17:14] [INFO ] Flatten gal took : 4 ms
[2025-06-05 11:17:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality16741631772163129030.gal : 1 ms
[2025-06-05 11:17:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality5016822344436836352.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.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16741631772163129030.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5016822344436836352.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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.026297,4904,2,1887,5,4456,6,0,350,2919,0


Converting to forward existential form...Done !
original formula: EX(A((AX(AF((Astart<=((n3_0+n3_1)+n3_2)))) + ((!(((CstopAbort<=((s5_0+s5_1)+s5_2))&&(((((n7_0+n7_1)+(n7_2+n7_3))+((n7_4+n7_5)+(n7_6+n7_7)...373
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(EG(!((E(!(((SstopAbort<=((((n9_0+n9_1)+(n9_2+n9_3))+((n9_4+n9_5)+(n9_6+n9_7)))+n9_8))&&(a1<...1273
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.548823,28220,1,0,360,122240,146,218,2573,118325,355
FORMULA QuasiCertifProtocol-COL-02-CTLCardinality-2025-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-05 11:17:15] [INFO ] Flatten gal took : 3 ms
[2025-06-05 11:17:15] [INFO ] Flatten gal took : 4 ms
Total runtime 18575 ms.

BK_STOP 1749122235108

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-5832"
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 r156-tall-174881254500721"
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.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 ;