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-171640602500049.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-10a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640602500049
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.5K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 13 09:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 13 09:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 13 09:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 13 09:45 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 94K 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-10a-CTLCardinality-2024-00
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-2024-01
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-2024-02
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-2024-03
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-2024-04
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-2024-05
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-2024-06
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-2024-07
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-2024-08
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-2024-09
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-2024-10
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-2024-11
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-2023-12
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-2023-13
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-2023-14
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716418476082

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-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 22:54:37] [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 22:54:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:54:37] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-05-22 22:54:37] [INFO ] Transformed 123 places.
[2024-05-22 22:54:37] [INFO ] Transformed 334 transitions.
[2024-05-22 22:54:37] [INFO ] Found NUPN structural information;
[2024-05-22 22:54:37] [INFO ] Parsed PT model containing 123 places and 334 transitions and 1467 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Ensure Unique test removed 82 transitions
Reduce redundant transitions removed 82 transitions.
Support contains 73 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 252/252 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 123 transition count 242
Applied a total of 10 rules in 21 ms. Remains 123 /123 variables (removed 0) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 123 cols
[2024-05-22 22:54:37] [INFO ] Computed 12 invariants in 13 ms
[2024-05-22 22:54:37] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-22 22:54:37] [INFO ] Invariant cache hit.
[2024-05-22 22:54:37] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-22 22:54:37] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-22 22:54:37] [INFO ] Invariant cache hit.
[2024-05-22 22:54:37] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 6907 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 6755 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 13818ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 13832ms
Starting structural reductions in LTL mode, iteration 1 : 123/123 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14258 ms. Remains : 123/123 places, 242/252 transitions.
Support contains 73 out of 123 places after structural reductions.
[2024-05-22 22:54:51] [INFO ] Flatten gal took : 36 ms
[2024-05-22 22:54:51] [INFO ] Flatten gal took : 16 ms
[2024-05-22 22:54:51] [INFO ] Input system was already deterministic with 242 transitions.
Reduction of identical properties reduced properties to check from 58 to 57
RANDOM walk for 40000 steps (8 resets) in 1001 ms. (39 steps per ms) remains 1/57 properties
BEST_FIRST walk for 40003 steps (8 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
[2024-05-22 22:54:52] [INFO ] Invariant cache hit.
[2024-05-22 22:54:52] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Real declared 14/365 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 21 ms.
Refiners :[Domain max(s): 2/123 constraints, Positive P Invariants (semi-flows): 2/12 constraints, State Equation: 0/123 constraints, ReadFeed: 0/141 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 34ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-22 22:54:52] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:54:52] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:54:52] [INFO ] Input system was already deterministic with 242 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-22 22:54:52] [INFO ] Invariant cache hit.
[2024-05-22 22:54:52] [INFO ] Implicit Places using invariants in 91 ms returned [121, 122]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 93 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/123 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 121 /121 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 121/123 places, 242/242 transitions.
[2024-05-22 22:54:52] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:54:52] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:54:52] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-22 22:54:52] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:54:52] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:54:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality5706790459047075510.gal : 5 ms
[2024-05-22 22:54:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality12388306035680295160.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/CTLCardinality5706790459047075510.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12388306035680295160.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,6.19174e+10,0.077978,6040,2,1684,5,13619,6,0,728,8529,0


Converting to forward existential form...Done !
original formula: E(((p115==1) + (EX(TRUE) * (((p120==1)||(p4==1))||((p10==1)||((p93==1)&&(p27==1)))))) U AG(EF(((EG((p79==0)) + (p49==0)) + (p89==1)))))
=> equivalent forward existential formula: [(FwdU(Init,((p115==1) + (EX(TRUE) * (((p120==1)||(p4==1))||((p10==1)||((p93==1)&&(p27==1))))))) * !(E(TRUE U !(...217
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.421818,21008,1,0,14,112962,30,6,3552,30444,16
FORMULA FlexibleBarrier-PT-10a-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-22 22:54:53] [INFO ] Invariant cache hit.
[2024-05-22 22:54:53] [INFO ] Implicit Places using invariants in 100 ms returned [121, 122]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 100 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/123 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 121 /121 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107 ms. Remains : 121/123 places, 242/242 transitions.
[2024-05-22 22:54:53] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:54:53] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:54:53] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-22 22:54:53] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:54:53] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:54:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality12482613067230463327.gal : 3 ms
[2024-05-22 22:54:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality7495530329560963686.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/CTLCardinality12482613067230463327.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7495530329560963686.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,6.19174e+10,0.068576,6120,2,1684,5,13619,6,0,728,8529,0


Converting to forward existential form...Done !
original formula: EX(EF((A((((p31==0)||(p94==1))&&(p16==1)) U AG(((p120==0)||(p66==1)))) * ((A((((p118==0)||(p41==1))||(p104==1)) U ((p30==0)||(p103==1))) ...182
=> equivalent forward existential formula: (([(((FwdU(EY(Init),TRUE) * !((E(!(!(E(TRUE U !(((p120==0)||(p66==1)))))) U (!((((p31==0)||(p94==1))&&(p16==1)))...859
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 237/5/5
(forward)formula 0,0,0.552811,25400,1,0,14,135949,35,2,3774,39628,19
FORMULA FlexibleBarrier-PT-10a-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-22 22:54:53] [INFO ] Invariant cache hit.
[2024-05-22 22:54:53] [INFO ] Implicit Places using invariants in 105 ms returned [121, 122]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 106 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/123 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 121 /121 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113 ms. Remains : 121/123 places, 242/242 transitions.
[2024-05-22 22:54:53] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:54:53] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:54:54] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-22 22:54:54] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:54:54] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:54:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality5671576938864852462.gal : 6 ms
[2024-05-22 22:54:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality11025796956626744971.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/CTLCardinality5671576938864852462.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11025796956626744971.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,6.19174e+10,0.069295,6124,2,1684,5,13619,6,0,728,8529,0


Converting to forward existential form...Done !
original formula: AX(AG(EF(((p16==1)&&(p15==0)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U ((p16==1)&&(p15==0)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.3727,20028,1,0,6,110918,14,0,3336,16200,5
FORMULA FlexibleBarrier-PT-10a-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 99 edges and 123 vertex of which 30 / 123 are part of one of the 10 SCC in 3 ms
Free SCC test removed 20 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 134 edges and 100 vertex of which 93 / 100 are part of one of the 13 SCC in 1 ms
Free SCC test removed 80 places
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 0 with 4 rules applied. Total rules applied 5 place count 20 transition count 184
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Iterating post reduction 1 with 168 rules applied. Total rules applied 173 place count 12 transition count 24
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 174 place count 11 transition count 22
Iterating global reduction 2 with 1 rules applied. Total rules applied 175 place count 11 transition count 22
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 177 place count 11 transition count 20
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 179 place count 10 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 180 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 5 with 9 rules applied. Total rules applied 189 place count 9 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 190 place count 9 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 191 place count 8 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 191 place count 8 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 195 place count 6 transition count 7
Applied a total of 195 rules in 29 ms. Remains 6 /123 variables (removed 117) and now considering 7/242 (removed 235) transitions.
// Phase 1: matrix 7 rows 6 cols
[2024-05-22 22:54:54] [INFO ] Computed 3 invariants in 2 ms
[2024-05-22 22:54:54] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-22 22:54:54] [INFO ] Invariant cache hit.
[2024-05-22 22:54:54] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2024-05-22 22:54:54] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-22 22:54:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 27 ms.
Refiners :[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, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 26 ms.
Refiners :[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 56ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 56ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/123 places, 7/242 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 123 ms. Remains : 6/123 places, 7/242 transitions.
[2024-05-22 22:54:54] [INFO ] Flatten gal took : 1 ms
[2024-05-22 22:54:54] [INFO ] Flatten gal took : 0 ms
[2024-05-22 22:54:54] [INFO ] Input system was already deterministic with 7 transitions.
[2024-05-22 22:54:54] [INFO ] Flatten gal took : 1 ms
[2024-05-22 22:54:54] [INFO ] Flatten gal took : 0 ms
[2024-05-22 22:54:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality3960975731695618800.gal : 0 ms
[2024-05-22 22:54:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality13533869355560138509.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/CTLCardinality3960975731695618800.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13533869355560138509.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.001431,3308,2,10,5,38,5,0,32,22,0


Converting to forward existential form...Done !
original formula: EF(EG(((p100==1)&&((p76==0)||(p117==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p100==1)&&((p76==0)||(p117==1))))] != FALSE
Hit Full ! (commute/partial/dont) 0/2/7
(forward)formula 0,1,0.002355,3624,1,0,6,91,18,0,138,56,8
FORMULA FlexibleBarrier-PT-10a-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 94 edges and 123 vertex of which 27 / 123 are part of one of the 9 SCC in 1 ms
Free SCC test removed 18 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 134 edges and 102 vertex of which 85 / 102 are part of one of the 13 SCC in 0 ms
Free SCC test removed 72 places
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 7 rules applied. Total rules applied 8 place count 30 transition count 191
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 154 transitions
Reduce isomorphic transitions removed 154 transitions.
Iterating post reduction 1 with 165 rules applied. Total rules applied 173 place count 19 transition count 37
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 175 place count 17 transition count 33
Iterating global reduction 2 with 2 rules applied. Total rules applied 177 place count 17 transition count 33
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 5 rules applied. Total rules applied 182 place count 17 transition count 28
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 185 place count 14 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 197 place count 14 transition count 16
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 4 with 2 rules applied. Total rules applied 199 place count 14 transition count 14
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 203 place count 12 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 205 place count 10 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 205 place count 10 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 209 place count 8 transition count 10
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 210 place count 7 transition count 9
Iterating global reduction 7 with 1 rules applied. Total rules applied 211 place count 7 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 212 place count 7 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 212 place count 7 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 214 place count 6 transition count 7
Applied a total of 214 rules in 7 ms. Remains 6 /123 variables (removed 117) and now considering 7/242 (removed 235) transitions.
// Phase 1: matrix 7 rows 6 cols
[2024-05-22 22:54:54] [INFO ] Computed 3 invariants in 0 ms
[2024-05-22 22:54:54] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-22 22:54:54] [INFO ] Invariant cache hit.
[2024-05-22 22:54:54] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-22 22:54:54] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-22 22:54:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29 ms.
Refiners :[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, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/12 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/12 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/13 variables, and 12 constraints, problems are : Problem set: 0 solved, 3 unsolved in 27 ms.
Refiners :[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 57ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 57ms
Starting structural reductions in SI_CTL mode, iteration 1 : 6/123 places, 7/242 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 104 ms. Remains : 6/123 places, 7/242 transitions.
[2024-05-22 22:54:54] [INFO ] Flatten gal took : 0 ms
[2024-05-22 22:54:54] [INFO ] Flatten gal took : 0 ms
[2024-05-22 22:54:54] [INFO ] Input system was already deterministic with 7 transitions.
[2024-05-22 22:54:54] [INFO ] Flatten gal took : 1 ms
[2024-05-22 22:54:54] [INFO ] Flatten gal took : 0 ms
[2024-05-22 22:54:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality5182237825475834901.gal : 1 ms
[2024-05-22 22:54:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality18042015471427296589.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/CTLCardinality5182237825475834901.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18042015471427296589.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.001654,3304,2,10,5,38,5,0,32,22,0


Converting to forward existential form...Done !
original formula: EF(AG(!(E(AF((p71==1)) U ((p111==0)||(p44==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(E(!(EG(!((p71==1)))) U ((p111==0)||(p44==1))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.002981,3620,1,0,9,119,25,4,128,106,14
FORMULA FlexibleBarrier-PT-10a-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2024-05-22 22:54:54] [INFO ] Computed 12 invariants in 1 ms
[2024-05-22 22:54:54] [INFO ] Implicit Places using invariants in 89 ms returned [121, 122]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 89 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 121 /121 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 95 ms. Remains : 121/123 places, 242/242 transitions.
[2024-05-22 22:54:54] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:54:54] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:54:54] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-22 22:54:54] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:54:54] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:54:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality12095921421306102868.gal : 1 ms
[2024-05-22 22:54:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality5810076816684046097.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/CTLCardinality12095921421306102868.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5810076816684046097.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,6.19174e+10,0.069529,6112,2,1684,5,13619,6,0,728,8529,0


Converting to forward existential form...Done !
original formula: (EG(AX(FALSE)) + EF(((p58==1) * AG((p74==0)))))
=> equivalent forward existential formula: ([FwdG(Init,!(EX(!(FALSE))))] != FALSE + [((FwdU(Init,TRUE) * (p58==1)) * !(E(TRUE U !((p74==0)))))] != FALSE)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.393501,20516,1,0,7,106917,21,0,3539,19898,8
FORMULA FlexibleBarrier-PT-10a-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 100 edges and 123 vertex of which 30 / 123 are part of one of the 10 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 138 edges and 100 vertex of which 96 / 100 are part of one of the 10 SCC in 1 ms
Free SCC test removed 86 places
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 0 with 4 rules applied. Total rules applied 5 place count 14 transition count 184
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 177 transitions
Reduce isomorphic transitions removed 177 transitions.
Iterating post reduction 1 with 187 rules applied. Total rules applied 192 place count 4 transition count 7
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 194 place count 4 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 196 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 196 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 4 with 2 rules applied. Total rules applied 198 place count 2 transition count 3
Applied a total of 198 rules in 4 ms. Remains 2 /123 variables (removed 121) and now considering 3/242 (removed 239) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-22 22:54:55] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 22:54:55] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-22 22:54:55] [INFO ] Invariant cache hit.
[2024-05-22 22:54:55] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2024-05-22 22:54:55] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-22 22:54:55] [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 17 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 23 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 53ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 53ms
Starting structural reductions in SI_CTL mode, iteration 1 : 2/123 places, 3/242 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 98 ms. Remains : 2/123 places, 3/242 transitions.
[2024-05-22 22:54:55] [INFO ] Flatten gal took : 1 ms
[2024-05-22 22:54:55] [INFO ] Flatten gal took : 1 ms
[2024-05-22 22:54:55] [INFO ] Input system was already deterministic with 3 transitions.
RANDOM walk for 4 steps (0 resets) in 8 ms. (0 steps per ms) remains 0/1 properties
FORMULA FlexibleBarrier-PT-10a-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 22:54:55] [INFO ] Flatten gal took : 0 ms
[2024-05-22 22:54:55] [INFO ] Flatten gal took : 1 ms
[2024-05-22 22:54:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9005810482417101051.gal : 1 ms
[2024-05-22 22:54:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3349996547608395850.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/ReachabilityCardinality9005810482417101051.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3349996547608395850.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 SI_CTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 95 edges and 123 vertex of which 27 / 123 are part of one of the 9 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 131 edges and 102 vertex of which 83 / 102 are part of one of the 12 SCC in 0 ms
Free SCC test removed 71 places
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 7 rules applied. Total rules applied 8 place count 31 transition count 191
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Iterating post reduction 1 with 158 rules applied. Total rules applied 166 place count 21 transition count 43
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 167 place count 20 transition count 41
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 20 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 3 rules applied. Total rules applied 171 place count 20 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 173 place count 18 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 190 place count 18 transition count 21
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 4 with 2 rules applied. Total rules applied 192 place count 18 transition count 19
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 196 place count 16 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 198 place count 14 transition count 17
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 198 place count 14 transition count 14
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 204 place count 11 transition count 14
Applied a total of 204 rules in 6 ms. Remains 11 /123 variables (removed 112) and now considering 14/242 (removed 228) transitions.
// Phase 1: matrix 14 rows 11 cols
[2024-05-22 22:54:55] [INFO ] Computed 4 invariants in 0 ms
[2024-05-22 22:54:55] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-22 22:54:55] [INFO ] Invariant cache hit.
[2024-05-22 22:54:55] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2024-05-22 22:54:55] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-22 22:54:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 4/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 13/24 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/24 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/25 variables, and 15 constraints, problems are : Problem set: 0 solved, 8 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 11/11 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 4/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 13/24 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/24 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/25 variables, and 23 constraints, problems are : Problem set: 0 solved, 8 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 107ms 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 : 11/123 places, 14/242 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 148 ms. Remains : 11/123 places, 14/242 transitions.
[2024-05-22 22:54:55] [INFO ] Flatten gal took : 1 ms
[2024-05-22 22:54:55] [INFO ] Flatten gal took : 1 ms
[2024-05-22 22:54:55] [INFO ] Input system was already deterministic with 14 transitions.
[2024-05-22 22:54:55] [INFO ] Flatten gal took : 1 ms
[2024-05-22 22:54:55] [INFO ] Flatten gal took : 0 ms
[2024-05-22 22:54:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality9086097798170211343.gal : 4 ms
[2024-05-22 22:54:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality12070196707908977590.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/CTLCardinality9086097798170211343.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12070196707908977590.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,40,0.002263,3344,2,19,5,79,5,0,59,48,0


Converting to forward existential form...Done !
original formula: EF(((p112==1) + (AF(((p47==0)&&(p15==1))) * !(E((p13==0) U (p30==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (p112==1))] != FALSE + [((FwdU(Init,TRUE) * !(EG(!(((p47==0)&&(p15==1)))))) * !(E((p13==0) ...179
(forward)formula 0,1,0.002705,3660,1,0,6,79,7,1,62,48,1
FORMULA FlexibleBarrier-PT-10a-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2024-05-22 22:54:55] [INFO ] Computed 12 invariants in 2 ms
[2024-05-22 22:54:55] [INFO ] Implicit Places using invariants in 86 ms returned [121, 122]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 86 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 121 /121 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 121/123 places, 242/242 transitions.
[2024-05-22 22:54:55] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:54:55] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:54:55] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-22 22:54:55] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:54:55] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:54:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality4113437465286701273.gal : 2 ms
[2024-05-22 22:54:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality12278433793659235978.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/CTLCardinality4113437465286701273.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12278433793659235978.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,6.19174e+10,0.077323,6112,2,1684,5,13619,6,0,728,8529,0


Converting to forward existential form...Done !
original formula: E((p21==0) U AG(((EX(AF(((p2==0)||(p6==1)))) + (p53==0)) + A(((p35==0)||(p95==1)) U (p15!=1)))))
=> equivalent forward existential formula: [(FwdU(Init,(p21==0)) * !(E(TRUE U !(((EX(!(EG(!(((p2==0)||(p6==1)))))) + (p53==0)) + !((E(!((p15!=1)) U (!(((p3...223
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 239/0/3
Hit Full ! (commute/partial/dont) 240/0/2
(forward)formula 0,1,0.685491,31340,1,0,14,189656,43,5,3785,74500,17
FORMULA FlexibleBarrier-PT-10a-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 100 edges and 123 vertex of which 30 / 123 are part of one of the 10 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 93 transition count 176
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 0 with 45 rules applied. Total rules applied 66 place count 93 transition count 131
Applied a total of 66 rules in 19 ms. Remains 93 /123 variables (removed 30) and now considering 131/242 (removed 111) transitions.
[2024-05-22 22:54:56] [INFO ] Flow matrix only has 122 transitions (discarded 9 similar events)
// Phase 1: matrix 122 rows 93 cols
[2024-05-22 22:54:56] [INFO ] Computed 12 invariants in 1 ms
[2024-05-22 22:54:56] [INFO ] Implicit Places using invariants in 69 ms returned [91, 92]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 70 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 91/123 places, 131/242 transitions.
Graph (trivial) has 128 edges and 91 vertex of which 86 / 91 are part of one of the 10 SCC in 1 ms
Free SCC test removed 76 places
Ensure Unique test removed 114 transitions
Reduce isomorphic transitions removed 114 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 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 14 transition count 16
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 11 place count 6 transition count 8
Iterating global reduction 2 with 8 rules applied. Total rules applied 19 place count 6 transition count 8
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 20 place count 6 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 5 transition count 6
Applied a total of 22 rules in 4 ms. Remains 5 /91 variables (removed 86) and now considering 6/131 (removed 125) transitions.
[2024-05-22 22:54:56] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
// Phase 1: matrix 5 rows 5 cols
[2024-05-22 22:54:56] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 22:54:56] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-22 22:54:56] [INFO ] Flow matrix only has 5 transitions (discarded 1 similar events)
[2024-05-22 22:54:56] [INFO ] Invariant cache hit.
[2024-05-22 22:54:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 22:54:56] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 5/123 places, 6/242 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 124 ms. Remains : 5/123 places, 6/242 transitions.
[2024-05-22 22:54:56] [INFO ] Flatten gal took : 0 ms
[2024-05-22 22:54:56] [INFO ] Flatten gal took : 0 ms
[2024-05-22 22:54:56] [INFO ] Input system was already deterministic with 6 transitions.
[2024-05-22 22:54:56] [INFO ] Flatten gal took : 0 ms
[2024-05-22 22:54:56] [INFO ] Flatten gal took : 1 ms
[2024-05-22 22:54:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality13427664449010186830.gal : 1 ms
[2024-05-22 22:54:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality2211367540692361398.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/CTLCardinality13427664449010186830.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2211367540692361398.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,4,0.001344,3300,2,10,5,36,6,0,24,21,0


Converting to forward existential form...Done !
original formula: AG(EF(((p0==0)&&(p18==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p0==0)&&(p18==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.002281,3616,1,0,6,69,14,0,99,41,5
FORMULA FlexibleBarrier-PT-10a-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2024-05-22 22:54:56] [INFO ] Computed 12 invariants in 2 ms
[2024-05-22 22:54:56] [INFO ] Implicit Places using invariants in 82 ms returned [121, 122]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 84 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 121 /121 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 87 ms. Remains : 121/123 places, 242/242 transitions.
[2024-05-22 22:54:56] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:54:56] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:54:56] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-22 22:54:56] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:54:56] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:54:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality17666919795057103185.gal : 2 ms
[2024-05-22 22:54:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality10589610727214620329.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/CTLCardinality17666919795057103185.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10589610727214620329.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,6.19174e+10,0.070543,6120,2,1684,5,13619,6,0,728,8529,0


Converting to forward existential form...Done !
original formula: EF((EX(((((p69==0)&&(p73==1)) + (E(((p104==0)||(p74==1)) U ((p79==0)||(p42==1))) * ((p81==0)||(p40==1)))) + AG(((p102==0)||(p99==1))))) *...192
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * EX(((((p69==0)&&(p73==1)) + (E(((p104==0)||(p74==1)) U ((p79==0)||(p42==1))) * ((p81==...281
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.36282,19392,1,0,8,105991,16,1,3336,15413,7
FORMULA FlexibleBarrier-PT-10a-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-22 22:54:56] [INFO ] Invariant cache hit.
[2024-05-22 22:54:57] [INFO ] Implicit Places using invariants in 90 ms returned [121, 122]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 91 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 121 /121 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 121/123 places, 242/242 transitions.
[2024-05-22 22:54:57] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:54:57] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:54:57] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-22 22:54:57] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:54:57] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:54:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality6824564190927625277.gal : 2 ms
[2024-05-22 22:54:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality13066662771467935222.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/CTLCardinality6824564190927625277.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13066662771467935222.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,6.19174e+10,0.074477,6112,2,1684,5,13619,6,0,728,8529,0


Converting to forward existential form...Done !
original formula: AX(AG(((AX(((p54==0)&&(p37==1))) + !(A(((p112==0)||(p15==1)) U (p31==1)))) + ((p97==0)||(((p14==0)&&(p52==1))&&((p50==0)&&((((p103==1)||(...204
=> equivalent forward existential formula: [(EY(((FwdU(EY(Init),TRUE) * !(((p97==0)||(((p14==0)&&(p52==1))&&((p50==0)&&((((p103==1)||(p110==0))||((p79==1)|...309
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 239/0/3
(forward)formula 0,0,0.599239,26616,1,0,17,150861,29,6,3800,58266,16
FORMULA FlexibleBarrier-PT-10a-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-22 22:54:57] [INFO ] Invariant cache hit.
[2024-05-22 22:54:57] [INFO ] Implicit Places using invariants in 83 ms returned [121]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 84 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 91 ms. Remains : 122/123 places, 242/242 transitions.
[2024-05-22 22:54:57] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:54:57] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:54:57] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-22 22:54:57] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:54:57] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:54:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality14285040793606206174.gal : 1 ms
[2024-05-22 22:54:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality860106735734097176.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/CTLCardinality14285040793606206174.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality860106735734097176.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,6.19174e+10,0.304944,16936,2,2315,5,93368,6,0,730,40375,0


Converting to forward existential form...Done !
original formula: EF((EX(E(!(AX((p69==1))) U !(EF((p122==1))))) * EF(AX((p33!=1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * EX(E(!(!(EX(!((p69==1))))) U !(E(TRUE U (p122==1)))))),TRUE) * !(EX(!((p33!=1)))))] !=...161
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.971602,35808,1,0,10,226493,18,1,3450,53843,9
FORMULA FlexibleBarrier-PT-10a-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-22 22:54:58] [INFO ] Invariant cache hit.
[2024-05-22 22:54:58] [INFO ] Implicit Places using invariants in 68 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 71 ms. Remains : 122/123 places, 242/242 transitions.
[2024-05-22 22:54:58] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:54:58] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:54:58] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-22 22:54:58] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:54:58] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:54:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality7399476544316863247.gal : 2 ms
[2024-05-22 22:54:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality14799370700804027666.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/CTLCardinality7399476544316863247.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14799370700804027666.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,6.19174e+10,0.202414,12160,2,2113,5,48590,6,0,730,31170,0


Converting to forward existential form...Done !
original formula: AG(EX((((p114==0)||(((p10==0)||(p116==1))&&((p93==0)||(p55==1))))||((p106==0)&&((p56==0)||(p121==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((((p114==0)||(((p10==0)||(p116==1))&&((p93==0)||(p55==1))))||((p106==0)&&((p56==0)||(p1...176
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.626353,26036,1,0,6,157890,10,0,3379,43016,4
FORMULA FlexibleBarrier-PT-10a-CTLCardinality-2023-13 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 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-22 22:54:59] [INFO ] Invariant cache hit.
[2024-05-22 22:54:59] [INFO ] Implicit Places using invariants in 93 ms returned [121, 122]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 94 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/123 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 121 /121 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 96 ms. Remains : 121/123 places, 242/242 transitions.
[2024-05-22 22:54:59] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:54:59] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:54:59] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-22 22:54:59] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:54:59] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:54:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality5566945501519773759.gal : 1 ms
[2024-05-22 22:54:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality7380864379494905242.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/CTLCardinality5566945501519773759.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7380864379494905242.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,6.19174e+10,0.06985,6112,2,1684,5,13619,6,0,728,8529,0


Converting to forward existential form...Done !
original formula: (AF(AG(E(AF(((p26==0)||(p50==1))) U (EF((p98==0)) * AF(((p21==0)||(p119==1))))))) + (AX(AF(((p87==0)&&(p107==1)))) * E(((p109==0)||(p21==...272
=> equivalent forward existential formula: ([FwdG(EY((Init * !(!(EG(!(!(E(TRUE U !(E(!(EG(!(((p26==0)||(p50==1))))) U (E(TRUE U (p98==0)) * !(EG(!(((p21==0...520
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 239/0/3
Hit Full ! (commute/partial/dont) 237/0/5
Hit Full ! (commute/partial/dont) 220/0/22
(forward)formula 0,0,0.924794,39912,1,0,29,247285,65,14,4062,116624,38
FORMULA FlexibleBarrier-PT-10a-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 94 edges and 123 vertex of which 27 / 123 are part of one of the 9 SCC in 0 ms
Free SCC test removed 18 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 95 transition count 186
Drop transitions (Redundant composition of simpler transitions.) removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 0 with 53 rules applied. Total rules applied 74 place count 95 transition count 133
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 77 place count 95 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 78 place count 94 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 79 place count 94 transition count 132
Applied a total of 79 rules in 16 ms. Remains 94 /123 variables (removed 29) and now considering 132/242 (removed 110) transitions.
[2024-05-22 22:55:00] [INFO ] Flow matrix only has 124 transitions (discarded 8 similar events)
// Phase 1: matrix 124 rows 94 cols
[2024-05-22 22:55:00] [INFO ] Computed 12 invariants in 2 ms
[2024-05-22 22:55:00] [INFO ] Implicit Places using invariants in 51 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 93/123 places, 132/242 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 93 transition count 122
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 83 transition count 122
Applied a total of 20 rules in 6 ms. Remains 83 /93 variables (removed 10) and now considering 122/132 (removed 10) transitions.
[2024-05-22 22:55:00] [INFO ] Flow matrix only has 114 transitions (discarded 8 similar events)
// Phase 1: matrix 114 rows 83 cols
[2024-05-22 22:55:00] [INFO ] Computed 11 invariants in 0 ms
[2024-05-22 22:55:00] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 22:55:00] [INFO ] Flow matrix only has 114 transitions (discarded 8 similar events)
[2024-05-22 22:55:00] [INFO ] Invariant cache hit.
[2024-05-22 22:55:00] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-22 22:55:00] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 83/123 places, 122/242 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 174 ms. Remains : 83/123 places, 122/242 transitions.
[2024-05-22 22:55:00] [INFO ] Flatten gal took : 2 ms
[2024-05-22 22:55:00] [INFO ] Flatten gal took : 3 ms
[2024-05-22 22:55:00] [INFO ] Input system was already deterministic with 122 transitions.
[2024-05-22 22:55:00] [INFO ] Flatten gal took : 2 ms
[2024-05-22 22:55:00] [INFO ] Flatten gal took : 3 ms
[2024-05-22 22:55:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality13060640995595806067.gal : 1 ms
[2024-05-22 22:55:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality2347754165179114325.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/CTLCardinality13060640995595806067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2347754165179114325.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,1.20796e+09,0.061536,6448,2,411,5,18740,6,0,445,8252,0


Converting to forward existential form...Done !
original formula: AG(E(!(AF(!(((p107==0)||(p79==1))))) U ((p122==0)||(p98==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(!(EG(!(!(((p107==0)||(p79==1))))))) U ((p122==0)||(p98==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.112315,6976,1,0,38,19582,22,28,1987,9475,37
FORMULA FlexibleBarrier-PT-10a-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 22:55:00] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:55:00] [INFO ] Flatten gal took : 5 ms
Total runtime 23710 ms.

BK_STOP 1716418500975

--------------------
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-10a"
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-10a, 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-171640602500049"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-10a.tgz
mv FlexibleBarrier-PT-10a 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 ;