About the Execution of ITS-Tools for NoC3x3-PT-3A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | FFFTTFTT?TTTFTFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r142-tall-174876812100185.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 NoC3x3-PT-3A, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-tall-174876812100185
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K 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.1K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 9.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 133K 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 NoC3x3-PT-3A-CTLCardinality-2023-12
FORMULA_NAME NoC3x3-PT-3A-CTLCardinality-2023-13
FORMULA_NAME NoC3x3-PT-3A-CTLCardinality-2023-14
FORMULA_NAME NoC3x3-PT-3A-CTLCardinality-2023-15
FORMULA_NAME NoC3x3-PT-3A-CTLCardinality-2025-00
FORMULA_NAME NoC3x3-PT-3A-CTLCardinality-2025-01
FORMULA_NAME NoC3x3-PT-3A-CTLCardinality-2025-02
FORMULA_NAME NoC3x3-PT-3A-CTLCardinality-2025-03
FORMULA_NAME NoC3x3-PT-3A-CTLCardinality-2025-04
FORMULA_NAME NoC3x3-PT-3A-CTLCardinality-2025-05
FORMULA_NAME NoC3x3-PT-3A-CTLCardinality-2025-06
FORMULA_NAME NoC3x3-PT-3A-CTLCardinality-2025-07
FORMULA_NAME NoC3x3-PT-3A-CTLCardinality-2025-08
FORMULA_NAME NoC3x3-PT-3A-CTLCardinality-2025-09
FORMULA_NAME NoC3x3-PT-3A-CTLCardinality-2025-10
FORMULA_NAME NoC3x3-PT-3A-CTLCardinality-2025-11
=== Now, execution of the tool begins
BK_START 1748818392060
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-3A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202505121319
[2025-06-01 22:53:13] [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-01 22:53:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 22:53:13] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2025-06-01 22:53:13] [INFO ] Transformed 370 places.
[2025-06-01 22:53:13] [INFO ] Transformed 450 transitions.
[2025-06-01 22:53:13] [INFO ] Found NUPN structural information;
[2025-06-01 22:53:13] [INFO ] Parsed PT model containing 370 places and 450 transitions and 1773 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA NoC3x3-PT-3A-CTLCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 370/370 places, 449/449 transitions.
Ensure Unique test removed 17 places
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 353 transition count 449
Discarding 88 places :
Symmetric choice reduction at 1 with 88 rule applications. Total rules 105 place count 265 transition count 339
Ensure Unique test removed 30 places
Iterating global reduction 1 with 118 rules applied. Total rules applied 223 place count 235 transition count 339
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 278 place count 235 transition count 284
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 302 place count 235 transition count 260
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 311 place count 226 transition count 260
Applied a total of 311 rules in 62 ms. Remains 226 /370 variables (removed 144) and now considering 260/449 (removed 189) transitions.
[2025-06-01 22:53:13] [INFO ] Flow matrix only has 250 transitions (discarded 10 similar events)
// Phase 1: matrix 250 rows 226 cols
[2025-06-01 22:53:13] [INFO ] Computed 71 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:53:13] [INFO ] Implicit Places using invariants in 289 ms returned [20, 45, 93, 129, 131, 132, 164, 182, 186, 187]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 321 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 216/370 places, 260/449 transitions.
Applied a total of 0 rules in 18 ms. Remains 216 /216 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 414 ms. Remains : 216/370 places, 260/449 transitions.
Support contains 66 out of 216 places after structural reductions.
[2025-06-01 22:53:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2025-06-01 22:53:14] [INFO ] Flatten gal took : 43 ms
[2025-06-01 22:53:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA NoC3x3-PT-3A-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-3A-CTLCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 22:53:14] [INFO ] Flatten gal took : 21 ms
[2025-06-01 22:53:14] [INFO ] Input system was already deterministic with 260 transitions.
Support contains 47 out of 216 places (down from 66) after GAL structural reductions.
FORMULA NoC3x3-PT-3A-CTLCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 35723 steps (8 resets) in 1348 ms. (26 steps per ms) remains 0/26 properties
[2025-06-01 22:53:14] [INFO ] Flatten gal took : 15 ms
[2025-06-01 22:53:14] [INFO ] Flatten gal took : 14 ms
[2025-06-01 22:53:14] [INFO ] Input system was already deterministic with 260 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 260/260 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 260
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 27 place count 189 transition count 232
Ensure Unique test removed 3 places
Iterating global reduction 1 with 29 rules applied. Total rules applied 56 place count 186 transition count 232
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 72 place count 186 transition count 216
Applied a total of 72 rules in 9 ms. Remains 186 /216 variables (removed 30) and now considering 216/260 (removed 44) transitions.
[2025-06-01 22:53:14] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
// Phase 1: matrix 208 rows 186 cols
[2025-06-01 22:53:14] [INFO ] Computed 57 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:53:14] [INFO ] Implicit Places using invariants in 114 ms returned []
[2025-06-01 22:53:14] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2025-06-01 22:53:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:53:14] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 22:53:15] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2025-06-01 22:53:15] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2025-06-01 22:53:15] [INFO ] Invariant cache hit.
[2025-06-01 22:53:15] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 207/393 variables, 186/243 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 9/252 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 1/394 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/394 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 253 constraints, problems are : Problem set: 0 solved, 215 unsolved in 9632 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 186/186 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 207/393 variables, 186/243 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 9/252 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 215/467 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 1/394 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (OVERLAPS) 0/394 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 468 constraints, problems are : Problem set: 0 solved, 215 unsolved in 21448 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 186/186 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31144ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 31154ms
Starting structural reductions in LTL mode, iteration 1 : 186/216 places, 216/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31451 ms. Remains : 186/216 places, 216/260 transitions.
[2025-06-01 22:53:46] [INFO ] Flatten gal took : 13 ms
[2025-06-01 22:53:46] [INFO ] Flatten gal took : 12 ms
[2025-06-01 22:53:46] [INFO ] Input system was already deterministic with 216 transitions.
[2025-06-01 22:53:46] [INFO ] Flatten gal took : 11 ms
[2025-06-01 22:53:46] [INFO ] Flatten gal took : 10 ms
[2025-06-01 22:53:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality11097429645460008.gal : 4 ms
[2025-06-01 22:53:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality7795321289937185401.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11097429645460008.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7795321289937185401.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 -...281
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.76315e+22,0.442332,21908,2,1635,5,95368,6,0,953,91746,0
Converting to forward existential form...Done !
original formula: AG(EX(AF((((p307==0)&&(p230==0))&&(p75==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EG(!((((p307==0)&&(p230==0))&&(p75==1))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.959974,32424,1,0,10,190219,19,3,4621,91746,8
FORMULA NoC3x3-PT-3A-CTLCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 216/216 places, 260/260 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 214 transition count 194
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 155 place count 141 transition count 177
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 155 place count 141 transition count 176
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 158 place count 139 transition count 176
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 158 place count 139 transition count 175
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 160 place count 138 transition count 175
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 172 place count 126 transition count 162
Ensure Unique test removed 3 places
Iterating global reduction 2 with 15 rules applied. Total rules applied 187 place count 123 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
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 2 with 7 rules applied. Total rules applied 194 place count 123 transition count 155
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 197 place count 120 transition count 155
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 200 place count 120 transition count 152
Applied a total of 200 rules in 29 ms. Remains 120 /216 variables (removed 96) and now considering 152/260 (removed 108) transitions.
[2025-06-01 22:53:47] [INFO ] Flow matrix only has 151 transitions (discarded 1 similar events)
// Phase 1: matrix 151 rows 120 cols
[2025-06-01 22:53:47] [INFO ] Computed 48 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:53:47] [INFO ] Implicit Places using invariants in 57 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 58 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 119/216 places, 152/260 transitions.
Applied a total of 0 rules in 4 ms. Remains 119 /119 variables (removed 0) and now considering 152/152 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 91 ms. Remains : 119/216 places, 152/260 transitions.
[2025-06-01 22:53:47] [INFO ] Flatten gal took : 6 ms
[2025-06-01 22:53:47] [INFO ] Flatten gal took : 6 ms
[2025-06-01 22:53:47] [INFO ] Input system was already deterministic with 152 transitions.
[2025-06-01 22:53:47] [INFO ] Flatten gal took : 6 ms
[2025-06-01 22:53:47] [INFO ] Flatten gal took : 6 ms
[2025-06-01 22:53:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality18202464764119133720.gal : 3 ms
[2025-06-01 22:53:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality2675163455124551142.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/CTLCardinality18202464764119133720.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2675163455124551142.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,6.49984e+17,0.054653,6196,2,307,5,11707,5,0,629,11993,0
Converting to forward existential form...Done !
original formula: AF(((EF((AG(((p219==0)&&(p250==1))) + (p154==1))) * (p181==0)) * ((p157==0)||(p108==1))))
=> equivalent forward existential formula: [FwdG(Init,!(((E(TRUE U (!(E(TRUE U !(((p219==0)&&(p250==1))))) + (p154==1))) * (p181==0)) * ((p157==0)||(p108==...170
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.117921,7860,1,0,13,23717,22,4,3081,11993,12
FORMULA NoC3x3-PT-3A-CTLCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 260/260 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 260
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 191 transition count 234
Ensure Unique test removed 3 places
Iterating global reduction 1 with 27 rules applied. Total rules applied 52 place count 188 transition count 234
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 67 place count 188 transition count 219
Applied a total of 67 rules in 9 ms. Remains 188 /216 variables (removed 28) and now considering 219/260 (removed 41) transitions.
[2025-06-01 22:53:47] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
// Phase 1: matrix 211 rows 188 cols
[2025-06-01 22:53:47] [INFO ] Computed 57 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:53:47] [INFO ] Implicit Places using invariants in 87 ms returned []
[2025-06-01 22:53:47] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
[2025-06-01 22:53:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:53:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 22:53:47] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2025-06-01 22:53:47] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
[2025-06-01 22:53:47] [INFO ] Invariant cache hit.
[2025-06-01 22:53:47] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 210/398 variables, 188/245 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 1/399 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 0/399 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 255 constraints, problems are : Problem set: 0 solved, 218 unsolved in 9699 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 188/188 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (OVERLAPS) 210/398 variables, 188/245 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 218/472 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (OVERLAPS) 1/399 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (OVERLAPS) 0/399 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/399 variables, and 473 constraints, problems are : Problem set: 0 solved, 218 unsolved in 19806 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 188/188 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29538ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 29541ms
Starting structural reductions in LTL mode, iteration 1 : 188/216 places, 219/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29802 ms. Remains : 188/216 places, 219/260 transitions.
[2025-06-01 22:54:17] [INFO ] Flatten gal took : 13 ms
[2025-06-01 22:54:17] [INFO ] Flatten gal took : 10 ms
[2025-06-01 22:54:17] [INFO ] Input system was already deterministic with 219 transitions.
[2025-06-01 22:54:17] [INFO ] Flatten gal took : 10 ms
[2025-06-01 22:54:17] [INFO ] Flatten gal took : 9 ms
[2025-06-01 22:54:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality8995753589697864965.gal : 2 ms
[2025-06-01 22:54:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality2696468094365536590.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/CTLCardinality8995753589697864965.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2696468094365536590.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,1.10922e+23,0.541139,25452,2,1644,5,113470,6,0,964,112352,0
Converting to forward existential form...Done !
original formula: AF(AX(AF(((((p197==0)&&(p72==1))||((p352==0)&&(p329==1)))&&((p289==1)||(p96==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(!(EG(!(((((p197==0)&&(p72==1))||((p352==0)&&(p329==1)))&&((p289==1)||(p96==1)))))))))))] = F...159
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-01 22:54:47] [INFO ] Flatten gal took : 10 ms
[2025-06-01 22:54:47] [INFO ] Applying decomposition
[2025-06-01 22:54:47] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13154828949290387615.txt' '-o' '/tmp/graph13154828949290387615.bin' '-w' '/tmp/graph13154828949290387615.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13154828949290387615.bin' '-l' '-1' '-v' '-w' '/tmp/graph13154828949290387615.weights' '-q' '0' '-e' '0.001'
[2025-06-01 22:54:47] [INFO ] Decomposing Gal with order
[2025-06-01 22:54:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 22:54:47] [INFO ] Removed a total of 51 redundant transitions.
[2025-06-01 22:54:47] [INFO ] Flatten gal took : 46 ms
[2025-06-01 22:54:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 10 ms.
[2025-06-01 22:54:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality16550360994061344459.gal : 5 ms
[2025-06-01 22:54:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality11447260042193715074.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/CTLCardinality16550360994061344459.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11447260042193715074.ctl'
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 -...264
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,1.10922e+23,0.238879,14412,393,70,17794,798,601,50414,96,2689,0
Converting to forward existential form...Done !
original formula: AF(AX(AF(((((i4.i1.u24.p197==0)&&(i2.u11.p72==1))||((i8.u47.p352==0)&&(i7.i2.u40.p329==1)))&&((i6.i0.u33.p289==1)||(i3.i0.u18.p96==1)))))...156
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(!(EG(!(((((i4.i1.u24.p197==0)&&(i2.u11.p72==1))||((i8.u47.p352==0)&&(i7.i2.u40.p329==1)))&&(...213
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 260/260 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 260
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 191 transition count 234
Ensure Unique test removed 3 places
Iterating global reduction 1 with 27 rules applied. Total rules applied 52 place count 188 transition count 234
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 66 place count 188 transition count 220
Applied a total of 66 rules in 14 ms. Remains 188 /216 variables (removed 28) and now considering 220/260 (removed 40) transitions.
[2025-06-01 22:55:17] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
// Phase 1: matrix 212 rows 188 cols
[2025-06-01 22:55:17] [INFO ] Computed 57 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:55:17] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-01 22:55:17] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
[2025-06-01 22:55:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:55:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 22:55:17] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2025-06-01 22:55:17] [INFO ] Flow matrix only has 212 transitions (discarded 8 similar events)
[2025-06-01 22:55:17] [INFO ] Invariant cache hit.
[2025-06-01 22:55:17] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 211/399 variables, 188/245 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 1/400 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 0/400 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 255 constraints, problems are : Problem set: 0 solved, 219 unsolved in 9568 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 188/188 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (OVERLAPS) 211/399 variables, 188/245 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 9/254 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 219/473 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (OVERLAPS) 0/400 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 474 constraints, problems are : Problem set: 0 solved, 219 unsolved in 21813 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 188/188 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 31411ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 31412ms
Starting structural reductions in LTL mode, iteration 1 : 188/216 places, 220/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31664 ms. Remains : 188/216 places, 220/260 transitions.
[2025-06-01 22:55:49] [INFO ] Flatten gal took : 12 ms
[2025-06-01 22:55:49] [INFO ] Flatten gal took : 8 ms
[2025-06-01 22:55:49] [INFO ] Input system was already deterministic with 220 transitions.
[2025-06-01 22:55:49] [INFO ] Flatten gal took : 7 ms
[2025-06-01 22:55:49] [INFO ] Flatten gal took : 7 ms
[2025-06-01 22:55:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality12812624161428821305.gal : 1 ms
[2025-06-01 22:55:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality14359405595919400953.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/CTLCardinality12812624161428821305.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14359405595919400953.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,1.00921e+23,0.441793,22080,2,1649,5,96386,6,0,965,92492,0
Converting to forward existential form...Done !
original formula: EX((((p77==1) + AX((p247==1))) + EX((EF((p234==1)) + AG((p59==1))))))
=> equivalent forward existential formula: (([(EY(Init) * (p77==1))] != FALSE + [(EY(Init) * !(EX(!((p247==1)))))] != FALSE) + ([(FwdU(EY(EY(Init)),TRUE) *...233
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,1.26822,44356,1,0,13,245088,14,2,4805,119636,10
FORMULA NoC3x3-PT-3A-CTLCardinality-2025-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 216/216 places, 260/260 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 214 transition count 189
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 169 place count 135 transition count 169
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 169 place count 135 transition count 168
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 172 place count 133 transition count 168
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 172 place count 133 transition count 167
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 174 place count 132 transition count 167
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 188 place count 118 transition count 151
Ensure Unique test removed 3 places
Iterating global reduction 2 with 17 rules applied. Total rules applied 205 place count 115 transition count 151
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
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 2 with 7 rules applied. Total rules applied 212 place count 115 transition count 144
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 219 place count 111 transition count 141
Applied a total of 219 rules in 22 ms. Remains 111 /216 variables (removed 105) and now considering 141/260 (removed 119) transitions.
// Phase 1: matrix 141 rows 111 cols
[2025-06-01 22:55:50] [INFO ] Computed 46 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:55:50] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-06-01 22:55:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:55:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-01 22:55:50] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:55:50] [INFO ] Redundant transitions in 60 ms returned [31, 32, 43, 44, 55, 56, 57, 58, 59, 66, 67, 70, 80, 93, 94, 96, 100, 103, 104, 105, 111, 112, 113, 115, 119, 122, 123, 125, 128, 129, 130, 131, 137]
Found 33 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 33 transitions
Redundant transitions reduction (with SMT) removed 33 transitions.
Running 84 sub problems to find dead transitions.
// Phase 1: matrix 108 rows 111 cols
[2025-06-01 22:55:50] [INFO ] Computed 46 invariants in 1 ms
[2025-06-01 22:55:50] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 12/111 variables, 12/46 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 107/218 variables, 111/157 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 9/166 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/218 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/219 variables, and 166 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1581 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 111/111 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (OVERLAPS) 12/111 variables, 12/46 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 107/218 variables, 111/157 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 9/166 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 84/250 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/218 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/219 variables, and 250 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2165 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 111/111 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3763ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 3764ms
Starting structural reductions in SI_CTL mode, iteration 1 : 111/216 places, 108/260 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 111 transition count 96
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 87 transition count 96
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 41 place count 87 transition count 91
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 44 edges and 77 vertex of which 14 / 77 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Iterating post reduction 1 with 16 rules applied. Total rules applied 57 place count 70 transition count 86
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 64 place count 70 transition count 79
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 88 place count 54 transition count 71
Graph (trivial) has 37 edges and 54 vertex of which 16 / 54 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 46 transition count 71
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 97 place count 46 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 112 place count 46 transition count 48
Applied a total of 112 rules in 17 ms. Remains 46 /111 variables (removed 65) and now considering 48/108 (removed 60) transitions.
// Phase 1: matrix 48 rows 46 cols
[2025-06-01 22:55:54] [INFO ] Computed 21 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:55:54] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-01 22:55:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:55:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 22:55:54] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 46/216 places, 48/260 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 4114 ms. Remains : 46/216 places, 48/260 transitions.
[2025-06-01 22:55:54] [INFO ] Flatten gal took : 2 ms
[2025-06-01 22:55:54] [INFO ] Flatten gal took : 1 ms
[2025-06-01 22:55:54] [INFO ] Input system was already deterministic with 48 transitions.
[2025-06-01 22:55:54] [INFO ] Flatten gal took : 6 ms
[2025-06-01 22:55:54] [INFO ] Flatten gal took : 1 ms
[2025-06-01 22:55:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13083789062205220892.gal : 0 ms
[2025-06-01 22:55:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6809122875375356730.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13083789062205220892.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6809122875375356730.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 3517 steps (1 resets) in 30 ms. (113 steps per ms) remains 0/1 properties
FORMULA NoC3x3-PT-3A-CTLCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality6809122875375356730.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :16 after 256
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :256 after 24576
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :24576 after 393216
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,8.84736e+06,0.01586,4260,2,77,9,719,6,0,234,573,0
Total reachable state count : 8847360
Verifying 1 reachability properties.
Reachability property NoC3x3-PT-3A-CTLCardinality-2025-06 is true.
ITS runner timed out or was interrupted.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
NoC3x3-PT-3A-CTLCardinality-2025-06,1.76947e+06,0.016063,4260,2,72,9,719,6,0,236,573,0
Starting structural reductions in SI_CTL mode, iteration 0 : 216/216 places, 260/260 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 215 transition count 193
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 145 place count 148 transition count 182
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 159 place count 134 transition count 166
Ensure Unique test removed 3 places
Iterating global reduction 2 with 17 rules applied. Total rules applied 176 place count 131 transition count 166
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
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 2 with 7 rules applied. Total rules applied 183 place count 131 transition count 159
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 186 place count 128 transition count 159
Applied a total of 186 rules in 24 ms. Remains 128 /216 variables (removed 88) and now considering 159/260 (removed 101) transitions.
[2025-06-01 22:55:54] [INFO ] Flow matrix only has 151 transitions (discarded 8 similar events)
// Phase 1: matrix 151 rows 128 cols
[2025-06-01 22:55:54] [INFO ] Computed 57 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:55:55] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-01 22:55:55] [INFO ] Flow matrix only has 151 transitions (discarded 8 similar events)
[2025-06-01 22:55:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:55:55] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-06-01 22:55:55] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:55:55] [INFO ] Redundant transitions in 5 ms returned []
Running 158 sub problems to find dead transitions.
[2025-06-01 22:55:55] [INFO ] Flow matrix only has 151 transitions (discarded 8 similar events)
[2025-06-01 22:55:55] [INFO ] Invariant cache hit.
[2025-06-01 22:55:55] [INFO ] State equation strengthened by 33 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (OVERLAPS) 150/278 variables, 128/185 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 32/217 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 158 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/279 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 8 (OVERLAPS) 0/279 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 218 constraints, problems are : Problem set: 0 solved, 158 unsolved in 4322 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 128/128 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/128 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (OVERLAPS) 150/278 variables, 128/185 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 32/217 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 158/375 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (OVERLAPS) 1/279 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/279 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (OVERLAPS) 0/279 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 376 constraints, problems are : Problem set: 0 solved, 158 unsolved in 8734 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 128/128 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13082ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 13083ms
Starting structural reductions in SI_CTL mode, iteration 1 : 128/216 places, 159/260 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13315 ms. Remains : 128/216 places, 159/260 transitions.
[2025-06-01 22:56:08] [INFO ] Flatten gal took : 10 ms
[2025-06-01 22:56:08] [INFO ] Flatten gal took : 5 ms
[2025-06-01 22:56:08] [INFO ] Input system was already deterministic with 159 transitions.
[2025-06-01 22:56:08] [INFO ] Flatten gal took : 5 ms
[2025-06-01 22:56:08] [INFO ] Flatten gal took : 5 ms
[2025-06-01 22:56:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality4443609591528619621.gal : 1 ms
[2025-06-01 22:56:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality2296918577057301452.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/CTLCardinality4443609591528619621.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2296918577057301452.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,9.16718e+17,0.081419,7308,2,341,5,17328,6,0,648,17852,0
Converting to forward existential form...Done !
original formula: AG((AF(((p115==1) + AG((p45==0)))) * EF((p278==1))))
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(((p115==1) + !(E(TRUE U !((p45==0)))))))] = FALSE * [(FwdU(Init,TRUE) * !(E(TRUE U (p27...173
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.131533,7564,1,0,8,17328,14,2,3200,17852,5
FORMULA NoC3x3-PT-3A-CTLCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 216/216 places, 260/260 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 214 transition count 192
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 93 rules applied. Total rules applied 160 place count 140 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 161 place count 139 transition count 173
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 161 place count 139 transition count 172
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 164 place count 137 transition count 172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 164 place count 137 transition count 171
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 166 place count 136 transition count 171
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 179 place count 123 transition count 156
Ensure Unique test removed 3 places
Iterating global reduction 3 with 16 rules applied. Total rules applied 195 place count 120 transition count 156
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
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 5 rules applied. Total rules applied 200 place count 120 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 201 place count 119 transition count 151
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 205 place count 119 transition count 147
Applied a total of 205 rules in 25 ms. Remains 119 /216 variables (removed 97) and now considering 147/260 (removed 113) transitions.
// Phase 1: matrix 147 rows 119 cols
[2025-06-01 22:56:08] [INFO ] Computed 49 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:56:08] [INFO ] Implicit Places using invariants in 60 ms returned [88]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 118/216 places, 147/260 transitions.
Applied a total of 0 rules in 3 ms. Remains 118 /118 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 90 ms. Remains : 118/216 places, 147/260 transitions.
[2025-06-01 22:56:08] [INFO ] Flatten gal took : 4 ms
[2025-06-01 22:56:08] [INFO ] Flatten gal took : 4 ms
[2025-06-01 22:56:08] [INFO ] Input system was already deterministic with 147 transitions.
[2025-06-01 22:56:08] [INFO ] Flatten gal took : 4 ms
[2025-06-01 22:56:08] [INFO ] Flatten gal took : 4 ms
[2025-06-01 22:56:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality7551579701588143832.gal : 1 ms
[2025-06-01 22:56:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality16384242083952952399.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/CTLCardinality7551579701588143832.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16384242083952952399.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,6.36984e+17,0.04652,5888,2,291,5,9897,5,0,620,9918,0
Converting to forward existential form...Done !
original formula: EF(((((p62==1) * EF((p227==0))) * ((p125==0)&&(p95==1))) * ((p145==0)&&((p101==0)||(p8==1)))))
=> equivalent forward existential formula: [(FwdU((((FwdU(Init,TRUE) * ((p145==0)&&((p101==0)||(p8==1)))) * ((p125==0)&&(p95==1))) * (p62==1)),TRUE) * (p22...171
(forward)formula 0,1,0.059628,6144,1,0,12,9897,11,4,1132,9918,6
FORMULA NoC3x3-PT-3A-CTLCardinality-2025-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 260/260 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 260
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 27 place count 189 transition count 232
Ensure Unique test removed 3 places
Iterating global reduction 1 with 29 rules applied. Total rules applied 56 place count 186 transition count 232
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 72 place count 186 transition count 216
Applied a total of 72 rules in 5 ms. Remains 186 /216 variables (removed 30) and now considering 216/260 (removed 44) transitions.
[2025-06-01 22:56:08] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
// Phase 1: matrix 208 rows 186 cols
[2025-06-01 22:56:08] [INFO ] Computed 57 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:56:08] [INFO ] Implicit Places using invariants in 227 ms returned []
[2025-06-01 22:56:08] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2025-06-01 22:56:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:56:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2025-06-01 22:56:08] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2025-06-01 22:56:08] [INFO ] Flow matrix only has 208 transitions (discarded 8 similar events)
[2025-06-01 22:56:08] [INFO ] Invariant cache hit.
[2025-06-01 22:56:08] [INFO ] State equation strengthened by 10 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 207/393 variables, 186/243 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 9/252 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 1/394 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/394 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 253 constraints, problems are : Problem set: 0 solved, 215 unsolved in 9252 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 186/186 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (OVERLAPS) 207/393 variables, 186/243 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 9/252 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 215/467 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (OVERLAPS) 1/394 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (OVERLAPS) 0/394 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 468 constraints, problems are : Problem set: 0 solved, 215 unsolved in 20319 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 186/186 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29589ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 29590ms
Starting structural reductions in LTL mode, iteration 1 : 186/216 places, 216/260 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29964 ms. Remains : 186/216 places, 216/260 transitions.
[2025-06-01 22:56:38] [INFO ] Flatten gal took : 11 ms
[2025-06-01 22:56:38] [INFO ] Flatten gal took : 6 ms
[2025-06-01 22:56:38] [INFO ] Input system was already deterministic with 216 transitions.
[2025-06-01 22:56:38] [INFO ] Flatten gal took : 11 ms
[2025-06-01 22:56:38] [INFO ] Flatten gal took : 6 ms
[2025-06-01 22:56:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality4505264816456411734.gal : 1 ms
[2025-06-01 22:56:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality7947668402431188614.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/CTLCardinality4505264816456411734.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7947668402431188614.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,7.76315e+22,0.44231,21804,2,1627,5,95225,6,0,953,91524,0
Converting to forward existential form...Done !
original formula: (EF(EX(AX((p321==1)))) + AX(FALSE))
=> equivalent forward existential formula: [(EY((Init * !(E(TRUE U EX(!(EX(!((p321==1))))))))) * !(FALSE))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.794549,25548,1,0,7,146772,14,2,4578,91524,5
FORMULA NoC3x3-PT-3A-CTLCardinality-2025-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 216/216 places, 260/260 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 214 transition count 190
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 165 place count 136 transition count 172
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 165 place count 136 transition count 171
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 168 place count 134 transition count 171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 168 place count 134 transition count 170
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 170 place count 133 transition count 170
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 184 place count 119 transition count 154
Ensure Unique test removed 3 places
Iterating global reduction 2 with 17 rules applied. Total rules applied 201 place count 116 transition count 154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
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 2 with 7 rules applied. Total rules applied 208 place count 116 transition count 147
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 215 place count 112 transition count 144
Applied a total of 215 rules in 19 ms. Remains 112 /216 variables (removed 104) and now considering 144/260 (removed 116) transitions.
// Phase 1: matrix 144 rows 112 cols
[2025-06-01 22:56:39] [INFO ] Computed 46 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:56:39] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-01 22:56:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:56:39] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-01 22:56:39] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 22:56:39] [INFO ] Redundant transitions in 59 ms returned [24, 30, 31, 42, 43, 54, 55, 56, 57, 58, 65, 66, 69, 79, 92, 93, 95, 99, 102, 103, 104, 110, 111, 112, 114, 118, 121, 122, 124, 127, 130, 131, 134, 140]
Found 34 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 34 transitions
Redundant transitions reduction (with SMT) removed 34 transitions.
Running 86 sub problems to find dead transitions.
// Phase 1: matrix 110 rows 112 cols
[2025-06-01 22:56:39] [INFO ] Computed 46 invariants in 1 ms
[2025-06-01 22:56:39] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 11/112 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 109/221 variables, 112/158 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 0/221 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 221/222 variables, and 167 constraints, problems are : Problem set: 0 solved, 86 unsolved in 1593 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 112/112 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 11/112 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (OVERLAPS) 109/221 variables, 112/158 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 9/167 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 86/253 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 0/221 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 221/222 variables, and 253 constraints, problems are : Problem set: 0 solved, 86 unsolved in 2217 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, State Equation: 112/112 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3815ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 3816ms
Starting structural reductions in SI_CTL mode, iteration 1 : 112/216 places, 110/260 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 112 transition count 99
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 33 rules applied. Total rules applied 33 place count 90 transition count 99
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 37 place count 90 transition count 95
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 46 edges and 82 vertex of which 14 / 82 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Iterating post reduction 1 with 13 rules applied. Total rules applied 50 place count 75 transition count 91
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 57 place count 75 transition count 84
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 84 place count 57 transition count 75
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 86 place count 56 transition count 74
Graph (trivial) has 38 edges and 56 vertex of which 16 / 56 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 48 transition count 74
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 95 place count 48 transition count 66
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 111 place count 48 transition count 50
Applied a total of 111 rules in 13 ms. Remains 48 /112 variables (removed 64) and now considering 50/110 (removed 60) transitions.
// Phase 1: matrix 50 rows 48 cols
[2025-06-01 22:56:43] [INFO ] Computed 22 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:56:43] [INFO ] Implicit Places using invariants in 31 ms returned [39]
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 2 : 47/216 places, 50/260 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 50
Applied a total of 1 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 47 cols
[2025-06-01 22:56:43] [INFO ] Computed 21 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:56:43] [INFO ] Implicit Places using invariants in 28 ms returned []
[2025-06-01 22:56:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:56:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 22:56:43] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 47/216 places, 50/260 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 4176 ms. Remains : 47/216 places, 50/260 transitions.
[2025-06-01 22:56:43] [INFO ] Flatten gal took : 2 ms
[2025-06-01 22:56:43] [INFO ] Flatten gal took : 2 ms
[2025-06-01 22:56:43] [INFO ] Input system was already deterministic with 50 transitions.
[2025-06-01 22:56:43] [INFO ] Flatten gal took : 1 ms
[2025-06-01 22:56:43] [INFO ] Flatten gal took : 2 ms
[2025-06-01 22:56:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality14413436678320077379.gal : 0 ms
[2025-06-01 22:56:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality16858650428143224356.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/CTLCardinality14413436678320077379.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16858650428143224356.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,1.3271e+07,0.010271,4068,2,89,5,1013,5,0,239,973,0
Converting to forward existential form...Done !
original formula: EG(((p319==0)||(p332==1)))
=> equivalent forward existential formula: [FwdG(Init,((p319==0)||(p332==1)))] != FALSE
Hit Full ! (commute/partial/dont) 45/0/5
(forward)formula 0,1,0.020908,4452,1,0,6,3313,18,1,1145,1458,8
FORMULA NoC3x3-PT-3A-CTLCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 260/260 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 260
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 191 transition count 234
Ensure Unique test removed 2 places
Iterating global reduction 1 with 26 rules applied. Total rules applied 51 place count 189 transition count 234
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 66 place count 189 transition count 219
Applied a total of 66 rules in 4 ms. Remains 189 /216 variables (removed 27) and now considering 219/260 (removed 41) transitions.
[2025-06-01 22:56:43] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
// Phase 1: matrix 211 rows 189 cols
[2025-06-01 22:56:43] [INFO ] Computed 58 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:56:43] [INFO ] Implicit Places using invariants in 65 ms returned [88]
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 : 188/216 places, 219/260 transitions.
Applied a total of 0 rules in 1 ms. Remains 188 /188 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 84 ms. Remains : 188/216 places, 219/260 transitions.
[2025-06-01 22:56:43] [INFO ] Flatten gal took : 5 ms
[2025-06-01 22:56:43] [INFO ] Flatten gal took : 6 ms
[2025-06-01 22:56:43] [INFO ] Input system was already deterministic with 219 transitions.
[2025-06-01 22:56:43] [INFO ] Flatten gal took : 6 ms
[2025-06-01 22:56:43] [INFO ] Flatten gal took : 6 ms
[2025-06-01 22:56:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality12097716683110506568.gal : 1 ms
[2025-06-01 22:56:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality8600189372911527024.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/CTLCardinality12097716683110506568.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8600189372911527024.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,1.06615e+23,0.45813,22652,2,1752,5,99640,6,0,964,95945,0
Converting to forward existential form...Done !
original formula: AF((((AF(((p150==0)&&(p195==1))) * AG(((p349==0)&&(p300==1)))) * (EF((p106==0)) * AG((p172==0)))) * EX(((p21==0)&&(p177==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((((!(EG(!(((p150==0)&&(p195==1))))) * !(E(TRUE U !(((p349==0)&&(p300==1)))))) * (E(TRUE U (p106==0)...226
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t207, t210, Intersection with reachable at each step enabled. (destroyed/reverse/int...181
(forward)formula 0,0,2.56597,86952,1,0,371,528296,461,227,6457,373639,461
FORMULA NoC3x3-PT-3A-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 260/260 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 215 transition count 260
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 191 transition count 234
Ensure Unique test removed 2 places
Iterating global reduction 1 with 26 rules applied. Total rules applied 51 place count 189 transition count 234
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 66 place count 189 transition count 219
Applied a total of 66 rules in 4 ms. Remains 189 /216 variables (removed 27) and now considering 219/260 (removed 41) transitions.
[2025-06-01 22:56:46] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
// Phase 1: matrix 211 rows 189 cols
[2025-06-01 22:56:46] [INFO ] Computed 58 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 22:56:46] [INFO ] Implicit Places using invariants in 81 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/216 places, 219/260 transitions.
Applied a total of 0 rules in 2 ms. Remains 188 /188 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 88 ms. Remains : 188/216 places, 219/260 transitions.
[2025-06-01 22:56:46] [INFO ] Flatten gal took : 6 ms
[2025-06-01 22:56:46] [INFO ] Flatten gal took : 6 ms
[2025-06-01 22:56:46] [INFO ] Input system was already deterministic with 219 transitions.
[2025-06-01 22:56:46] [INFO ] Flatten gal took : 6 ms
[2025-06-01 22:56:46] [INFO ] Flatten gal took : 6 ms
[2025-06-01 22:56:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality1569535419933387990.gal : 1 ms
[2025-06-01 22:56:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality18429233526690619124.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/CTLCardinality1569535419933387990.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18429233526690619124.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,1.08648e+23,0.447089,22292,2,1663,5,98104,6,0,964,93995,0
Converting to forward existential form...Done !
original formula: (AG(((p189==0)||(p249==1))) * EF((((p110==0)||(p106==1)) + !(A(EX((p345==0)) U AF(((p235==0)||(p348==1))))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(((p189==0)||(p249==1))))] = FALSE * [(Init * !(E(TRUE U (((p110==0)||(p106==1)) + !(!((E(...309
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,0.923852,30824,1,0,29,171715,32,18,4961,93995,29
FORMULA NoC3x3-PT-3A-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2025-06-01 22:56:47] [INFO ] Flatten gal took : 7 ms
[2025-06-01 22:56:47] [INFO ] Flatten gal took : 6 ms
[2025-06-01 22:56:47] [INFO ] Applying decomposition
[2025-06-01 22:56:47] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3092856991039175942.txt' '-o' '/tmp/graph3092856991039175942.bin' '-w' '/tmp/graph3092856991039175942.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3092856991039175942.bin' '-l' '-1' '-v' '-w' '/tmp/graph3092856991039175942.weights' '-q' '0' '-e' '0.001'
[2025-06-01 22:56:47] [INFO ] Decomposing Gal with order
[2025-06-01 22:56:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 22:56:47] [INFO ] Removed a total of 81 redundant transitions.
[2025-06-01 22:56:47] [INFO ] Flatten gal took : 14 ms
[2025-06-01 22:56:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 6 ms.
[2025-06-01 22:56:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality4838579593478580455.gal : 3 ms
[2025-06-01 22:56:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality14626487578144302189.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/CTLCardinality4838579593478580455.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14626487578144302189.ctl'
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 -...263
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.80552e+24,0.43007,20568,550,159,26894,1663,772,83385,170,8149,0
Converting to forward existential form...Done !
original formula: AF(AX(AF(((((i4.i1.u25.p197==0)&&(i2.i0.u10.p72==1))||((i8.u47.p352==0)&&(i7.u40.p329==1)))&&((i6.i1.u37.p289==1)||(i3.u20.p96==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(!(EG(!(((((i4.i1.u25.p197==0)&&(i2.i0.u10.p72==1))||((i8.u47.p352==0)&&(i7.u40.p329==1)))&&(...210
Reverse transition relation is NOT exact ! Due to transitions i7.t250, i7.t243, i7.u42.t5, i8.u45.t3, Intersection with reachable at each step enabled. (d...201
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Detected timeout of ITS tools.
[2025-06-01 23:17:58] [INFO ] Applying decomposition
[2025-06-01 23:17:58] [INFO ] Flatten gal took : 7 ms
[2025-06-01 23:17:58] [INFO ] Decomposing Gal with order
[2025-06-01 23:17:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 23:17:58] [INFO ] Removed a total of 109 redundant transitions.
[2025-06-01 23:17:58] [INFO ] Flatten gal took : 15 ms
[2025-06-01 23:17:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 98 labels/synchronizations in 5 ms.
[2025-06-01 23:17:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality9988764065644855484.gal : 2 ms
[2025-06-01 23:17:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality1616847627327104812.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/CTLCardinality9988764065644855484.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1616847627327104812.ctl'
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 -...262
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.80552e+24,0.2813,16812,708,74,31963,464,659,29985,112,1134,0
Converting to forward existential form...Done !
original formula: AF(AX(AF(((((u37.p197==0)&&(u16.p72==1))||((u61.p352==0)&&(u59.p329==1)))&&((u52.p289==1)||(u21.p96==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(!(EG(!(((((u37.p197==0)&&(u16.p72==1))||((u61.p352==0)&&(u59.p329==1)))&&((u52.p289==1)||(u2...183
Reverse transition relation is NOT exact ! Due to transitions t241, t245, u59.t5, u64.t3, Intersection with reachable at each step enabled. (destroyed/rev...189
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Fast SCC detection found an SCC at level 26
Fast SCC detection found an SCC at level 27
Fast SCC detection found an SCC at level 29
Fast SCC detection found an SCC at level 30
Fast SCC detection found an SCC at level 31
Fast SCC detection found an SCC at level 32
Fast SCC detection found an SCC at level 33
Fast SCC detection found an SCC at level 34
Fast SCC detection found an SCC at level 35
Fast SCC detection found an SCC at level 36
Fast SCC detection found an SCC at level 37
Fast SCC detection found an SCC at level 38
Fast SCC detection found an SCC at level 39
Fast SCC detection found an SCC at level 40
Fast SCC detection found an SCC at level 41
Fast SCC detection found an SCC at level 42
Fast SCC detection found an SCC at level 43
Fast SCC detection found an SCC at level 44
Fast SCC detection found an SCC at level 45
Fast SCC detection found an SCC at level 46
Fast SCC detection found an SCC at level 47
Fast SCC detection found an SCC at level 48
Fast SCC detection found an SCC at level 49
Fast SCC detection found an SCC at level 50
Fast SCC detection found an SCC at level 51
Fast SCC detection found an SCC at level 52
Fast SCC detection found an SCC at level 53
Fast SCC detection found an SCC at level 54
Fast SCC detection found an SCC at level 55
Fast SCC detection found an SCC at level 56
Fast SCC detection found an SCC at level 57
Detected timeout of ITS tools.
[2025-06-01 23:39:10] [INFO ] Flatten gal took : 9 ms
[2025-06-01 23:39:10] [INFO ] Input system was already deterministic with 260 transitions.
[2025-06-01 23:39:10] [INFO ] Transformed 216 places.
[2025-06-01 23:39:10] [INFO ] Transformed 260 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-01 23:39:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality4570609200003187803.gal : 3 ms
[2025-06-01 23:39:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality2220693945877386531.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/CTLCardinality4570609200003187803.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2220693945877386531.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...328
Successfully loaded order from file /home/mcc/execution/model.ord
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.80552e+24,134.629,2598552,2,460551,5,1.41724e+07,6,0,1117,1.16655e+07,0
Converting to forward existential form...Done !
BK_TIME_CONFINEMENT_REACHED
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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="NoC3x3-PT-3A"
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 NoC3x3-PT-3A, 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 r142-tall-174876812100185"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-3A.tgz
mv NoC3x3-PT-3A 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 ;