fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r292-tall-162124156300354
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for HealthRecord-PT-13

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3535.968 670077.00 610476.00 44214.60 TFTFTFFTFFFTFTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r292-tall-162124156300354.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is HealthRecord-PT-13, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156300354
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.0K May 11 18:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 11 18:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 11 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 11 15:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 52K May 12 08:13 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 HealthRecord-PT-13-CTLFireability-00
FORMULA_NAME HealthRecord-PT-13-CTLFireability-01
FORMULA_NAME HealthRecord-PT-13-CTLFireability-02
FORMULA_NAME HealthRecord-PT-13-CTLFireability-03
FORMULA_NAME HealthRecord-PT-13-CTLFireability-04
FORMULA_NAME HealthRecord-PT-13-CTLFireability-05
FORMULA_NAME HealthRecord-PT-13-CTLFireability-06
FORMULA_NAME HealthRecord-PT-13-CTLFireability-07
FORMULA_NAME HealthRecord-PT-13-CTLFireability-08
FORMULA_NAME HealthRecord-PT-13-CTLFireability-09
FORMULA_NAME HealthRecord-PT-13-CTLFireability-10
FORMULA_NAME HealthRecord-PT-13-CTLFireability-11
FORMULA_NAME HealthRecord-PT-13-CTLFireability-12
FORMULA_NAME HealthRecord-PT-13-CTLFireability-13
FORMULA_NAME HealthRecord-PT-13-CTLFireability-14
FORMULA_NAME HealthRecord-PT-13-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1621282349234

Running Version 0
[2021-05-17 20:12:43] [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]
[2021-05-17 20:12:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 20:12:43] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2021-05-17 20:12:43] [INFO ] Transformed 161 places.
[2021-05-17 20:12:43] [INFO ] Transformed 341 transitions.
[2021-05-17 20:12:43] [INFO ] Found NUPN structural information;
[2021-05-17 20:12:43] [INFO ] Parsed PT model containing 161 places and 341 transitions in 93 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
[2021-05-17 20:12:43] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 20:12:43] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 20:12:43] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 20:12:43] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 20:12:43] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 20:12:43] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-17 20:12:43] [INFO ] Reduced 2 identical enabling conditions.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Support contains 157 out of 161 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 161/161 places, 313/313 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 159 transition count 311
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 159 transition count 311
Applied a total of 4 rules in 19 ms. Remains 159 /161 variables (removed 2) and now considering 311/313 (removed 2) transitions.
[2021-05-17 20:12:43] [INFO ] Flow matrix only has 301 transitions (discarded 10 similar events)
// Phase 1: matrix 301 rows 159 cols
[2021-05-17 20:12:43] [INFO ] Computed 16 place invariants in 21 ms
[2021-05-17 20:12:43] [INFO ] Implicit Places using invariants in 133 ms returned []
[2021-05-17 20:12:43] [INFO ] Flow matrix only has 301 transitions (discarded 10 similar events)
// Phase 1: matrix 301 rows 159 cols
[2021-05-17 20:12:43] [INFO ] Computed 16 place invariants in 4 ms
[2021-05-17 20:12:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:12:43] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2021-05-17 20:12:43] [INFO ] Flow matrix only has 301 transitions (discarded 10 similar events)
// Phase 1: matrix 301 rows 159 cols
[2021-05-17 20:12:43] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-17 20:12:43] [INFO ] Dead Transitions using invariants and state equation in 217 ms returned []
Finished structural reductions, in 1 iterations. Remains : 159/161 places, 311/313 transitions.
[2021-05-17 20:12:44] [INFO ] Flatten gal took : 56 ms
[2021-05-17 20:12:44] [INFO ] Flatten gal took : 23 ms
[2021-05-17 20:12:44] [INFO ] Input system was already deterministic with 311 transitions.
Incomplete random walk after 100000 steps, including 7784 resets, run finished after 433 ms. (steps per millisecond=230 ) properties (out of 94) seen :90
Running SMT prover for 4 properties.
[2021-05-17 20:12:44] [INFO ] Flow matrix only has 301 transitions (discarded 10 similar events)
// Phase 1: matrix 301 rows 159 cols
[2021-05-17 20:12:44] [INFO ] Computed 16 place invariants in 4 ms
[2021-05-17 20:12:44] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2021-05-17 20:12:44] [INFO ] [Real]Absence check using 8 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-17 20:12:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:12:44] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2021-05-17 20:12:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:12:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-17 20:12:44] [INFO ] [Nat]Absence check using 8 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:12:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:12:44] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2021-05-17 20:12:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:12:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:12:44] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 19 ms.
[2021-05-17 20:12:45] [INFO ] Added : 84 causal constraints over 17 iterations in 310 ms. Result :sat
[2021-05-17 20:12:45] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-17 20:12:45] [INFO ] [Real]Absence check using 8 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-17 20:12:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:12:45] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2021-05-17 20:12:45] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2021-05-17 20:12:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:12:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-17 20:12:45] [INFO ] [Nat]Absence check using 8 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-17 20:12:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:12:45] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2021-05-17 20:12:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:12:45] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 4 ms to minimize.
[2021-05-17 20:12:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2021-05-17 20:12:45] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 27 ms.
[2021-05-17 20:12:45] [INFO ] Added : 88 causal constraints over 19 iterations in 293 ms. Result :sat
[2021-05-17 20:12:45] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2021-05-17 20:12:45] [INFO ] [Real]Absence check using 8 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:12:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:12:45] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2021-05-17 20:12:45] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:12:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:12:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-17 20:12:46] [INFO ] [Nat]Absence check using 8 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:12:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:12:46] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2021-05-17 20:12:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:12:46] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 22 ms.
[2021-05-17 20:12:46] [INFO ] Added : 83 causal constraints over 17 iterations in 259 ms. Result :sat
[2021-05-17 20:12:46] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-17 20:12:46] [INFO ] [Real]Absence check using 8 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:12:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:12:46] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2021-05-17 20:12:46] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:12:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:12:46] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-17 20:12:46] [INFO ] [Nat]Absence check using 8 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:12:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:12:46] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2021-05-17 20:12:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:12:46] [INFO ] Computed and/alt/rep : 233/270/233 causal constraints (skipped 67 transitions) in 23 ms.
[2021-05-17 20:12:46] [INFO ] Added : 87 causal constraints over 18 iterations in 257 ms. Result :sat
Graph (trivial) has 181 edges and 159 vertex of which 6 / 159 are part of one of the 3 SCC in 3 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 86 places :
Symmetric choice reduction at 0 with 86 rule applications. Total rules 87 place count 69 transition count 142
Iterating global reduction 0 with 86 rules applied. Total rules applied 173 place count 69 transition count 142
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 181 place count 61 transition count 126
Iterating global reduction 0 with 8 rules applied. Total rules applied 189 place count 61 transition count 126
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 195 place count 61 transition count 120
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 198 place count 58 transition count 111
Iterating global reduction 1 with 3 rules applied. Total rules applied 201 place count 58 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 202 place count 57 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 203 place count 57 transition count 109
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 206 place count 57 transition count 106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 210 place count 55 transition count 104
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 214 place count 53 transition count 123
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 216 place count 53 transition count 121
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 217 place count 52 transition count 120
Applied a total of 217 rules in 42 ms. Remains 52 /159 variables (removed 107) and now considering 120/311 (removed 191) transitions.
[2021-05-17 20:12:46] [INFO ] Flatten gal took : 7 ms
[2021-05-17 20:12:46] [INFO ] Flatten gal took : 8 ms
[2021-05-17 20:12:46] [INFO ] Input system was already deterministic with 120 transitions.
[2021-05-17 20:12:46] [INFO ] Flatten gal took : 8 ms
[2021-05-17 20:12:46] [INFO ] Flatten gal took : 8 ms
[2021-05-17 20:12:46] [INFO ] Time to serialize gal into /tmp/CTLFireability13377420778448033761.gal : 4 ms
[2021-05-17 20:12:46] [INFO ] Time to serialize properties into /tmp/CTLFireability13048738935720168609.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability13377420778448033761.gal, -t, CGAL, -ctl, /tmp/CTLFireability13048738935720168609.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability13377420778448033761.gal -t CGAL -ctl /tmp/CTLFireability13048738935720168609.ctl --gen-order FOLLOW
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,590550,0.147287,9916,2,2845,5,19883,6,0,318,20374,0


