About the Execution of ITS-Tools for BusinessProcesses-PT-01
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1133.951 | 241190.00 | 259676.00 | 2309.40 | FTTTTTFTTTFTFFTT | normal |
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.r024-tall-165251918400322.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 BusinessProcesses-PT-01, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918400322
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 7.5K Apr 29 23:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 23:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 29 23:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 29 23:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 47K 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 BusinessProcesses-PT-01-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-01-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1652622536598
Running Version 202205111006
[2022-05-15 13:48:57] [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 13:48:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 13:48:57] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2022-05-15 13:48:58] [INFO ] Transformed 200 places.
[2022-05-15 13:48:58] [INFO ] Transformed 178 transitions.
[2022-05-15 13:48:58] [INFO ] Found NUPN structural information;
[2022-05-15 13:48:58] [INFO ] Parsed PT model containing 200 places and 178 transitions in 202 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-01-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 87 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 177/177 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 197 transition count 177
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 183 transition count 163
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 183 transition count 163
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 178 transition count 158
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 178 transition count 158
Applied a total of 40 rules in 51 ms. Remains 178 /199 variables (removed 21) and now considering 158/177 (removed 19) transitions.
// Phase 1: matrix 158 rows 178 cols
[2022-05-15 13:48:58] [INFO ] Computed 28 place invariants in 16 ms
[2022-05-15 13:48:58] [INFO ] Implicit Places using invariants in 205 ms returned []
// Phase 1: matrix 158 rows 178 cols
[2022-05-15 13:48:58] [INFO ] Computed 28 place invariants in 5 ms
[2022-05-15 13:48:58] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
// Phase 1: matrix 158 rows 178 cols
[2022-05-15 13:48:58] [INFO ] Computed 28 place invariants in 9 ms
[2022-05-15 13:48:58] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 178/199 places, 158/177 transitions.
Finished structural reductions, in 1 iterations. Remains : 178/199 places, 158/177 transitions.
Support contains 87 out of 178 places after structural reductions.
[2022-05-15 13:48:58] [INFO ] Flatten gal took : 37 ms
[2022-05-15 13:48:58] [INFO ] Flatten gal took : 16 ms
[2022-05-15 13:48:58] [INFO ] Input system was already deterministic with 158 transitions.
Incomplete random walk after 10000 steps, including 115 resets, run finished after 482 ms. (steps per millisecond=20 ) properties (out of 59) seen :50
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 158 rows 178 cols
[2022-05-15 13:48:59] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-15 13:48:59] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2022-05-15 13:48:59] [INFO ] [Real]Absence check using 18 positive and 10 generalized place invariants in 3 ms returned sat
[2022-05-15 13:49:00] [INFO ] After 48ms SMT Verify possible using state equation in real domain returned unsat :5 sat :1
[2022-05-15 13:49:00] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 4 ms to minimize.
[2022-05-15 13:49:00] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 1 ms to minimize.
[2022-05-15 13:49:00] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2022-05-15 13:49:00] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 1 ms to minimize.
[2022-05-15 13:49:00] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 0 ms to minimize.
[2022-05-15 13:49:00] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2022-05-15 13:49:00] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
[2022-05-15 13:49:00] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2022-05-15 13:49:00] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2022-05-15 13:49:00] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 0 ms to minimize.
[2022-05-15 13:49:00] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 0 ms to minimize.
[2022-05-15 13:49:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 611 ms
[2022-05-15 13:49:00] [INFO ] After 665ms SMT Verify possible using trap constraints in real domain returned unsat :6 sat :0
[2022-05-15 13:49:00] [INFO ] After 772ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 6 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-01-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 13:49:00] [INFO ] Flatten gal took : 10 ms
[2022-05-15 13:49:00] [INFO ] Flatten gal took : 10 ms
[2022-05-15 13:49:00] [INFO ] Input system was already deterministic with 158 transitions.
Computed a total of 150 stabilizing places and 130 stable transitions
Graph (complete) has 358 edges and 178 vertex of which 177 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 158/158 transitions.
Graph (trivial) has 100 edges and 178 vertex of which 7 / 178 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 350 edges and 172 vertex of which 171 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 32 place count 170 transition count 118
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 140 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 139 transition count 117
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 64 place count 139 transition count 92
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 119 place count 109 transition count 92
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 137 place count 91 transition count 74
Iterating global reduction 3 with 18 rules applied. Total rules applied 155 place count 91 transition count 74
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 155 place count 91 transition count 72
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 159 place count 89 transition count 72
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 215 place count 61 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 216 place count 60 transition count 43
Applied a total of 216 rules in 34 ms. Remains 60 /178 variables (removed 118) and now considering 43/158 (removed 115) transitions.
// Phase 1: matrix 43 rows 60 cols
[2022-05-15 13:49:00] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-15 13:49:00] [INFO ] Implicit Places using invariants in 59 ms returned [0, 1, 5, 6, 7, 8]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 61 ms to find 6 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 54/178 places, 43/158 transitions.
Applied a total of 0 rules in 4 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 54/178 places, 43/158 transitions.
[2022-05-15 13:49:00] [INFO ] Flatten gal took : 3 ms
[2022-05-15 13:49:00] [INFO ] Flatten gal took : 4 ms
[2022-05-15 13:49:00] [INFO ] Input system was already deterministic with 43 transitions.
[2022-05-15 13:49:00] [INFO ] Flatten gal took : 3 ms
[2022-05-15 13:49:00] [INFO ] Flatten gal took : 3 ms
[2022-05-15 13:49:00] [INFO ] Time to serialize gal into /tmp/CTLFireability15552426816222161073.gal : 1 ms
[2022-05-15 13:49:00] [INFO ] Time to serialize properties into /tmp/CTLFireability907259494969607218.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/CTLFireability15552426816222161073.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability907259494969607218.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,3678,0.024212,5080,2,593,5,3373,6,0,259,2488,0
Converting to forward existential form...Done !
original formula: (E((AG(!(EF((p176==1)))) * EF((p88==1))) U AF((!(AF((p75==1))) * (p199==1)))) + EG((p131==1)))
=> equivalent forward existential formula: ([(FwdU(Init,(!(E(TRUE U !(!(E(TRUE U (p176==1)))))) * E(TRUE U (p88==1)))) * !(EG(!((!(!(EG(!((p75==1))))) * (p...212
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t12, t13, t18, t24, t27, t28, t35, t40, t41, Intersection with reachable at each ste...213
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.567052,26188,1,0,295,133217,129,170,1795,125986,325
FORMULA BusinessProcesses-PT-01-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 158/158 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 162 transition count 142
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 162 transition count 142
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 153 transition count 133
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 153 transition count 133
Applied a total of 50 rules in 11 ms. Remains 153 /178 variables (removed 25) and now considering 133/158 (removed 25) transitions.
// Phase 1: matrix 133 rows 153 cols
[2022-05-15 13:49:01] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:49:01] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 133 rows 153 cols
[2022-05-15 13:49:01] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-15 13:49:01] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
// Phase 1: matrix 133 rows 153 cols
[2022-05-15 13:49:01] [INFO ] Computed 28 place invariants in 6 ms
[2022-05-15 13:49:01] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/178 places, 133/158 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/178 places, 133/158 transitions.
[2022-05-15 13:49:01] [INFO ] Flatten gal took : 8 ms
[2022-05-15 13:49:01] [INFO ] Flatten gal took : 11 ms
[2022-05-15 13:49:01] [INFO ] Input system was already deterministic with 133 transitions.
[2022-05-15 13:49:01] [INFO ] Flatten gal took : 7 ms
[2022-05-15 13:49:01] [INFO ] Flatten gal took : 7 ms
[2022-05-15 13:49:01] [INFO ] Time to serialize gal into /tmp/CTLFireability9745746167331219496.gal : 3 ms
[2022-05-15 13:49:01] [INFO ] Time to serialize properties into /tmp/CTLFireability9434308457043236835.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/CTLFireability9745746167331219496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9434308457043236835.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.55618e+10,0.869653,33316,2,17666,5,106562,6,0,746,146618,0
Converting to forward existential form...Done !
original formula: AG((EF(((p27==0)&&((p142==0)||((p4==0)&&(p13==0))))) + !(A((AG((p21==1)) + (EX((p169==1)) * ((p31==1)||(p27==1)))) U (p115!=1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(!(!((E(!((p115!=1)) U (!((!(E(TRUE U !((p21==1)))) + (EX((p169==1)) * ((p31==1)||(p27==1)...270
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t12, t18, t27, t30, t33, t36, t39, t43, t44, t46, t49, t52, t57, t60, t63, t67, t68, ...319
(forward)formula 0,1,9.52196,266756,1,0,276,892593,283,126,4318,869416,272
FORMULA BusinessProcesses-PT-01-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 158/158 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 159 transition count 139
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 159 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 159 transition count 138
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 51 place count 147 transition count 126
Iterating global reduction 1 with 12 rules applied. Total rules applied 63 place count 147 transition count 126
Applied a total of 63 rules in 19 ms. Remains 147 /178 variables (removed 31) and now considering 126/158 (removed 32) transitions.
// Phase 1: matrix 126 rows 147 cols
[2022-05-15 13:49:11] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-15 13:49:11] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 126 rows 147 cols
[2022-05-15 13:49:11] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:49:11] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
// Phase 1: matrix 126 rows 147 cols
[2022-05-15 13:49:11] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:49:11] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 147/178 places, 126/158 transitions.
Finished structural reductions, in 1 iterations. Remains : 147/178 places, 126/158 transitions.
[2022-05-15 13:49:11] [INFO ] Flatten gal took : 7 ms
[2022-05-15 13:49:11] [INFO ] Flatten gal took : 6 ms
[2022-05-15 13:49:11] [INFO ] Input system was already deterministic with 126 transitions.
[2022-05-15 13:49:11] [INFO ] Flatten gal took : 5 ms
[2022-05-15 13:49:11] [INFO ] Flatten gal took : 5 ms
[2022-05-15 13:49:11] [INFO ] Time to serialize gal into /tmp/CTLFireability1475336562309325503.gal : 2 ms
[2022-05-15 13:49:11] [INFO ] Time to serialize properties into /tmp/CTLFireability8019048587920045795.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/CTLFireability1475336562309325503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8019048587920045795.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.24738e+10,0.670999,28924,2,15963,5,91781,6,0,715,122822,0
Converting to forward existential form...Done !
original formula: AX(EF(AG(AX((p11==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U !(!(EX(!((p11==0))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t22, t25, t28, t31, t34, t37, t40, t43, t46, t51, t54, t57, t61, t62, t65, t66, t69, ...306
(forward)formula 0,1,16.2242,403552,1,0,341,1.59128e+06,270,163,4236,1.74417e+06,360
FORMULA BusinessProcesses-PT-01-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 158/158 transitions.
Graph (complete) has 358 edges and 178 vertex of which 177 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 176 transition count 133
Reduce places removed 23 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 153 transition count 131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 151 transition count 131
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 51 place count 151 transition count 94
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 131 place count 108 transition count 94
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 151 place count 88 transition count 74
Iterating global reduction 3 with 20 rules applied. Total rules applied 171 place count 88 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 173 place count 88 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 174 place count 87 transition count 72
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 174 place count 87 transition count 70
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 178 place count 85 transition count 70
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 236 place count 56 transition count 41
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 237 place count 56 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 238 place count 55 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 239 place count 54 transition count 39
Applied a total of 239 rules in 22 ms. Remains 54 /178 variables (removed 124) and now considering 39/158 (removed 119) transitions.
// Phase 1: matrix 39 rows 54 cols
[2022-05-15 13:49:28] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-15 13:49:28] [INFO ] Implicit Places using invariants in 35 ms returned [7, 8, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 36 ms to find 3 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 51/178 places, 39/158 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 51/178 places, 39/158 transitions.
[2022-05-15 13:49:28] [INFO ] Flatten gal took : 3 ms
[2022-05-15 13:49:28] [INFO ] Flatten gal took : 3 ms
[2022-05-15 13:49:28] [INFO ] Input system was already deterministic with 39 transitions.
[2022-05-15 13:49:28] [INFO ] Flatten gal took : 2 ms
[2022-05-15 13:49:28] [INFO ] Flatten gal took : 3 ms
[2022-05-15 13:49:28] [INFO ] Time to serialize gal into /tmp/CTLFireability9129225057692556885.gal : 1 ms
[2022-05-15 13:49:28] [INFO ] Time to serialize properties into /tmp/CTLFireability2684659001325383567.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/CTLFireability9129225057692556885.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2684659001325383567.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,2868,0.015867,5136,2,426,5,2231,6,0,243,2328,0
Converting to forward existential form...Done !
original formula: EG(EF((((p10==1)&&(p118==1))&&(p193==1))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((p10==1)&&(p118==1))&&(p193==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, t14, t21, t28, t32, t37, Intersection with reachable at each step enabled. (des...197
(forward)formula 0,1,0.115357,10068,1,0,143,28198,101,103,1631,29727,160
FORMULA BusinessProcesses-PT-01-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 158/158 transitions.
Graph (trivial) has 102 edges and 178 vertex of which 7 / 178 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 350 edges and 172 vertex of which 171 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 34 place count 170 transition count 116
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 67 place count 138 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 137 transition count 115
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 68 place count 137 transition count 90
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 123 place count 107 transition count 90
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 141 place count 89 transition count 72
Iterating global reduction 3 with 18 rules applied. Total rules applied 159 place count 89 transition count 72
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 159 place count 89 transition count 70
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 163 place count 87 transition count 70
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 225 place count 56 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 226 place count 55 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 227 place count 54 transition count 38
Applied a total of 227 rules in 21 ms. Remains 54 /178 variables (removed 124) and now considering 38/158 (removed 120) transitions.
// Phase 1: matrix 38 rows 54 cols
[2022-05-15 13:49:28] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-15 13:49:28] [INFO ] Implicit Places using invariants in 37 ms returned [2, 6, 7, 8]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 37 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 50/178 places, 38/158 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 50/178 places, 38/158 transitions.
[2022-05-15 13:49:28] [INFO ] Flatten gal took : 2 ms
[2022-05-15 13:49:28] [INFO ] Flatten gal took : 3 ms
[2022-05-15 13:49:28] [INFO ] Input system was already deterministic with 38 transitions.
Finished random walk after 24 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
FORMULA BusinessProcesses-PT-01-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 158/158 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 159 transition count 139
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 159 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 159 transition count 138
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 52 place count 146 transition count 125
Iterating global reduction 1 with 13 rules applied. Total rules applied 65 place count 146 transition count 125
Applied a total of 65 rules in 7 ms. Remains 146 /178 variables (removed 32) and now considering 125/158 (removed 33) transitions.
// Phase 1: matrix 125 rows 146 cols
[2022-05-15 13:49:28] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:49:28] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 125 rows 146 cols
[2022-05-15 13:49:28] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:49:28] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 146 cols
[2022-05-15 13:49:28] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-15 13:49:28] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 146/178 places, 125/158 transitions.
Finished structural reductions, in 1 iterations. Remains : 146/178 places, 125/158 transitions.
[2022-05-15 13:49:28] [INFO ] Flatten gal took : 5 ms
[2022-05-15 13:49:28] [INFO ] Flatten gal took : 6 ms
[2022-05-15 13:49:28] [INFO ] Input system was already deterministic with 125 transitions.
[2022-05-15 13:49:28] [INFO ] Flatten gal took : 6 ms
[2022-05-15 13:49:28] [INFO ] Flatten gal took : 6 ms
[2022-05-15 13:49:28] [INFO ] Time to serialize gal into /tmp/CTLFireability3971601728037970129.gal : 1 ms
[2022-05-15 13:49:28] [INFO ] Time to serialize properties into /tmp/CTLFireability14851950493430136910.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/CTLFireability3971601728037970129.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14851950493430136910.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.24738e+10,0.691891,28764,2,15840,5,91688,6,0,710,124146,0
Converting to forward existential form...Done !
original formula: (EF((AG(AX((p76==1))) * (p152==0))) * AF(EG(AX((p97==0)))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (!(E(TRUE U !(!(EX(!((p76==1))))))) * (p152==0)))))] = FALSE * [FwdG(Init,!(EG(!(EX(!((p97=...174
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t22, t25, t28, t31, t34, t37, t40, t43, t47, t48, t52, t55, t58, t62, t63, t66, t67, ...306
Detected timeout of ITS tools.
[2022-05-15 13:49:58] [INFO ] Flatten gal took : 10 ms
[2022-05-15 13:49:58] [INFO ] Applying decomposition
[2022-05-15 13:49:58] [INFO ] Flatten gal took : 6 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/graph7227383689628128000.txt' '-o' '/tmp/graph7227383689628128000.bin' '-w' '/tmp/graph7227383689628128000.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7227383689628128000.bin' '-l' '-1' '-v' '-w' '/tmp/graph7227383689628128000.weights' '-q' '0' '-e' '0.001'
[2022-05-15 13:49:58] [INFO ] Decomposing Gal with order
[2022-05-15 13:49:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 13:49:58] [INFO ] Removed a total of 46 redundant transitions.
[2022-05-15 13:49:58] [INFO ] Flatten gal took : 39 ms
[2022-05-15 13:49:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2022-05-15 13:49:58] [INFO ] Time to serialize gal into /tmp/CTLFireability14929154534977140540.gal : 4 ms
[2022-05-15 13:49:58] [INFO ] Time to serialize properties into /tmp/CTLFireability11659571286808642799.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/CTLFireability14929154534977140540.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11659571286808642799.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.24738e+10,0.196027,13008,1410,32,17688,335,377,25334,49,798,0
Converting to forward existential form...Done !
original formula: (EF((AG(AX((i8.u23.p76==1))) * (i15.u40.p152==0))) * AF(EG(AX((i11.u31.p97==0)))))
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (!(E(TRUE U !(!(EX(!((i8.u23.p76==1))))))) * (i15.u40.p152==0)))))] = FALSE * [FwdG(Init,!(...197
Reverse transition relation is NOT exact ! Due to transitions t1, t67, t71, t75, t83, t116, i0.u24.t52, i0.u38.t25, i0.u39.t22, i1.t63, i1.u6.t86, i1.u15.t...446
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,15.9256,453768,1,0,954356,335,2392,1.24145e+06,251,829,1182741
FORMULA BusinessProcesses-PT-01-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 158/158 transitions.
Graph (complete) has 358 edges and 178 vertex of which 177 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 176 transition count 132
Reduce places removed 24 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 152 transition count 130
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 150 transition count 130
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 53 place count 150 transition count 95
Deduced a syphon composed of 35 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 129 place count 109 transition count 95
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 149 place count 89 transition count 75
Iterating global reduction 3 with 20 rules applied. Total rules applied 169 place count 89 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 171 place count 89 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 172 place count 88 transition count 73
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 172 place count 88 transition count 71
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 176 place count 86 transition count 71
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 226 place count 61 transition count 46
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 227 place count 61 transition count 45
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 229 place count 61 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 60 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 231 place count 59 transition count 44
Applied a total of 231 rules in 26 ms. Remains 59 /178 variables (removed 119) and now considering 44/158 (removed 114) transitions.
// Phase 1: matrix 44 rows 59 cols
[2022-05-15 13:50:14] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-15 13:50:15] [INFO ] Implicit Places using invariants in 477 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 478 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 57/178 places, 44/158 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 44/44 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 57/178 places, 44/158 transitions.
[2022-05-15 13:50:15] [INFO ] Flatten gal took : 3 ms
[2022-05-15 13:50:15] [INFO ] Flatten gal took : 3 ms
[2022-05-15 13:50:15] [INFO ] Input system was already deterministic with 44 transitions.
[2022-05-15 13:50:15] [INFO ] Flatten gal took : 3 ms
[2022-05-15 13:50:15] [INFO ] Flatten gal took : 4 ms
[2022-05-15 13:50:15] [INFO ] Time to serialize gal into /tmp/CTLFireability2653148619450096360.gal : 1 ms
[2022-05-15 13:50:15] [INFO ] Time to serialize properties into /tmp/CTLFireability14044322807934634931.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/CTLFireability2653148619450096360.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14044322807934634931.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,8586,0.018143,5152,2,591,5,2738,6,0,272,2573,0
Converting to forward existential form...Done !
original formula: !(E((EF(((p90==1)||(((p71==1)&&(p129==1))&&(p197==1)))) + AG((((p39==1)&&(p123==1))&&(p193==1)))) U (((p65==1)&&(p129==1))&&(p188==1))))
=> equivalent forward existential formula: [(FwdU(Init,(E(TRUE U ((p90==1)||(((p71==1)&&(p129==1))&&(p197==1)))) + !(E(TRUE U !((((p39==1)&&(p123==1))&&(p1...214
Reverse transition relation is NOT exact ! Due to transitions t6, t14, t19, t20, t23, t30, t32, t35, t36, t39, t41, Intersection with reachable at each st...214
(forward)formula 0,0,0.271185,16744,1,0,185,63582,112,137,1872,73557,247
FORMULA BusinessProcesses-PT-01-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 158/158 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 159 transition count 139
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 159 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 159 transition count 138
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 52 place count 146 transition count 125
Iterating global reduction 1 with 13 rules applied. Total rules applied 65 place count 146 transition count 125
Applied a total of 65 rules in 14 ms. Remains 146 /178 variables (removed 32) and now considering 125/158 (removed 33) transitions.
// Phase 1: matrix 125 rows 146 cols
[2022-05-15 13:50:15] [INFO ] Computed 28 place invariants in 0 ms
[2022-05-15 13:50:15] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 125 rows 146 cols
[2022-05-15 13:50:15] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:50:16] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 146 cols
[2022-05-15 13:50:16] [INFO ] Computed 28 place invariants in 0 ms
[2022-05-15 13:50:16] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 146/178 places, 125/158 transitions.
Finished structural reductions, in 1 iterations. Remains : 146/178 places, 125/158 transitions.
[2022-05-15 13:50:16] [INFO ] Flatten gal took : 6 ms
[2022-05-15 13:50:16] [INFO ] Flatten gal took : 6 ms
[2022-05-15 13:50:16] [INFO ] Input system was already deterministic with 125 transitions.
[2022-05-15 13:50:16] [INFO ] Flatten gal took : 5 ms
[2022-05-15 13:50:16] [INFO ] Flatten gal took : 5 ms
[2022-05-15 13:50:16] [INFO ] Time to serialize gal into /tmp/CTLFireability8181061292582727492.gal : 2 ms
[2022-05-15 13:50:16] [INFO ] Time to serialize properties into /tmp/CTLFireability4792201693582736382.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/CTLFireability8181061292582727492.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4792201693582736382.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.25161e+10,0.708333,31048,2,15963,5,97268,6,0,710,139149,0
Converting to forward existential form...Done !
original formula: EF(((AX((((p66==0)||(p189==0)) * EX(AX((p122==1))))) * EG((p49==0))) * ((p91==1) + AF((p172==0)))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (!(EX(!((((p66==0)||(p189==0)) * EX(!(EX(!((p122==1))))))))) * EG((p49==0)))) * (p91==1))]...299
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t22, t25, t28, t32, t33, t35, t38, t41, t44, t47, t52, t55, t58, t62, t63, t66, t67, ...306
Detected timeout of ITS tools.
[2022-05-15 13:50:46] [INFO ] Flatten gal took : 6 ms
[2022-05-15 13:50:46] [INFO ] Applying decomposition
[2022-05-15 13:50:46] [INFO ] Flatten gal took : 5 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/graph11228395824887637122.txt' '-o' '/tmp/graph11228395824887637122.bin' '-w' '/tmp/graph11228395824887637122.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11228395824887637122.bin' '-l' '-1' '-v' '-w' '/tmp/graph11228395824887637122.weights' '-q' '0' '-e' '0.001'
[2022-05-15 13:50:46] [INFO ] Decomposing Gal with order
[2022-05-15 13:50:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 13:50:46] [INFO ] Removed a total of 48 redundant transitions.
[2022-05-15 13:50:46] [INFO ] Flatten gal took : 11 ms
[2022-05-15 13:50:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2022-05-15 13:50:46] [INFO ] Time to serialize gal into /tmp/CTLFireability14054739490985912085.gal : 2 ms
[2022-05-15 13:50:46] [INFO ] Time to serialize properties into /tmp/CTLFireability12946338307534382787.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/CTLFireability14054739490985912085.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12946338307534382787.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.25161e+10,0.136052,10156,1203,27,10568,323,421,15075,47,714,0
Converting to forward existential form...Done !
original formula: EF(((AX((((i7.i1.u19.p66==0)||(i7.i1.u49.p189==0)) * EX(AX((i12.i1.u36.p122==1))))) * EG((i2.u15.p49==0))) * ((i11.u30.p91==1) + AF((i6.u...170
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (!(EX(!((((i7.i1.u19.p66==0)||(i7.i1.u49.p189==0)) * EX(!(EX(!((i12.i1.u36.p122==1))))))))...390
Reverse transition relation is NOT exact ! Due to transitions t1, t63, t67, t71, t75, t116, i0.i0.u40.t22, i0.i1.u16.t66, i0.i1.u25.t52, i2.u14.t70, i3.t83...470
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local 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
(forward)formula 0,1,6.96649,232564,1,0,458809,323,2344,674272,211,714,529149
FORMULA BusinessProcesses-PT-01-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 158/158 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 159 transition count 139
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 159 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 159 transition count 138
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 52 place count 146 transition count 125
Iterating global reduction 1 with 13 rules applied. Total rules applied 65 place count 146 transition count 125
Applied a total of 65 rules in 7 ms. Remains 146 /178 variables (removed 32) and now considering 125/158 (removed 33) transitions.
// Phase 1: matrix 125 rows 146 cols
[2022-05-15 13:50:53] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-15 13:50:53] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 125 rows 146 cols
[2022-05-15 13:50:53] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:50:53] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 146 cols
[2022-05-15 13:50:53] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:50:53] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 146/178 places, 125/158 transitions.
Finished structural reductions, in 1 iterations. Remains : 146/178 places, 125/158 transitions.
[2022-05-15 13:50:53] [INFO ] Flatten gal took : 4 ms
[2022-05-15 13:50:53] [INFO ] Flatten gal took : 5 ms
[2022-05-15 13:50:53] [INFO ] Input system was already deterministic with 125 transitions.
[2022-05-15 13:50:53] [INFO ] Flatten gal took : 6 ms
[2022-05-15 13:50:53] [INFO ] Flatten gal took : 5 ms
[2022-05-15 13:50:53] [INFO ] Time to serialize gal into /tmp/CTLFireability16725082374860270096.gal : 1 ms
[2022-05-15 13:50:53] [INFO ] Time to serialize properties into /tmp/CTLFireability8817928041028717767.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/CTLFireability16725082374860270096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8817928041028717767.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.24799e+10,0.715489,28540,2,15656,5,91194,6,0,710,121818,0
Converting to forward existential form...Done !
original formula: (EG(EF(((p151==1) * AF((p64==1))))) + EX(EX(AF((p35==1)))))
=> equivalent forward existential formula: ([FwdG(Init,E(TRUE U ((p151==1) * !(EG(!((p64==1)))))))] != FALSE + [(EY(EY(Init)) * !(EG(!((p35==1)))))] != FAL...158
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t22, t25, t28, t31, t34, t37, t40, t43, t46, t51, t54, t57, t58, t62, t63, t66, t67, ...306
Detected timeout of ITS tools.
[2022-05-15 13:51:23] [INFO ] Flatten gal took : 12 ms
[2022-05-15 13:51:23] [INFO ] Applying decomposition
[2022-05-15 13:51:23] [INFO ] Flatten gal took : 6 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/graph17801905771377665689.txt' '-o' '/tmp/graph17801905771377665689.bin' '-w' '/tmp/graph17801905771377665689.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17801905771377665689.bin' '-l' '-1' '-v' '-w' '/tmp/graph17801905771377665689.weights' '-q' '0' '-e' '0.001'
[2022-05-15 13:51:23] [INFO ] Decomposing Gal with order
[2022-05-15 13:51:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 13:51:23] [INFO ] Removed a total of 49 redundant transitions.
[2022-05-15 13:51:23] [INFO ] Flatten gal took : 24 ms
[2022-05-15 13:51:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2022-05-15 13:51:23] [INFO ] Time to serialize gal into /tmp/CTLFireability10994413969867183369.gal : 7 ms
[2022-05-15 13:51:23] [INFO ] Time to serialize properties into /tmp/CTLFireability17093502797776056691.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/CTLFireability10994413969867183369.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17093502797776056691.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.24799e+10,0.146952,11576,1286,30,15347,293,375,18966,45,744,0
Converting to forward existential form...Done !
original formula: (EG(EF(((i12.u48.p151==1) * AF((i13.u19.p64==1))))) + EX(EX(AF((i5.u11.p35==1)))))
=> equivalent forward existential formula: ([FwdG(Init,E(TRUE U ((i12.u48.p151==1) * !(EG(!((i13.u19.p64==1)))))))] != FALSE + [(EY(EY(Init)) * !(EG(!((i5....181
Reverse transition relation is NOT exact ! Due to transitions t63, t71, t75, t83, t116, i0.u39.t25, i0.u40.t22, i1.i0.u17.t66, i1.i0.u26.t51, i1.i1.u24.t54...460
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 a local 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
(forward)formula 0,1,6.19831,191472,1,0,428875,293,2419,468789,216,744,472879
FORMULA BusinessProcesses-PT-01-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 158/158 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 162 transition count 142
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 162 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 162 transition count 141
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 42 place count 153 transition count 132
Iterating global reduction 1 with 9 rules applied. Total rules applied 51 place count 153 transition count 132
Applied a total of 51 rules in 7 ms. Remains 153 /178 variables (removed 25) and now considering 132/158 (removed 26) transitions.
// Phase 1: matrix 132 rows 153 cols
[2022-05-15 13:51:29] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-15 13:51:30] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 132 rows 153 cols
[2022-05-15 13:51:30] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:51:30] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
// Phase 1: matrix 132 rows 153 cols
[2022-05-15 13:51:30] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:51:30] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/178 places, 132/158 transitions.
Finished structural reductions, in 1 iterations. Remains : 153/178 places, 132/158 transitions.
[2022-05-15 13:51:30] [INFO ] Flatten gal took : 5 ms
[2022-05-15 13:51:30] [INFO ] Flatten gal took : 4 ms
[2022-05-15 13:51:30] [INFO ] Input system was already deterministic with 132 transitions.
[2022-05-15 13:51:30] [INFO ] Flatten gal took : 4 ms
[2022-05-15 13:51:30] [INFO ] Flatten gal took : 4 ms
[2022-05-15 13:51:30] [INFO ] Time to serialize gal into /tmp/CTLFireability17468174331957364542.gal : 1 ms
[2022-05-15 13:51:30] [INFO ] Time to serialize properties into /tmp/CTLFireability17098779807356562466.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/CTLFireability17468174331957364542.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17098779807356562466.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...276
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.50876e+10,1.07685,37972,2,18098,5,120136,6,0,745,181363,0
Converting to forward existential form...Done !
original formula: EG(((AG(!(A(E((((p71==1)&&(p129==1))&&(p197==1)) U (p30==1)) U AX((p73==1))))) + (A(!(((p186==1)&&(p132==1))) U !(A((p132==1) U (p153==1)...251
=> equivalent forward existential formula: [FwdG(Init,((!(E(TRUE U !(!(!((E(!(!(EX(!((p73==1))))) U (!(E((((p71==1)&&(p129==1))&&(p197==1)) U (p30==1))) * ...607
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t6, t16, t26, t30, t31, t33, t36, t39, t42, t45, t48, t51, t56, t59, t62, t66, t67, t...329
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2022-05-15 13:52:00] [INFO ] Flatten gal took : 5 ms
[2022-05-15 13:52:00] [INFO ] Applying decomposition
[2022-05-15 13:52:00] [INFO ] Flatten gal took : 13 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/graph14841606403501541634.txt' '-o' '/tmp/graph14841606403501541634.bin' '-w' '/tmp/graph14841606403501541634.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14841606403501541634.bin' '-l' '-1' '-v' '-w' '/tmp/graph14841606403501541634.weights' '-q' '0' '-e' '0.001'
[2022-05-15 13:52:00] [INFO ] Decomposing Gal with order
[2022-05-15 13:52:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 13:52:00] [INFO ] Removed a total of 46 redundant transitions.
[2022-05-15 13:52:00] [INFO ] Flatten gal took : 9 ms
[2022-05-15 13:52:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-15 13:52:00] [INFO ] Time to serialize gal into /tmp/CTLFireability7342492186865148116.gal : 1 ms
[2022-05-15 13:52:00] [INFO ] Time to serialize properties into /tmp/CTLFireability2265997522412718395.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/CTLFireability7342492186865148116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2265997522412718395.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.50876e+10,0.091457,8364,870,29,7537,370,430,10510,51,825,0
Converting to forward existential form...Done !
original formula: EG(((AG(!(A(E((((i13.i1.u20.p71==1)&&(i0.u37.p129==1))&&(i13.i1.u49.p197==1)) U (i4.u11.p30==1)) U AX((i13.i0.u22.p73==1))))) + (A(!(((i1...379
=> equivalent forward existential formula: [FwdG(Init,((!(E(TRUE U !(!(!((E(!(!(EX(!((i13.i0.u22.p73==1))))) U (!(E((((i13.i1.u20.p71==1)&&(i0.u37.p129==1)...837
Reverse transition relation is NOT exact ! Due to transitions t1, t71, t79, t89, t122, i0.u37.t33, i0.u40.t26, i1.t67, i1.u14.t74, i1.u16.t70, i2.u4.t94, i...523
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local 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
(forward)formula 0,0,4.05873,139892,1,0,266970,370,2861,407063,268,825,410762
FORMULA BusinessProcesses-PT-01-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 158/158 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 158 transition count 138
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 158 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 158 transition count 137
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 54 place count 145 transition count 124
Iterating global reduction 1 with 13 rules applied. Total rules applied 67 place count 145 transition count 124
Applied a total of 67 rules in 8 ms. Remains 145 /178 variables (removed 33) and now considering 124/158 (removed 34) transitions.
// Phase 1: matrix 124 rows 145 cols
[2022-05-15 13:52:04] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-15 13:52:04] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 124 rows 145 cols
[2022-05-15 13:52:04] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:52:04] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
// Phase 1: matrix 124 rows 145 cols
[2022-05-15 13:52:04] [INFO ] Computed 28 place invariants in 2 ms
[2022-05-15 13:52:04] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 145/178 places, 124/158 transitions.
Finished structural reductions, in 1 iterations. Remains : 145/178 places, 124/158 transitions.
[2022-05-15 13:52:04] [INFO ] Flatten gal took : 4 ms
[2022-05-15 13:52:04] [INFO ] Flatten gal took : 4 ms
[2022-05-15 13:52:04] [INFO ] Input system was already deterministic with 124 transitions.
[2022-05-15 13:52:04] [INFO ] Flatten gal took : 4 ms
[2022-05-15 13:52:04] [INFO ] Flatten gal took : 4 ms
[2022-05-15 13:52:04] [INFO ] Time to serialize gal into /tmp/CTLFireability1628519555168736032.gal : 0 ms
[2022-05-15 13:52:04] [INFO ] Time to serialize properties into /tmp/CTLFireability16401416490322389062.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/CTLFireability1628519555168736032.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16401416490322389062.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.24738e+10,0.698462,27956,2,15173,5,88856,6,0,705,119390,0
Converting to forward existential form...Done !
original formula: EF(AX(AX(FALSE)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!(EX(!(FALSE)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t22, t25, t28, t31, t34, t37, t40, t43, t46, t51, t54, t57, t61, t62, t65, t66, t69, ...301
(forward)formula 0,1,7.13684,204192,1,0,261,750977,259,122,4026,833867,254
FORMULA BusinessProcesses-PT-01-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 158/158 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 160 transition count 140
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 160 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 160 transition count 139
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 49 place count 148 transition count 127
Iterating global reduction 1 with 12 rules applied. Total rules applied 61 place count 148 transition count 127
Applied a total of 61 rules in 5 ms. Remains 148 /178 variables (removed 30) and now considering 127/158 (removed 31) transitions.
// Phase 1: matrix 127 rows 148 cols
[2022-05-15 13:52:11] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:52:12] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 127 rows 148 cols
[2022-05-15 13:52:12] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:52:12] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
// Phase 1: matrix 127 rows 148 cols
[2022-05-15 13:52:12] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:52:12] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 148/178 places, 127/158 transitions.
Finished structural reductions, in 1 iterations. Remains : 148/178 places, 127/158 transitions.
[2022-05-15 13:52:12] [INFO ] Flatten gal took : 5 ms
[2022-05-15 13:52:12] [INFO ] Flatten gal took : 4 ms
[2022-05-15 13:52:12] [INFO ] Input system was already deterministic with 127 transitions.
[2022-05-15 13:52:12] [INFO ] Flatten gal took : 3 ms
[2022-05-15 13:52:12] [INFO ] Flatten gal took : 3 ms
[2022-05-15 13:52:12] [INFO ] Time to serialize gal into /tmp/CTLFireability7239876225813289550.gal : 0 ms
[2022-05-15 13:52:12] [INFO ] Time to serialize properties into /tmp/CTLFireability2224254202809666949.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/CTLFireability7239876225813289550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2224254202809666949.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.30313e+10,0.775489,31624,2,16113,5,100259,6,0,720,142342,0
Converting to forward existential form...Done !
original formula: AG(EX(!(E((p125==1) U (p173==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(E((p125==1) U (p173==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t11, t24, t27, t30, t34, t35, t37, t40, t43, t46, t49, t54, t57, t60, t64, t65, t68, ...311
(forward)formula 0,0,9.72287,289672,1,0,617,1.13843e+06,270,301,4102,1.40094e+06,613
FORMULA BusinessProcesses-PT-01-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 178/178 places, 158/158 transitions.
Graph (trivial) has 93 edges and 178 vertex of which 7 / 178 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 350 edges and 172 vertex of which 171 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 29 place count 170 transition count 121
Reduce places removed 27 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 143 transition count 119
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 60 place count 141 transition count 119
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 60 place count 141 transition count 96
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 110 place count 114 transition count 96
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 126 place count 98 transition count 80
Iterating global reduction 3 with 16 rules applied. Total rules applied 142 place count 98 transition count 80
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 142 place count 98 transition count 79
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 144 place count 97 transition count 79
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 206 place count 66 transition count 48
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 208 place count 66 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 209 place count 65 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 210 place count 64 transition count 47
Applied a total of 210 rules in 13 ms. Remains 64 /178 variables (removed 114) and now considering 47/158 (removed 111) transitions.
// Phase 1: matrix 47 rows 64 cols
[2022-05-15 13:52:22] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-15 13:52:22] [INFO ] Implicit Places using invariants in 42 ms returned [0, 1, 5, 8, 11, 49, 50]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 43 ms to find 7 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 57/178 places, 47/158 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 57/178 places, 47/158 transitions.
[2022-05-15 13:52:22] [INFO ] Flatten gal took : 2 ms
[2022-05-15 13:52:22] [INFO ] Flatten gal took : 2 ms
[2022-05-15 13:52:22] [INFO ] Input system was already deterministic with 47 transitions.
[2022-05-15 13:52:22] [INFO ] Flatten gal took : 2 ms
[2022-05-15 13:52:22] [INFO ] Flatten gal took : 2 ms
[2022-05-15 13:52:22] [INFO ] Time to serialize gal into /tmp/CTLFireability18280972199911657147.gal : 3 ms
[2022-05-15 13:52:22] [INFO ] Time to serialize properties into /tmp/CTLFireability10784742184589635822.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/CTLFireability18280972199911657147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10784742184589635822.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...276
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,2340,0.024417,5320,2,671,5,4810,6,0,274,3401,0
Converting to forward existential form...Done !
original formula: ((EF((p135==1)) + AF(!(A(((p186==1)&&(!(((p68==1)&&(p124==1))&&(p185==1)))) U (E(((p195==1)&&(p198==1)) U (p157==1)) + (p50!=1)))))) + AG...166
=> equivalent forward existential formula: [(FwdU((Init * !((E(TRUE U (p135==1)) + !(EG(!(!(!((E(!((E(((p195==1)&&(p198==1)) U (p157==1)) + (p50!=1))) U (!...364
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t6, t10, t21, t34, t35, t43, Intersection with reachable at each step enabled. (dest...196
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.2408,16448,1,0,200,71850,131,132,1870,52688,233
FORMULA BusinessProcesses-PT-01-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 158/158 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 160 transition count 140
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 160 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 160 transition count 139
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 48 place count 149 transition count 128
Iterating global reduction 1 with 11 rules applied. Total rules applied 59 place count 149 transition count 128
Applied a total of 59 rules in 4 ms. Remains 149 /178 variables (removed 29) and now considering 128/158 (removed 30) transitions.
// Phase 1: matrix 128 rows 149 cols
[2022-05-15 13:52:22] [INFO ] Computed 28 place invariants in 3 ms
[2022-05-15 13:52:22] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 128 rows 149 cols
[2022-05-15 13:52:22] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:52:22] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
// Phase 1: matrix 128 rows 149 cols
[2022-05-15 13:52:22] [INFO ] Computed 28 place invariants in 1 ms
[2022-05-15 13:52:22] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 149/178 places, 128/158 transitions.
Finished structural reductions, in 1 iterations. Remains : 149/178 places, 128/158 transitions.
[2022-05-15 13:52:22] [INFO ] Flatten gal took : 4 ms
[2022-05-15 13:52:22] [INFO ] Flatten gal took : 4 ms
[2022-05-15 13:52:22] [INFO ] Input system was already deterministic with 128 transitions.
[2022-05-15 13:52:22] [INFO ] Flatten gal took : 3 ms
[2022-05-15 13:52:22] [INFO ] Flatten gal took : 3 ms
[2022-05-15 13:52:22] [INFO ] Time to serialize gal into /tmp/CTLFireability11911265036559332944.gal : 1 ms
[2022-05-15 13:52:22] [INFO ] Time to serialize properties into /tmp/CTLFireability1844244728841650139.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/CTLFireability11911265036559332944.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1844244728841650139.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.31136e+10,0.689047,31660,2,17923,5,101916,6,0,725,137867,0
Converting to forward existential form...Done !
original formula: (AX(EF((EF((((p20==1)&&(p94==1))&&(p163==1))) + EG((p107==0))))) + AG((E((p46==1) U (p85==1)) + A((p38==1) U ((p101==1)||(p170!=1))))))
=> equivalent forward existential formula: [((FwdU((Init * !(!(EX(!(E(TRUE U (E(TRUE U (((p20==1)&&(p94==1))&&(p163==1))) + EG((p107==0))))))))),TRUE) * !(...304
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t11, t23, t26, t29, t32, t35, t38, t42, t43, t45, t48, t53, t56, t59, t63, t64, t67, ...305
Detected timeout of ITS tools.
[2022-05-15 13:52:52] [INFO ] Flatten gal took : 4 ms
[2022-05-15 13:52:52] [INFO ] Applying decomposition
[2022-05-15 13:52:52] [INFO ] Flatten gal took : 4 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/graph14588181590814226354.txt' '-o' '/tmp/graph14588181590814226354.bin' '-w' '/tmp/graph14588181590814226354.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14588181590814226354.bin' '-l' '-1' '-v' '-w' '/tmp/graph14588181590814226354.weights' '-q' '0' '-e' '0.001'
[2022-05-15 13:52:52] [INFO ] Decomposing Gal with order
[2022-05-15 13:52:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 13:52:52] [INFO ] Removed a total of 47 redundant transitions.
[2022-05-15 13:52:52] [INFO ] Flatten gal took : 7 ms
[2022-05-15 13:52:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-15 13:52:52] [INFO ] Time to serialize gal into /tmp/CTLFireability13234961052818739393.gal : 1 ms
[2022-05-15 13:52:52] [INFO ] Time to serialize properties into /tmp/CTLFireability16527809926406796998.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/CTLFireability13234961052818739393.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16527809926406796998.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.31136e+10,0.17662,11444,1138,30,14276,408,380,17676,53,822,0
Converting to forward existential form...Done !
original formula: (AX(EF((EF((((i1.u7.p20==1)&&(i10.u30.p94==1))&&(i1.u44.p163==1))) + EG((i11.i1.u34.p107==0))))) + AG((E((i4.u14.p46==1) U (i9.u27.p85==1...221
=> equivalent forward existential formula: [((FwdU((Init * !(!(EX(!(E(TRUE U (E(TRUE U (((i1.u7.p20==1)&&(i10.u30.p94==1))&&(i1.u44.p163==1))) + EG((i11.i1...404
Reverse transition relation is NOT exact ! Due to transitions t1, t64, t68, t72, t86, t118, i0.u16.t67, i1.u6.t89, i2.t85, i2.t78, i3.u12.t75, i4.u14.t71, ...475
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local 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
(forward)formula 0,1,4.951,159400,1,0,325939,408,2393,427162,259,851,461308
FORMULA BusinessProcesses-PT-01-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
[2022-05-15 13:52:57] [INFO ] Flatten gal took : 10 ms
[2022-05-15 13:52:57] [INFO ] Flatten gal took : 4 ms
Total runtime 239939 ms.
BK_STOP 1652622777788
--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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="BusinessProcesses-PT-01"
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 BusinessProcesses-PT-01, 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 r024-tall-165251918400322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-01.tgz
mv BusinessProcesses-PT-01 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 '
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 ;