About the Execution of ITS-Tools for FMS-PT-00002
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 332.823 | 8114.00 | 17764.00 | 176.80 | FFTTFTTFTFFFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r130-smll-177955809100465.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is FMS-PT-00002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809100465
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.3K Mar 7 05:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 7 05:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 7 05:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Mar 7 05:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 10:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 7 05:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Mar 7 05:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 7 05:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Mar 7 05:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 10:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 16K Mar 3 18:30 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 FMS-PT-00002-CTLCardinality-2024-00
FORMULA_NAME FMS-PT-00002-CTLCardinality-2024-01
FORMULA_NAME FMS-PT-00002-CTLCardinality-2024-02
FORMULA_NAME FMS-PT-00002-CTLCardinality-2024-03
FORMULA_NAME FMS-PT-00002-CTLCardinality-2024-04
FORMULA_NAME FMS-PT-00002-CTLCardinality-2024-05
FORMULA_NAME FMS-PT-00002-CTLCardinality-2024-06
FORMULA_NAME FMS-PT-00002-CTLCardinality-2024-07
FORMULA_NAME FMS-PT-00002-CTLCardinality-2024-08
FORMULA_NAME FMS-PT-00002-CTLCardinality-2024-09
FORMULA_NAME FMS-PT-00002-CTLCardinality-2024-10
FORMULA_NAME FMS-PT-00002-CTLCardinality-2024-11
FORMULA_NAME FMS-PT-00002-CTLCardinality-2024-12
FORMULA_NAME FMS-PT-00002-CTLCardinality-2024-13
FORMULA_NAME FMS-PT-00002-CTLCardinality-2024-14
FORMULA_NAME FMS-PT-00002-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1779940668724
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FMS-PT-00002
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-28 03:57:51] [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]
[2026-05-28 03:57:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-28 03:57:51] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2026-05-28 03:57:51] [INFO ] Transformed 22 places.
[2026-05-28 03:57:51] [INFO ] Transformed 20 transitions.
[2026-05-28 03:57:51] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 301 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 39 ms.
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 16 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17389784002325631881.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9960427993916362279.kers'
[2026-05-28 03:57:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17389784002325631881.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9960427993916362279.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 20 rows 19 cols 42 entries
Finished phase 1 with 15 SingleSign rule and 1 generalized
[2026-05-28 03:57:51] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9960427993916362279.kers
Total runtime 2 ms.
[2026-05-28 03:57:51] [INFO ] Implicit Places using invariants in 273 ms returned []
[2026-05-28 03:57:51] [INFO ] Invariant cache hit.
[2026-05-28 03:57:52] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2026-05-28 03:57:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/21 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/22 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/42 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 28 constraints, problems are : Problem set: 0 solved, 17 unsolved in 829 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 2/21 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 1/22 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 17/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/42 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 45 constraints, problems are : Problem set: 0 solved, 17 unsolved in 615 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1485ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 1503ms
Finished structural reductions in LTL mode , in 1 iterations and 2014 ms. Remains : 22/22 places, 20/20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2026-05-28 03:57:53] [INFO ] Invariant cache hit.
[2026-05-28 03:57:53] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-28 03:57:53] [INFO ] Invariant cache hit.
[2026-05-28 03:57:53] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 22/22 places, 20/20 transitions.
Support contains 22 out of 22 places after structural reductions.
[2026-05-28 03:57:53] [INFO ] Flatten gal took : 25 ms
[2026-05-28 03:57:53] [INFO ] Flatten gal took : 8 ms
[2026-05-28 03:57:53] [INFO ] Input system was already deterministic with 20 transitions.
RANDOM walk for 40001 steps (8 resets) in 2634 ms. (15 steps per ms) remains 37/88 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
[2026-05-28 03:57:55] [INFO ] Invariant cache hit.
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp81 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 4/4 constraints. Problems are: Problem set: 24 solved, 13 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp72 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/5 constraints. Problems are: Problem set: 33 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 33 solved, 4 unsolved
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp87 is UNSAT
At refinement iteration 3 (OVERLAPS) 1/22 variables, 1/6 constraints. Problems are: Problem set: 35 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 35 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 20/42 variables, 22/28 constraints. Problems are: Problem set: 35 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/28 constraints. Problems are: Problem set: 35 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/42 variables, 0/28 constraints. Problems are: Problem set: 35 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 28 constraints, problems are : Problem set: 35 solved, 2 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 35 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 35 solved, 2 unsolved
Problem AtomicPropp22 is UNSAT
At refinement iteration 1 (OVERLAPS) 7/15 variables, 2/2 constraints. Problems are: Problem set: 36 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 36 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/17 variables, 2/4 constraints. Problems are: Problem set: 36 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 36 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/21 variables, 1/5 constraints. Problems are: Problem set: 36 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/5 constraints. Problems are: Problem set: 36 solved, 1 unsolved
Problem AtomicPropp37 is UNSAT
After SMT solving in domain Int declared 22/42 variables, and 6 constraints, problems are : Problem set: 37 solved, 0 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/22 constraints, PredecessorRefiner: 0/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 198ms problems are : Problem set: 37 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 37 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA FMS-PT-00002-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00002-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00002-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00002-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00002-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-28 03:57:55] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2026-05-28 03:57:55] [INFO ] Flatten gal took : 6 ms
FORMULA FMS-PT-00002-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00002-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-28 03:57:55] [INFO ] Flatten gal took : 5 ms
[2026-05-28 03:57:55] [INFO ] Input system was already deterministic with 20 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2026-05-28 03:57:55] [INFO ] Invariant cache hit.
[2026-05-28 03:57:55] [INFO ] Implicit Places using invariants in 35 ms returned [7, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 41 ms. Remains : 20/22 places, 20/20 transitions.
[2026-05-28 03:57:55] [INFO ] Flatten gal took : 4 ms
[2026-05-28 03:57:55] [INFO ] Flatten gal took : 3 ms
[2026-05-28 03:57:55] [INFO ] Input system was already deterministic with 20 transitions.
[2026-05-28 03:57:55] [INFO ] Flatten gal took : 2 ms
[2026-05-28 03:57:55] [INFO ] Flatten gal took : 3 ms
[2026-05-28 03:57:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality12331703896182974773.gal : 2 ms
[2026-05-28 03:57:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality3548727588676179811.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12331703896182974773.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3548727588676179811.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,3444,0.028646,3868,2,103,5,608,6,0,103,466,0
Converting to forward existential form...Done !
original formula: EG(((A(EX((P1M1<=P2wM2)) U AG((P2M2<=0))) * (P1wP2<=P2wM2)) * A((P1wP2<=M2) U (P2M2<=P1d))))
=> equivalent forward existential formula: [FwdG(Init,((!((E(!(!(E(TRUE U !((P2M2<=0))))) U (!(EX((P1M1<=P2wM2))) * !(!(E(TRUE U !((P2M2<=0))))))) + EG(!(!...295
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 15/0/5
(forward)formula 0,0,0.081677,5412,1,0,13,8447,37,3,529,5436,17
FORMULA FMS-PT-00002-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2026-05-28 03:57:55] [INFO ] Invariant cache hit.
[2026-05-28 03:57:55] [INFO ] Implicit Places using invariants in 47 ms returned [7, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 20/22 places, 20/20 transitions.
[2026-05-28 03:57:55] [INFO ] Flatten gal took : 3 ms
[2026-05-28 03:57:55] [INFO ] Flatten gal took : 2 ms
[2026-05-28 03:57:55] [INFO ] Input system was already deterministic with 20 transitions.
[2026-05-28 03:57:55] [INFO ] Flatten gal took : 2 ms
[2026-05-28 03:57:55] [INFO ] Flatten gal took : 2 ms
[2026-05-28 03:57:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality3561553701601647971.gal : 1 ms
[2026-05-28 03:57:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality4465108712246549694.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3561553701601647971.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4465108712246549694.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,3444,0.006057,3956,2,103,5,608,6,0,103,466,0
Converting to forward existential form...Done !
original formula: EX(EF(AG((P12s>=2))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U !((P12s>=2)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.011946,4228,1,0,6,1724,15,0,451,791,5
FORMULA FMS-PT-00002-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2026-05-28 03:57:55] [INFO ] Invariant cache hit.
[2026-05-28 03:57:55] [INFO ] Implicit Places using invariants in 30 ms returned [7, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 20/22 places, 20/20 transitions.
[2026-05-28 03:57:55] [INFO ] Flatten gal took : 2 ms
[2026-05-28 03:57:55] [INFO ] Flatten gal took : 2 ms
[2026-05-28 03:57:55] [INFO ] Input system was already deterministic with 20 transitions.
[2026-05-28 03:57:55] [INFO ] Flatten gal took : 2 ms
[2026-05-28 03:57:55] [INFO ] Flatten gal took : 2 ms
[2026-05-28 03:57:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality5394466884230125121.gal : 1 ms
[2026-05-28 03:57:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality10823858789880311584.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5394466884230125121.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10823858789880311584.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,3444,0.006069,3972,2,103,5,608,6,0,103,466,0
Converting to forward existential form...Done !
original formula: A((P1wM1<=0) U AG(EX(((EX((P2s<=1)) + AF((P1wP2>=1))) + ((P3s>=1)||(P3M2>=3))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(EX(((EX((P2s<=1)) + !(EG(!((P1wP2>=1))))) + ((P3s>=1)||(P3M2>=3))))))))))) * !(E(!...360
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.018758,4728,1,0,9,2563,31,4,450,1816,9
FORMULA FMS-PT-00002-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2026-05-28 03:57:55] [INFO ] Invariant cache hit.
[2026-05-28 03:57:55] [INFO ] Implicit Places using invariants in 36 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38 ms. Remains : 21/22 places, 20/20 transitions.
[2026-05-28 03:57:55] [INFO ] Flatten gal took : 2 ms
[2026-05-28 03:57:55] [INFO ] Flatten gal took : 2 ms
[2026-05-28 03:57:55] [INFO ] Input system was already deterministic with 20 transitions.
[2026-05-28 03:57:55] [INFO ] Flatten gal took : 2 ms
[2026-05-28 03:57:55] [INFO ] Flatten gal took : 2 ms
[2026-05-28 03:57:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality8509426312520634955.gal : 1 ms
[2026-05-28 03:57:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality5633892773052783148.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality8509426312520634955.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5633892773052783148.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,3444,0.006625,3968,2,106,5,624,6,0,107,478,0
Converting to forward existential form...Done !
original formula: (AX(FALSE) + (EG(EX(EF((M3<=P12M3)))) * (EF(AG((P3s>0))) + AG(EX((P2wP1<=0))))))
=> equivalent forward existential formula: ([((Init * !(!(EX(!(FALSE))))) * !(EG(EX(E(TRUE U (M3<=P12M3))))))] = FALSE * [(FwdU(((Init * !(!(EX(!(FALSE))))...233
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.017707,4528,1,0,9,2741,17,3,516,1763,9
FORMULA FMS-PT-00002-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 5 places and 0 transitions.
Graph (trivial) has 8 edges and 17 vertex of which 3 / 17 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 11 place count 15 transition count 15
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 14 place count 14 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 14 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 12 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 11 transition count 10
Applied a total of 20 rules in 68 ms. Remains 11 /22 variables (removed 11) and now considering 10/20 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6552201242035891995.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3508710732001897030.kers'
[2026-05-28 03:57:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6552201242035891995.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3508710732001897030.kers]
Normalized transition count is 9 out of 10 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 9 rows 8 cols 18 entries
Finished phase 1 with 6 SingleSign rule and 0 generalized
[2026-05-28 03:57:56] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-3508710732001897030.kers
Total runtime 8 ms.
[2026-05-28 03:57:56] [INFO ] Implicit Places using invariants in 42 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 10/22 places, 10/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 114 ms. Remains : 10/22 places, 10/20 transitions.
[2026-05-28 03:57:56] [INFO ] Flatten gal took : 1 ms
[2026-05-28 03:57:56] [INFO ] Flatten gal took : 1 ms
[2026-05-28 03:57:56] [INFO ] Input system was already deterministic with 10 transitions.
[2026-05-28 03:57:56] [INFO ] Flatten gal took : 1 ms
[2026-05-28 03:57:56] [INFO ] Flatten gal took : 1 ms
[2026-05-28 03:57:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality15458880185968269177.gal : 1 ms
[2026-05-28 03:57:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality6955542395033037651.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15458880185968269177.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6955542395033037651.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,117,0.004403,3796,2,30,5,147,6,0,52,94,0
Converting to forward existential form...Done !
original formula: EF(AG(((P3M2>M1)&&(P12M3<1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((P3M2>M1)&&(P12M3<1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.00774,4080,1,0,6,330,15,0,236,209,5
FORMULA FMS-PT-00002-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-532165446954670320.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8671324262642637658.kers'
[2026-05-28 03:57:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-532165446954670320.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8671324262642637658.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 20 rows 19 cols 42 entries
Finished phase 1 with 15 SingleSign rule and 1 generalized
[2026-05-28 03:57:56] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-8671324262642637658.kers
Total runtime 11 ms.
[2026-05-28 03:57:56] [INFO ] Implicit Places using invariants in 75 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 79 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 79 ms. Remains : 21/22 places, 20/20 transitions.
[2026-05-28 03:57:56] [INFO ] Flatten gal took : 2 ms
[2026-05-28 03:57:56] [INFO ] Flatten gal took : 4 ms
[2026-05-28 03:57:56] [INFO ] Input system was already deterministic with 20 transitions.
[2026-05-28 03:57:56] [INFO ] Flatten gal took : 3 ms
[2026-05-28 03:57:56] [INFO ] Flatten gal took : 2 ms
[2026-05-28 03:57:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality12750234007473823676.gal : 1 ms
[2026-05-28 03:57:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality4444710210074393139.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12750234007473823676.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4444710210074393139.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,3444,0.00875,3964,2,106,5,616,6,0,107,469,0
Converting to forward existential form...Done !
original formula: (AG(EF(((M1<=0)||(M2<=P2wP1)))) * (AG(AX(EG((P2wM2>P2)))) + AG((((P2<=0)||(P1>=2))||((P1wP2<=P1d)||(P12M3<=P2wP1))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U ((M1<=0)||(M2<=P2wP1)))))] = FALSE * [(FwdU((Init * !(!(E(TRUE U !(!(EX(!(EG((P2...246
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.039691,4444,1,0,11,2843,25,4,550,1902,12
FORMULA FMS-PT-00002-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2026-05-28 03:57:56] [INFO ] Invariant cache hit.
[2026-05-28 03:57:56] [INFO ] Implicit Places using invariants in 48 ms returned [7, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 20/22 places, 20/20 transitions.
[2026-05-28 03:57:56] [INFO ] Flatten gal took : 2 ms
[2026-05-28 03:57:56] [INFO ] Flatten gal took : 2 ms
[2026-05-28 03:57:56] [INFO ] Input system was already deterministic with 20 transitions.
[2026-05-28 03:57:56] [INFO ] Flatten gal took : 2 ms
[2026-05-28 03:57:56] [INFO ] Flatten gal took : 2 ms
[2026-05-28 03:57:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality7863922764803722383.gal : 1 ms
[2026-05-28 03:57:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality10184233332889419233.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7863922764803722383.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10184233332889419233.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,3444,0.009218,3952,2,103,5,608,6,0,103,466,0
Converting to forward existential form...Done !
original formula: EF(((EX((AX((P1>=2)) * AG((P12wM3<=0)))) * AX(EX((P12s>P1M1)))) * ((P2wP1<=1) + ((!(A(AX((P2wP1<=P3)) U (P3<=P2M2))) * (P12<=2)) * ((P12M...175
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (EX((!(EX(!((P1>=2)))) * !(E(TRUE U !((P12wM3<=0)))))) * !(EX(!(EX((P12s>P1M1))))))) * (P2...571
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.032928,4848,1,0,18,2903,38,4,505,1993,16
FORMULA FMS-PT-00002-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 8 places and 0 transitions.
Graph (trivial) has 11 edges and 14 vertex of which 6 / 14 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 12 rules applied. Total rules applied 17 place count 10 transition count 12
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 25 place count 6 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 25 place count 6 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 27 place count 5 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 28 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 31 place count 3 transition count 5
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 3 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 33 place count 2 transition count 4
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 34 place count 2 transition count 3
Applied a total of 34 rules in 6 ms. Remains 2 /22 variables (removed 20) and now considering 3/20 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2043051704554990047.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15266937590550334989.kers'
[2026-05-28 03:57:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2043051704554990047.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15266937590550334989.kers]
Normalized transition count is 2 out of 3 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 2 rows 1 cols 2 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-28 03:57:56] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15266937590550334989.kers
Total runtime 2 ms.
[2026-05-28 03:57:56] [INFO ] Implicit Places using invariants in 24 ms returned []
[2026-05-28 03:57:56] [INFO ] Invariant cache hit.
[2026-05-28 03:57:56] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2026-05-28 03:57:56] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-28 03:57:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 88ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/22 places, 3/20 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 151 ms. Remains : 2/22 places, 3/20 transitions.
[2026-05-28 03:57:56] [INFO ] Flatten gal took : 1 ms
[2026-05-28 03:57:56] [INFO ] Flatten gal took : 1 ms
[2026-05-28 03:57:56] [INFO ] Input system was already deterministic with 3 transitions.
[2026-05-28 03:57:56] [INFO ] Flatten gal took : 0 ms
[2026-05-28 03:57:56] [INFO ] Flatten gal took : 0 ms
[2026-05-28 03:57:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality16798146879058045695.gal : 0 ms
[2026-05-28 03:57:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality16466586276930729605.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality16798146879058045695.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16466586276930729605.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,3,0.002483,3732,2,5,5,19,5,0,12,10,0
Converting to forward existential form...Done !
original formula: EG(AG(EF((P1s>1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U (P1s>1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.004086,4012,1,0,6,31,16,1,47,18,10
FORMULA FMS-PT-00002-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18409964736661950864.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14308510682190294409.kers'
[2026-05-28 03:57:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18409964736661950864.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14308510682190294409.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 20 rows 19 cols 42 entries
Finished phase 1 with 15 SingleSign rule and 1 generalized
[2026-05-28 03:57:56] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14308510682190294409.kers
Total runtime 0 ms.
[2026-05-28 03:57:56] [INFO ] Implicit Places using invariants in 62 ms returned [7, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 63 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 20/22 places, 20/20 transitions.
[2026-05-28 03:57:56] [INFO ] Flatten gal took : 3 ms
[2026-05-28 03:57:56] [INFO ] Flatten gal took : 3 ms
[2026-05-28 03:57:56] [INFO ] Input system was already deterministic with 20 transitions.
[2026-05-28 03:57:56] [INFO ] Flatten gal took : 3 ms
[2026-05-28 03:57:56] [INFO ] Flatten gal took : 2 ms
[2026-05-28 03:57:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality15023476869221794982.gal : 1 ms
[2026-05-28 03:57:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality1379287007031149382.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.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15023476869221794982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1379287007031149382.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/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,3444,0.00927,3956,2,103,5,608,6,0,103,466,0
Converting to forward existential form...Done !
original formula: (AG(EF(AG(((P2d>P1wM1)&&(P12<2))))) + (AX(FALSE) * AX((P1wM1>0))))
=> equivalent forward existential formula: ([(EY((Init * !(!(E(TRUE U !(E(TRUE U !(E(TRUE U !(((P2d>P1wM1)&&(P12<2)))))))))))) * !(FALSE))] = FALSE * [(EY(...258
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.023677,4264,1,0,11,1991,17,3,481,1108,9
FORMULA FMS-PT-00002-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-28 03:57:56] [INFO ] Flatten gal took : 2 ms
[2026-05-28 03:57:56] [INFO ] Flatten gal took : 2 ms
Total runtime 5718 ms.
BK_STOP 1779940676838
--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="FMS-PT-00002"
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-5973"
echo " Executing tool itstools"
echo " Input is FMS-PT-00002, 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 r130-smll-177955809100465"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FMS-PT-00002.tgz
mv FMS-PT-00002 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 '
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 ;