Converting to forward existential form...Done !
original formula: EG(AF(AG(((AF((((p36==1)&&(p158==1))||((p115==1)&&(p130==1)))) + ((p49==0)&&(p71==0))) + (((((p101==0)&&(p36==0))&&(p104==0))&&(p110==0))&&(p143==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(E(TRUE U !(((!(EG(!((((p36==1)&&(p158==1))||((p115==1)&&(p130==1)))))) + ((p49==0)&&(p71==0))) + (((((p101==0)&&(p36==0))&&(p104==0))&&(p110==0))&&(p143==0))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t22, t23, t24, t25, t26, t34, t35, t39, t40, t54, t55, t57, t70, t108, t109, t110, t111, t112, t113, t114, t115, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/78/42/120
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,7.27369,227872,1,0,424,1.37297e+06,273,189,2754,1.12053e+06,486
FORMULA HealthRecord-PT-13-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Graph (trivial) has 140 edges and 159 vertex of which 8 / 159 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 81 place count 75 transition count 154
Iterating global reduction 0 with 80 rules applied. Total rules applied 161 place count 75 transition count 154
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 167 place count 69 transition count 142
Iterating global reduction 0 with 6 rules applied. Total rules applied 173 place count 69 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 175 place count 69 transition count 140
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 177 place count 67 transition count 134
Iterating global reduction 1 with 2 rules applied. Total rules applied 179 place count 67 transition count 134
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 180 place count 66 transition count 132
Iterating global reduction 1 with 1 rules applied. Total rules applied 181 place count 66 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 183 place count 66 transition count 130
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 2 with 2 rules applied. Total rules applied 185 place count 65 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 187 place count 64 transition count 132
Applied a total of 187 rules in 20 ms. Remains 64 /159 variables (removed 95) and now considering 132/311 (removed 179) transitions.
[2021-05-17 20:12:54] [INFO ] Flatten gal took : 8 ms
[2021-05-17 20:12:54] [INFO ] Flatten gal took : 8 ms
[2021-05-17 20:12:54] [INFO ] Input system was already deterministic with 132 transitions.
[2021-05-17 20:12:54] [INFO ] Flatten gal took : 8 ms
[2021-05-17 20:12:54] [INFO ] Flatten gal took : 8 ms
[2021-05-17 20:12:54] [INFO ] Time to serialize gal into /tmp/CTLFireability14268705141452506731.gal : 3 ms
[2021-05-17 20:12:54] [INFO ] Time to serialize properties into /tmp/CTLFireability12479382247935192692.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability14268705141452506731.gal, -t, CGAL, -ctl, /tmp/CTLFireability12479382247935192692.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability14268705141452506731.gal -t CGAL -ctl /tmp/CTLFireability12479382247935192692.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.26806e+06,1.09814,39748,2,5856,5,133620,6,0,381,156116,0


Converting to forward existential form...Done !
original formula: (EF(((((((((p48==1)||(p33==1))||(p38==1))||(p42==1))||(p142==1))||(p111==1))||(p92==1))||(p143==1))) * EF(!(EF(AG((((((((((p49==0)&&(p114==0))&&(p48==0))&&(p83==0))&&((((((((((p18==0)||(p37==0))||(p56==0))||(p61==0))||(p68==0))||(p75==0))||(p82==0))||(p89==0))||(p116==0))||(p153==0)))&&(p71==0))&&(p102==0))&&(p123==0))&&(p126==0)))))))
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U ((((((((p48==1)||(p33==1))||(p38==1))||(p42==1))||(p142==1))||(p111==1))||(p92==1))||(p143==1)))),TRUE) * !(E(TRUE U !(E(TRUE U !((((((((((p49==0)&&(p114==0))&&(p48==0))&&(p83==0))&&((((((((((p18==0)||(p37==0))||(p56==0))||(p61==0))||(p68==0))||(p75==0))||(p82==0))||(p89==0))||(p116==0))||(p153==0)))&&(p71==0))&&(p102==0))&&(p123==0))&&(p126==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t25, t27, t28, t29, t30, t32, t33, t42, t43, t49, t50, t51, t52, t53, t54, t58, t59, t60, t61, t62, t64, t68, t69, t70, t71, t77, t78, t80, t83, t84, t88, t96, t124, t125, t126, t127, t128, t130, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/70/62/132
(forward)formula 0,0,6.2508,176908,1,0,299,989059,279,115,2954,786338,310
FORMULA HealthRecord-PT-13-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Graph (trivial) has 129 edges and 159 vertex of which 6 / 159 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 74 places :
Symmetric choice reduction at 0 with 74 rule applications. Total rules 75 place count 82 transition count 167
Iterating global reduction 0 with 74 rules applied. Total rules applied 149 place count 82 transition count 167
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 154 place count 77 transition count 157
Iterating global reduction 0 with 5 rules applied. Total rules applied 159 place count 77 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 160 place count 77 transition count 156
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 166 place count 74 transition count 153
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 172 place count 71 transition count 157
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 173 place count 71 transition count 156
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 174 place count 71 transition count 156
Applied a total of 174 rules in 23 ms. Remains 71 /159 variables (removed 88) and now considering 156/311 (removed 155) transitions.
[2021-05-17 20:13:00] [INFO ] Flatten gal took : 9 ms
[2021-05-17 20:13:00] [INFO ] Flatten gal took : 9 ms
[2021-05-17 20:13:00] [INFO ] Input system was already deterministic with 156 transitions.
[2021-05-17 20:13:00] [INFO ] Flatten gal took : 8 ms
[2021-05-17 20:13:00] [INFO ] Flatten gal took : 8 ms
[2021-05-17 20:13:00] [INFO ] Time to serialize gal into /tmp/CTLFireability17326096133996861111.gal : 1 ms
[2021-05-17 20:13:00] [INFO ] Time to serialize properties into /tmp/CTLFireability9002184330814252356.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability17326096133996861111.gal, -t, CGAL, -ctl, /tmp/CTLFireability9002184330814252356.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability17326096133996861111.gal -t CGAL -ctl /tmp/CTLFireability9002184330814252356.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.49373e+06,0.693495,28000,2,7007,5,107960,6,0,433,103072,0


Converting to forward existential form...Done !
original formula: !(EF((EG(A((((((((p16==0)&&(p43==0))&&(p136==0))&&(p28==0))&&((((p17==0)||(p36==0))||(p55==0))||(p141==0)))&&(p76==0))&&(p30==0)) U (((p96==1)||((p115==1)&&(p155==1)))||(p87==1)))) * !(AF(E((((((((((p65==1)||((p36==1)&&(p158==1)))||(p135==1))||(p86==1))||(p23==1))||((p115==1)&&(p128==1)))||(p110==1))||(p111==1))||(p47==1)) U ((((((p131==1)||(p69==1))||(p119==1))||((p88==1)&&(p158==1)))||(p123==1))||((((p17==1)&&(p36==1))&&(p55==1))&&(p158==1)))))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * EG(!((E(!((((p96==1)||((p115==1)&&(p155==1)))||(p87==1))) U (!((((((((p16==0)&&(p43==0))&&(p136==0))&&(p28==0))&&((((p17==0)||(p36==0))||(p55==0))||(p141==0)))&&(p76==0))&&(p30==0))) * !((((p96==1)||((p115==1)&&(p155==1)))||(p87==1))))) + EG(!((((p96==1)||((p115==1)&&(p155==1)))||(p87==1)))))))),!(E((((((((((p65==1)||((p36==1)&&(p158==1)))||(p135==1))||(p86==1))||(p23==1))||((p115==1)&&(p128==1)))||(p110==1))||(p111==1))||(p47==1)) U ((((((p131==1)||(p69==1))||(p119==1))||((p88==1)&&(p158==1)))||(p123==1))||((((p17==1)&&(p36==1))&&(p55==1))&&(p158==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t32, t33, t34, t35, t36, t39, t40, t41, t45, t46, t53, t54, t56, t57, t58, t59, t60, t61, t63, t64, t65, t66, t67, t68, t69, t70, t72, t73, t77, t82, t83, t85, t86, t87, t91, t101, t102, t105, t106, t109, t110, t135, t136, t139, t140, t141, t142, t145, t146, t147, t148, t155, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/73/83/156
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,18.5956,522608,1,0,659,2.91691e+06,347,314,3515,3.03629e+06,694
FORMULA HealthRecord-PT-13-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Graph (trivial) has 152 edges and 159 vertex of which 6 / 159 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 81 places :
Symmetric choice reduction at 0 with 81 rule applications. Total rules 82 place count 75 transition count 153
Iterating global reduction 0 with 81 rules applied. Total rules applied 163 place count 75 transition count 153
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 172 place count 66 transition count 135
Iterating global reduction 0 with 9 rules applied. Total rules applied 181 place count 66 transition count 135
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 190 place count 66 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 191 place count 65 transition count 123
Iterating global reduction 1 with 1 rules applied. Total rules applied 192 place count 65 transition count 123
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 193 place count 64 transition count 121
Iterating global reduction 1 with 1 rules applied. Total rules applied 194 place count 64 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 197 place count 64 transition count 118
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 205 place count 60 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 206 place count 60 transition count 113
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 212 place count 57 transition count 125
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 213 place count 57 transition count 124
Applied a total of 213 rules in 25 ms. Remains 57 /159 variables (removed 102) and now considering 124/311 (removed 187) transitions.
[2021-05-17 20:13:21] [INFO ] Flatten gal took : 7 ms
[2021-05-17 20:13:21] [INFO ] Flatten gal took : 7 ms
[2021-05-17 20:13:21] [INFO ] Input system was already deterministic with 124 transitions.
[2021-05-17 20:13:21] [INFO ] Flatten gal took : 6 ms
[2021-05-17 20:13:21] [INFO ] Flatten gal took : 6 ms
[2021-05-17 20:13:21] [INFO ] Time to serialize gal into /tmp/CTLFireability2903275133853704065.gal : 83 ms
[2021-05-17 20:13:21] [INFO ] Time to serialize properties into /tmp/CTLFireability11736856538705135919.ctl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability2903275133853704065.gal, -t, CGAL, -ctl, /tmp/CTLFireability11736856538705135919.ctl, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability2903275133853704065.gal -t CGAL -ctl /tmp/CTLFireability11736856538705135919.ctl --gen-order FOLLOW
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,768571,4.28493,125216,2,24108,5,322237,6,0,345,375700,0


Converting to forward existential form...Done !
original formula: AG(!(AG((((((((((((p81==0)||(p158==0))&&(p160==0))&&(p66==0))&&(p132==0))&&(p117==0))&&(p86==0))&&(p107==0))&&(p76==0))&&(p79==0)) + EG((((((((((p115==1)&&(p149==1))||(p87==1))||(p55==1))||((p17==1)&&(p158==1)))||((p88==1)&&(p158==1)))||(p76==1))||(p46==1))||(p109==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((((((((((p81==0)||(p158==0))&&(p160==0))&&(p66==0))&&(p132==0))&&(p117==0))&&(p86==0))&&(p107==0))&&(p76==0))&&(p79==0)) + EG((((((((((p115==1)&&(p149==1))||(p87==1))||(p55==1))||((p17==1)&&(p158==1)))||((p88==1)&&(p158==1)))||(p76==1))||(p46==1))||(p109==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38, t39, t40, t41, t42, t43, t44, t46, t47, t55, t62, t63, t70, t71, t76, t90, t91, t92, t93, t96, t97, t106, t107, t108, t109, t110, t111, t118, t119, t120, t121, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/56/68/124
Detected timeout of ITS tools.
[2021-05-17 20:13:52] [INFO ] Flatten gal took : 11 ms
[2021-05-17 20:13:52] [INFO ] Applying decomposition
[2021-05-17 20:13:52] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10986820677225823704.txt, -o, /tmp/graph10986820677225823704.bin, -w, /tmp/graph10986820677225823704.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10986820677225823704.bin, -l, -1, -v, -w, /tmp/graph10986820677225823704.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:14:05] [INFO ] Decomposing Gal with order
[2021-05-17 20:14:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:14:05] [INFO ] Removed a total of 171 redundant transitions.
[2021-05-17 20:14:05] [INFO ] Flatten gal took : 57 ms
[2021-05-17 20:14:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 8 ms.
[2021-05-17 20:14:05] [INFO ] Time to serialize gal into /tmp/CTLFireability7653700041843604746.gal : 2 ms
[2021-05-17 20:14:05] [INFO ] Time to serialize properties into /tmp/CTLFireability873057768998461995.ctl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability7653700041843604746.gal, -t, CGAL, -ctl, /tmp/CTLFireability873057768998461995.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability7653700041843604746.gal -t CGAL -ctl /tmp/CTLFireability873057768998461995.ctl
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,768571,0.073996,6936,219,129,3499,1649,290,8245,114,6109,0


Converting to forward existential form...Done !
original formula: AG(!(AG((((((((((((i1.u7.p81==0)||(i6.u12.p158==0))&&(i6.u13.p160==0))&&(u5.p66==0))&&(i6.u13.p132==0))&&(i4.u11.p117==0))&&(u8.p86==0))&&(i4.u9.p107==0))&&(u6.p76==0))&&(i1.u7.p79==0)) + EG((((((((((i4.u9.p115==1)&&(i6.u12.p149==1))||(u8.p87==1))||(i0.u3.p55==1))||((i0.u1.p17==1)&&(i6.u12.p158==1)))||((u8.p88==1)&&(i6.u12.p158==1)))||(u6.p76==1))||(i0.u3.p46==1))||(i4.u10.p109==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((((((((((i1.u7.p81==0)||(i6.u12.p158==0))&&(i6.u13.p160==0))&&(u5.p66==0))&&(i6.u13.p132==0))&&(i4.u11.p117==0))&&(u8.p86==0))&&(i4.u9.p107==0))&&(u6.p76==0))&&(i1.u7.p79==0)) + EG((((((((((i4.u9.p115==1)&&(i6.u12.p149==1))||(u8.p87==1))||(i0.u3.p55==1))||((i0.u1.p17==1)&&(i6.u12.p158==1)))||((u8.p88==1)&&(i6.u12.p158==1)))||(u6.p76==1))||(i0.u3.p46==1))||(i4.u10.p109==1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t55, t62, t63, t70, t71, t77, t91, t97, t107, t111, t118, t120, u6.t41, u6.t42, u8.t31, u8.t32, u8.t33, u8.t34, u8.t35, u8.t36, u5.t43, u5.t44, i0.u3.t46, i0.u3.t47, i1.u7.t37, i1.u7.t38, i1.u7.t39, i1.u7.t40, i4.t29, i4.t25, i4.t23, i4.u9.t28, i4.u9.t30, i4.u11.t22, i4.u11.t24, i6.t109, i6.t92, i6.t19, i6.t16, i6.t12, i6.t11, i6.t7, i6.t2, i6.t1, i6.u12.t18, i6.u13.t0, i6.u13.t3, i6.u13.t4, i6.u13.t6, i6.u13.t8, i6.u13.t9, i6.u13.t10, i6.u13.t13, i6.u13.t14, i6.u13.t20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/39/55/94
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,0.713519,23952,1,0,27275,3881,1512,86073,501,15820,58257
FORMULA HealthRecord-PT-13-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Graph (trivial) has 198 edges and 159 vertex of which 6 / 159 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 86 places :
Symmetric choice reduction at 0 with 86 rule applications. Total rules 87 place count 70 transition count 143
Iterating global reduction 0 with 86 rules applied. Total rules applied 173 place count 70 transition count 143
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 184 place count 59 transition count 121
Iterating global reduction 0 with 11 rules applied. Total rules applied 195 place count 59 transition count 121
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 204 place count 59 transition count 112
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 207 place count 56 transition count 103
Iterating global reduction 1 with 3 rules applied. Total rules applied 210 place count 56 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 213 place count 53 transition count 97
Iterating global reduction 1 with 3 rules applied. Total rules applied 216 place count 53 transition count 97
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 225 place count 53 transition count 88
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 231 place count 50 transition count 85
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 241 place count 45 transition count 111
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 243 place count 45 transition count 109
Applied a total of 243 rules in 25 ms. Remains 45 /159 variables (removed 114) and now considering 109/311 (removed 202) transitions.
[2021-05-17 20:14:06] [INFO ] Flatten gal took : 6 ms
[2021-05-17 20:14:06] [INFO ] Flatten gal took : 6 ms
[2021-05-17 20:14:06] [INFO ] Input system was already deterministic with 109 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
FORMULA HealthRecord-PT-13-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2021-05-17 20:14:06] [INFO ] Flatten gal took : 15 ms
[2021-05-17 20:14:06] [INFO ] Flatten gal took : 15 ms
[2021-05-17 20:14:06] [INFO ] Applying decomposition
[2021-05-17 20:14:06] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4801280214946810234.txt, -o, /tmp/graph4801280214946810234.bin, -w, /tmp/graph4801280214946810234.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4801280214946810234.bin, -l, -1, -v, -w, /tmp/graph4801280214946810234.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:14:06] [INFO ] Decomposing Gal with order
[2021-05-17 20:14:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:14:06] [INFO ] Removed a total of 51 redundant transitions.
[2021-05-17 20:14:06] [INFO ] Flatten gal took : 26 ms
[2021-05-17 20:14:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2021-05-17 20:14:06] [INFO ] Time to serialize gal into /tmp/CTLFireability5349454908480550994.gal : 2 ms
[2021-05-17 20:14:06] [INFO ] Time to serialize properties into /tmp/CTLFireability3006224297708034955.ctl : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability5349454908480550994.gal, -t, CGAL, -ctl, /tmp/CTLFireability3006224297708034955.ctl], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /tmp/CTLFireability5349454908480550994.gal -t CGAL -ctl /tmp/CTLFireability3006224297708034955.ctl
No direction supplied, using forward translation only.
Parsed 11 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.86596e+09,16.1859,383172,2042,2369,540746,64821,363,1.28724e+06,349,1.53344e+06,0


Converting to forward existential form...Done !
original formula: EF(!(E(EX((((((((((i8.u11.p114==1)||(u8.p85==1))||(i8.u9.p103==1))||(u2.p42==1))||(u13.p153==1))||(u13.p142==1))||(u2.p44==1))||(u13.p143==1))||(i8.u10.p109==1))) U ((((u7.p81==1)&&(u13.p158==1)) + !(EG((((((((u5.p64==1)||(u0.p5==1))||(u1.p25==1))||(u13.p139==1))||((u2.p55==1)&&(u13.p158==1)))||(u13.p126==1))||(u7.p79==1))))) + (!(E((((((((((u2.p49==1)||(u1.p36==1))||(u13.p119==1))||((u5.p67==1)&&(u13.p158==1)))||(u2.p43==1))||(u1.p27==1))||(u13.p121==1))||(i8.u9.p108==1))||(i8.u9.p95==1)) U (((((((i8.u11.p114==1)||(u0.p17==1))||(u0.p8==1))||(i8.u9.p104==1))||(u6.p72==1))||(u0.p10==1))||(u0.p15==1)))) * !(E((((((((((u13.p147==1)||(u0.p5==1))||(u13.p135==1))||(i8.u9.p100==1))||(u1.p22==1))||(u13.p139==1))||(i8.u10.p111==1))||(u13.p143==1))||(u13.p156==1)) U ((((i8.u9.p106==1)||(i8.u9.p107==1))||(u1.p27==1))||(u13.p141==1)))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(EX((((((((((i8.u11.p114==1)||(u8.p85==1))||(i8.u9.p103==1))||(u2.p42==1))||(u13.p153==1))||(u13.p142==1))||(u2.p44==1))||(u13.p143==1))||(i8.u10.p109==1))) U ((((u7.p81==1)&&(u13.p158==1)) + !(EG((((((((u5.p64==1)||(u0.p5==1))||(u1.p25==1))||(u13.p139==1))||((u2.p55==1)&&(u13.p158==1)))||(u13.p126==1))||(u7.p79==1))))) + (!(E((((((((((u2.p49==1)||(u1.p36==1))||(u13.p119==1))||((u5.p67==1)&&(u13.p158==1)))||(u2.p43==1))||(u1.p27==1))||(u13.p121==1))||(i8.u9.p108==1))||(i8.u9.p95==1)) U (((((((i8.u11.p114==1)||(u0.p17==1))||(u0.p8==1))||(i8.u9.p104==1))||(u6.p72==1))||(u0.p10==1))||(u0.p15==1)))) * !(E((((((((((u13.p147==1)||(u0.p5==1))||(u13.p135==1))||(i8.u9.p100==1))||(u1.p22==1))||(u13.p139==1))||(i8.u10.p111==1))||(u13.p143==1))||(u13.p156==1)) U ((((i8.u9.p106==1)||(i8.u9.p107==1))||(u1.p27==1))||(u13.p141==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, u0.t202, u0.t203, u0.t204, u0.t205, u0.t206, u0.t207, u0.t208, u0.t209, u0.t210, u0.t211, u0.t212, u0.t213, u0.t214, u0.t215, u0.t216, u0.t217, u0.t218, u0.t219, u0.t220, u0.t221, u0.t222, u0.t223, u0.t224, u0.t225, u0.t226, u0.t227, u0.t228, u0.t229, u0.t230, u0.t232, u1.t171, u1.t172, u1.t173, u1.t174, u1.t175, u1.t176, u1.t177, u1.t178, u1.t179, u1.t180, u1.t181, u1.t182, u1.t183, u1.t184, u1.t185, u1.t186, u1.t187, u1.t188, u1.t189, u1.t190, u1.t191, u1.t192, u1.t193, u1.t194, u1.t195, u1.t196, u1.t197, u1.t198, u1.t199, u1.t201, u2.t140, u2.t141, u2.t142, u2.t143, u2.t144, u2.t145, u2.t146, u2.t147, u2.t148, u2.t149, u2.t150, u2.t151, u2.t152, u2.t153, u2.t154, u2.t155, u2.t156, u2.t157, u2.t158, u2.t159, u2.t160, u2.t161, u2.t162, u2.t163, u2.t164, u2.t165, u2.t166, u2.t167, u2.t168, u2.t170, u5.t128, u5.t129, u5.t130, u5.t131, u5.t132, u5.t133, u5.t134, u5.t135, u6.t120, u6.t121, u6.t122, u6.t123, u6.t124, u6.t125, u6.t126, u6.t127, u7.t112, u7.t113, u7.t114, u7.t115, u7.t116, u7.t117, u7.t118, u7.t119, u8.t104, u8.t105, u8.t106, u8.t107, u8.t108, u8.t109, u8.t110, u8.t111, u13.t1, u13.t2, u13.t3, u13.t4, u13.t5, u13.t6, u13.t7, u13.t8, u13.t9, u13.t14, u13.t15, u13.t16, u13.t17, u13.t18, u13.t19, u13.t20, u13.t21, u13.t22, u13.t23, u13.t24, u13.t25, u13.t26, u13.t27, u13.t28, u13.t29, u13.t30, u13.t31, u13.t32, u13.t33, u13.t34, u13.t35, u13.t36, u13.t37, u13.t38, u13.t39, u13.t40, u13.t41, u13.t42, u13.t43, u13.t44, u13.t45, u13.t46, u13.t47, u13.t48, u13.t49, u13.t50, u13.t51, u13.t52, u13.t53, u13.t54, u13.t55, u13.t56, u13.t57, u13.t58, u13.t59, i8.t66, i8.t64, i8.u9.t60, i8.u9.t61, i8.u9.t70, i8.u9.t71, i8.u9.t72, i8.u9.t73, i8.u9.t74, i8.u9.t75, i8.u9.t76, i8.u9.t77, i8.u9.t78, i8.u9.t79, i8.u9.t80, i8.u9.t81, i8.u9.t82, i8.u9.t83, i8.u9.t84, i8.u9.t85, i8.u9.t86, i8.u9.t87, i8.u9.t88, i8.u9.t89, i8.u9.t90, i8.u9.t91, i8.u9.t92, i8.u9.t93, i8.u9.t94, i8.u9.t95, i8.u9.t96, i8.u9.t97, i8.u9.t98, i8.u9.t99, i8.u9.t100, i8.u9.t101, i8.u9.t102, i8.u9.t103, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/90/216/306
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,1,24.9946,383172,1,0,591727,78698,2502,1.28724e+06,1974,1.53344e+06,674454
FORMULA HealthRecord-PT-13-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX((!(AF(((((((u0.p8==1)||(u13.p137==1))||(i8.u9.p93==1))||(u1.p28==1)) + E(((((u8.p85==1)||(u0.p6==1))||(u8.p87==1))||((u2.p55==1)&&(u13.p158==1))) U (((((i8.u9.p96==1)||(u0.p6==1))||(u13.p137==1))||(u13.p143==1))||(u0.p13==1)))) + (((i3.u4.p2==1)||(u1.p26==1))&&((((((((((((((((u0.p18==1)&&(u1.p37==1))&&(u2.p56==1))&&(i3.u4.p61==1))&&(u5.p68==1))&&(u6.p75==1))&&(u7.p82==1))&&(u8.p89==1))&&(i8.u9.p115==1))&&(u13.p159==1))||(i3.u4.p2==1))||(u13.p134==1))||(i8.u9.p104==1))||(i3.u4.p58==1))||(u0.p11==1))||(i3.u3.p60==1)))))) * !(EF((!(EF(((((u1.p32==1)||(u2.p50==1))||(u7.p79==1))||(u2.p46==1)))) * !(AX(((((((((((u5.p65==1)||((u1.p36==1)&&(u13.p158==1)))||(i8.u9.p99==1))||(i8.u9.p117==1))||(u13.p154==1))||(u6.p73==1))||(u0.p9==1))||(u1.p27==1))||(u13.p121==1))||(u13.p127==1)))))))))
=> equivalent forward existential formula: [((EY(Init) * !(!(EG(!(((((((u0.p8==1)||(u13.p137==1))||(i8.u9.p93==1))||(u1.p28==1)) + E(((((u8.p85==1)||(u0.p6==1))||(u8.p87==1))||((u2.p55==1)&&(u13.p158==1))) U (((((i8.u9.p96==1)||(u0.p6==1))||(u13.p137==1))||(u13.p143==1))||(u0.p13==1)))) + (((i3.u4.p2==1)||(u1.p26==1))&&((((((((((((((((u0.p18==1)&&(u1.p37==1))&&(u2.p56==1))&&(i3.u4.p61==1))&&(u5.p68==1))&&(u6.p75==1))&&(u7.p82==1))&&(u8.p89==1))&&(i8.u9.p115==1))&&(u13.p159==1))||(i3.u4.p2==1))||(u13.p134==1))||(i8.u9.p104==1))||(i3.u4.p58==1))||(u0.p11==1))||(i3.u3.p60==1))))))))) * !(E(TRUE U (!(E(TRUE U ((((u1.p32==1)||(u2.p50==1))||(u7.p79==1))||(u2.p46==1)))) * !(!(EX(!(((((((((((u5.p65==1)||((u1.p36==1)&&(u13.p158==1)))||(i8.u9.p99==1))||(i8.u9.p117==1))||(u13.p154==1))||(u6.p73==1))||(u0.p9==1))||(u1.p27==1))||(u13.p121==1))||(u13.p127==1))))))))))] != FALSE
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 1,0,36.9755,724948,1,0,1.22835e+06,104440,2683,2.64263e+06,2024,1.53344e+06,1016761
FORMULA HealthRecord-PT-13-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX((A(AG(((((((((((u13.p130==1)||(u2.p51==1))||(u1.p36==1))||(u13.p135==1))||(u13.p148==1))||(u0.p6==1))||(u2.p41==1))||((u8.p88==1)&&(u13.p158==1)))||(u0.p11==1))||(i8.u10.p109==1))) U (((((((((((u0.p19==1)||(i3.u4.p118==1))||(u0.p5==1))||(u0.p6==1))||(u1.p24==1))||(u6.p72==1))||(u0.p9==1))||(u12.p152==1))||(u1.p30==1))||(i3.u4.p62==1)) * ((((((((((u13.p129==1)||(u1.p36==1))||(u13.p133==1))||((u2.p39==1)&&(u13.p158==1)))||(u2.p45==1))||(u13.p143==1))||((u8.p88==1)&&(u13.p158==1)))||(i8.u9.p104==1)) + E((((((u0.p16==1)||(u7.p83==1))||(u13.p144==1))||(i3.u4.p70==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p129==1))) U ((u2.p55==1)&&(u13.p158==1)))) + (u2.p51==1)))) + AF((AG((((((u5.p65==1)||(u1.p35==1))||((i8.u9.p115==1)&&(u13.p140==1)))||(u13.p119==1))&&(((u2.p51==1)||((((((((((u0.p18==1)&&(u1.p37==1))&&(u2.p56==1))&&(i3.u4.p61==1))&&(u5.p68==1))&&(u6.p75==1))&&(u7.p82==1))&&(u8.p89==1))&&(i8.u9.p116==1))&&(u13.p153==1)))||(u6.p72==1)))) * ((((((u0.p16==1)||(u13.p130==1))||(u13.p131==1))||((u0.p17==1)&&(u13.p158==1)))||(i8.u10.p110==1))||(u2.p47==1))))))
=> equivalent forward existential formula: [FwdG((EY(Init) * !(!((E(!((((((((((((u0.p19==1)||(i3.u4.p118==1))||(u0.p5==1))||(u0.p6==1))||(u1.p24==1))||(u6.p72==1))||(u0.p9==1))||(u12.p152==1))||(u1.p30==1))||(i3.u4.p62==1)) * ((((((((((u13.p129==1)||(u1.p36==1))||(u13.p133==1))||((u2.p39==1)&&(u13.p158==1)))||(u2.p45==1))||(u13.p143==1))||((u8.p88==1)&&(u13.p158==1)))||(i8.u9.p104==1)) + E((((((u0.p16==1)||(u7.p83==1))||(u13.p144==1))||(i3.u4.p70==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p129==1))) U ((u2.p55==1)&&(u13.p158==1)))) + (u2.p51==1)))) U (!(!(E(TRUE U !(((((((((((u13.p130==1)||(u2.p51==1))||(u1.p36==1))||(u13.p135==1))||(u13.p148==1))||(u0.p6==1))||(u2.p41==1))||((u8.p88==1)&&(u13.p158==1)))||(u0.p11==1))||(i8.u10.p109==1)))))) * !((((((((((((u0.p19==1)||(i3.u4.p118==1))||(u0.p5==1))||(u0.p6==1))||(u1.p24==1))||(u6.p72==1))||(u0.p9==1))||(u12.p152==1))||(u1.p30==1))||(i3.u4.p62==1)) * ((((((((((u13.p129==1)||(u1.p36==1))||(u13.p133==1))||((u2.p39==1)&&(u13.p158==1)))||(u2.p45==1))||(u13.p143==1))||((u8.p88==1)&&(u13.p158==1)))||(i8.u9.p104==1)) + E((((((u0.p16==1)||(u7.p83==1))||(u13.p144==1))||(i3.u4.p70==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p129==1))) U ((u2.p55==1)&&(u13.p158==1)))) + (u2.p51==1)))))) + EG(!((((((((((((u0.p19==1)||(i3.u4.p118==1))||(u0.p5==1))||(u0.p6==1))||(u1.p24==1))||(u6.p72==1))||(u0.p9==1))||(u12.p152==1))||(u1.p30==1))||(i3.u4.p62==1)) * ((((((((((u13.p129==1)||(u1.p36==1))||(u13.p133==1))||((u2.p39==1)&&(u13.p158==1)))||(u2.p45==1))||(u13.p143==1))||((u8.p88==1)&&(u13.p158==1)))||(i8.u9.p104==1)) + E((((((u0.p16==1)||(u7.p83==1))||(u13.p144==1))||(i3.u4.p70==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p129==1))) U ((u2.p55==1)&&(u13.p158==1)))) + (u2.p51==1))))))))),!((!(E(TRUE U !((((((u5.p65==1)||(u1.p35==1))||((i8.u9.p115==1)&&(u13.p140==1)))||(u13.p119==1))&&(((u2.p51==1)||((((((((((u0.p18==1)&&(u1.p37==1))&&(u2.p56==1))&&(i3.u4.p61==1))&&(u5.p68==1))&&(u6.p75==1))&&(u7.p82==1))&&(u8.p89==1))&&(i8.u9.p116==1))&&(u13.p153==1)))||(u6.p72==1)))))) * ((((((u0.p16==1)||(u13.p130==1))||(u13.p131==1))||((u0.p17==1)&&(u13.p158==1)))||(i8.u10.p110==1))||(u2.p47==1)))))] = FALSE
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 2,1,51.5606,1112680,1,0,1.92546e+06,116490,2840,4.08006e+06,2041,1.53344e+06,1373693
FORMULA HealthRecord-PT-13-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E(E(EG(((((((u7.p80==1)||(u5.p66==1))||(u2.p50==1))||(i3.u4.p84==1))||(u13.p157==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p141==1)))) U A(AG((((((((((u13.p131==1)||(u13.p147==1))||(u13.p160==1))||(u2.p50==1))||(u12.p152==1))||(i8.u9.p92==1))||(u13.p125==1))||((u0.p1==1)&&(u13.p158==1)))||((u2.p55==1)&&(u13.p158==1)))) U (((((u0.p3==0)&&(u5.p66==0))&&(u1.p26==0))&&(i8.u9.p108==0))&&((u2.p55==0)||(u13.p158==0))))) U AX(A((((((((((u5.p65==1)||(u2.p50==1))||(i8.u9.p106==1))||(u2.p41==1))||(u6.p72==1))||(u13.p127==1))||(u2.p47==1))||((u2.p39==1)&&(u13.p158==1)))&&((((((((((((((((((((((((u7.p83==1)||(i8.u9.p100==1))||(u0.p8==1))||(u2.p41==1))||(u0.p13==1))||(u2.p47==1))||(u1.p32==1))||(u0.p19==1))||(u0.p7==1))||(u2.p43==1))||(u12.p152==1))||(u13.p125==1))||(u5.p65==1))||(u2.p52==1))||(u2.p57==1))||(u1.p26==1))||(u13.p120==1))||(i8.u9.p92==1))||(u2.p44==1))||(u0.p15==1))||((u1.p20==1)&&(u13.p158==1)))||((i8.u9.p115==1)&&(u13.p124==1)))||((u1.p36==1)&&(u13.p158==1)))||((u5.p67==1)&&(u13.p158==1)))) U ((((i3.u3.p59==1)||(u13.p121==1))||(u7.p79==1))||((i8.u9.p115==1)&&(u13.p130==1))))))
=> equivalent forward existential formula: [(FwdU(Init,E(EG(((((((u7.p80==1)||(u5.p66==1))||(u2.p50==1))||(i3.u4.p84==1))||(u13.p157==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p141==1)))) U !((E(!((((((u0.p3==0)&&(u5.p66==0))&&(u1.p26==0))&&(i8.u9.p108==0))&&((u2.p55==0)||(u13.p158==0)))) U (!(!(E(TRUE U !((((((((((u13.p131==1)||(u13.p147==1))||(u13.p160==1))||(u2.p50==1))||(u12.p152==1))||(i8.u9.p92==1))||(u13.p125==1))||((u0.p1==1)&&(u13.p158==1)))||((u2.p55==1)&&(u13.p158==1))))))) * !((((((u0.p3==0)&&(u5.p66==0))&&(u1.p26==0))&&(i8.u9.p108==0))&&((u2.p55==0)||(u13.p158==0)))))) + EG(!((((((u0.p3==0)&&(u5.p66==0))&&(u1.p26==0))&&(i8.u9.p108==0))&&((u2.p55==0)||(u13.p158==0))))))))) * !(EX(!(!((E(!(((((i3.u3.p59==1)||(u13.p121==1))||(u7.p79==1))||((i8.u9.p115==1)&&(u13.p130==1)))) U (!((((((((((u5.p65==1)||(u2.p50==1))||(i8.u9.p106==1))||(u2.p41==1))||(u6.p72==1))||(u13.p127==1))||(u2.p47==1))||((u2.p39==1)&&(u13.p158==1)))&&((((((((((((((((((((((((u7.p83==1)||(i8.u9.p100==1))||(u0.p8==1))||(u2.p41==1))||(u0.p13==1))||(u2.p47==1))||(u1.p32==1))||(u0.p19==1))||(u0.p7==1))||(u2.p43==1))||(u12.p152==1))||(u13.p125==1))||(u5.p65==1))||(u2.p52==1))||(u2.p57==1))||(u1.p26==1))||(u13.p120==1))||(i8.u9.p92==1))||(u2.p44==1))||(u0.p15==1))||((u1.p20==1)&&(u13.p158==1)))||((i8.u9.p115==1)&&(u13.p124==1)))||((u1.p36==1)&&(u13.p158==1)))||((u5.p67==1)&&(u13.p158==1))))) * !(((((i3.u3.p59==1)||(u13.p121==1))||(u7.p79==1))||((i8.u9.p115==1)&&(u13.p130==1)))))) + EG(!(((((i3.u3.p59==1)||(u13.p121==1))||(u7.p79==1))||((i8.u9.p115==1)&&(u13.p130==1)))))))))))] != FALSE
(forward)formula 3,1,150.167,2198776,1,0,4.03189e+06,150098,798,7.64307e+06,869,2.60773e+06,1331967
FORMULA HealthRecord-PT-13-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (!(E(EG(E((((((((((u2.p51==0)&&((u6.p74==0)||(u13.p158==0)))&&(i8.u9.p101==0))&&(u1.p23==0))&&(u13.p149==0))&&(u1.p27==0))&&(u2.p44==0))&&(u2.p46==0))&&(u1.p31==0)) U (((((((((u7.p80==1)||(u1.p33==1))||(u13.p128==1))||(u1.p36==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p133==1)))||(i8.u9.p104==1))||(i3.u3.p59==1))||(i8.u9.p105==1))||(u1.p30==1)))) U (((((((((u0.p16==1)||(u0.p17==1))||(u1.p34==1))||(u1.p35==1))||((i8.u9.p115==1)&&(u13.p122==1)))||(i8.u9.p107==1))||(u13.p121==1))||(u1.p27==1))||(u0.p13==1)))) * EX(EX(((((((((((u5.p65==1)||(i3.u4.p2==1))||(u7.p83==1))||(u0.p19==1))||(u2.p54==1))||(u0.p7==1))||(i8.u9.p106==1))||(u1.p27==1))||(i8.u10.p109==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p158==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,EG(E((((((((((u2.p51==0)&&((u6.p74==0)||(u13.p158==0)))&&(i8.u9.p101==0))&&(u1.p23==0))&&(u13.p149==0))&&(u1.p27==0))&&(u2.p44==0))&&(u2.p46==0))&&(u1.p31==0)) U (((((((((u7.p80==1)||(u1.p33==1))||(u13.p128==1))||(u1.p36==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p133==1)))||(i8.u9.p104==1))||(i3.u3.p59==1))||(i8.u9.p105==1))||(u1.p30==1))))) * (((((((((u0.p16==1)||(u0.p17==1))||(u1.p34==1))||(u1.p35==1))||((i8.u9.p115==1)&&(u13.p122==1)))||(i8.u9.p107==1))||(u13.p121==1))||(u1.p27==1))||(u0.p13==1)))] = FALSE * [(Init * !(EX(EX(((((((((((u5.p65==1)||(i3.u4.p2==1))||(u7.p83==1))||(u0.p19==1))||(u2.p54==1))||(u0.p7==1))||(i8.u9.p106==1))||(u1.p27==1))||(i8.u10.p109==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p158==1)))))))] = FALSE)
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 4,0,326.175,2676280,1,0,4.32202e+06,150098,814,9.0254e+06,877,3.05346e+06,680780
FORMULA HealthRecord-PT-13-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(((E(((((((((i8.u9.p96==1)||((i8.u9.p115==1)&&(u13.p124==1)))||(u1.p22==1))||((u0.p17==1)&&(u13.p158==1)))||(u6.p73==1))||(i3.u3.p59==1))||(u8.p90==1))||(i8.u10.p109==1)) U EF((((((u2.p48==1)||(u0.p8==1))||(i3.u4.p77==1))||(u13.p143==1))||((i8.u9.p115==1)&&(u13.p130==1))))) * EG(((i3.u4.p84==0)&&(u1.p38==0)))) * (EG(EF(((((((((i8.u9.p115==1)&&(u13.p120==1))||(u13.p135==1))||(u0.p7==1))||(u2.p41==1))||(u2.p47==1))||(u0.p14==1))||(u1.p31==1)))) + (A((((((u2.p49==1)||(u0.p19==1))||((u2.p55==1)&&(u13.p158==1)))&&(((((((((u1.p33==1)||(u13.p131==1))||(u5.p64==1))||(i3.u4.p2==1))||((u7.p81==1)&&(u13.p158==1)))||((u5.p67==1)&&(u13.p158==1)))||(u2.p57==1))||(u6.p76==1))||(u0.p15==1)))&&(((((((u1.p36==1)&&(u13.p158==1))||((i8.u9.p115==1)&&(u13.p124==1)))||((u5.p67==1)&&(u13.p158==1)))||(u1.p25==1))||(u6.p72==1))||((u0.p1==1)&&(u13.p158==1)))) U (((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))) * (((((((((((EF(((((u1.p20==1)&&(u13.p158==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p148==1)))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p129==1)))) + (u1.p26==1)) + (u13.p143==1)) + (u0.p16==1)) + (u8.p85==1)) + (u5.p69==1)) + (u1.p23==1)) + (u13.p122==1)) + (u13.p154==1)) + (u1.p28==1)) + (u2.p47==1)) + ((u1.p36==1)&&(u13.p158==1)))))))
=> equivalent forward existential formula: ([FwdG((EY(Init) * (E(((((((((i8.u9.p96==1)||((i8.u9.p115==1)&&(u13.p124==1)))||(u1.p22==1))||((u0.p17==1)&&(u13.p158==1)))||(u6.p73==1))||(i3.u3.p59==1))||(u8.p90==1))||(i8.u10.p109==1)) U E(TRUE U (((((u2.p48==1)||(u0.p8==1))||(i3.u4.p77==1))||(u13.p143==1))||((i8.u9.p115==1)&&(u13.p130==1))))) * EG(((i3.u4.p84==0)&&(u1.p38==0))))),E(TRUE U ((((((((i8.u9.p115==1)&&(u13.p120==1))||(u13.p135==1))||(u0.p7==1))||(u2.p41==1))||(u2.p47==1))||(u0.p14==1))||(u1.p31==1))))] != FALSE + ((((((((((([(FwdU(((EY(Init) * (E(((((((((i8.u9.p96==1)||((i8.u9.p115==1)&&(u13.p124==1)))||(u1.p22==1))||((u0.p17==1)&&(u13.p158==1)))||(u6.p73==1))||(i3.u3.p59==1))||(u8.p90==1))||(i8.u10.p109==1)) U E(TRUE U (((((u2.p48==1)||(u0.p8==1))||(i3.u4.p77==1))||(u13.p143==1))||((i8.u9.p115==1)&&(u13.p130==1))))) * EG(((i3.u4.p84==0)&&(u1.p38==0))))) * !((E(!((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))) U (!((((((u2.p49==1)||(u0.p19==1))||((u2.p55==1)&&(u13.p158==1)))&&(((((((((u1.p33==1)||(u13.p131==1))||(u5.p64==1))||(i3.u4.p2==1))||((u7.p81==1)&&(u13.p158==1)))||((u5.p67==1)&&(u13.p158==1)))||(u2.p57==1))||(u6.p76==1))||(u0.p15==1)))&&(((((((u1.p36==1)&&(u13.p158==1))||((i8.u9.p115==1)&&(u13.p124==1)))||((u5.p67==1)&&(u13.p158==1)))||(u1.p25==1))||(u6.p72==1))||((u0.p1==1)&&(u13.p158==1))))) * !((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))))) + EG(!((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))))))),TRUE) * ((((u1.p20==1)&&(u13.p158==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p148==1)))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p129==1))))] != FALSE + [(((EY(Init) * (E(((((((((i8.u9.p96==1)||((i8.u9.p115==1)&&(u13.p124==1)))||(u1.p22==1))||((u0.p17==1)&&(u13.p158==1)))||(u6.p73==1))||(i3.u3.p59==1))||(u8.p90==1))||(i8.u10.p109==1)) U E(TRUE U (((((u2.p48==1)||(u0.p8==1))||(i3.u4.p77==1))||(u13.p143==1))||((i8.u9.p115==1)&&(u13.p130==1))))) * EG(((i3.u4.p84==0)&&(u1.p38==0))))) * !((E(!((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))) U (!((((((u2.p49==1)||(u0.p19==1))||((u2.p55==1)&&(u13.p158==1)))&&(((((((((u1.p33==1)||(u13.p131==1))||(u5.p64==1))||(i3.u4.p2==1))||((u7.p81==1)&&(u13.p158==1)))||((u5.p67==1)&&(u13.p158==1)))||(u2.p57==1))||(u6.p76==1))||(u0.p15==1)))&&(((((((u1.p36==1)&&(u13.p158==1))||((i8.u9.p115==1)&&(u13.p124==1)))||((u5.p67==1)&&(u13.p158==1)))||(u1.p25==1))||(u6.p72==1))||((u0.p1==1)&&(u13.p158==1))))) * !((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))))) + EG(!((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))))))) * (u1.p26==1))] != FALSE) + [(((EY(Init) * (E(((((((((i8.u9.p96==1)||((i8.u9.p115==1)&&(u13.p124==1)))||(u1.p22==1))||((u0.p17==1)&&(u13.p158==1)))||(u6.p73==1))||(i3.u3.p59==1))||(u8.p90==1))||(i8.u10.p109==1)) U E(TRUE U (((((u2.p48==1)||(u0.p8==1))||(i3.u4.p77==1))||(u13.p143==1))||((i8.u9.p115==1)&&(u13.p130==1))))) * EG(((i3.u4.p84==0)&&(u1.p38==0))))) * !((E(!((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))) U (!((((((u2.p49==1)||(u0.p19==1))||((u2.p55==1)&&(u13.p158==1)))&&(((((((((u1.p33==1)||(u13.p131==1))||(u5.p64==1))||(i3.u4.p2==1))||((u7.p81==1)&&(u13.p158==1)))||((u5.p67==1)&&(u13.p158==1)))||(u2.p57==1))||(u6.p76==1))||(u0.p15==1)))&&(((((((u1.p36==1)&&(u13.p158==1))||((i8.u9.p115==1)&&(u13.p124==1)))||((u5.p67==1)&&(u13.p158==1)))||(u1.p25==1))||(u6.p72==1))||((u0.p1==1)&&(u13.p158==1))))) * !((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))))) + EG(!((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))))))) * (u13.p143==1))] != FALSE) + [(((EY(Init) * (E(((((((((i8.u9.p96==1)||((i8.u9.p115==1)&&(u13.p124==1)))||(u1.p22==1))||((u0.p17==1)&&(u13.p158==1)))||(u6.p73==1))||(i3.u3.p59==1))||(u8.p90==1))||(i8.u10.p109==1)) U E(TRUE U (((((u2.p48==1)||(u0.p8==1))||(i3.u4.p77==1))||(u13.p143==1))||((i8.u9.p115==1)&&(u13.p130==1))))) * EG(((i3.u4.p84==0)&&(u1.p38==0))))) * !((E(!((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))) U (!((((((u2.p49==1)||(u0.p19==1))||((u2.p55==1)&&(u13.p158==1)))&&(((((((((u1.p33==1)||(u13.p131==1))||(u5.p64==1))||(i3.u4.p2==1))||((u7.p81==1)&&(u13.p158==1)))||((u5.p67==1)&&(u13.p158==1)))||(u2.p57==1))||(u6.p76==1))||(u0.p15==1)))&&(((((((u1.p36==1)&&(u13.p158==1))||((i8.u9.p115==1)&&(u13.p124==1)))||((u5.p67==1)&&(u13.p158==1)))||(u1.p25==1))||(u6.p72==1))||((u0.p1==1)&&(u13.p158==1))))) * !((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))))) + EG(!((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))))))) * (u0.p16==1))] != FALSE) + [(((EY(Init) * (E(((((((((i8.u9.p96==1)||((i8.u9.p115==1)&&(u13.p124==1)))||(u1.p22==1))||((u0.p17==1)&&(u13.p158==1)))||(u6.p73==1))||(i3.u3.p59==1))||(u8.p90==1))||(i8.u10.p109==1)) U E(TRUE U (((((u2.p48==1)||(u0.p8==1))||(i3.u4.p77==1))||(u13.p143==1))||((i8.u9.p115==1)&&(u13.p130==1))))) * EG(((i3.u4.p84==0)&&(u1.p38==0))))) * !((E(!((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))) U (!((((((u2.p49==1)||(u0.p19==1))||((u2.p55==1)&&(u13.p158==1)))&&(((((((((u1.p33==1)||(u13.p131==1))||(u5.p64==1))||(i3.u4.p2==1))||((u7.p81==1)&&(u13.p158==1)))||((u5.p67==1)&&(u13.p158==1)))||(u2.p57==1))||(u6.p76==1))||(u0.p15==1)))&&(((((((u1.p36==1)&&(u13.p158==1))||((i8.u9.p115==1)&&(u13.p124==1)))||((u5.p67==1)&&(u13.p158==1)))||(u1.p25==1))||(u6.p72==1))||((u0.p1==1)&&(u13.p158==1))))) * !((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))))) + EG(!((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))))))) * (u8.p85==1))] != FALSE) + [(((EY(Init) * (E(((((((((i8.u9.p96==1)||((i8.u9.p115==1)&&(u13.p124==1)))||(u1.p22==1))||((u0.p17==1)&&(u13.p158==1)))||(u6.p73==1))||(i3.u3.p59==1))||(u8.p90==1))||(i8.u10.p109==1)) U E(TRUE U (((((u2.p48==1)||(u0.p8==1))||(i3.u4.p77==1))||(u13.p143==1))||((i8.u9.p115==1)&&(u13.p130==1))))) * EG(((i3.u4.p84==0)&&(u1.p38==0))))) * !((E(!((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))) U (!((((((u2.p49==1)||(u0.p19==1))||((u2.p55==1)&&(u13.p158==1)))&&(((((((((u1.p33==1)||(u13.p131==1))||(u5.p64==1))||(i3.u4.p2==1))||((u7.p81==1)&&(u13.p158==1)))||((u5.p67==1)&&(u13.p158==1)))||(u2.p57==1))||(u6.p76==1))||(u0.p15==1)))&&(((((((u1.p36==1)&&(u13.p158==1))||((i8.u9.p115==1)&&(u13.p124==1)))||((u5.p67==1)&&(u13.p158==1)))||(u1.p25==1))||(u6.p72==1))||((u0.p1==1)&&(u13.p158==1))))) * !((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))))) + EG(!((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))))))) * (u5.p69==1))] != FALSE) + [(((EY(Init) * (E(((((((((i8.u9.p96==1)||((i8.u9.p115==1)&&(u13.p124==1)))||(u1.p22==1))||((u0.p17==1)&&(u13.p158==1)))||(u6.p73==1))||(i3.u3.p59==1))||(u8.p90==1))||(i8.u10.p109==1)) U E(TRUE U (((((u2.p48==1)||(u0.p8==1))||(i3.u4.p77==1))||(u13.p143==1))||((i8.u9.p115==1)&&(u13.p130==1))))) * EG(((i3.u4.p84==0)&&(u1.p38==0))))) * !((E(!((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))) U (!((((((u2.p49==1)||(u0.p19==1))||((u2.p55==1)&&(u13.p158==1)))&&(((((((((u1.p33==1)||(u13.p131==1))||(u5.p64==1))||(i3.u4.p2==1))||((u7.p81==1)&&(u13.p158==1)))||((u5.p67==1)&&(u13.p158==1)))||(u2.p57==1))||(u6.p76==1))||(u0.p15==1)))&&(((((((u1.p36==1)&&(u13.p158==1))||((i8.u9.p115==1)&&(u13.p124==1)))||((u5.p67==1)&&(u13.p158==1)))||(u1.p25==1))||(u6.p72==1))||((u0.p1==1)&&(u13.p158==1))))) * !((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))))) + EG(!((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))))))) * (u1.p23==1))] != FALSE) + [(((EY(Init) * (E(((((((((i8.u9.p96==1)||((i8.u9.p115==1)&&(u13.p124==1)))||(u1.p22==1))||((u0.p17==1)&&(u13.p158==1)))||(u6.p73==1))||(i3.u3.p59==1))||(u8.p90==1))||(i8.u10.p109==1)) U E(TRUE U (((((u2.p48==1)||(u0.p8==1))||(i3.u4.p77==1))||(u13.p143==1))||((i8.u9.p115==1)&&(u13.p130==1))))) * EG(((i3.u4.p84==0)&&(u1.p38==0))))) * !((E(!((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))) U (!((((((u2.p49==1)||(u0.p19==1))||((u2.p55==1)&&(u13.p158==1)))&&(((((((((u1.p33==1)||(u13.p131==1))||(u5.p64==1))||(i3.u4.p2==1))||((u7.p81==1)&&(u13.p158==1)))||((u5.p67==1)&&(u13.p158==1)))||(u2.p57==1))||(u6.p76==1))||(u0.p15==1)))&&(((((((u1.p36==1)&&(u13.p158==1))||((i8.u9.p115==1)&&(u13.p124==1)))||((u5.p67==1)&&(u13.p158==1)))||(u1.p25==1))||(u6.p72==1))||((u0.p1==1)&&(u13.p158==1))))) * !((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))))) + EG(!((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))))))) * (u13.p122==1))] != FALSE) + [(((EY(Init) * (E(((((((((i8.u9.p96==1)||((i8.u9.p115==1)&&(u13.p124==1)))||(u1.p22==1))||((u0.p17==1)&&(u13.p158==1)))||(u6.p73==1))||(i3.u3.p59==1))||(u8.p90==1))||(i8.u10.p109==1)) U E(TRUE U (((((u2.p48==1)||(u0.p8==1))||(i3.u4.p77==1))||(u13.p143==1))||((i8.u9.p115==1)&&(u13.p130==1))))) * EG(((i3.u4.p84==0)&&(u1.p38==0))))) * !((E(!((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))) U (!((((((u2.p49==1)||(u0.p19==1))||((u2.p55==1)&&(u13.p158==1)))&&(((((((((u1.p33==1)||(u13.p131==1))||(u5.p64==1))||(i3.u4.p2==1))||((u7.p81==1)&&(u13.p158==1)))||((u5.p67==1)&&(u13.p158==1)))||(u2.p57==1))||(u6.p76==1))||(u0.p15==1)))&&(((((((u1.p36==1)&&(u13.p158==1))||((i8.u9.p115==1)&&(u13.p124==1)))||((u5.p67==1)&&(u13.p158==1)))||(u1.p25==1))||(u6.p72==1))||((u0.p1==1)&&(u13.p158==1))))) * !((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))))) + EG(!((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))))))) * (u13.p154==1))] != FALSE) + [(((EY(Init) * (E(((((((((i8.u9.p96==1)||((i8.u9.p115==1)&&(u13.p124==1)))||(u1.p22==1))||((u0.p17==1)&&(u13.p158==1)))||(u6.p73==1))||(i3.u3.p59==1))||(u8.p90==1))||(i8.u10.p109==1)) U E(TRUE U (((((u2.p48==1)||(u0.p8==1))||(i3.u4.p77==1))||(u13.p143==1))||((i8.u9.p115==1)&&(u13.p130==1))))) * EG(((i3.u4.p84==0)&&(u1.p38==0))))) * !((E(!((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))) U (!((((((u2.p49==1)||(u0.p19==1))||((u2.p55==1)&&(u13.p158==1)))&&(((((((((u1.p33==1)||(u13.p131==1))||(u5.p64==1))||(i3.u4.p2==1))||((u7.p81==1)&&(u13.p158==1)))||((u5.p67==1)&&(u13.p158==1)))||(u2.p57==1))||(u6.p76==1))||(u0.p15==1)))&&(((((((u1.p36==1)&&(u13.p158==1))||((i8.u9.p115==1)&&(u13.p124==1)))||((u5.p67==1)&&(u13.p158==1)))||(u1.p25==1))||(u6.p72==1))||((u0.p1==1)&&(u13.p158==1))))) * !((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))))) + EG(!((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))))))) * (u1.p28==1))] != FALSE) + [(((EY(Init) * (E(((((((((i8.u9.p96==1)||((i8.u9.p115==1)&&(u13.p124==1)))||(u1.p22==1))||((u0.p17==1)&&(u13.p158==1)))||(u6.p73==1))||(i3.u3.p59==1))||(u8.p90==1))||(i8.u10.p109==1)) U E(TRUE U (((((u2.p48==1)||(u0.p8==1))||(i3.u4.p77==1))||(u13.p143==1))||((i8.u9.p115==1)&&(u13.p130==1))))) * EG(((i3.u4.p84==0)&&(u1.p38==0))))) * !((E(!((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))) U (!((((((u2.p49==1)||(u0.p19==1))||((u2.p55==1)&&(u13.p158==1)))&&(((((((((u1.p33==1)||(u13.p131==1))||(u5.p64==1))||(i3.u4.p2==1))||((u7.p81==1)&&(u13.p158==1)))||((u5.p67==1)&&(u13.p158==1)))||(u2.p57==1))||(u6.p76==1))||(u0.p15==1)))&&(((((((u1.p36==1)&&(u13.p158==1))||((i8.u9.p115==1)&&(u13.p124==1)))||((u5.p67==1)&&(u13.p158==1)))||(u1.p25==1))||(u6.p72==1))||((u0.p1==1)&&(u13.p158==1))))) * !((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))))) + EG(!((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))))))) * (u2.p47==1))] != FALSE) + [(((EY(Init) * (E(((((((((i8.u9.p96==1)||((i8.u9.p115==1)&&(u13.p124==1)))||(u1.p22==1))||((u0.p17==1)&&(u13.p158==1)))||(u6.p73==1))||(i3.u3.p59==1))||(u8.p90==1))||(i8.u10.p109==1)) U E(TRUE U (((((u2.p48==1)||(u0.p8==1))||(i3.u4.p77==1))||(u13.p143==1))||((i8.u9.p115==1)&&(u13.p130==1))))) * EG(((i3.u4.p84==0)&&(u1.p38==0))))) * !((E(!((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))) U (!((((((u2.p49==1)||(u0.p19==1))||((u2.p55==1)&&(u13.p158==1)))&&(((((((((u1.p33==1)||(u13.p131==1))||(u5.p64==1))||(i3.u4.p2==1))||((u7.p81==1)&&(u13.p158==1)))||((u5.p67==1)&&(u13.p158==1)))||(u2.p57==1))||(u6.p76==1))||(u0.p15==1)))&&(((((((u1.p36==1)&&(u13.p158==1))||((i8.u9.p115==1)&&(u13.p124==1)))||((u5.p67==1)&&(u13.p158==1)))||(u1.p25==1))||(u6.p72==1))||((u0.p1==1)&&(u13.p158==1))))) * !((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))))) + EG(!((((((u6.p74==1)&&(u13.p158==1))||(i8.u9.p102==1))||(u2.p44==1))||(u7.p79==1))))))) * ((u1.p36==1)&&(u13.p158==1)))] != FALSE))
(forward)formula 5,1,367.475,2678920,1,0,4.32202e+06,150098,1171,9.0254e+06,1028,4.02381e+06,1556615
FORMULA HealthRecord-PT-13-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (((!(AF(((i3.u4.p118==1)||(u0.p12==1)))) * !(EG(E(((u1.p32==1)||(u0.p15==1)) U (((((((((u2.p48==1)||(u2.p53==1))||((i8.u9.p115==1)&&(u13.p149==1)))||((i8.u9.p115==1)&&(u13.p124==1)))||(u5.p69==1))||((i8.u9.p115==1)&&(u13.p144==1)))||((u0.p17==1)&&(u13.p158==1)))||(u1.p25==1))||(i8.u9.p94==1)))))) * !(AX((u6.p71==1)))) * (!(EF((((((((u1.p36==1)&&(u13.p158==1))||(i8.u11.p112==1))||(u1.p36==1))||((u8.p88==1)&&(u13.p158==1)))||((i8.u9.p115==1)&&(u13.p130==1)))||(u7.p78==1)))) + E((((!(EG(A(((((u2.p49==1)||(u13.p133==1))||(u6.p73==1))||(u1.p25==1)) U ((((u0.p19==1)||(u1.p22==1))||(u6.p71==1))||(i3.u4.p62==1))))) * (u13.p133==0)) * (u0.p9==0)) * (u6.p72==0)) U EX((((((((u0.p3==1)||(u13.p133==1))||(u8.p86==1))||(u13.p123==1))||(i8.u9.p105==1))||(u1.p31==1)) + A((((((i8.u9.p115==1)&&(u13.p128==1))||(u0.p12==1))||(u13.p127==1))||(u7.p78==1)) U ((((u13.p135==1)||((u8.p88==1)&&(u13.p158==1)))||(u13.p136==1))||(i3.u4.p58==1))))))))
=> equivalent forward existential formula: ((([(Init * !(EG(!(((i3.u4.p118==1)||(u0.p12==1))))))] = FALSE * [FwdG(Init,E(((u1.p32==1)||(u0.p15==1)) U (((((((((u2.p48==1)||(u2.p53==1))||((i8.u9.p115==1)&&(u13.p149==1)))||((i8.u9.p115==1)&&(u13.p124==1)))||(u5.p69==1))||((i8.u9.p115==1)&&(u13.p144==1)))||((u0.p17==1)&&(u13.p158==1)))||(u1.p25==1))||(i8.u9.p94==1))))] = FALSE) * [(Init * !(EX(!((u6.p71==1)))))] = FALSE) * [(FwdU((Init * !(E((((!(EG(!((E(!(((((u0.p19==1)||(u1.p22==1))||(u6.p71==1))||(i3.u4.p62==1))) U (!(((((u2.p49==1)||(u13.p133==1))||(u6.p73==1))||(u1.p25==1))) * !(((((u0.p19==1)||(u1.p22==1))||(u6.p71==1))||(i3.u4.p62==1))))) + EG(!(((((u0.p19==1)||(u1.p22==1))||(u6.p71==1))||(i3.u4.p62==1)))))))) * (u13.p133==0)) * (u0.p9==0)) * (u6.p72==0)) U EX((((((((u0.p3==1)||(u13.p133==1))||(u8.p86==1))||(u13.p123==1))||(i8.u9.p105==1))||(u1.p31==1)) + !((E(!(((((u13.p135==1)||((u8.p88==1)&&(u13.p158==1)))||(u13.p136==1))||(i3.u4.p58==1))) U (!((((((i8.u9.p115==1)&&(u13.p128==1))||(u0.p12==1))||(u13.p127==1))||(u7.p78==1))) * !(((((u13.p135==1)||((u8.p88==1)&&(u13.p158==1)))||(u13.p136==1))||(i3.u4.p58==1))))) + EG(!(((((u13.p135==1)||((u8.p88==1)&&(u13.p158==1)))||(u13.p136==1))||(i3.u4.p58==1))))))))))),TRUE) * (((((((u1.p36==1)&&(u13.p158==1))||(i8.u11.p112==1))||(u1.p36==1))||((u8.p88==1)&&(u13.p158==1)))||((i8.u9.p115==1)&&(u13.p130==1)))||(u7.p78==1)))] = FALSE)
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 6,0,417.974,2959024,1,0,4.90887e+06,153651,1199,1.03183e+07,1054,4.2229e+06,353571
FORMULA HealthRecord-PT-13-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((EF(((((i8.u9.p100==1)||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p133==1)))||(u2.p43==1))||(u1.p27==1))) * (((A((((((((u7.p81==1)&&(u13.p158==1))||(u13.p135==1))||(u5.p65==1))||(u13.p127==1))||(i3.u4.p62==1))&&(((((u2.p49==1)||(u0.p7==1))||(u6.p73==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p129==1)))||(i3.u4.p77==1))) U (((((((((((((((((u2.p49==1)||((i8.u9.p115==1)&&(u13.p122==1)))||(u2.p54==1))||(u0.p11==1))||(u13.p137==1))||(u7.p78==1))||(u2.p48==1))||(i8.u11.p113==1))||(u13.p149==1))||((u0.p17==1)&&(u13.p158==1)))||(i8.u9.p104==1))||(u13.p139==1))||(u13.p136==1))||((i8.u9.p115==1)&&(u13.p132==1)))||(u13.p127==1))||(u13.p125==1)) * EX((((((((((u2.p48==1)||(u7.p83==1))||(i8.u9.p99==1))||(u2.p52==1))||((i8.u9.p115==1)&&(u13.p142==1)))||(u13.p137==1))||(u1.p28==1))||(u2.p44==1))||(u13.p141==1))))) + EF(((((((((i3.u4.p0==1)||((u1.p20==1)&&(u13.p158==1)))||(u5.p66==1))||(u8.p86==1))||(u13.p123==1))||((u2.p55==1)&&(u13.p158==1)))||(i3.u4.p77==1))||(i8.u10.p111==1)))) + !(AF(AX(((((((i8.u9.p99==1)||((((((((((u0.p18==1)&&(u1.p37==1))&&(u2.p56==1))&&(i3.u4.p61==1))&&(u5.p68==1))&&(u6.p75==1))&&(u7.p82==1))&&(u8.p89==1))&&(i8.u9.p116==1))&&(u13.p153==1)))||(u6.p72==1))||(u0.p9==1))||(u13.p120==1))||(u13.p127==1)))))) + !(EX(EF((((((u2.p51==1)||(u12.p150==1))||(u0.p7==1))||(u1.p25==1))||(u13.p137==1))))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U ((((i8.u9.p100==1)||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p133==1)))||(u2.p43==1))||(u1.p27==1))) * (((!((E(!((((((((((((((((((u2.p49==1)||((i8.u9.p115==1)&&(u13.p122==1)))||(u2.p54==1))||(u0.p11==1))||(u13.p137==1))||(u7.p78==1))||(u2.p48==1))||(i8.u11.p113==1))||(u13.p149==1))||((u0.p17==1)&&(u13.p158==1)))||(i8.u9.p104==1))||(u13.p139==1))||(u13.p136==1))||((i8.u9.p115==1)&&(u13.p132==1)))||(u13.p127==1))||(u13.p125==1)) * EX((((((((((u2.p48==1)||(u7.p83==1))||(i8.u9.p99==1))||(u2.p52==1))||((i8.u9.p115==1)&&(u13.p142==1)))||(u13.p137==1))||(u1.p28==1))||(u2.p44==1))||(u13.p141==1))))) U (!((((((((u7.p81==1)&&(u13.p158==1))||(u13.p135==1))||(u5.p65==1))||(u13.p127==1))||(i3.u4.p62==1))&&(((((u2.p49==1)||(u0.p7==1))||(u6.p73==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p129==1)))||(i3.u4.p77==1)))) * !((((((((((((((((((u2.p49==1)||((i8.u9.p115==1)&&(u13.p122==1)))||(u2.p54==1))||(u0.p11==1))||(u13.p137==1))||(u7.p78==1))||(u2.p48==1))||(i8.u11.p113==1))||(u13.p149==1))||((u0.p17==1)&&(u13.p158==1)))||(i8.u9.p104==1))||(u13.p139==1))||(u13.p136==1))||((i8.u9.p115==1)&&(u13.p132==1)))||(u13.p127==1))||(u13.p125==1)) * EX((((((((((u2.p48==1)||(u7.p83==1))||(i8.u9.p99==1))||(u2.p52==1))||((i8.u9.p115==1)&&(u13.p142==1)))||(u13.p137==1))||(u1.p28==1))||(u2.p44==1))||(u13.p141==1))))))) + EG(!((((((((((((((((((u2.p49==1)||((i8.u9.p115==1)&&(u13.p122==1)))||(u2.p54==1))||(u0.p11==1))||(u13.p137==1))||(u7.p78==1))||(u2.p48==1))||(i8.u11.p113==1))||(u13.p149==1))||((u0.p17==1)&&(u13.p158==1)))||(i8.u9.p104==1))||(u13.p139==1))||(u13.p136==1))||((i8.u9.p115==1)&&(u13.p132==1)))||(u13.p127==1))||(u13.p125==1)) * EX((((((((((u2.p48==1)||(u7.p83==1))||(i8.u9.p99==1))||(u2.p52==1))||((i8.u9.p115==1)&&(u13.p142==1)))||(u13.p137==1))||(u1.p28==1))||(u2.p44==1))||(u13.p141==1)))))))) + E(TRUE U ((((((((i3.u4.p0==1)||((u1.p20==1)&&(u13.p158==1)))||(u5.p66==1))||(u8.p86==1))||(u13.p123==1))||((u2.p55==1)&&(u13.p158==1)))||(i3.u4.p77==1))||(i8.u10.p111==1)))) + !(!(EG(!(!(EX(!(((((((i8.u9.p99==1)||((((((((((u0.p18==1)&&(u1.p37==1))&&(u2.p56==1))&&(i3.u4.p61==1))&&(u5.p68==1))&&(u6.p75==1))&&(u7.p82==1))&&(u8.p89==1))&&(i8.u9.p116==1))&&(u13.p153==1)))||(u6.p72==1))||(u0.p9==1))||(u13.p120==1))||(u13.p127==1)))))))))) + !(EX(E(TRUE U (((((u2.p51==1)||(u12.p150==1))||(u0.p7==1))||(u1.p25==1))||(u13.p137==1)))))))))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 7
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 3
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 7,1,429.345,2959024,1,0,4.90887e+06,153651,1543,1.03183e+07,1123,4.2229e+06,809287
FORMULA HealthRecord-PT-13-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (!(AX((((((((((((u1.p36==1)&&(u13.p158==1))||(i3.u4.p2==1))||(u0.p19==1))||(i3.u4.p118==1))||(i3.u4.p21==1))||(u0.p6==1))||(i8.u9.p102==1))||(i8.u9.p93==1))||(u0.p14==1)) + EF(((((((u1.p36==1)&&(u13.p158==1))||(i8.u9.p98==1))||(i8.u9.p92==1))||(u1.p30==1))||(u2.p46==1)))))) + E((EX((((((((AG(((((u2.p51==1)||(u13.p123==1))||(u13.p136==1))||(i8.u9.p93==1))) + (((u1.p35==1)||(u0.p9==1))&&(((((((((i8.u11.p114==1)||(u0.p3==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p148==1)))||(u13.p133==1))||((u0.p17==1)&&(u13.p158==1)))||(u13.p154==1))||((u2.p55==1)&&(u13.p158==1)))||(u13.p137==1))||(u0.p13==1)))) + (u2.p48==1)) + (i8.u11.p112==1)) + (i8.u9.p98==1)) + ((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p133==1))) + (u0.p8==1)) + (u0.p9==1))) * !(E((((u2.p42==1)||(u1.p31==1))||((i8.u11.p112==1)&&((((((((((u5.p65==1)||(u2.p48==1))||(i8.u9.p96==1))||(i8.u11.p112==1))||(u13.p129==1))||(u2.p55==1))||((u8.p88==1)&&(u13.p158==1)))||(u0.p10==1))||((u2.p55==1)&&(u13.p158==1)))||(u13.p127==1)))) U EX(((((((((u1.p36==1)&&(u13.p158==1))||(u5.p64==1))||(u0.p19==1))||(u6.p72==1))||(u1.p26==1))||(u13.p121==1))||(i8.u9.p108==1)))))) U AG((((((u1.p36==1)&&(u13.p158==1))||(i3.u4.p2==1))||(i8.u9.p102==1))||(i8.u9.p93==1)))))
=> equivalent forward existential formula: ([((EY(Init) * !(((((((((((u1.p36==1)&&(u13.p158==1))||(i3.u4.p2==1))||(u0.p19==1))||(i3.u4.p118==1))||(i3.u4.p21==1))||(u0.p6==1))||(i8.u9.p102==1))||(i8.u9.p93==1))||(u0.p14==1)))) * !(E(TRUE U ((((((u1.p36==1)&&(u13.p158==1))||(i8.u9.p98==1))||(i8.u9.p92==1))||(u1.p30==1))||(u2.p46==1)))))] != FALSE + [(FwdU(Init,(EX((((((((!(E(TRUE U !(((((u2.p51==1)||(u13.p123==1))||(u13.p136==1))||(i8.u9.p93==1))))) + (((u1.p35==1)||(u0.p9==1))&&(((((((((i8.u11.p114==1)||(u0.p3==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p148==1)))||(u13.p133==1))||((u0.p17==1)&&(u13.p158==1)))||(u13.p154==1))||((u2.p55==1)&&(u13.p158==1)))||(u13.p137==1))||(u0.p13==1)))) + (u2.p48==1)) + (i8.u11.p112==1)) + (i8.u9.p98==1)) + ((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p133==1))) + (u0.p8==1)) + (u0.p9==1))) * !(E((((u2.p42==1)||(u1.p31==1))||((i8.u11.p112==1)&&((((((((((u5.p65==1)||(u2.p48==1))||(i8.u9.p96==1))||(i8.u11.p112==1))||(u13.p129==1))||(u2.p55==1))||((u8.p88==1)&&(u13.p158==1)))||(u0.p10==1))||((u2.p55==1)&&(u13.p158==1)))||(u13.p127==1)))) U EX(((((((((u1.p36==1)&&(u13.p158==1))||(u5.p64==1))||(u0.p19==1))||(u6.p72==1))||(u1.p26==1))||(u13.p121==1))||(i8.u9.p108==1))))))) * !(E(TRUE U !((((((u1.p36==1)&&(u13.p158==1))||(i3.u4.p2==1))||(i8.u9.p102==1))||(i8.u9.p93==1))))))] != FALSE)
(forward)formula 8,0,432.622,2959024,1,0,4.90887e+06,153651,1708,1.03183e+07,1184,4.2229e+06,933786
FORMULA HealthRecord-PT-13-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(((((!(EF(((((((u1.p33==1)||(u5.p64==1))||(u13.p128==1))||((i8.u9.p115==1)&&(u13.p140==1)))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p148==1)))||((u2.p55==1)&&(u13.p158==1))))) + (u2.p52==1)) + AG(((((E(((((((((((i8.u9.p115==1)&&(u13.p120==1))||((i8.u9.p115==1)&&(u13.p136==1)))||(i8.u11.p112==1))||(u13.p144==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p154==1)))||(u0.p4==1))||((i8.u9.p115==1)&&(u13.p146==1)))||(i8.u9.p93==1))||(u6.p76==1)) U (((((u0.p3==1)||(u1.p27==1))||(u7.p79==1))||(u2.p46==1))||(u13.p141==1))) + AX((((((((u2.p48==1)||(i8.u9.p99==1))||(u1.p36==1))||(i8.u9.p117==1))||(u1.p23==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p129==1)))||(u13.p139==1)))) * AG((((((((u7.p83==1)||(u1.p36==1))||(i8.u9.p100==1))||(u6.p71==1))||(u0.p6==1))||(u2.p43==1))||(u2.p45==1)))) * (((u1.p25==1)||((u2.p55==1)&&(u13.p158==1)))||(u2.p47==1))) * ((u0.p5==1)||(u0.p8==1))))) + (((u0.p14==0)&&((u5.p67==0)||(u13.p158==0)))&&((u0.p17==0)||(u13.p158==0)))) + (AX(!(AF(((((i8.u9.p97==1)||(u13.p139==1))||(i3.u4.p62==1))||(u0.p15==1))))) * E((((((u0.p7==1)||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p141==1)))||(u6.p76==1))||(u2.p47==1)) + EG(((((((((u5.p64==1)||(u0.p17==1))||((u6.p74==1)&&(u13.p158==1)))||(i3.u4.p84==1))||(u13.p133==1))||(u13.p149==1))||(u0.p8==1))||(i8.u9.p93==1)))) U EF(((((((u1.p36==1)&&(u13.p158==1))||(u13.p135==1))||(u0.p6==1))||(u1.p24==1))||(i8.u9.p93==1)))))) U AX(!(E(((((((((((((u13.p145==1)||(u13.p129==1))||(i3.u4.p21==1))||(u13.p131==1))||(u2.p53==1))||(u2.p52==1))||(i8.u9.p107==1))||(u0.p9==1))||(u13.p121==1))||(u13.p140==1))||(i8.u9.p95==1))&&(((((u13.p119==1)||((i8.u9.p115==1)&&(u13.p138==1)))||((u2.p55==1)&&(u13.p158==1)))||(i8.u9.p93==1))||(u1.p30==1))) U !(E((((((u0.p17==1)||(i3.u4.p84==1))||(u6.p72==1))||(u13.p143==1))||(i8.u9.p94==1)) U ((((((((((i3.u4.p0==1)||(u2.p49==1))||(u0.p6==1))||(u8.p86==1))||(i8.u9.p102==1))||(u1.p26==1))||(u13.p153==1))||(u1.p28==1))||((i8.u9.p115==1)&&(u13.p157==1)))||(i8.u10.p111==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,((((!(E(TRUE U ((((((u1.p33==1)||(u5.p64==1))||(u13.p128==1))||((i8.u9.p115==1)&&(u13.p140==1)))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p148==1)))||((u2.p55==1)&&(u13.p158==1))))) + (u2.p52==1)) + !(E(TRUE U !(((((E(((((((((((i8.u9.p115==1)&&(u13.p120==1))||((i8.u9.p115==1)&&(u13.p136==1)))||(i8.u11.p112==1))||(u13.p144==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p154==1)))||(u0.p4==1))||((i8.u9.p115==1)&&(u13.p146==1)))||(i8.u9.p93==1))||(u6.p76==1)) U (((((u0.p3==1)||(u1.p27==1))||(u7.p79==1))||(u2.p46==1))||(u13.p141==1))) + !(EX(!((((((((u2.p48==1)||(i8.u9.p99==1))||(u1.p36==1))||(i8.u9.p117==1))||(u1.p23==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p129==1)))||(u13.p139==1)))))) * !(E(TRUE U !((((((((u7.p83==1)||(u1.p36==1))||(i8.u9.p100==1))||(u6.p71==1))||(u0.p6==1))||(u2.p43==1))||(u2.p45==1)))))) * (((u1.p25==1)||((u2.p55==1)&&(u13.p158==1)))||(u2.p47==1))) * ((u0.p5==1)||(u0.p8==1))))))) + (((u0.p14==0)&&((u5.p67==0)||(u13.p158==0)))&&((u0.p17==0)||(u13.p158==0)))) + (!(EX(!(!(!(EG(!(((((i8.u9.p97==1)||(u13.p139==1))||(i3.u4.p62==1))||(u0.p15==1))))))))) * E((((((u0.p7==1)||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u13.p141==1)))||(u6.p76==1))||(u2.p47==1)) + EG(((((((((u5.p64==1)||(u0.p17==1))||((u6.p74==1)&&(u13.p158==1)))||(i3.u4.p84==1))||(u13.p133==1))||(u13.p149==1))||(u0.p8==1))||(i8.u9.p93==1)))) U E(TRUE U ((((((u1.p36==1)&&(u13.p158==1))||(u13.p135==1))||(u0.p6==1))||(u1.p24==1))||(i8.u9.p93==1))))))) * !(EX(!(!(E(((((((((((((u13.p145==1)||(u13.p129==1))||(i3.u4.p21==1))||(u13.p131==1))||(u2.p53==1))||(u2.p52==1))||(i8.u9.p107==1))||(u0.p9==1))||(u13.p121==1))||(u13.p140==1))||(i8.u9.p95==1))&&(((((u13.p119==1)||((i8.u9.p115==1)&&(u13.p138==1)))||((u2.p55==1)&&(u13.p158==1)))||(i8.u9.p93==1))||(u1.p30==1))) U !(E((((((u0.p17==1)||(i3.u4.p84==1))||(u6.p72==1))||(u13.p143==1))||(i8.u9.p94==1)) U ((((((((((i3.u4.p0==1)||(u2.p49==1))||(u0.p6==1))||(u8.p86==1))||(i8.u9.p102==1))||(u1.p26==1))||(u13.p153==1))||(u1.p28==1))||((i8.u9.p115==1)&&(u13.p157==1)))||(i8.u10.p111==1))))))))))] != FALSE
(forward)formula 9,1,551.129,3290872,1,0,5.5546e+06,181054,798,1.15955e+07,869,4.2229e+06,415997
FORMULA HealthRecord-PT-13-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EG((EF((AF(((((((i8.u11.p114==1)||(u2.p50==1))||(u2.p55==1))||(u8.p86==1))||(u13.p122==1))||(u13.p121==1))) + !(EX(((((u0.p17==1)||(u1.p33==1))||(u1.p35==1))||(i8.u11.p113==1)))))) * A((!(E(((((u5.p66==1)||(u1.p24==1))||(i8.u9.p107==1))||(i8.u9.p93==1)) U (((i8.u9.p99==1)||((u0.p17==1)&&(u13.p158==1)))||((u2.p55==1)&&(u13.p158==1))))) + E(AF((((((u0.p17==1)||(u5.p66==1))||(u8.p87==1))||(u1.p25==1))||(u1.p30==1))) U ((u0.p3==0)&&(u13.p133==0)))) U AX((AF((i8.u9.p93==1)) + (u1.p26==1))))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (!(EG(!(((((((i8.u11.p114==1)||(u2.p50==1))||(u2.p55==1))||(u8.p86==1))||(u13.p122==1))||(u13.p121==1))))) + !(EX(((((u0.p17==1)||(u1.p33==1))||(u1.p35==1))||(i8.u11.p113==1)))))) * !((E(!(!(EX(!((!(EG(!((i8.u9.p93==1)))) + (u1.p26==1)))))) U (!((!(E(((((u5.p66==1)||(u1.p24==1))||(i8.u9.p107==1))||(i8.u9.p93==1)) U (((i8.u9.p99==1)||((u0.p17==1)&&(u13.p158==1)))||((u2.p55==1)&&(u13.p158==1))))) + E(!(EG(!((((((u0.p17==1)||(u5.p66==1))||(u8.p87==1))||(u1.p25==1))||(u1.p30==1))))) U ((u0.p3==0)&&(u13.p133==0))))) * !(!(EX(!((!(EG(!((i8.u9.p93==1)))) + (u1.p26==1)))))))) + EG(!(!(EX(!((!(EG(!((i8.u9.p93==1)))) + (u1.p26==1)))))))))))] != FALSE
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 10,0,563.736,3290872,1,0,5.5546e+06,181054,1261,1.15955e+07,1025,4.2229e+06,1008217
FORMULA HealthRecord-PT-13-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1621283019311

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="HealthRecord-PT-13"
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 HealthRecord-PT-13, 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 r292-tall-162124156300354"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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