Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 09:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 13 09:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 13 09:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 13 09:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 128K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-2024-00
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-2024-01
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-2024-02
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-2024-03
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-2024-04
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-2024-05
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-2024-06
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-2024-07
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-2024-08
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-2024-09
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-2024-10
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-2024-11
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-2023-12
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-2023-13
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-2023-14
FORMULA_NAME FlexibleBarrier-PT-12a-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716420346144

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-12a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 23:25:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 23:25:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:25:47] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-05-22 23:25:47] [INFO ] Transformed 147 places.
[2024-05-22 23:25:47] [INFO ] Transformed 448 transitions.
[2024-05-22 23:25:47] [INFO ] Found NUPN structural information;
[2024-05-22 23:25:47] [INFO ] Parsed PT model containing 147 places and 448 transitions and 2045 arcs in 189 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Ensure Unique test removed 122 transitions
Reduce redundant transitions removed 122 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 68 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 326/326 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 147 transition count 314
Applied a total of 12 rules in 23 ms. Remains 147 /147 variables (removed 0) and now considering 314/326 (removed 12) transitions.
// Phase 1: matrix 314 rows 147 cols
[2024-05-22 23:25:47] [INFO ] Computed 14 invariants in 18 ms
[2024-05-22 23:25:47] [INFO ] Implicit Places using invariants in 261 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 288 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/147 places, 314/326 transitions.
Applied a total of 0 rules in 5 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 332 ms. Remains : 146/147 places, 314/326 transitions.
Support contains 68 out of 146 places after structural reductions.
[2024-05-22 23:25:48] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 23:25:48] [INFO ] Flatten gal took : 43 ms
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 23:25:48] [INFO ] Flatten gal took : 18 ms
[2024-05-22 23:25:48] [INFO ] Input system was already deterministic with 314 transitions.
Support contains 67 out of 146 places (down from 68) after GAL structural reductions.
RANDOM walk for 20532 steps (4 resets) in 644 ms. (31 steps per ms) remains 0/51 properties
[2024-05-22 23:25:48] [INFO ] Flatten gal took : 18 ms
[2024-05-22 23:25:48] [INFO ] Flatten gal took : 15 ms
[2024-05-22 23:25:48] [INFO ] Input system was already deterministic with 314 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 314/314 transitions.
Applied a total of 0 rules in 6 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
// Phase 1: matrix 314 rows 146 cols
[2024-05-22 23:25:48] [INFO ] Computed 13 invariants in 5 ms
[2024-05-22 23:25:48] [INFO ] Implicit Places using invariants in 125 ms returned [145]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 128 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/146 places, 314/314 transitions.
Applied a total of 0 rules in 5 ms. Remains 145 /145 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139 ms. Remains : 145/146 places, 314/314 transitions.
[2024-05-22 23:25:48] [INFO ] Flatten gal took : 12 ms
[2024-05-22 23:25:48] [INFO ] Flatten gal took : 13 ms
[2024-05-22 23:25:48] [INFO ] Input system was already deterministic with 314 transitions.
[2024-05-22 23:25:48] [INFO ] Flatten gal took : 11 ms
[2024-05-22 23:25:48] [INFO ] Flatten gal took : 12 ms
[2024-05-22 23:25:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality15921951674502850658.gal : 7 ms
[2024-05-22 23:25:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality10284528914548271258.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15921951674502850658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10284528914548271258.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.9161e+12,0.16153,9172,2,3496,5,31644,6,0,896,19345,0


Converting to forward existential form...Done !
original formula: AG((A((AX((p103==1)) + AX(AG(((p35==0)||(p86==1))))) U (EF((p100==1)) * !((((p32==0)||(p123==1))&&(p42==1))))) + AG(((((p24==0)||(p87==1)...192
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(!((E(!((E(TRUE U (p100==1)) * !((((p32==0)||(p123==1))&&(p42==1))))) U (!((!(EX(!((p...435
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,0,1.54065,57920,1,0,16,364297,30,7,4983,119553,21
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 314/314 transitions.
Applied a total of 0 rules in 5 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-22 23:25:50] [INFO ] Invariant cache hit.
[2024-05-22 23:25:50] [INFO ] Implicit Places using invariants in 117 ms returned [145]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 120 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/146 places, 314/314 transitions.
Applied a total of 0 rules in 4 ms. Remains 145 /145 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129 ms. Remains : 145/146 places, 314/314 transitions.
[2024-05-22 23:25:50] [INFO ] Flatten gal took : 11 ms
[2024-05-22 23:25:50] [INFO ] Flatten gal took : 11 ms
[2024-05-22 23:25:50] [INFO ] Input system was already deterministic with 314 transitions.
[2024-05-22 23:25:50] [INFO ] Flatten gal took : 10 ms
[2024-05-22 23:25:50] [INFO ] Flatten gal took : 9 ms
[2024-05-22 23:25:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality10365745550788245853.gal : 3 ms
[2024-05-22 23:25:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality3417642605261138640.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10365745550788245853.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3417642605261138640.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.9161e+12,0.148305,9244,2,3496,5,31644,6,0,896,19345,0


Converting to forward existential form...Done !
original formula: EX(EF((EG(((p110==1)&&(p60==1))) * (((p13==0)||(p127==1)) + AF(((p92==1)||(p38==1)))))))
=> equivalent forward existential formula: ([((FwdU(EY(Init),TRUE) * EG(((p110==1)&&(p60==1)))) * ((p13==0)||(p127==1)))] != FALSE + [((FwdU(EY(Init),TRUE)...229
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,1.22983,47920,1,0,11,286118,20,2,4452,59437,11
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 314/314 transitions.
Applied a total of 0 rules in 9 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-22 23:25:51] [INFO ] Invariant cache hit.
[2024-05-22 23:25:51] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 23:25:51] [INFO ] Invariant cache hit.
[2024-05-22 23:25:51] [INFO ] State equation strengthened by 133 read => feed constraints.
[2024-05-22 23:25:51] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 313 sub problems to find dead transitions.
[2024-05-22 23:25:52] [INFO ] Invariant cache hit.
[2024-05-22 23:25:52] [INFO ] State equation strengthened by 133 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 145/145 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 13/158 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/460 variables, 146/305 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 133/438 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (OVERLAPS) 0/460 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 438 constraints, problems are : Problem set: 0 solved, 313 unsolved in 10306 ms.
Refiners :[Domain max(s): 146/146 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 146/146 constraints, ReadFeed: 133/133 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 145/145 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/146 variables, 13/158 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 314/460 variables, 146/305 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 133/438 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 313/751 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 0/460 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 313 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 751 constraints, problems are : Problem set: 0 solved, 313 unsolved in 9845 ms.
Refiners :[Domain max(s): 146/146 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 146/146 constraints, ReadFeed: 133/133 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 0/0 constraints]
After SMT, in 20377ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 20394ms
Finished structural reductions in LTL mode , in 1 iterations and 20576 ms. Remains : 146/146 places, 314/314 transitions.
[2024-05-22 23:26:12] [INFO ] Flatten gal took : 13 ms
[2024-05-22 23:26:12] [INFO ] Flatten gal took : 10 ms
[2024-05-22 23:26:12] [INFO ] Input system was already deterministic with 314 transitions.
[2024-05-22 23:26:12] [INFO ] Flatten gal took : 10 ms
[2024-05-22 23:26:12] [INFO ] Flatten gal took : 10 ms
[2024-05-22 23:26:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality12589196349045112938.gal : 2 ms
[2024-05-22 23:26:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality10874313316607745106.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12589196349045112938.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10874313316607745106.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.9161e+12,0.729605,29120,2,4945,5,144298,6,0,898,87635,0


Converting to forward existential form...Done !
original formula: AG((A((!(((p77==1) + EF(((p38==0)||(p126==1))))) * (p105==1)) U (AX(EX(((p66==0)||(p78==1)))) + EF(((p145==1)&&(p4==0))))) + A((AX(EG(((p...250
=> equivalent forward existential formula: ([(EY(((FwdU((FwdU(Init,TRUE) * !(!((E(!((!(((p94!=1)||(p100==1))) + !(EG(!((p49==1)))))) U (!((!(EX(!(EG(((p127...895
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
(forward)formula 0,1,3.61446,110532,1,0,27,750022,44,14,5120,326065,26
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 314/314 transitions.
Applied a total of 0 rules in 3 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-22 23:26:16] [INFO ] Invariant cache hit.
[2024-05-22 23:26:16] [INFO ] Implicit Places using invariants in 92 ms returned [145]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/146 places, 314/314 transitions.
Applied a total of 0 rules in 3 ms. Remains 145 /145 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 145/146 places, 314/314 transitions.
[2024-05-22 23:26:16] [INFO ] Flatten gal took : 8 ms
[2024-05-22 23:26:16] [INFO ] Flatten gal took : 8 ms
[2024-05-22 23:26:16] [INFO ] Input system was already deterministic with 314 transitions.
[2024-05-22 23:26:16] [INFO ] Flatten gal took : 8 ms
[2024-05-22 23:26:16] [INFO ] Flatten gal took : 8 ms
[2024-05-22 23:26:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality13079733652270701602.gal : 2 ms
[2024-05-22 23:26:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality13640517057646221431.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13079733652270701602.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13640517057646221431.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.9161e+12,0.141366,9248,2,3496,5,31644,6,0,896,19345,0


Converting to forward existential form...Done !
original formula: EF(AG(EX(AG((p107==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!(E(TRUE U !((p107==1)))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,1.08268,43208,1,0,6,260399,15,0,4178,31798,7
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 146/146 places, 314/314 transitions.
Graph (trivial) has 160 edges and 146 vertex of which 66 / 146 are part of one of the 14 SCC in 7 ms
Free SCC test removed 52 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 94 transition count 208
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 80 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 79 transition count 207
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 31 place count 79 transition count 196
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 53 place count 68 transition count 196
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 59 place count 65 transition count 193
Drop transitions (Redundant composition of simpler transitions.) removed 82 transitions
Redundant transition composition rules discarded 82 transitions
Iterating global reduction 3 with 82 rules applied. Total rules applied 141 place count 65 transition count 111
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 153 place count 59 transition count 105
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 156 place count 59 transition count 105
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 158 place count 57 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 160 place count 57 transition count 103
Applied a total of 160 rules in 75 ms. Remains 57 /146 variables (removed 89) and now considering 103/314 (removed 211) transitions.
[2024-05-22 23:26:17] [INFO ] Flow matrix only has 83 transitions (discarded 20 similar events)
// Phase 1: matrix 83 rows 57 cols
[2024-05-22 23:26:17] [INFO ] Computed 13 invariants in 1 ms
[2024-05-22 23:26:17] [INFO ] Implicit Places using invariants in 136 ms returned [56]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 137 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 56/146 places, 103/314 transitions.
Graph (trivial) has 66 edges and 56 vertex of which 22 / 56 are part of one of the 11 SCC in 0 ms
Free SCC test removed 11 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 37 transition count 71
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 37 transition count 71
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 7 rules applied. Total rules applied 24 place count 37 transition count 64
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 28 place count 35 transition count 62
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 30 place count 33 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 33 place count 33 transition count 59
Applied a total of 33 rules in 9 ms. Remains 33 /56 variables (removed 23) and now considering 59/103 (removed 44) transitions.
[2024-05-22 23:26:17] [INFO ] Flow matrix only has 44 transitions (discarded 15 similar events)
// Phase 1: matrix 44 rows 33 cols
[2024-05-22 23:26:17] [INFO ] Computed 9 invariants in 0 ms
[2024-05-22 23:26:17] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-22 23:26:17] [INFO ] Flow matrix only has 44 transitions (discarded 15 similar events)
[2024-05-22 23:26:17] [INFO ] Invariant cache hit.
[2024-05-22 23:26:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 23:26:17] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 33/146 places, 59/314 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 272 ms. Remains : 33/146 places, 59/314 transitions.
[2024-05-22 23:26:17] [INFO ] Flatten gal took : 2 ms
[2024-05-22 23:26:17] [INFO ] Flatten gal took : 2 ms
[2024-05-22 23:26:17] [INFO ] Input system was already deterministic with 59 transitions.
[2024-05-22 23:26:17] [INFO ] Flatten gal took : 2 ms
[2024-05-22 23:26:17] [INFO ] Flatten gal took : 3 ms
[2024-05-22 23:26:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality465025329977566110.gal : 1 ms
[2024-05-22 23:26:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality11878905282843925636.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality465025329977566110.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11878905282843925636.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...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,18433,0.010582,3648,2,102,5,541,6,0,177,377,0


Converting to forward existential form...Done !
original formula: !(A(!(EF((p84!=0))) U (!((EG(EF((p135==1))) * ((((p128==1)||(p66==0))||((p144==1)||(p36==0)))||(p128==1)))) + EG(AG(((p45==1)||(p22==1)))...159
=> equivalent forward existential formula: ([FwdG((((FwdU(Init,!((!((EG(E(TRUE U (p135==1))) * ((((p128==1)||(p66==0))||((p144==1)||(p36==0)))||(p128==1)))...535
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.044284,5284,1,0,68,6624,32,46,930,9276,86
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 146/146 places, 314/314 transitions.
Graph (trivial) has 169 edges and 146 vertex of which 84 / 146 are part of one of the 12 SCC in 1 ms
Free SCC test removed 72 places
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 74 transition count 174
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 62 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 61 transition count 173
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 27 place count 61 transition count 162
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 49 place count 50 transition count 162
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 51 place count 49 transition count 161
Drop transitions (Redundant composition of simpler transitions.) removed 83 transitions
Redundant transition composition rules discarded 83 transitions
Iterating global reduction 3 with 83 rules applied. Total rules applied 134 place count 49 transition count 78
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 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 152 place count 40 transition count 69
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 40 transition count 69
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 155 place count 39 transition count 68
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 39 transition count 68
Applied a total of 156 rules in 35 ms. Remains 39 /146 variables (removed 107) and now considering 68/314 (removed 246) transitions.
[2024-05-22 23:26:17] [INFO ] Flow matrix only has 48 transitions (discarded 20 similar events)
// Phase 1: matrix 48 rows 39 cols
[2024-05-22 23:26:17] [INFO ] Computed 13 invariants in 0 ms
[2024-05-22 23:26:17] [INFO ] Implicit Places using invariants in 33 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 38/146 places, 68/314 transitions.
Graph (trivial) has 47 edges and 38 vertex of which 20 / 38 are part of one of the 10 SCC in 1 ms
Free SCC test removed 10 places
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 0 with 1 rules applied. Total rules applied 2 place count 28 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 27 transition count 49
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 10 place count 20 transition count 35
Iterating global reduction 2 with 7 rules applied. Total rules applied 17 place count 20 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 3 rules applied. Total rules applied 20 place count 20 transition count 32
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 22 place count 19 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 23 place count 18 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 25 place count 18 transition count 29
Applied a total of 25 rules in 6 ms. Remains 18 /38 variables (removed 20) and now considering 29/68 (removed 39) transitions.
[2024-05-22 23:26:17] [INFO ] Flow matrix only has 19 transitions (discarded 10 similar events)
// Phase 1: matrix 19 rows 18 cols
[2024-05-22 23:26:17] [INFO ] Computed 7 invariants in 0 ms
[2024-05-22 23:26:17] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-22 23:26:17] [INFO ] Flow matrix only has 19 transitions (discarded 10 similar events)
[2024-05-22 23:26:17] [INFO ] Invariant cache hit.
[2024-05-22 23:26:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 23:26:17] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 18/146 places, 29/314 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 118 ms. Remains : 18/146 places, 29/314 transitions.
[2024-05-22 23:26:17] [INFO ] Flatten gal took : 1 ms
[2024-05-22 23:26:17] [INFO ] Flatten gal took : 1 ms
[2024-05-22 23:26:17] [INFO ] Input system was already deterministic with 29 transitions.
[2024-05-22 23:26:17] [INFO ] Flatten gal took : 2 ms
[2024-05-22 23:26:17] [INFO ] Flatten gal took : 2 ms
[2024-05-22 23:26:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality15139952758114341361.gal : 0 ms
[2024-05-22 23:26:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality1328650373143790953.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality15139952758114341361.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1328650373143790953.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(EF(((AF(((p55!=0)&&(p96!=1))) + (p34!=0)) + (p76==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((!(EG(!(((p55!=0)&&(p96!=1))))) + (p34!=0)) + (p76==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.007544,3764,1,0,12,690,25,3,439,549,11
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 146/146 places, 314/314 transitions.
Graph (trivial) has 164 edges and 146 vertex of which 80 / 146 are part of one of the 14 SCC in 0 ms
Free SCC test removed 66 places
Ensure Unique test removed 137 transitions
Reduce isomorphic transitions removed 137 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 93 edges and 78 vertex of which 52 / 78 are part of one of the 11 SCC in 0 ms
Free SCC test removed 41 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 37 transition count 173
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 130 rules applied. Total rules applied 136 place count 27 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 137 place count 26 transition count 53
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 137 place count 26 transition count 52
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 139 place count 25 transition count 52
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 141 place count 23 transition count 48
Iterating global reduction 3 with 2 rules applied. Total rules applied 143 place count 23 transition count 48
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 147 place count 23 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 149 place count 21 transition count 44
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 5 with 2 rules applied. Total rules applied 151 place count 20 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 171 place count 20 transition count 23
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 3 rules applied. Total rules applied 174 place count 20 transition count 20
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 177 place count 17 transition count 20
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 177 place count 17 transition count 16
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 185 place count 13 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 186 place count 13 transition count 15
Applied a total of 186 rules in 22 ms. Remains 13 /146 variables (removed 133) and now considering 15/314 (removed 299) transitions.
// Phase 1: matrix 15 rows 13 cols
[2024-05-22 23:26:17] [INFO ] Computed 5 invariants in 0 ms
[2024-05-22 23:26:17] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-22 23:26:17] [INFO ] Invariant cache hit.
[2024-05-22 23:26:17] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-22 23:26:17] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-22 23:26:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 14/27 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/27 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/28 variables, and 18 constraints, problems are : Problem set: 0 solved, 8 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 5/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 14/27 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/27 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/28 variables, and 26 constraints, problems are : Problem set: 0 solved, 8 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 106ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 107ms
Starting structural reductions in SI_CTL mode, iteration 1 : 13/146 places, 15/314 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 175 ms. Remains : 13/146 places, 15/314 transitions.
[2024-05-22 23:26:18] [INFO ] Flatten gal took : 1 ms
[2024-05-22 23:26:18] [INFO ] Flatten gal took : 1 ms
[2024-05-22 23:26:18] [INFO ] Input system was already deterministic with 15 transitions.
[2024-05-22 23:26:18] [INFO ] Flatten gal took : 0 ms
[2024-05-22 23:26:18] [INFO ] Flatten gal took : 4 ms
[2024-05-22 23:26:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality4666840800970721524.gal : 0 ms
[2024-05-22 23:26:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality5406671179310977131.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4666840800970721524.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5406671179310977131.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...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,80,0.00253,3352,2,22,5,91,5,0,68,57,0


Converting to forward existential form...Done !
original formula: AG((EF((AG(((p4==0)||(p74==1))) + EF((p104==1)))) * (AG((EG((p113==1)) + AF(((p1==0)||(p113==1))))) + (p92==0))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U (!(E(TRUE U !(((p4==0)||(p74==1))))) + E(TRUE U (p104==1))))))] = FALSE * [FwdG(...253
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 10/4/5
(forward)formula 0,0,0.005325,3932,1,0,10,292,29,5,310,178,13
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 146/146 places, 314/314 transitions.
Graph (trivial) has 171 edges and 146 vertex of which 96 / 146 are part of one of the 12 SCC in 0 ms
Free SCC test removed 84 places
Ensure Unique test removed 163 transitions
Reduce isomorphic transitions removed 163 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 75 edges and 60 vertex of which 45 / 60 are part of one of the 9 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 24 transition count 147
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 140 rules applied. Total rules applied 146 place count 12 transition count 19
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 149 place count 9 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 158 place count 9 transition count 10
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 161 place count 9 transition count 7
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 164 place count 6 transition count 7
Applied a total of 164 rules in 4 ms. Remains 6 /146 variables (removed 140) and now considering 7/314 (removed 307) transitions.
// Phase 1: matrix 7 rows 6 cols
[2024-05-22 23:26:18] [INFO ] Computed 3 invariants in 0 ms
[2024-05-22 23:26:18] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-22 23:26:18] [INFO ] Invariant cache hit.
[2024-05-22 23:26:18] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2024-05-22 23:26:18] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-22 23:26:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 3/6 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/12 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 15 constraints, problems are : Problem set: 0 solved, 3 unsolved in 30 ms.
Refiners :[Domain max(s): 6/6 constraints, Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 3/6 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 6/12 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/12 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/12 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 18 constraints, problems are : Problem set: 0 solved, 3 unsolved in 31 ms.
Refiners :[Domain max(s): 6/6 constraints, Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 63ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/146 places, 7/314 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 101 ms. Remains : 6/146 places, 7/314 transitions.
[2024-05-22 23:26:18] [INFO ] Flatten gal took : 0 ms
[2024-05-22 23:26:18] [INFO ] Flatten gal took : 0 ms
[2024-05-22 23:26:18] [INFO ] Input system was already deterministic with 7 transitions.
[2024-05-22 23:26:18] [INFO ] Flatten gal took : 1 ms
[2024-05-22 23:26:18] [INFO ] Flatten gal took : 0 ms
[2024-05-22 23:26:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality7313246779847643231.gal : 1 ms
[2024-05-22 23:26:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality15039680775501831778.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality7313246779847643231.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15039680775501831778.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8,0.001411,3308,2,10,5,38,5,0,32,22,0


Converting to forward existential form...Done !
original formula: EF(EG((AF(((p115==0)&&(p7==1))) + (p139==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(EG(!(((p115==0)&&(p7==1))))) + (p139==1)))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.00272,3624,1,0,9,108,23,3,128,90,11
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 146/146 places, 314/314 transitions.
Graph (trivial) has 142 edges and 146 vertex of which 60 / 146 are part of one of the 17 SCC in 0 ms
Free SCC test removed 43 places
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 103 transition count 198
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 91 transition count 196
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 29 place count 89 transition count 196
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 29 place count 89 transition count 186
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 49 place count 79 transition count 186
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 63 place count 72 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 3 with 58 rules applied. Total rules applied 121 place count 72 transition count 121
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 125 place count 70 transition count 119
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 128 place count 70 transition count 119
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 69 transition count 118
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 69 transition count 118
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 69 transition count 116
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 134 place count 68 transition count 115
Applied a total of 134 rules in 19 ms. Remains 68 /146 variables (removed 78) and now considering 115/314 (removed 199) transitions.
[2024-05-22 23:26:18] [INFO ] Flow matrix only has 89 transitions (discarded 26 similar events)
// Phase 1: matrix 89 rows 68 cols
[2024-05-22 23:26:18] [INFO ] Computed 13 invariants in 1 ms
[2024-05-22 23:26:18] [INFO ] Implicit Places using invariants in 37 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 67/146 places, 115/314 transitions.
Graph (trivial) has 65 edges and 67 vertex of which 22 / 67 are part of one of the 10 SCC in 0 ms
Free SCC test removed 12 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 50 transition count 89
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 50 transition count 89
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 0 with 9 rules applied. Total rules applied 20 place count 50 transition count 80
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 24 place count 46 transition count 80
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 46 transition count 79
Applied a total of 25 rules in 5 ms. Remains 46 /67 variables (removed 21) and now considering 79/115 (removed 36) transitions.
[2024-05-22 23:26:18] [INFO ] Flow matrix only has 51 transitions (discarded 28 similar events)
// Phase 1: matrix 51 rows 46 cols
[2024-05-22 23:26:18] [INFO ] Computed 12 invariants in 1 ms
[2024-05-22 23:26:18] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-22 23:26:18] [INFO ] Flow matrix only has 51 transitions (discarded 28 similar events)
[2024-05-22 23:26:18] [INFO ] Invariant cache hit.
[2024-05-22 23:26:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 23:26:18] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 46/146 places, 79/314 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 112 ms. Remains : 46/146 places, 79/314 transitions.
[2024-05-22 23:26:18] [INFO ] Flatten gal took : 1 ms
[2024-05-22 23:26:18] [INFO ] Flatten gal took : 2 ms
[2024-05-22 23:26:18] [INFO ] Input system was already deterministic with 79 transitions.
[2024-05-22 23:26:18] [INFO ] Flatten gal took : 1 ms
[2024-05-22 23:26:18] [INFO ] Flatten gal took : 2 ms
[2024-05-22 23:26:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality17629848030547185647.gal : 0 ms
[2024-05-22 23:26:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality13240192474916421343.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17629848030547185647.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13240192474916421343.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.44944e+06,0.010189,3728,2,249,5,1675,6,0,244,932,0


Converting to forward existential form...Done !
original formula: AG((((EG(((p105==0)||(p13==1))) + ((p78==0)&&(p117==1))) + ((E(AG(((p110==1)&&((p144==0)||(p142==1)))) U EG((p9!=1))) * ((p57==0)||(p77==...252
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * !((EG((p66==1)) * ((p44==0)||(p67==1))))) * !(((E(!(E(TRUE U !(((p110==1)&&((p144==0)||(p...327
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.04499,5628,1,0,24,11573,46,11,1159,7474,21
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
// Phase 1: matrix 314 rows 146 cols
[2024-05-22 23:26:18] [INFO ] Computed 13 invariants in 1 ms
[2024-05-22 23:26:18] [INFO ] Implicit Places using invariants in 154 ms returned [145]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 158 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/146 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 162 ms. Remains : 145/146 places, 314/314 transitions.
[2024-05-22 23:26:18] [INFO ] Flatten gal took : 7 ms
[2024-05-22 23:26:18] [INFO ] Flatten gal took : 7 ms
[2024-05-22 23:26:18] [INFO ] Input system was already deterministic with 314 transitions.
[2024-05-22 23:26:18] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:26:18] [INFO ] Flatten gal took : 7 ms
[2024-05-22 23:26:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality5290820440569005401.gal : 2 ms
[2024-05-22 23:26:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality13484415811440978686.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5290820440569005401.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13484415811440978686.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.9161e+12,0.147231,9244,2,3496,5,31644,6,0,896,19345,0


Converting to forward existential form...Done !
original formula: EF((AF((((p94==1)&&(p101==0))&&((p81==0)&&(p134==1)))) * (EF((p38==1)) + EX((p137==0)))))
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,TRUE) * !(EG(!((((p94==1)&&(p101==0))&&((p81==0)&&(p134==1))))))),TRUE) * (p38==1))] != FALSE...264
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,1.15474,45432,1,0,10,270897,21,3,4459,52991,10
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 314/314 transitions.
Applied a total of 0 rules in 3 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-05-22 23:26:19] [INFO ] Invariant cache hit.
[2024-05-22 23:26:19] [INFO ] Implicit Places using invariants in 109 ms returned [145]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 110 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/146 places, 314/314 transitions.
Applied a total of 0 rules in 1 ms. Remains 145 /145 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 145/146 places, 314/314 transitions.
[2024-05-22 23:26:19] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:26:19] [INFO ] Flatten gal took : 8 ms
[2024-05-22 23:26:19] [INFO ] Input system was already deterministic with 314 transitions.
[2024-05-22 23:26:19] [INFO ] Flatten gal took : 7 ms
[2024-05-22 23:26:19] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:26:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality17488170809017612308.gal : 2 ms
[2024-05-22 23:26:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality17564822907681630598.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality17488170809017612308.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17564822907681630598.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.9161e+12,0.143924,8984,2,3496,5,31644,6,0,896,19345,0


Converting to forward existential form...Done !
original formula: (AX(!(E(AF((p116!=1)) U (EG((p97==1)) * (EF(((p94==0)||(p90==1))) + !(((p49==0)||(p93==1)))))))) + AG(((p86==0)||(p104==1))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(EX(!(!(E(!(EG(!((p116!=1)))) U (EG((p97==1)) * (E(TRUE U ((p94==0)||(p90==1))) + !(((p49==0)|...218
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,1.32954,51788,1,0,46,323689,39,30,4719,95223,41
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 146/146 places, 314/314 transitions.
Graph (trivial) has 177 edges and 146 vertex of which 91 / 146 are part of one of the 12 SCC in 0 ms
Free SCC test removed 79 places
Ensure Unique test removed 156 transitions
Reduce isomorphic transitions removed 156 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 88 edges and 65 vertex of which 63 / 65 are part of one of the 12 SCC in 1 ms
Free SCC test removed 51 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 14 transition count 157
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 151 transitions
Reduce isomorphic transitions removed 151 transitions.
Iterating post reduction 1 with 162 rules applied. Total rules applied 165 place count 3 transition count 6
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 167 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 167 place count 3 transition count 3
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 169 place count 2 transition count 3
Applied a total of 169 rules in 9 ms. Remains 2 /146 variables (removed 144) and now considering 3/314 (removed 311) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-22 23:26:21] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 23:26:21] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-22 23:26:21] [INFO ] Invariant cache hit.
[2024-05-22 23:26:21] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2024-05-22 23:26:21] [INFO ] Redundant transitions in 1 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-22 23:26:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/4 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 5 constraints, problems are : Problem set: 0 solved, 1 unsolved in 19 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/2 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/4 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 20 ms.
Refiners :[Domain max(s): 2/2 constraints, Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 41ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 41ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/146 places, 3/314 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 84 ms. Remains : 2/146 places, 3/314 transitions.
[2024-05-22 23:26:21] [INFO ] Flatten gal took : 1 ms
[2024-05-22 23:26:21] [INFO ] Flatten gal took : 0 ms
[2024-05-22 23:26:21] [INFO ] Input system was already deterministic with 3 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 23:26:21] [INFO ] Flatten gal took : 1 ms
[2024-05-22 23:26:21] [INFO ] Flatten gal took : 1 ms
[2024-05-22 23:26:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12396519465715746479.gal : 0 ms
[2024-05-22 23:26:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7173415432789124982.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12396519465715746479.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7173415432789124982.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 146 /146 variables (removed 0) and now considering 314/314 (removed 0) transitions.
// Phase 1: matrix 314 rows 146 cols
[2024-05-22 23:26:21] [INFO ] Computed 13 invariants in 5 ms
[2024-05-22 23:26:21] [INFO ] Implicit Places using invariants in 105 ms returned [145]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 107 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/146 places, 314/314 transitions.
Applied a total of 0 rules in 1 ms. Remains 145 /145 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 110 ms. Remains : 145/146 places, 314/314 transitions.
[2024-05-22 23:26:21] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:26:21] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:26:21] [INFO ] Input system was already deterministic with 314 transitions.
[2024-05-22 23:26:21] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:26:21] [INFO ] Flatten gal took : 6 ms
[2024-05-22 23:26:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality1272118351381050797.gal : 2 ms
[2024-05-22 23:26:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality15743017987344423843.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1272118351381050797.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15743017987344423843.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.9161e+12,0.144976,9248,2,3496,5,31644,6,0,896,19345,0


Converting to forward existential form...Done !
original formula: EX((EG((EG((p3==1)) * (p131==0))) + EG((EF((p70==0)) * AX(((p56==1)&&(p89==1)))))))
=> equivalent forward existential formula: ([FwdG(EY(Init),(EG((p3==1)) * (p131==0)))] != FALSE + [FwdG(EY(Init),(E(TRUE U (p70==0)) * !(EX(!(((p56==1)&&(p...178
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,1.33474,55084,1,0,11,355640,29,2,4205,86424,11
FORMULA FlexibleBarrier-PT-12a-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 23:26:22] [INFO ] Flatten gal took : 9 ms
[2024-05-22 23:26:22] [INFO ] Flatten gal took : 6 ms
Total runtime 35606 ms.

BK_STOP 1716420382910

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-12a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-12a, 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 r180-tall-171640602600065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-12a.tgz
mv FlexibleBarrier-PT-12a execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;