Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 7.3K Apr 29 13:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 29 13:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Apr 29 13:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Apr 29 13:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 214K May 10 09:33 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-16a-CTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-16a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1652640736175

Running Version 202205111006
[2022-05-15 18:52:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 18:52:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 18:52:18] [INFO ] Load time of PNML (sax parser for PT used): 228 ms
[2022-05-15 18:52:18] [INFO ] Transformed 195 places.
[2022-05-15 18:52:18] [INFO ] Transformed 724 transitions.
[2022-05-15 18:52:18] [INFO ] Found NUPN structural information;
[2022-05-15 18:52:18] [INFO ] Parsed PT model containing 195 places and 724 transitions in 410 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 226 transitions
Reduce redundant transitions removed 226 transitions.
FORMULA FlexibleBarrier-PT-16a-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 498/498 transitions.
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 195 transition count 482
Applied a total of 16 rules in 47 ms. Remains 195 /195 variables (removed 0) and now considering 482/498 (removed 16) transitions.
// Phase 1: matrix 482 rows 195 cols
[2022-05-15 18:52:18] [INFO ] Computed 18 place invariants in 25 ms
[2022-05-15 18:52:19] [INFO ] Implicit Places using invariants in 363 ms returned []
// Phase 1: matrix 482 rows 195 cols
[2022-05-15 18:52:19] [INFO ] Computed 18 place invariants in 6 ms
[2022-05-15 18:52:19] [INFO ] State equation strengthened by 321 read => feed constraints.
[2022-05-15 18:52:19] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 1111 ms to find 0 implicit places.
// Phase 1: matrix 482 rows 195 cols
[2022-05-15 18:52:20] [INFO ] Computed 18 place invariants in 13 ms
[2022-05-15 18:52:20] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 195/195 places, 482/498 transitions.
Finished structural reductions, in 1 iterations. Remains : 195/195 places, 482/498 transitions.
Support contains 50 out of 195 places after structural reductions.
[2022-05-15 18:52:20] [INFO ] Flatten gal took : 102 ms
[2022-05-15 18:52:20] [INFO ] Flatten gal took : 51 ms
[2022-05-15 18:52:21] [INFO ] Input system was already deterministic with 482 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 52) seen :51
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 482 rows 195 cols
[2022-05-15 18:52:21] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-15 18:52:21] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2022-05-15 18:52:21] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2022-05-15 18:52:21] [INFO ] Flatten gal took : 48 ms
[2022-05-15 18:52:21] [INFO ] Flatten gal took : 54 ms
[2022-05-15 18:52:21] [INFO ] Input system was already deterministic with 482 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 20 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (removed 0) transitions.
// Phase 1: matrix 482 rows 195 cols
[2022-05-15 18:52:21] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-15 18:52:22] [INFO ] Implicit Places using invariants in 290 ms returned [194]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 298 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/195 places, 482/482 transitions.
Applied a total of 0 rules in 10 ms. Remains 194 /194 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 194/195 places, 482/482 transitions.
[2022-05-15 18:52:22] [INFO ] Flatten gal took : 54 ms
[2022-05-15 18:52:22] [INFO ] Flatten gal took : 49 ms
[2022-05-15 18:52:22] [INFO ] Input system was already deterministic with 482 transitions.
[2022-05-15 18:52:22] [INFO ] Flatten gal took : 33 ms
[2022-05-15 18:52:22] [INFO ] Flatten gal took : 39 ms
[2022-05-15 18:52:22] [INFO ] Time to serialize gal into /tmp/CTLFireability1030472496129416286.gal : 54 ms
[2022-05-15 18:52:22] [INFO ] Time to serialize properties into /tmp/CTLFireability15513412201164378521.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1030472496129416286.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15513412201164378521.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.84884e+17,9.06771,201184,2,29901,5,1.16822e+06,6,0,1258,647365,0


