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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 6.8K Apr 29 23:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 29 23:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Apr 29 23:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 29 23:54 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:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:09 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 63K 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-03-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-03-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652623165549

Running Version 202205111006
[2022-05-15 13:59:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -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:59:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 13:59:26] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2022-05-15 13:59:26] [INFO ] Transformed 274 places.
[2022-05-15 13:59:26] [INFO ] Transformed 237 transitions.
[2022-05-15 13:59:26] [INFO ] Found NUPN structural information;
[2022-05-15 13:59:26] [INFO ] Parsed PT model containing 274 places and 237 transitions in 182 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-03-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 107 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 236/236 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 271 transition count 236
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 253 transition count 218
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 253 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 253 transition count 217
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 44 place count 248 transition count 212
Iterating global reduction 2 with 5 rules applied. Total rules applied 49 place count 248 transition count 212
Applied a total of 49 rules in 50 ms. Remains 248 /273 variables (removed 25) and now considering 212/236 (removed 24) transitions.
// Phase 1: matrix 212 rows 248 cols
[2022-05-15 13:59:27] [INFO ] Computed 41 place invariants in 20 ms
[2022-05-15 13:59:27] [INFO ] Implicit Places using invariants in 206 ms returned []
// Phase 1: matrix 212 rows 248 cols
[2022-05-15 13:59:27] [INFO ] Computed 41 place invariants in 7 ms
[2022-05-15 13:59:27] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
// Phase 1: matrix 212 rows 248 cols
[2022-05-15 13:59:27] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-15 13:59:27] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 248/273 places, 212/236 transitions.
Finished structural reductions, in 1 iterations. Remains : 248/273 places, 212/236 transitions.
Support contains 107 out of 248 places after structural reductions.
[2022-05-15 13:59:27] [INFO ] Flatten gal took : 40 ms
[2022-05-15 13:59:27] [INFO ] Flatten gal took : 18 ms
[2022-05-15 13:59:27] [INFO ] Input system was already deterministic with 212 transitions.
Incomplete random walk after 10000 steps, including 113 resets, run finished after 539 ms. (steps per millisecond=18 ) properties (out of 78) seen :50
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
// Phase 1: matrix 212 rows 248 cols
[2022-05-15 13:59:28] [INFO ] Computed 41 place invariants in 5 ms
[2022-05-15 13:59:28] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:28
[2022-05-15 13:59:29] [INFO ] [Nat]Absence check using 41 positive place invariants in 18 ms returned sat
[2022-05-15 13:59:29] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :21 sat :7
[2022-05-15 13:59:29] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 3 ms to minimize.
[2022-05-15 13:59:29] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2022-05-15 13:59:29] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2022-05-15 13:59:29] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 2 ms to minimize.
[2022-05-15 13:59:29] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2022-05-15 13:59:29] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2022-05-15 13:59:29] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2022-05-15 13:59:29] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2022-05-15 13:59:29] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2022-05-15 13:59:29] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
[2022-05-15 13:59:29] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 0 ms to minimize.
[2022-05-15 13:59:29] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2022-05-15 13:59:29] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2022-05-15 13:59:29] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2022-05-15 13:59:29] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 0 ms to minimize.
[2022-05-15 13:59:30] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2022-05-15 13:59:30] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 830 ms
[2022-05-15 13:59:30] [INFO ] After 1102ms SMT Verify possible using trap constraints in natural domain returned unsat :21 sat :7
Attempting to minimize the solution found.
Minimization took 69 ms.
[2022-05-15 13:59:30] [INFO ] After 1419ms SMT Verify possible using all constraints in natural domain returned unsat :21 sat :7
Fused 28 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 13 out of 248 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 248/248 places, 212/212 transitions.
Graph (trivial) has 127 edges and 248 vertex of which 4 / 248 are part of one of the 1 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 491 edges and 245 vertex of which 244 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 244 transition count 167
Reduce places removed 39 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 40 rules applied. Total rules applied 81 place count 205 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 204 transition count 166
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 82 place count 204 transition count 130
Deduced a syphon composed of 36 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 81 rules applied. Total rules applied 163 place count 159 transition count 130
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 189 place count 133 transition count 104
Iterating global reduction 3 with 26 rules applied. Total rules applied 215 place count 133 transition count 104
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 215 place count 133 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 218 place count 131 transition count 103
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 314 place count 83 transition count 55
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 315 place count 83 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 316 place count 82 transition count 54
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 317 place count 81 transition count 53
Applied a total of 317 rules in 44 ms. Remains 81 /248 variables (removed 167) and now considering 53/212 (removed 159) transitions.
Finished structural reductions, in 1 iterations. Remains : 81/248 places, 53/212 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 53 rows 81 cols
[2022-05-15 13:59:31] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-15 13:59:31] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-15 13:59:31] [INFO ] [Nat]Absence check using 30 positive place invariants in 4 ms returned sat
[2022-05-15 13:59:31] [INFO ] [Nat]Absence check using 30 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-15 13:59:31] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2022-05-15 13:59:31] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2022-05-15 13:59:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2022-05-15 13:59:31] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-15 13:59:31] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 32 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 6 properties in 2 ms.
Successfully simplified 21 atomic propositions for a total of 14 simplifications.
FORMULA BusinessProcesses-PT-03-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 13:59:31] [INFO ] Flatten gal took : 13 ms
[2022-05-15 13:59:31] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BusinessProcesses-PT-03-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 13:59:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-03-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-03-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 13:59:31] [INFO ] Flatten gal took : 12 ms
[2022-05-15 13:59:31] [INFO ] Input system was already deterministic with 212 transitions.
Support contains 50 out of 248 places (down from 80) after GAL structural reductions.
Computed a total of 242 stabilizing places and 204 stable transitions
Graph (complete) has 495 edges and 248 vertex of which 247 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 212/212 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 216 transition count 180
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 216 transition count 180
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 77 place count 203 transition count 167
Iterating global reduction 0 with 13 rules applied. Total rules applied 90 place count 203 transition count 167
Applied a total of 90 rules in 17 ms. Remains 203 /248 variables (removed 45) and now considering 167/212 (removed 45) transitions.
// Phase 1: matrix 167 rows 203 cols
[2022-05-15 13:59:31] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-15 13:59:31] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 167 rows 203 cols
[2022-05-15 13:59:31] [INFO ] Computed 41 place invariants in 14 ms
[2022-05-15 13:59:31] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
// Phase 1: matrix 167 rows 203 cols
[2022-05-15 13:59:31] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-15 13:59:31] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/248 places, 167/212 transitions.
Finished structural reductions, in 1 iterations. Remains : 203/248 places, 167/212 transitions.
[2022-05-15 13:59:31] [INFO ] Flatten gal took : 9 ms
[2022-05-15 13:59:31] [INFO ] Flatten gal took : 9 ms
[2022-05-15 13:59:31] [INFO ] Input system was already deterministic with 167 transitions.
[2022-05-15 13:59:31] [INFO ] Flatten gal took : 9 ms
[2022-05-15 13:59:31] [INFO ] Flatten gal took : 9 ms
[2022-05-15 13:59:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality15262607164818533499.gal : 5 ms
[2022-05-15 13:59:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality14348128658087228864.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/CTLCardinality15262607164818533499.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14348128658087228864.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,9.50162e+12,0.448923,21232,2,11210,5,50021,6,0,979,80495,0


Converting to forward existential form...Done !
original formula: AG(EX(AX(((p132==0)||(p128==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(EX(!(((p132==0)||(p128==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t18, t25, t28, t31, t34, t37, t40, t43, t46, t49, t52, t55, t58, t61, t65, t66, t68, t70, t73...404
(forward)formula 0,0,6.1102,199304,1,0,376,749488,351,174,5507,705746,345
FORMULA BusinessProcesses-PT-03-CTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 248/248 places, 212/212 transitions.
Graph (trivial) has 148 edges and 248 vertex of which 6 / 248 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 489 edges and 243 vertex of which 242 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 242 transition count 156
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 193 transition count 156
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 100 place count 193 transition count 117
Deduced a syphon composed of 39 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 188 place count 144 transition count 117
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 220 place count 112 transition count 85
Iterating global reduction 2 with 32 rules applied. Total rules applied 252 place count 112 transition count 85
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 252 place count 112 transition count 83
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 258 place count 108 transition count 83
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 352 place count 61 transition count 36
Applied a total of 352 rules in 24 ms. Remains 61 /248 variables (removed 187) and now considering 36/212 (removed 176) transitions.
// Phase 1: matrix 36 rows 61 cols
[2022-05-15 13:59:38] [INFO ] Computed 29 place invariants in 1 ms
[2022-05-15 13:59:38] [INFO ] Implicit Places using invariants in 45 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 60/248 places, 36/212 transitions.
Applied a total of 0 rules in 2 ms. Remains 60 /60 variables (removed 0) and now considering 36/36 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 60/248 places, 36/212 transitions.
[2022-05-15 13:59:38] [INFO ] Flatten gal took : 4 ms
[2022-05-15 13:59:38] [INFO ] Flatten gal took : 3 ms
[2022-05-15 13:59:38] [INFO ] Input system was already deterministic with 36 transitions.
[2022-05-15 13:59:38] [INFO ] Flatten gal took : 4 ms
[2022-05-15 13:59:38] [INFO ] Flatten gal took : 3 ms
[2022-05-15 13:59:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality13983580415561998666.gal : 1 ms
[2022-05-15 13:59:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality4881162834865376582.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/CTLCardinality13983580415561998666.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4881162834865376582.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,51,0.013994,4920,2,379,5,1477,6,0,276,1221,0


Converting to forward existential form...Done !
original formula: EF(AG((p1==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p1==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t35, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...168
(forward)formula 0,0,0.049803,6944,1,0,49,5343,93,36,1939,3963,81
FORMULA BusinessProcesses-PT-03-CTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 212/212 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 216 transition count 180
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 216 transition count 180
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 77 place count 203 transition count 167
Iterating global reduction 0 with 13 rules applied. Total rules applied 90 place count 203 transition count 167
Applied a total of 90 rules in 16 ms. Remains 203 /248 variables (removed 45) and now considering 167/212 (removed 45) transitions.
// Phase 1: matrix 167 rows 203 cols
[2022-05-15 13:59:38] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 13:59:38] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 167 rows 203 cols
[2022-05-15 13:59:38] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 13:59:38] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
// Phase 1: matrix 167 rows 203 cols
[2022-05-15 13:59:38] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 13:59:38] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/248 places, 167/212 transitions.
Finished structural reductions, in 1 iterations. Remains : 203/248 places, 167/212 transitions.
[2022-05-15 13:59:38] [INFO ] Flatten gal took : 9 ms
[2022-05-15 13:59:38] [INFO ] Flatten gal took : 7 ms
[2022-05-15 13:59:38] [INFO ] Input system was already deterministic with 167 transitions.
[2022-05-15 13:59:38] [INFO ] Flatten gal took : 9 ms
[2022-05-15 13:59:38] [INFO ] Flatten gal took : 7 ms
[2022-05-15 13:59:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality509631749024398777.gal : 1 ms
[2022-05-15 13:59:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality8285568325179122572.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/CTLCardinality509631749024398777.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8285568325179122572.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...273
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.58845e+12,0.451597,23084,2,11459,5,52918,6,0,979,89603,0


Converting to forward existential form...Done !
original formula: !(EF(!(EX((p173!=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((p173!=1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t18, t25, t28, t31, t34, t38, t39, t41, t44, t47, t50, t53, t56, t59, t62, t65, t68, t70, t73...404
(forward)formula 0,0,5.89032,193380,1,0,371,696563,350,171,5504,640930,341
FORMULA BusinessProcesses-PT-03-CTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 248/248 places, 212/212 transitions.
Graph (trivial) has 144 edges and 248 vertex of which 6 / 248 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 489 edges and 243 vertex of which 242 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 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 241 transition count 158
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 195 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 194 transition count 157
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 96 place count 194 transition count 119
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 182 place count 146 transition count 119
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 213 place count 115 transition count 88
Iterating global reduction 3 with 31 rules applied. Total rules applied 244 place count 115 transition count 88
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 244 place count 115 transition count 86
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 250 place count 111 transition count 86
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 342 place count 65 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 344 place count 64 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 345 place count 63 transition count 38
Applied a total of 345 rules in 23 ms. Remains 63 /248 variables (removed 185) and now considering 38/212 (removed 174) transitions.
// Phase 1: matrix 38 rows 63 cols
[2022-05-15 13:59:44] [INFO ] Computed 29 place invariants in 0 ms
[2022-05-15 13:59:44] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 38 rows 63 cols
[2022-05-15 13:59:44] [INFO ] Computed 29 place invariants in 0 ms
[2022-05-15 13:59:44] [INFO ] Implicit Places using invariants and state equation in 60 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 16, 18, 20, 22, 24, 26, 28, 34, 36, 38, 40, 42, 44, 46, 48]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 98 ms to find 28 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 35/248 places, 38/212 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 35 transition count 31
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 28 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 26 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 26 transition count 29
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 26 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 20 place count 25 transition count 28
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 21 place count 24 transition count 27
Iterating global reduction 4 with 1 rules applied. Total rules applied 22 place count 24 transition count 27
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 24 place count 23 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 25 place count 23 transition count 25
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 26 place count 23 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 27 place count 22 transition count 24
Applied a total of 27 rules in 5 ms. Remains 22 /35 variables (removed 13) and now considering 24/38 (removed 14) transitions.
// Phase 1: matrix 24 rows 22 cols
[2022-05-15 13:59:44] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-15 13:59:44] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 24 rows 22 cols
[2022-05-15 13:59:44] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-15 13:59:44] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 22/248 places, 24/212 transitions.
Finished structural reductions, in 2 iterations. Remains : 22/248 places, 24/212 transitions.
[2022-05-15 13:59:44] [INFO ] Flatten gal took : 1 ms
[2022-05-15 13:59:44] [INFO ] Flatten gal took : 2 ms
[2022-05-15 13:59:44] [INFO ] Input system was already deterministic with 24 transitions.
[2022-05-15 13:59:44] [INFO ] Flatten gal took : 1 ms
[2022-05-15 13:59:44] [INFO ] Flatten gal took : 1 ms
[2022-05-15 13:59:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality13533153200429090697.gal : 1 ms
[2022-05-15 13:59:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality13716287188905975906.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/CTLCardinality13533153200429090697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13716287188905975906.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,104,0.007693,4456,2,65,5,422,6,0,110,327,0


Converting to forward existential form...Done !
original formula: EG(AG(((p96==0)||(p156==1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(((p96==0)||(p156==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t15, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...168
(forward)formula 0,0,0.0157,4956,1,0,45,1898,75,29,648,1621,59
FORMULA BusinessProcesses-PT-03-CTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 248/248 places, 212/212 transitions.
Graph (trivial) has 135 edges and 248 vertex of which 6 / 248 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 489 edges and 243 vertex of which 242 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 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 241 transition count 162
Reduce places removed 42 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 199 transition count 160
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 90 place count 197 transition count 160
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 90 place count 197 transition count 122
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 83 rules applied. Total rules applied 173 place count 152 transition count 122
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 201 place count 124 transition count 94
Iterating global reduction 3 with 28 rules applied. Total rules applied 229 place count 124 transition count 94
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 229 place count 124 transition count 93
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 232 place count 122 transition count 93
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 314 place count 81 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 316 place count 80 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 317 place count 79 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 318 place count 78 transition count 50
Applied a total of 318 rules in 27 ms. Remains 78 /248 variables (removed 170) and now considering 50/212 (removed 162) transitions.
// Phase 1: matrix 50 rows 78 cols
[2022-05-15 13:59:44] [INFO ] Computed 32 place invariants in 0 ms
[2022-05-15 13:59:44] [INFO ] Implicit Places using invariants in 38 ms returned [6, 8, 14, 23]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 38 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 74/248 places, 50/212 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 74/248 places, 50/212 transitions.
[2022-05-15 13:59:44] [INFO ] Flatten gal took : 3 ms
[2022-05-15 13:59:44] [INFO ] Flatten gal took : 3 ms
[2022-05-15 13:59:44] [INFO ] Input system was already deterministic with 50 transitions.
[2022-05-15 13:59:44] [INFO ] Flatten gal took : 3 ms
[2022-05-15 13:59:44] [INFO ] Flatten gal took : 3 ms
[2022-05-15 13:59:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality10031270934673873251.gal : 0 ms
[2022-05-15 13:59:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality12227430638960548338.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/CTLCardinality10031270934673873251.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12227430638960548338.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,1014,0.032631,5868,2,757,5,3947,6,0,345,3972,0


Converting to forward existential form...Done !
original formula: (A(!(AG(AF(((p28==0)||(p219==1))))) U AF(!((AG(((p54==0)||(p243==1))) + EG((p221==1)))))) + AF((((EG((p222==0)) * AF((p57==1))) * ((p222=...240
=> equivalent forward existential formula: [FwdG((Init * !(!((E(!(!(EG(!(!((!(E(TRUE U !(((p54==0)||(p243==1))))) + EG((p221==1)))))))) U (!(!(!(E(TRUE U !...495
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t8, t9, t24, t25, t26, t27, t28, t30, t31, t32, t49, Intersection with reachable at ...221
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.374685,21216,1,0,384,89323,161,217,2243,95134,455
FORMULA BusinessProcesses-PT-03-CTLCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 212/212 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 219 transition count 183
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 219 transition count 183
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 69 place count 208 transition count 172
Iterating global reduction 0 with 11 rules applied. Total rules applied 80 place count 208 transition count 172
Applied a total of 80 rules in 20 ms. Remains 208 /248 variables (removed 40) and now considering 172/212 (removed 40) transitions.
// Phase 1: matrix 172 rows 208 cols
[2022-05-15 13:59:45] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-15 13:59:45] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 172 rows 208 cols
[2022-05-15 13:59:45] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 13:59:45] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
// Phase 1: matrix 172 rows 208 cols
[2022-05-15 13:59:45] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 13:59:45] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 208/248 places, 172/212 transitions.
Finished structural reductions, in 1 iterations. Remains : 208/248 places, 172/212 transitions.
[2022-05-15 13:59:45] [INFO ] Flatten gal took : 7 ms
[2022-05-15 13:59:45] [INFO ] Flatten gal took : 8 ms
[2022-05-15 13:59:45] [INFO ] Input system was already deterministic with 172 transitions.
[2022-05-15 13:59:45] [INFO ] Flatten gal took : 8 ms
[2022-05-15 13:59:45] [INFO ] Flatten gal took : 7 ms
[2022-05-15 13:59:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality13667364312957817030.gal : 2 ms
[2022-05-15 13:59:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality12138013797306963590.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/CTLCardinality13667364312957817030.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12138013797306963590.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,9.54797e+12,0.413376,22372,2,11669,5,52368,6,0,1004,85650,0


Converting to forward existential form...Done !
original formula: E(AG(!(AF(EG((p247==1))))) U ((AX((((p163==0)||(p163==1))&&(p243==1))) * ((p152==0)||(p26==1))) * ((p220==0)||(p230==1))))
=> equivalent forward existential formula: [(((FwdU(Init,!(E(TRUE U !(!(!(EG(!(EG((p247==1)))))))))) * ((p220==0)||(p230==1))) * ((p152==0)||(p26==1))) * !...210
Reverse transition relation is NOT exact ! Due to transitions t9, t13, t15, t17, t23, t30, t33, t36, t39, t42, t45, t49, t50, t52, t55, t58, t61, t64, t67,...413
(forward)formula 0,1,29.48,840732,1,0,930,3.70381e+06,377,444,6275,4.05911e+06,998
FORMULA BusinessProcesses-PT-03-CTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 212/212 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 217 transition count 181
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 217 transition count 181
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 73 place count 206 transition count 170
Iterating global reduction 0 with 11 rules applied. Total rules applied 84 place count 206 transition count 170
Applied a total of 84 rules in 11 ms. Remains 206 /248 variables (removed 42) and now considering 170/212 (removed 42) transitions.
// Phase 1: matrix 170 rows 206 cols
[2022-05-15 14:00:15] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-15 14:00:15] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 170 rows 206 cols
[2022-05-15 14:00:15] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-15 14:00:15] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
// Phase 1: matrix 170 rows 206 cols
[2022-05-15 14:00:15] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:00:15] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 206/248 places, 170/212 transitions.
Finished structural reductions, in 1 iterations. Remains : 206/248 places, 170/212 transitions.
[2022-05-15 14:00:15] [INFO ] Flatten gal took : 6 ms
[2022-05-15 14:00:15] [INFO ] Flatten gal took : 7 ms
[2022-05-15 14:00:15] [INFO ] Input system was already deterministic with 170 transitions.
[2022-05-15 14:00:15] [INFO ] Flatten gal took : 6 ms
[2022-05-15 14:00:15] [INFO ] Flatten gal took : 6 ms
[2022-05-15 14:00:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality11933933613393860746.gal : 3 ms
[2022-05-15 14:00:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality8552417772190258290.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/CTLCardinality11933933613393860746.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8552417772190258290.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,9.54633e+12,0.408753,22352,2,11489,5,51852,6,0,994,85656,0


Converting to forward existential form...Done !
original formula: ((EG((p112==0)) + AG(AX((((p87==0)||(p87==1))&&((p113==0)||(p172==1)))))) * (A(((p70==0)||(p55==1)) U AF(AG((p177==1)))) + A(AG((E((p260=...262
=> equivalent forward existential formula: ([(EY(FwdU((Init * !(EG((p112==0)))),TRUE)) * !((((p87==0)||(p87==1))&&((p113==0)||(p172==1)))))] = FALSE * ([Fw...778
Reverse transition relation is NOT exact ! Due to transitions t5, t13, t21, t28, t31, t34, t37, t40, t43, t47, t48, t50, t53, t56, t59, t62, t65, t68, t71,...414
Using saturation style SCC detection
Detected timeout of ITS tools.
[2022-05-15 14:00:45] [INFO ] Flatten gal took : 12 ms
[2022-05-15 14:00:45] [INFO ] Applying decomposition
[2022-05-15 14:00:45] [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/graph3641181527699997697.txt' '-o' '/tmp/graph3641181527699997697.bin' '-w' '/tmp/graph3641181527699997697.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3641181527699997697.bin' '-l' '-1' '-v' '-w' '/tmp/graph3641181527699997697.weights' '-q' '0' '-e' '0.001'
[2022-05-15 14:00:45] [INFO ] Decomposing Gal with order
[2022-05-15 14:00:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 14:00:45] [INFO ] Removed a total of 45 redundant transitions.
[2022-05-15 14:00:46] [INFO ] Flatten gal took : 40 ms
[2022-05-15 14:00:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2022-05-15 14:00:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality14950476506266687188.gal : 4 ms
[2022-05-15 14:00:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality5984698830567400292.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/CTLCardinality14950476506266687188.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5984698830567400292.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...254
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.54633e+12,0.150722,10788,1499,29,11520,485,401,17234,45,1214,0


Converting to forward existential form...Done !
original formula: ((EG((i16.u38.p112==0)) + AG(AX((((u28.p87==0)||(u28.p87==1))&&((i16.u38.p113==0)||(i9.u52.p172==1)))))) * (A(((i11.u23.p70==0)||(i9.u18....379
=> equivalent forward existential formula: ([(EY(FwdU((Init * !(EG((i16.u38.p112==0)))),TRUE)) * !((((u28.p87==0)||(u28.p87==1))&&((i16.u38.p113==0)||(i9.u...1005
Reverse transition relation is NOT exact ! Due to transitions t80, t100, t104, t108, t116, t160, t163, t166, i0.u53.t37, i0.u55.t31, i0.u56.t28, i1.i0.u33....679
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 a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,18.7398,539700,1,0,908840,485,3012,1.50627e+06,238,1214,1099068
FORMULA BusinessProcesses-PT-03-CTLCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 212/212 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 218 transition count 182
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 218 transition count 182
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 71 place count 207 transition count 171
Iterating global reduction 0 with 11 rules applied. Total rules applied 82 place count 207 transition count 171
Applied a total of 82 rules in 14 ms. Remains 207 /248 variables (removed 41) and now considering 171/212 (removed 41) transitions.
// Phase 1: matrix 171 rows 207 cols
[2022-05-15 14:01:04] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:01:04] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 171 rows 207 cols
[2022-05-15 14:01:04] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:01:05] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
// Phase 1: matrix 171 rows 207 cols
[2022-05-15 14:01:05] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:01:05] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 207/248 places, 171/212 transitions.
Finished structural reductions, in 1 iterations. Remains : 207/248 places, 171/212 transitions.
[2022-05-15 14:01:05] [INFO ] Flatten gal took : 6 ms
[2022-05-15 14:01:05] [INFO ] Flatten gal took : 6 ms
[2022-05-15 14:01:05] [INFO ] Input system was already deterministic with 171 transitions.
[2022-05-15 14:01:05] [INFO ] Flatten gal took : 5 ms
[2022-05-15 14:01:05] [INFO ] Flatten gal took : 5 ms
[2022-05-15 14:01:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality9582008015876859067.gal : 1 ms
[2022-05-15 14:01:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality2293064873121691522.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/CTLCardinality9582008015876859067.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2293064873121691522.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/C...274
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.76284e+12,0.410879,22260,2,11908,5,51585,6,0,999,84253,0


Converting to forward existential form...Done !
original formula: AG(!(E(A(((EF((p31==1)) * ((p2==0)||(p2==1))) * ((p158==0)||(p41==1))) U !(((p70==1)&&(p46==1)))) U (EX(TRUE) * (p152==1)))))
=> equivalent forward existential formula: [(EY((FwdU(FwdU(Init,TRUE),!((E(!(!(((p70==1)&&(p46==1)))) U (!(((E(TRUE U (p31==1)) * ((p2==0)||(p2==1))) * ((p...273
Reverse transition relation is NOT exact ! Due to transitions t18, t25, t28, t31, t34, t37, t40, t43, t47, t48, t50, t53, t56, t59, t62, t65, t68, t70, t73...404
(forward)formula 0,0,9.44949,306588,1,0,645,1.13341e+06,377,296,5960,1.19013e+06,682
FORMULA BusinessProcesses-PT-03-CTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 212/212 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 217 transition count 181
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 217 transition count 181
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 75 place count 204 transition count 168
Iterating global reduction 0 with 13 rules applied. Total rules applied 88 place count 204 transition count 168
Applied a total of 88 rules in 7 ms. Remains 204 /248 variables (removed 44) and now considering 168/212 (removed 44) transitions.
// Phase 1: matrix 168 rows 204 cols
[2022-05-15 14:01:14] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:01:14] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 168 rows 204 cols
[2022-05-15 14:01:14] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-15 14:01:14] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
// Phase 1: matrix 168 rows 204 cols
[2022-05-15 14:01:14] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:01:15] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 204/248 places, 168/212 transitions.
Finished structural reductions, in 1 iterations. Remains : 204/248 places, 168/212 transitions.
[2022-05-15 14:01:15] [INFO ] Flatten gal took : 5 ms
[2022-05-15 14:01:15] [INFO ] Flatten gal took : 8 ms
[2022-05-15 14:01:15] [INFO ] Input system was already deterministic with 168 transitions.
[2022-05-15 14:01:15] [INFO ] Flatten gal took : 5 ms
[2022-05-15 14:01:15] [INFO ] Flatten gal took : 5 ms
[2022-05-15 14:01:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality17214837976952984344.gal : 1 ms
[2022-05-15 14:01:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality14923914144769593235.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/CTLCardinality17214837976952984344.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14923914144769593235.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,9.3977e+12,0.399508,21408,2,11154,5,50033,6,0,984,81242,0


Converting to forward existential form...Done !
original formula: (AG((p145==0)) + ((EX(((p184==0)||(p26==1))) * AX(((p9==0)||(p240==1)))) * EX(((p16!=0)&&(p101!=1)))))
=> equivalent forward existential formula: (([((Init * !(!(E(TRUE U !((p145==0)))))) * !(EX(((p184==0)||(p26==1)))))] = FALSE * [(EY((Init * !(!(E(TRUE U !...292
Reverse transition relation is NOT exact ! Due to transitions t9, t19, t26, t29, t32, t35, t38, t41, t44, t47, t50, t53, t56, t59, t62, t65, t68, t70, t73,...403
(forward)formula 0,0,5.61624,200116,1,0,379,685541,359,177,5736,588392,355
FORMULA BusinessProcesses-PT-03-CTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 212/212 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 216 transition count 180
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 216 transition count 180
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 77 place count 203 transition count 167
Iterating global reduction 0 with 13 rules applied. Total rules applied 90 place count 203 transition count 167
Applied a total of 90 rules in 14 ms. Remains 203 /248 variables (removed 45) and now considering 167/212 (removed 45) transitions.
// Phase 1: matrix 167 rows 203 cols
[2022-05-15 14:01:20] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-15 14:01:20] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 167 rows 203 cols
[2022-05-15 14:01:20] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:01:20] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
// Phase 1: matrix 167 rows 203 cols
[2022-05-15 14:01:20] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-15 14:01:20] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 203/248 places, 167/212 transitions.
Finished structural reductions, in 1 iterations. Remains : 203/248 places, 167/212 transitions.
[2022-05-15 14:01:20] [INFO ] Flatten gal took : 5 ms
[2022-05-15 14:01:21] [INFO ] Flatten gal took : 4 ms
[2022-05-15 14:01:21] [INFO ] Input system was already deterministic with 167 transitions.
[2022-05-15 14:01:21] [INFO ] Flatten gal took : 4 ms
[2022-05-15 14:01:21] [INFO ] Flatten gal took : 4 ms
[2022-05-15 14:01:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality14734135115432478906.gal : 1 ms
[2022-05-15 14:01:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality5339689379212526385.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/CTLCardinality14734135115432478906.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5339689379212526385.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,9.42e+12,0.377241,21704,2,11160,5,49779,6,0,979,80035,0


Converting to forward existential form...Done !
original formula: EF(((p252==1) * EX(AG((p250==0)))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * (p252==1))) * !(E(TRUE U !((p250==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t19, t26, t29, t32, t35, t38, t41, t44, t47, t50, t53, t56, t59, t62, t65, t68, t70, t73,...403
(forward)formula 0,1,5.72229,199888,1,0,394,676401,357,184,5749,570903,374
FORMULA BusinessProcesses-PT-03-CTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2022-05-15 14:01:26] [INFO ] Flatten gal took : 12 ms
[2022-05-15 14:01:26] [INFO ] Flatten gal took : 5 ms
Total runtime 120187 ms.

BK_STOP 1652623286890

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination CTLCardinality -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-03"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-03, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918400337"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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