Converting to forward existential form...Done !
original formula: EF(!(E(EF((((!(((p156==1)&&(p191==1))&&(p193==1)))||(((p84==1)&&(p131==1))&&(p193==1)))||(((p48==1)&&(p107==1))&&(p193==1)))) U EF(AX((((...191
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(E(TRUE U (((!(((p156==1)&&(p191==1))&&(p193==1)))||(((p84==1)&&(p131==1))&&(p193==1)))||...261
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,28.2283,511660,1,0,7,3.66998e+06,16,0,6673,769827,7
FORMULA FlexibleBarrier-PT-16a-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Graph (trivial) has 153 edges and 195 vertex of which 42 / 195 are part of one of the 14 SCC in 5 ms
Free SCC test removed 28 places
Ensure Unique test removed 106 transitions
Reduce isomorphic transitions removed 106 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 31 place count 152 transition count 361
Drop transitions removed 145 transitions
Redundant transition composition rules discarded 145 transitions
Iterating global reduction 0 with 145 rules applied. Total rules applied 176 place count 152 transition count 216
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 177 place count 152 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 178 place count 151 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 179 place count 151 transition count 215
Applied a total of 179 rules in 94 ms. Remains 151 /195 variables (removed 44) and now considering 215/482 (removed 267) transitions.
[2022-05-15 18:52:51] [INFO ] Flow matrix only has 202 transitions (discarded 13 similar events)
// Phase 1: matrix 202 rows 151 cols
[2022-05-15 18:52:51] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-15 18:52:51] [INFO ] Implicit Places using invariants in 160 ms returned [150]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 164 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 150/195 places, 215/482 transitions.
Graph (trivial) has 189 edges and 150 vertex of which 69 / 150 are part of one of the 15 SCC in 1 ms
Free SCC test removed 54 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 96 transition count 116
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 77 transition count 116
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 39 place count 77 transition count 100
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 71 place count 61 transition count 100
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 84 place count 61 transition count 87
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 110 place count 48 transition count 74
Applied a total of 110 rules in 22 ms. Remains 48 /150 variables (removed 102) and now considering 74/215 (removed 141) transitions.
[2022-05-15 18:52:51] [INFO ] Flow matrix only has 59 transitions (discarded 15 similar events)
// Phase 1: matrix 59 rows 48 cols
[2022-05-15 18:52:51] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-15 18:52:51] [INFO ] Implicit Places using invariants in 40 ms returned []
[2022-05-15 18:52:51] [INFO ] Flow matrix only has 59 transitions (discarded 15 similar events)
// Phase 1: matrix 59 rows 48 cols
[2022-05-15 18:52:51] [INFO ] Computed 17 place invariants in 6 ms
[2022-05-15 18:52:51] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-05-15 18:52:51] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 48/195 places, 74/482 transitions.
Finished structural reductions, in 2 iterations. Remains : 48/195 places, 74/482 transitions.
[2022-05-15 18:52:51] [INFO ] Flatten gal took : 3 ms
[2022-05-15 18:52:51] [INFO ] Flatten gal took : 3 ms
[2022-05-15 18:52:51] [INFO ] Input system was already deterministic with 74 transitions.
[2022-05-15 18:52:51] [INFO ] Flatten gal took : 3 ms
[2022-05-15 18:52:51] [INFO ] Flatten gal took : 3 ms
[2022-05-15 18:52:51] [INFO ] Time to serialize gal into /tmp/CTLFireability9267849199107572488.gal : 1 ms
[2022-05-15 18:52:51] [INFO ] Time to serialize properties into /tmp/CTLFireability13264384918108670441.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9267849199107572488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13264384918108670441.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.40845e+06,0.018398,4844,2,216,5,1552,6,0,250,1106,0


Converting to forward existential form...Done !
original formula: EG((AG((p37==0)) + (((p59==1)&&(p168==1))&&(p193==1))))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !((p37==0)))) + (((p59==1)&&(p168==1))&&(p193==1))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.050359,5872,1,0,8,6596,22,1,1224,1967,9
FORMULA FlexibleBarrier-PT-16a-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 6 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (removed 0) transitions.
// Phase 1: matrix 482 rows 195 cols
[2022-05-15 18:52:51] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-15 18:52:51] [INFO ] Implicit Places using invariants in 136 ms returned []
// Phase 1: matrix 482 rows 195 cols
[2022-05-15 18:52:51] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-15 18:52:52] [INFO ] State equation strengthened by 321 read => feed constraints.
[2022-05-15 18:52:52] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
// Phase 1: matrix 482 rows 195 cols
[2022-05-15 18:52:52] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-15 18:52:52] [INFO ] Dead Transitions using invariants and state equation in 355 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 195/195 places, 482/482 transitions.
[2022-05-15 18:52:52] [INFO ] Flatten gal took : 19 ms
[2022-05-15 18:52:52] [INFO ] Flatten gal took : 21 ms
[2022-05-15 18:52:52] [INFO ] Input system was already deterministic with 482 transitions.
[2022-05-15 18:52:52] [INFO ] Flatten gal took : 20 ms
[2022-05-15 18:52:52] [INFO ] Flatten gal took : 20 ms
[2022-05-15 18:52:52] [INFO ] Time to serialize gal into /tmp/CTLFireability9726088556392382971.gal : 6 ms
[2022-05-15 18:52:52] [INFO ] Time to serialize properties into /tmp/CTLFireability4186776342232338853.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9726088556392382971.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4186776342232338853.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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.84884e+17,15.4474,338196,2,20418,5,1.95718e+06,6,0,1260,779798,0


Converting to forward existential form...Done !
original formula: (!(E(EF((((p24==1)&&(p191==1))&&((p193==1)&&(p156==1)))) U !(EX(EX((((p23==1)&&(p36==1))&&(p193==1))))))) + AF(AG(((p163==0)||(p194==0)))...157
=> equivalent forward existential formula: [FwdG((Init * !(!(E(E(TRUE U (((p24==1)&&(p191==1))&&((p193==1)&&(p156==1)))) U !(EX(EX((((p23==1)&&(p36==1))&&(...223
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-15 18:53:23] [INFO ] Flatten gal took : 24 ms
[2022-05-15 18:53:23] [INFO ] Applying decomposition
[2022-05-15 18:53:23] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16913612747606521054.txt' '-o' '/tmp/graph16913612747606521054.bin' '-w' '/tmp/graph16913612747606521054.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16913612747606521054.bin' '-l' '-1' '-v' '-w' '/tmp/graph16913612747606521054.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:53:23] [INFO ] Decomposing Gal with order
[2022-05-15 18:53:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:53:23] [INFO ] Removed a total of 719 redundant transitions.
[2022-05-15 18:53:23] [INFO ] Flatten gal took : 119 ms
[2022-05-15 18:53:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 27 ms.
[2022-05-15 18:53:23] [INFO ] Time to serialize gal into /tmp/CTLFireability15783490653264321495.gal : 9 ms
[2022-05-15 18:53:23] [INFO ] Time to serialize properties into /tmp/CTLFireability5320629958155771489.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15783490653264321495.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5320629958155771489.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
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.84884e+17,0.184146,7260,101,23,5355,301,575,6709,57,549,0


Converting to forward existential form...Done !
original formula: (!(E(EF((((i1.u5.p24==1)&&(i14.u47.p191==1))&&((i1.u11.p193==1)&&(i11.u38.p156==1)))) U !(EX(EX((((i1.u5.p23==1)&&(i2.u8.p36==1))&&(i1.u1...222
=> equivalent forward existential formula: [FwdG((Init * !(!(E(E(TRUE U (((i1.u5.p24==1)&&(i14.u47.p191==1))&&((i1.u11.p193==1)&&(i11.u38.p156==1)))) U !(E...288
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,0.374921,9488,1,0,8652,397,2834,13487,257,838,15768
FORMULA FlexibleBarrier-PT-16a-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Graph (trivial) has 155 edges and 195 vertex of which 42 / 195 are part of one of the 14 SCC in 1 ms
Free SCC test removed 28 places
Ensure Unique test removed 106 transitions
Reduce isomorphic transitions removed 106 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 31 place count 152 transition count 361
Drop transitions removed 145 transitions
Redundant transition composition rules discarded 145 transitions
Iterating global reduction 0 with 145 rules applied. Total rules applied 176 place count 152 transition count 216
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 177 place count 152 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 178 place count 151 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 179 place count 151 transition count 215
Applied a total of 179 rules in 47 ms. Remains 151 /195 variables (removed 44) and now considering 215/482 (removed 267) transitions.
[2022-05-15 18:53:23] [INFO ] Flow matrix only has 202 transitions (discarded 13 similar events)
// Phase 1: matrix 202 rows 151 cols
[2022-05-15 18:53:23] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-15 18:53:24] [INFO ] Implicit Places using invariants in 165 ms returned [150]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 167 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 150/195 places, 215/482 transitions.
Graph (trivial) has 192 edges and 150 vertex of which 74 / 150 are part of one of the 16 SCC in 1 ms
Free SCC test removed 58 places
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 92 transition count 111
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 74 transition count 111
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 37 place count 74 transition count 95
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 69 place count 58 transition count 95
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 83 place count 58 transition count 81
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 111 place count 44 transition count 67
Applied a total of 111 rules in 17 ms. Remains 44 /150 variables (removed 106) and now considering 67/215 (removed 148) transitions.
[2022-05-15 18:53:24] [INFO ] Flow matrix only has 52 transitions (discarded 15 similar events)
// Phase 1: matrix 52 rows 44 cols
[2022-05-15 18:53:24] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-15 18:53:24] [INFO ] Implicit Places using invariants in 44 ms returned []
[2022-05-15 18:53:24] [INFO ] Flow matrix only has 52 transitions (discarded 15 similar events)
// Phase 1: matrix 52 rows 44 cols
[2022-05-15 18:53:24] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-15 18:53:24] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-05-15 18:53:24] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 44/195 places, 67/482 transitions.
Finished structural reductions, in 2 iterations. Remains : 44/195 places, 67/482 transitions.
[2022-05-15 18:53:24] [INFO ] Flatten gal took : 3 ms
[2022-05-15 18:53:24] [INFO ] Flatten gal took : 2 ms
[2022-05-15 18:53:24] [INFO ] Input system was already deterministic with 67 transitions.
[2022-05-15 18:53:24] [INFO ] Flatten gal took : 3 ms
[2022-05-15 18:53:24] [INFO ] Flatten gal took : 3 ms
[2022-05-15 18:53:24] [INFO ] Time to serialize gal into /tmp/CTLFireability8878411534758039685.gal : 2 ms
[2022-05-15 18:53:24] [INFO ] Time to serialize properties into /tmp/CTLFireability14227857017481783995.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8878411534758039685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14227857017481783995.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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,802817,0.029028,4896,2,370,5,1631,6,0,227,1184,0


Converting to forward existential form...Done !
original formula: AG(EF(EG((((p72==0)||(p119==0))||(p193==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U EG((((p72==0)||(p119==0))||(p193==0))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.106698,6920,1,0,7,11104,22,0,1110,2622,9
FORMULA FlexibleBarrier-PT-16a-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 13 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (removed 0) transitions.
// Phase 1: matrix 482 rows 195 cols
[2022-05-15 18:53:24] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-15 18:53:24] [INFO ] Implicit Places using invariants in 151 ms returned []
// Phase 1: matrix 482 rows 195 cols
[2022-05-15 18:53:24] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-15 18:53:24] [INFO ] State equation strengthened by 321 read => feed constraints.
[2022-05-15 18:53:25] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
// Phase 1: matrix 482 rows 195 cols
[2022-05-15 18:53:25] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-15 18:53:25] [INFO ] Dead Transitions using invariants and state equation in 575 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 195/195 places, 482/482 transitions.
[2022-05-15 18:53:25] [INFO ] Flatten gal took : 17 ms
[2022-05-15 18:53:25] [INFO ] Flatten gal took : 23 ms
[2022-05-15 18:53:25] [INFO ] Input system was already deterministic with 482 transitions.
[2022-05-15 18:53:25] [INFO ] Flatten gal took : 22 ms
[2022-05-15 18:53:25] [INFO ] Flatten gal took : 21 ms
[2022-05-15 18:53:25] [INFO ] Time to serialize gal into /tmp/CTLFireability11960352941197710767.gal : 4 ms
[2022-05-15 18:53:25] [INFO ] Time to serialize properties into /tmp/CTLFireability4889672837077036003.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11960352941197710767.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4889672837077036003.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.84884e+17,16.2053,338920,2,20418,5,1.95718e+06,6,0,1260,779798,0


Converting to forward existential form...Done !
original formula: EF((((EX(AX(AX((((p144==1)&&(p155==1))&&(p193==1))))) * EF((AG((((p35==1)&&(p156==1))&&(p193==1))) * EG((((p24==1)&&(p59==1))&&(p193==1))...475
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * ((EX(!(EX(!(!(EX(!((((p144==1)&&(p155==1))&&(p193==1))))))))) * E(TRUE U (!(E(TRUE U !(((...1491
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-15 18:53:56] [INFO ] Flatten gal took : 19 ms
[2022-05-15 18:53:56] [INFO ] Applying decomposition
[2022-05-15 18:53:56] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13837433382211983884.txt' '-o' '/tmp/graph13837433382211983884.bin' '-w' '/tmp/graph13837433382211983884.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13837433382211983884.bin' '-l' '-1' '-v' '-w' '/tmp/graph13837433382211983884.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:53:56] [INFO ] Decomposing Gal with order
[2022-05-15 18:53:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:53:56] [INFO ] Removed a total of 719 redundant transitions.
[2022-05-15 18:53:56] [INFO ] Flatten gal took : 52 ms
[2022-05-15 18:53:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 14 ms.
[2022-05-15 18:53:56] [INFO ] Time to serialize gal into /tmp/CTLFireability6493301635547759264.gal : 6 ms
[2022-05-15 18:53:56] [INFO ] Time to serialize properties into /tmp/CTLFireability13696036794866519727.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6493301635547759264.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13696036794866519727.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
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.84884e+17,0.553145,19484,137,23,36421,452,567,31227,57,1339,0


Converting to forward existential form...Done !
original formula: EF((((EX(AX(AX((((i10.u35.p144==1)&&(i11.u38.p155==1))&&(i3.u11.p193==1))))) * EF((AG((((i2.u8.p35==1)&&(i11.u38.p156==1))&&(i3.u11.p193=...699
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * ((EX(!(EX(!(!(EX(!((((i10.u35.p144==1)&&(i11.u38.p155==1))&&(i3.u11.p193==1))))))))) * E(...2079
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,0.68036,19804,1,0,36421,452,2435,31227,240,1339,22129
FORMULA FlexibleBarrier-PT-16a-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Graph (trivial) has 153 edges and 195 vertex of which 42 / 195 are part of one of the 14 SCC in 1 ms
Free SCC test removed 28 places
Ensure Unique test removed 106 transitions
Reduce isomorphic transitions removed 106 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 31 place count 152 transition count 361
Drop transitions removed 145 transitions
Redundant transition composition rules discarded 145 transitions
Iterating global reduction 0 with 145 rules applied. Total rules applied 176 place count 152 transition count 216
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 177 place count 152 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 178 place count 151 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 179 place count 151 transition count 215
Applied a total of 179 rules in 37 ms. Remains 151 /195 variables (removed 44) and now considering 215/482 (removed 267) transitions.
[2022-05-15 18:53:56] [INFO ] Flow matrix only has 202 transitions (discarded 13 similar events)
// Phase 1: matrix 202 rows 151 cols
[2022-05-15 18:53:56] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-15 18:53:57] [INFO ] Implicit Places using invariants in 156 ms returned [150]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 157 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 150/195 places, 215/482 transitions.
Graph (trivial) has 189 edges and 150 vertex of which 69 / 150 are part of one of the 15 SCC in 1 ms
Free SCC test removed 54 places
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 96 transition count 116
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 77 transition count 116
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 39 place count 77 transition count 100
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 71 place count 61 transition count 100
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 84 place count 61 transition count 87
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 110 place count 48 transition count 74
Applied a total of 110 rules in 13 ms. Remains 48 /150 variables (removed 102) and now considering 74/215 (removed 141) transitions.
[2022-05-15 18:53:57] [INFO ] Flow matrix only has 59 transitions (discarded 15 similar events)
// Phase 1: matrix 59 rows 48 cols
[2022-05-15 18:53:57] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-15 18:53:57] [INFO ] Implicit Places using invariants in 36 ms returned []
[2022-05-15 18:53:57] [INFO ] Flow matrix only has 59 transitions (discarded 15 similar events)
// Phase 1: matrix 59 rows 48 cols
[2022-05-15 18:53:57] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-15 18:53:57] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-05-15 18:53:57] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 48/195 places, 74/482 transitions.
Finished structural reductions, in 2 iterations. Remains : 48/195 places, 74/482 transitions.
[2022-05-15 18:53:57] [INFO ] Flatten gal took : 2 ms
[2022-05-15 18:53:57] [INFO ] Flatten gal took : 2 ms
[2022-05-15 18:53:57] [INFO ] Input system was already deterministic with 74 transitions.
Finished random walk after 57 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=28 )
FORMULA FlexibleBarrier-PT-16a-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 7 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (removed 0) transitions.
// Phase 1: matrix 482 rows 195 cols
[2022-05-15 18:53:57] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-15 18:53:57] [INFO ] Implicit Places using invariants in 179 ms returned [194]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 180 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/195 places, 482/482 transitions.
Applied a total of 0 rules in 3 ms. Remains 194 /194 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 194/195 places, 482/482 transitions.
[2022-05-15 18:53:57] [INFO ] Flatten gal took : 15 ms
[2022-05-15 18:53:57] [INFO ] Flatten gal took : 16 ms
[2022-05-15 18:53:57] [INFO ] Input system was already deterministic with 482 transitions.
[2022-05-15 18:53:57] [INFO ] Flatten gal took : 15 ms
[2022-05-15 18:53:57] [INFO ] Flatten gal took : 15 ms
[2022-05-15 18:53:57] [INFO ] Time to serialize gal into /tmp/CTLFireability17035800469896946601.gal : 5 ms
[2022-05-15 18:53:57] [INFO ] Time to serialize properties into /tmp/CTLFireability3601183967772022752.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17035800469896946601.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3601183967772022752.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.84884e+17,10.1359,201456,2,29901,5,1.16822e+06,6,0,1258,647365,0


Converting to forward existential form...Done !
original formula: AX((AG(!(E(AF((p106==1)) U !((((p11==1)&&(p180==1))&&(p193==1)))))) + EG(((AG((p73==1)) * (p42==1)) * (p193==1)))))
=> equivalent forward existential formula: [(FwdU(FwdU((EY(Init) * !(EG(((!(E(TRUE U !((p73==1)))) * (p42==1)) * (p193==1))))),TRUE),!(EG(!((p106==1))))) *...203
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-15 18:54:27] [INFO ] Flatten gal took : 14 ms
[2022-05-15 18:54:27] [INFO ] Applying decomposition
[2022-05-15 18:54:27] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7365016563794416810.txt' '-o' '/tmp/graph7365016563794416810.bin' '-w' '/tmp/graph7365016563794416810.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7365016563794416810.bin' '-l' '-1' '-v' '-w' '/tmp/graph7365016563794416810.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:54:27] [INFO ] Decomposing Gal with order
[2022-05-15 18:54:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:54:27] [INFO ] Removed a total of 660 redundant transitions.
[2022-05-15 18:54:27] [INFO ] Flatten gal took : 37 ms
[2022-05-15 18:54:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2022-05-15 18:54:27] [INFO ] Time to serialize gal into /tmp/CTLFireability7208338453931630133.gal : 4 ms
[2022-05-15 18:54:27] [INFO ] Time to serialize properties into /tmp/CTLFireability8350205902544863373.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7208338453931630133.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8350205902544863373.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...253
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.84884e+17,0.112251,7504,149,16,5599,249,510,6762,37,381,0


Converting to forward existential form...Done !
original formula: AX((AG(!(E(AF((i9.u44.p106==1)) U !((((i4.u4.p11==1)&&(i15.u74.p180==1))&&(i4.u19.p193==1)))))) + EG(((AG((i7.u30.p73==1)) * (i3.i1.u17.p...185
=> equivalent forward existential formula: [(FwdU(FwdU((EY(Init) * !(EG(((!(E(TRUE U !((i7.u30.p73==1)))) * (i3.i1.u17.p42==1)) * (i4.u19.p193==1))))),TRUE...255
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,0,0.221901,9412,1,0,8938,249,2784,12028,146,424,18376
FORMULA FlexibleBarrier-PT-16a-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 2 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (removed 0) transitions.
// Phase 1: matrix 482 rows 195 cols
[2022-05-15 18:54:28] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-15 18:54:28] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 482 rows 195 cols
[2022-05-15 18:54:28] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-15 18:54:28] [INFO ] State equation strengthened by 321 read => feed constraints.
[2022-05-15 18:54:28] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
// Phase 1: matrix 482 rows 195 cols
[2022-05-15 18:54:28] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-15 18:54:29] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 195/195 places, 482/482 transitions.
[2022-05-15 18:54:29] [INFO ] Flatten gal took : 17 ms
[2022-05-15 18:54:29] [INFO ] Flatten gal took : 17 ms
[2022-05-15 18:54:29] [INFO ] Input system was already deterministic with 482 transitions.
[2022-05-15 18:54:29] [INFO ] Flatten gal took : 18 ms
[2022-05-15 18:54:29] [INFO ] Flatten gal took : 21 ms
[2022-05-15 18:54:29] [INFO ] Time to serialize gal into /tmp/CTLFireability12212159323539590965.gal : 4 ms
[2022-05-15 18:54:29] [INFO ] Time to serialize properties into /tmp/CTLFireability7989663717479923978.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12212159323539590965.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7989663717479923978.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.84884e+17,15.2505,338160,2,20418,5,1.95718e+06,6,0,1260,779798,0


Converting to forward existential form...Done !
original formula: (AF(EG(((E((((p96==1)&&(p191==1))&&(p193==1)) U (((p12==1)&&(p35==1))&&(p193==1))) + EF(((p31==1)&&(p194==1)))) * A(((p41==1)&&(p194==1))...340
=> equivalent forward existential formula: ([FwdG(Init,!(EG(((E((((p96==1)&&(p191==1))&&(p193==1)) U (((p12==1)&&(p35==1))&&(p193==1))) + E(TRUE U ((p31==1...727
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 230/0/252
Hit Full ! (commute/partial/dont) 232/250/250
Hit Full ! (commute/partial/dont) 235/449/247
Detected timeout of ITS tools.
[2022-05-15 18:54:59] [INFO ] Flatten gal took : 14 ms
[2022-05-15 18:54:59] [INFO ] Applying decomposition
[2022-05-15 18:54:59] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1369642549865090839.txt' '-o' '/tmp/graph1369642549865090839.bin' '-w' '/tmp/graph1369642549865090839.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1369642549865090839.bin' '-l' '-1' '-v' '-w' '/tmp/graph1369642549865090839.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:54:59] [INFO ] Decomposing Gal with order
[2022-05-15 18:54:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:54:59] [INFO ] Removed a total of 719 redundant transitions.
[2022-05-15 18:54:59] [INFO ] Flatten gal took : 35 ms
[2022-05-15 18:54:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 76 labels/synchronizations in 9 ms.
[2022-05-15 18:54:59] [INFO ] Time to serialize gal into /tmp/CTLFireability11536325169894366907.gal : 5 ms
[2022-05-15 18:54:59] [INFO ] Time to serialize properties into /tmp/CTLFireability14246274217619292645.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11536325169894366907.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14246274217619292645.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...255
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.84884e+17,0.133652,8204,129,23,7670,348,576,9306,57,593,0


Converting to forward existential form...Done !
original formula: (AF(EG(((E((((i7.u23.p96==1)&&(i14.u47.p191==1))&&(i3.u11.p193==1)) U (((i0.u2.p12==1)&&(i1.u8.p35==1))&&(i3.u11.p193==1))) + EF(((i1.u7....508
=> equivalent forward existential formula: ([FwdG(Init,!(EG(((E((((i7.u23.p96==1)&&(i14.u47.p191==1))&&(i3.u11.p193==1)) U (((i0.u2.p12==1)&&(i1.u8.p35==1)...1037
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,4.12387,82892,1,0,143740,400,2651,249928,234,1287,111628
FORMULA FlexibleBarrier-PT-16a-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Graph (trivial) has 150 edges and 195 vertex of which 36 / 195 are part of one of the 12 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 29 place count 157 transition count 389
Drop transitions removed 158 transitions
Redundant transition composition rules discarded 158 transitions
Iterating global reduction 0 with 158 rules applied. Total rules applied 187 place count 157 transition count 231
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 189 place count 157 transition count 231
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 191 place count 155 transition count 229
Iterating global reduction 0 with 2 rules applied. Total rules applied 193 place count 155 transition count 229
Applied a total of 193 rules in 49 ms. Remains 155 /195 variables (removed 40) and now considering 229/482 (removed 253) transitions.
[2022-05-15 18:55:03] [INFO ] Flow matrix only has 218 transitions (discarded 11 similar events)
// Phase 1: matrix 218 rows 155 cols
[2022-05-15 18:55:03] [INFO ] Computed 18 place invariants in 13 ms
[2022-05-15 18:55:03] [INFO ] Implicit Places using invariants in 194 ms returned [154]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 210 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 154/195 places, 229/482 transitions.
Graph (trivial) has 192 edges and 154 vertex of which 68 / 154 are part of one of the 16 SCC in 0 ms
Free SCC test removed 52 places
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 102 transition count 133
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 82 transition count 133
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 41 place count 82 transition count 117
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 73 place count 66 transition count 117
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 85 place count 66 transition count 105
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 109 place count 54 transition count 93
Applied a total of 109 rules in 13 ms. Remains 54 /154 variables (removed 100) and now considering 93/229 (removed 136) transitions.
[2022-05-15 18:55:03] [INFO ] Flow matrix only has 78 transitions (discarded 15 similar events)
// Phase 1: matrix 78 rows 54 cols
[2022-05-15 18:55:03] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-15 18:55:04] [INFO ] Implicit Places using invariants in 74 ms returned []
[2022-05-15 18:55:04] [INFO ] Flow matrix only has 78 transitions (discarded 15 similar events)
// Phase 1: matrix 78 rows 54 cols
[2022-05-15 18:55:04] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-15 18:55:04] [INFO ] State equation strengthened by 29 read => feed constraints.
[2022-05-15 18:55:04] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 54/195 places, 93/482 transitions.
Finished structural reductions, in 2 iterations. Remains : 54/195 places, 93/482 transitions.
[2022-05-15 18:55:04] [INFO ] Flatten gal took : 2 ms
[2022-05-15 18:55:04] [INFO ] Flatten gal took : 2 ms
[2022-05-15 18:55:04] [INFO ] Input system was already deterministic with 93 transitions.
[2022-05-15 18:55:04] [INFO ] Flatten gal took : 2 ms
[2022-05-15 18:55:04] [INFO ] Flatten gal took : 2 ms
[2022-05-15 18:55:04] [INFO ] Time to serialize gal into /tmp/CTLFireability13887086277188958247.gal : 1 ms
[2022-05-15 18:55:04] [INFO ] Time to serialize properties into /tmp/CTLFireability445670343708776850.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13887086277188958247.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability445670343708776850.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.8345e+06,0.036702,4932,2,352,5,2599,6,0,293,1657,0


Converting to forward existential form...Done !
original formula: E(!((((p156==1)&&(p167==1))&&(p193==1))) U (((p12==1)&&(p119==1))&&(p193==1)))
=> equivalent forward existential formula: [(FwdU(Init,!((((p156==1)&&(p167==1))&&(p193==1)))) * (((p12==1)&&(p119==1))&&(p193==1)))] != FALSE
Hit Full ! (commute/partial/dont) 60/0/33
(forward)formula 0,1,0.080557,5812,1,0,8,4666,16,1,581,4348,4
FORMULA FlexibleBarrier-PT-16a-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 4 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (removed 0) transitions.
// Phase 1: matrix 482 rows 195 cols
[2022-05-15 18:55:04] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-15 18:55:04] [INFO ] Implicit Places using invariants in 160 ms returned [194]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 162 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/195 places, 482/482 transitions.
Applied a total of 0 rules in 12 ms. Remains 194 /194 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 194/195 places, 482/482 transitions.
[2022-05-15 18:55:04] [INFO ] Flatten gal took : 18 ms
[2022-05-15 18:55:04] [INFO ] Flatten gal took : 11 ms
[2022-05-15 18:55:04] [INFO ] Input system was already deterministic with 482 transitions.
[2022-05-15 18:55:04] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:55:04] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:55:04] [INFO ] Time to serialize gal into /tmp/CTLFireability5485998161031636060.gal : 2 ms
[2022-05-15 18:55:04] [INFO ] Time to serialize properties into /tmp/CTLFireability10940803888149745918.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5485998161031636060.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10940803888149745918.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.84884e+17,11.0335,202752,2,29901,5,1.16822e+06,6,0,1258,647365,0


Converting to forward existential form...Done !
original formula: EX((((p35==0)||(p156==0))||(p193==0)))
=> equivalent forward existential formula: [(EY(Init) * (((p35==0)||(p156==0))||(p193==0)))] != FALSE
(forward)formula 0,1,11.0761,202752,1,0,7,1.16822e+06,8,1,1794,647365,2
FORMULA FlexibleBarrier-PT-16a-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 2 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (removed 0) transitions.
// Phase 1: matrix 482 rows 195 cols
[2022-05-15 18:55:15] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-15 18:55:15] [INFO ] Implicit Places using invariants in 234 ms returned [194]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 236 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/195 places, 482/482 transitions.
Applied a total of 0 rules in 2 ms. Remains 194 /194 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 194/195 places, 482/482 transitions.
[2022-05-15 18:55:15] [INFO ] Flatten gal took : 11 ms
[2022-05-15 18:55:15] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:55:15] [INFO ] Input system was already deterministic with 482 transitions.
[2022-05-15 18:55:15] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:55:15] [INFO ] Flatten gal took : 11 ms
[2022-05-15 18:55:15] [INFO ] Time to serialize gal into /tmp/CTLFireability13680595797718267652.gal : 2 ms
[2022-05-15 18:55:15] [INFO ] Time to serialize properties into /tmp/CTLFireability8528933931666617001.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13680595797718267652.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8528933931666617001.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.84884e+17,10.9422,202336,2,29901,5,1.16822e+06,6,0,1258,647365,0


Converting to forward existential form...Done !
original formula: AG(!(E(!(AG(!((((p35==1)&&(p72==1))&&(p193==1))))) U ((p99==1) * AX(EF((((p84==1)&&(p95==1))&&(p193==1))))))))
=> equivalent forward existential formula: [((FwdU(FwdU(Init,TRUE),!(!(E(TRUE U !(!((((p35==1)&&(p72==1))&&(p193==1)))))))) * (p99==1)) * !(EX(!(E(TRUE U (...201
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-15 18:55:46] [INFO ] Flatten gal took : 13 ms
[2022-05-15 18:55:46] [INFO ] Applying decomposition
[2022-05-15 18:55:46] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph12475840729090610283.txt' '-o' '/tmp/graph12475840729090610283.bin' '-w' '/tmp/graph12475840729090610283.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph12475840729090610283.bin' '-l' '-1' '-v' '-w' '/tmp/graph12475840729090610283.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:55:46] [INFO ] Decomposing Gal with order
[2022-05-15 18:55:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:55:46] [INFO ] Removed a total of 660 redundant transitions.
[2022-05-15 18:55:46] [INFO ] Flatten gal took : 32 ms
[2022-05-15 18:55:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2022-05-15 18:55:46] [INFO ] Time to serialize gal into /tmp/CTLFireability12575897066912347694.gal : 4 ms
[2022-05-15 18:55:46] [INFO ] Time to serialize properties into /tmp/CTLFireability7772638417745508125.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12575897066912347694.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7772638417745508125.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
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.84884e+17,0.251017,9848,195,16,11984,215,498,13048,37,300,0


Converting to forward existential form...Done !
original formula: AG(!(E(!(AG(!((((i2.u14.p35==1)&&(i6.u29.p72==1))&&(i4.u19.p193==1))))) U ((i9.i0.u41.p99==1) * AX(EF((((i7.u34.p84==1)&&(i8.u39.p95==1))...180
=> equivalent forward existential formula: [((FwdU(FwdU(Init,TRUE),!(!(E(TRUE U !(!((((i2.u14.p35==1)&&(i6.u29.p72==1))&&(i4.u19.p193==1)))))))) * (i9.i0.u...253
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.368434,10228,1,0,11984,215,2515,13048,135,309,16063
FORMULA FlexibleBarrier-PT-16a-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Graph (trivial) has 155 edges and 195 vertex of which 42 / 195 are part of one of the 14 SCC in 1 ms
Free SCC test removed 28 places
Ensure Unique test removed 106 transitions
Reduce isomorphic transitions removed 106 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 31 place count 152 transition count 361
Drop transitions removed 145 transitions
Redundant transition composition rules discarded 145 transitions
Iterating global reduction 0 with 145 rules applied. Total rules applied 176 place count 152 transition count 216
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 177 place count 152 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 178 place count 151 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 179 place count 151 transition count 215
Applied a total of 179 rules in 41 ms. Remains 151 /195 variables (removed 44) and now considering 215/482 (removed 267) transitions.
[2022-05-15 18:55:46] [INFO ] Flow matrix only has 202 transitions (discarded 13 similar events)
// Phase 1: matrix 202 rows 151 cols
[2022-05-15 18:55:46] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-15 18:55:46] [INFO ] Implicit Places using invariants in 168 ms returned [150]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 169 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 150/195 places, 215/482 transitions.
Graph (trivial) has 192 edges and 150 vertex of which 74 / 150 are part of one of the 16 SCC in 0 ms
Free SCC test removed 58 places
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 92 transition count 111
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 74 transition count 111
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 37 place count 74 transition count 95
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 69 place count 58 transition count 95
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 83 place count 58 transition count 81
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 111 place count 44 transition count 67
Applied a total of 111 rules in 9 ms. Remains 44 /150 variables (removed 106) and now considering 67/215 (removed 148) transitions.
[2022-05-15 18:55:46] [INFO ] Flow matrix only has 52 transitions (discarded 15 similar events)
// Phase 1: matrix 52 rows 44 cols
[2022-05-15 18:55:46] [INFO ] Computed 17 place invariants in 0 ms
[2022-05-15 18:55:46] [INFO ] Implicit Places using invariants in 37 ms returned []
[2022-05-15 18:55:46] [INFO ] Flow matrix only has 52 transitions (discarded 15 similar events)
// Phase 1: matrix 52 rows 44 cols
[2022-05-15 18:55:46] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-15 18:55:46] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-05-15 18:55:46] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 44/195 places, 67/482 transitions.
Finished structural reductions, in 2 iterations. Remains : 44/195 places, 67/482 transitions.
[2022-05-15 18:55:46] [INFO ] Flatten gal took : 1 ms
[2022-05-15 18:55:46] [INFO ] Flatten gal took : 2 ms
[2022-05-15 18:55:46] [INFO ] Input system was already deterministic with 67 transitions.
Finished random walk after 85 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=42 )
FORMULA FlexibleBarrier-PT-16a-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 2 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (removed 0) transitions.
// Phase 1: matrix 482 rows 195 cols
[2022-05-15 18:55:46] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-15 18:55:47] [INFO ] Implicit Places using invariants in 153 ms returned [194]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 160 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/195 places, 482/482 transitions.
Applied a total of 0 rules in 3 ms. Remains 194 /194 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 194/195 places, 482/482 transitions.
[2022-05-15 18:55:47] [INFO ] Flatten gal took : 11 ms
[2022-05-15 18:55:47] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:55:47] [INFO ] Input system was already deterministic with 482 transitions.
[2022-05-15 18:55:47] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:55:47] [INFO ] Flatten gal took : 12 ms
[2022-05-15 18:55:47] [INFO ] Time to serialize gal into /tmp/CTLFireability12743363227031003935.gal : 2 ms
[2022-05-15 18:55:47] [INFO ] Time to serialize properties into /tmp/CTLFireability3042875222186853004.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12743363227031003935.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3042875222186853004.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...275
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.84884e+17,11.0687,202464,2,29901,5,1.16822e+06,6,0,1258,647365,0


Converting to forward existential form...Done !
original formula: AG(EX(((((p119==1)&&(p144==1))&&(p193==1))||(((p36==1)&&(p83==1))&&(p193==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(((((p119==1)&&(p144==1))&&(p193==1))||(((p36==1)&&(p83==1))&&(p193==1))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,28.3746,372208,1,0,8,2.4764e+06,10,2,6338,647365,4
FORMULA FlexibleBarrier-PT-16a-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Applied a total of 0 rules in 3 ms. Remains 195 /195 variables (removed 0) and now considering 482/482 (removed 0) transitions.
// Phase 1: matrix 482 rows 195 cols
[2022-05-15 18:56:15] [INFO ] Computed 18 place invariants in 2 ms
[2022-05-15 18:56:15] [INFO ] Implicit Places using invariants in 260 ms returned [194]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 261 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 194/195 places, 482/482 transitions.
Applied a total of 0 rules in 4 ms. Remains 194 /194 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 194/195 places, 482/482 transitions.
[2022-05-15 18:56:15] [INFO ] Flatten gal took : 17 ms
[2022-05-15 18:56:15] [INFO ] Flatten gal took : 21 ms
[2022-05-15 18:56:16] [INFO ] Input system was already deterministic with 482 transitions.
[2022-05-15 18:56:16] [INFO ] Flatten gal took : 20 ms
[2022-05-15 18:56:16] [INFO ] Flatten gal took : 19 ms
[2022-05-15 18:56:16] [INFO ] Time to serialize gal into /tmp/CTLFireability7225081896447345046.gal : 9 ms
[2022-05-15 18:56:16] [INFO ] Time to serialize properties into /tmp/CTLFireability1018292811392774165.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7225081896447345046.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1018292811392774165.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
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.84884e+17,9.16112,201984,2,29901,5,1.16822e+06,6,0,1258,647365,0


Converting to forward existential form...Done !
original formula: A((AX((p8==1)) * (p94==1)) U (EX(EX(AG((p119==1)))) + (AF((!(AX((p116==1))) * EF((((p36==1)&&(p83==1))&&(p193==1))))) * A(((p125==1) + E(...297
=> equivalent forward existential formula: [((Init * !(EG(!((EX(EX(!(E(TRUE U !((p119==1)))))) + (!(EG(!((!(!(EX(!((p116==1))))) * E(TRUE U (((p36==1)&&(p8...2318
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 235/0/247
Hit Full ! (commute/partial/dont) 235/435/247
Detected timeout of ITS tools.
[2022-05-15 18:56:46] [INFO ] Flatten gal took : 11 ms
[2022-05-15 18:56:46] [INFO ] Applying decomposition
[2022-05-15 18:56:46] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2185637799145478261.txt' '-o' '/tmp/graph2185637799145478261.bin' '-w' '/tmp/graph2185637799145478261.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2185637799145478261.bin' '-l' '-1' '-v' '-w' '/tmp/graph2185637799145478261.weights' '-q' '0' '-e' '0.001'
[2022-05-15 18:56:46] [INFO ] Decomposing Gal with order
[2022-05-15 18:56:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 18:56:46] [INFO ] Removed a total of 660 redundant transitions.
[2022-05-15 18:56:46] [INFO ] Flatten gal took : 51 ms
[2022-05-15 18:56:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-15 18:56:46] [INFO ] Time to serialize gal into /tmp/CTLFireability8347460668247044.gal : 5 ms
[2022-05-15 18:56:46] [INFO ] Time to serialize properties into /tmp/CTLFireability2749634584557962888.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8347460668247044.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2749634584557962888.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...250
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.84884e+17,0.177126,10620,199,16,14000,212,527,14855,37,301,0


Converting to forward existential form...Done !
original formula: A((AX((i0.i1.u3.p8==1)) * (i8.u39.p94==1)) U (EX(EX(AG((i1.u49.p119==1)))) + (AF((!(AX((i10.i0.u48.p116==1))) * EF((((i3.u14.p36==1)&&(i1...435
=> equivalent forward existential formula: [((Init * !(EG(!((EX(EX(!(E(TRUE U !((i1.u49.p119==1)))))) + (!(EG(!((!(!(EX(!((i10.i0.u48.p116==1))))) * E(TRUE...3264
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,0,0.472465,16544,1,0,22482,212,2612,48995,144,301,27329
FORMULA FlexibleBarrier-PT-16a-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 482/482 transitions.
Graph (trivial) has 158 edges and 195 vertex of which 45 / 195 are part of one of the 15 SCC in 1 ms
Free SCC test removed 30 places
Ensure Unique test removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 224 edges and 162 vertex of which 155 / 162 are part of one of the 17 SCC in 1 ms
Free SCC test removed 138 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 24 transition count 358
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 345 transitions
Reduce isomorphic transitions removed 345 transitions.
Iterating post reduction 1 with 362 rules applied. Total rules applied 368 place count 7 transition count 13
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 369 place count 6 transition count 11
Iterating global reduction 2 with 1 rules applied. Total rules applied 370 place count 6 transition count 11
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions 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 373 place count 6 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 375 place count 4 transition count 8
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 378 place count 4 transition count 5
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 379 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 381 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 382 place count 2 transition count 3
Applied a total of 382 rules in 16 ms. Remains 2 /195 variables (removed 193) and now considering 3/482 (removed 479) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-15 18:56:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 18:56:46] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-15 18:56:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 18:56:46] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2022-05-15 18:56:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-15 18:56:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 18:56:46] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 2/195 places, 3/482 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/195 places, 3/482 transitions.
[2022-05-15 18:56:46] [INFO ] Flatten gal took : 1 ms
[2022-05-15 18:56:46] [INFO ] Flatten gal took : 0 ms
[2022-05-15 18:56:46] [INFO ] Input system was already deterministic with 3 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA FlexibleBarrier-PT-16a-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2022-05-15 18:56:46] [INFO ] Flatten gal took : 31 ms
[2022-05-15 18:56:46] [INFO ] Flatten gal took : 21 ms
Total runtime 268663 ms.

BK_STOP 1652641007126

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination CTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-16a"
export BK_EXAMINATION="CTLFireability"
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-4028"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-16a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r096-smll-165260575700098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-16a.tgz
mv FlexibleBarrier-PT-16a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;