About the Execution of ITS-Tools for HealthRecord-PT-12
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2995.855 | 325348.00 | 255686.00 | 40200.70 | TTFFTFTFFTTFTFFF | 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-162124156300346.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-12, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156300346
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 9.0K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K 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:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 11 18:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 11 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 51K 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-12-CTLFireability-00
FORMULA_NAME HealthRecord-PT-12-CTLFireability-01
FORMULA_NAME HealthRecord-PT-12-CTLFireability-02
FORMULA_NAME HealthRecord-PT-12-CTLFireability-03
FORMULA_NAME HealthRecord-PT-12-CTLFireability-04
FORMULA_NAME HealthRecord-PT-12-CTLFireability-05
FORMULA_NAME HealthRecord-PT-12-CTLFireability-06
FORMULA_NAME HealthRecord-PT-12-CTLFireability-07
FORMULA_NAME HealthRecord-PT-12-CTLFireability-08
FORMULA_NAME HealthRecord-PT-12-CTLFireability-09
FORMULA_NAME HealthRecord-PT-12-CTLFireability-10
FORMULA_NAME HealthRecord-PT-12-CTLFireability-11
FORMULA_NAME HealthRecord-PT-12-CTLFireability-12
FORMULA_NAME HealthRecord-PT-12-CTLFireability-13
FORMULA_NAME HealthRecord-PT-12-CTLFireability-14
FORMULA_NAME HealthRecord-PT-12-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1621282078178
Running Version 0
[2021-05-17 20:08:08] [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:08:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 20:08:08] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2021-05-17 20:08:08] [INFO ] Transformed 160 places.
[2021-05-17 20:08:08] [INFO ] Transformed 340 transitions.
[2021-05-17 20:08:08] [INFO ] Found NUPN structural information;
[2021-05-17 20:08:08] [INFO ] Parsed PT model containing 160 places and 340 transitions in 89 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
[2021-05-17 20:08:08] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 20:08:08] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 20:08:08] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 20:08:08] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 20:08:08] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-17 20:08:08] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 20:08:08] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 20:08:08] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 20:08:08] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 20:08:08] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-17 20:08:08] [INFO ] Reduced 1 identical enabling conditions.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Support contains 152 out of 160 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 160/160 places, 312/312 transitions.
Applied a total of 0 rules in 12 ms. Remains 160 /160 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2021-05-17 20:08:08] [INFO ] Flow matrix only has 300 transitions (discarded 12 similar events)
// Phase 1: matrix 300 rows 160 cols
[2021-05-17 20:08:08] [INFO ] Computed 18 place invariants in 18 ms
[2021-05-17 20:08:08] [INFO ] Implicit Places using invariants in 148 ms returned []
[2021-05-17 20:08:08] [INFO ] Flow matrix only has 300 transitions (discarded 12 similar events)
// Phase 1: matrix 300 rows 160 cols
[2021-05-17 20:08:08] [INFO ] Computed 18 place invariants in 8 ms
[2021-05-17 20:08:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:08:09] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2021-05-17 20:08:09] [INFO ] Flow matrix only has 300 transitions (discarded 12 similar events)
// Phase 1: matrix 300 rows 160 cols
[2021-05-17 20:08:09] [INFO ] Computed 18 place invariants in 3 ms
[2021-05-17 20:08:09] [INFO ] Dead Transitions using invariants and state equation in 200 ms returned []
Finished structural reductions, in 1 iterations. Remains : 160/160 places, 312/312 transitions.
[2021-05-17 20:08:09] [INFO ] Flatten gal took : 56 ms
[2021-05-17 20:08:09] [INFO ] Flatten gal took : 26 ms
[2021-05-17 20:08:09] [INFO ] Input system was already deterministic with 312 transitions.
Incomplete random walk after 100000 steps, including 7204 resets, run finished after 470 ms. (steps per millisecond=212 ) properties (out of 71) seen :64
Running SMT prover for 7 properties.
[2021-05-17 20:08:10] [INFO ] Flow matrix only has 300 transitions (discarded 12 similar events)
// Phase 1: matrix 300 rows 160 cols
[2021-05-17 20:08:10] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 20:08:10] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:08:10] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:08:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:08:10] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2021-05-17 20:08:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:08:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-17 20:08:10] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-17 20:08:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:08:10] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2021-05-17 20:08:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:08:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:08:10] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 3 ms to minimize.
[2021-05-17 20:08:10] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 1 ms to minimize.
[2021-05-17 20:08:10] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2021-05-17 20:08:10] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 1 ms to minimize.
[2021-05-17 20:08:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 329 ms
[2021-05-17 20:08:10] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 26 ms.
[2021-05-17 20:08:11] [INFO ] Added : 87 causal constraints over 18 iterations in 303 ms. Result :sat
[2021-05-17 20:08:11] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-17 20:08:11] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:08:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:08:11] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2021-05-17 20:08:11] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 20:08:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:08:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:08:11] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:08:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:08:11] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2021-05-17 20:08:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:08:11] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2021-05-17 20:08:11] [INFO ] Deduced a trap composed of 39 places in 38 ms of which 1 ms to minimize.
[2021-05-17 20:08:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2021-05-17 20:08:11] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 20 ms.
[2021-05-17 20:08:11] [INFO ] Added : 83 causal constraints over 17 iterations in 241 ms. Result :sat
[2021-05-17 20:08:11] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 20:08:11] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:08:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:08:11] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2021-05-17 20:08:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:08:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:08:11] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:08:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:08:11] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2021-05-17 20:08:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:08:11] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 22 ms.
[2021-05-17 20:08:12] [INFO ] Added : 93 causal constraints over 19 iterations in 260 ms. Result :sat
[2021-05-17 20:08:12] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:08:12] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2021-05-17 20:08:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:08:12] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2021-05-17 20:08:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:08:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-17 20:08:12] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-17 20:08:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:08:12] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2021-05-17 20:08:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 20:08:12] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 0 ms to minimize.
[2021-05-17 20:08:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2021-05-17 20:08:12] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 18 ms.
[2021-05-17 20:08:12] [INFO ] Added : 84 causal constraints over 17 iterations in 234 ms. Result :sat
[2021-05-17 20:08:12] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 20:08:12] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:08:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:08:12] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2021-05-17 20:08:12] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:08:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:08:18] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:08:18] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:08:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:08:19] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-17 20:08:19] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:08:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:08:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:08:19] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:08:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:08:19] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-17 20:08:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:08:19] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 19 ms.
[2021-05-17 20:08:19] [INFO ] Deduced a trap composed of 40 places in 29 ms of which 1 ms to minimize.
[2021-05-17 20:08:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2021-05-17 20:08:19] [INFO ] Added : 83 causal constraints over 17 iterations in 305 ms. Result :sat
[2021-05-17 20:08:19] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:08:19] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:08:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:08:19] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2021-05-17 20:08:19] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:08:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:08:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:08:19] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:08:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:08:19] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-17 20:08:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 20:08:19] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 18 ms.
[2021-05-17 20:08:19] [INFO ] Added : 83 causal constraints over 17 iterations in 241 ms. Result :sat
Graph (trivial) has 79 edges and 160 vertex of which 6 / 160 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.
Discarding 81 places :
Symmetric choice reduction at 0 with 81 rule applications. Total rules 82 place count 76 transition count 156
Iterating global reduction 0 with 81 rules applied. Total rules applied 163 place count 76 transition count 156
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 171 place count 68 transition count 140
Iterating global reduction 0 with 8 rules applied. Total rules applied 179 place count 68 transition count 140
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 187 place count 68 transition count 132
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 1 with 4 rules applied. Total rules applied 191 place count 66 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 192 place count 66 transition count 129
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 194 place count 66 transition count 129
Applied a total of 194 rules in 44 ms. Remains 66 /160 variables (removed 94) and now considering 129/312 (removed 183) transitions.
[2021-05-17 20:08:20] [INFO ] Flatten gal took : 9 ms
[2021-05-17 20:08:20] [INFO ] Flatten gal took : 9 ms
[2021-05-17 20:08:20] [INFO ] Input system was already deterministic with 129 transitions.
[2021-05-17 20:08:20] [INFO ] Flatten gal took : 8 ms
[2021-05-17 20:08:20] [INFO ] Flatten gal took : 7 ms
[2021-05-17 20:08:20] [INFO ] Time to serialize gal into /tmp/CTLFireability16475570947539997704.gal : 3 ms
[2021-05-17 20:08:20] [INFO ] Time to serialize properties into /tmp/CTLFireability12301272002458661145.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/CTLFireability16475570947539997704.gal, -t, CGAL, -ctl, /tmp/CTLFireability12301272002458661145.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/CTLFireability16475570947539997704.gal -t CGAL -ctl /tmp/CTLFireability12301272002458661145.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.50024e+06,0.811098,32764,2,5791,5,122604,6,0,386,127255,0
Converting to forward existential form...Done !
original formula: (EG(!(EF((((p98==1)||(p5==1))||(p159==1))))) + !(A(((((((((p130==0)&&(p48==0))&&(p18==0))&&(p2==0))&&((p19==0)||(p157==0)))&&(p72==0))&&(p45==0))&&(p108==0)) U EF((((((((((((p17==1)&&(p36==1))&&(p55==1))&&(p60==1))&&(p67==1))&&(p74==1))&&(p81==1))&&(p88==1))&&(p114==1))&&(p158==1)) + !(EF((((((p54==1)&&(p157==1))||((p66==1)&&(p157==1)))||(p9==1))||(p46==1)))))))))
=> equivalent forward existential formula: ([FwdG(Init,!(E(TRUE U (((p98==1)||(p5==1))||(p159==1)))))] != FALSE + ([((FwdU(Init,!(E(TRUE U (((((((((((p17==1)&&(p36==1))&&(p55==1))&&(p60==1))&&(p67==1))&&(p74==1))&&(p81==1))&&(p88==1))&&(p114==1))&&(p158==1)) + !(E(TRUE U (((((p54==1)&&(p157==1))||((p66==1)&&(p157==1)))||(p9==1))||(p46==1)))))))) * !(((((((((p130==0)&&(p48==0))&&(p18==0))&&(p2==0))&&((p19==0)||(p157==0)))&&(p72==0))&&(p45==0))&&(p108==0)))) * !(E(TRUE U (((((((((((p17==1)&&(p36==1))&&(p55==1))&&(p60==1))&&(p67==1))&&(p74==1))&&(p81==1))&&(p88==1))&&(p114==1))&&(p158==1)) + !(E(TRUE U (((((p54==1)&&(p157==1))||((p66==1)&&(p157==1)))||(p9==1))||(p46==1))))))))] != FALSE + [FwdG(Init,!(E(TRUE U (((((((((((p17==1)&&(p36==1))&&(p55==1))&&(p60==1))&&(p67==1))&&(p74==1))&&(p81==1))&&(p88==1))&&(p114==1))&&(p158==1)) + !(E(TRUE U (((((p54==1)&&(p157==1))||((p66==1)&&(p157==1)))||(p9==1))||(p46==1))))))))] != FALSE))
Reverse transition relation is NOT exact ! Due to transitions 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, t30, t31, t33, t34, t35, t41, t42, t49, t50, t51, t52, t53, t54, t55, t56, t61, t62, t63, t64, t65, t66, t67, t68, t69, t70, t72, t73, t74, t75, t86, t87, t88, t90, t92, t94, t95, t96, t98, t100, t106, t108, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/60/69/129
(forward)formula 0,0,8.21828,219556,1,0,321,1.19165e+06,283,130,3000,975299,336
FORMULA HealthRecord-PT-12-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Graph (trivial) has 237 edges and 160 vertex of which 8 / 160 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 89 place count 67 transition count 139
Iterating global reduction 0 with 88 rules applied. Total rules applied 177 place count 67 transition count 139
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 187 place count 57 transition count 119
Iterating global reduction 0 with 10 rules applied. Total rules applied 197 place count 57 transition count 119
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 206 place count 57 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 208 place count 55 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 210 place count 55 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 212 place count 53 transition count 100
Iterating global reduction 1 with 2 rules applied. Total rules applied 214 place count 53 transition count 100
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 219 place count 53 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 223 place count 51 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
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 227 place count 49 transition count 110
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 229 place count 49 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 230 place count 48 transition count 107
Applied a total of 230 rules in 59 ms. Remains 48 /160 variables (removed 112) and now considering 107/312 (removed 205) transitions.
[2021-05-17 20:08:28] [INFO ] Flatten gal took : 7 ms
[2021-05-17 20:08:28] [INFO ] Flatten gal took : 7 ms
[2021-05-17 20:08:28] [INFO ] Input system was already deterministic with 107 transitions.
[2021-05-17 20:08:28] [INFO ] Flatten gal took : 6 ms
[2021-05-17 20:08:28] [INFO ] Flatten gal took : 6 ms
[2021-05-17 20:08:28] [INFO ] Time to serialize gal into /tmp/CTLFireability7572745217137651127.gal : 3 ms
[2021-05-17 20:08:28] [INFO ] Time to serialize properties into /tmp/CTLFireability9312234255231105248.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/CTLFireability7572745217137651127.gal, -t, CGAL, -ctl, /tmp/CTLFireability9312234255231105248.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/CTLFireability7572745217137651127.gal -t CGAL -ctl /tmp/CTLFireability9312234255231105248.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,383944,0.093375,7860,2,1467,5,18472,6,0,287,11073,0
Converting to forward existential form...Done !
original formula: EF(AG(EF(EG(((((p155==1)||(p11==1))||(p46==1))&&((p1==1)||(p42==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U EG(((((p155==1)||(p11==1))||(p46==1))&&((p1==1)||(p42==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t17, t18, t19, t20, t31, t32, t33, t34, t37, t38, t74, t75, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/80/27/107
(forward)formula 0,0,3.09505,98924,1,0,245,528788,233,98,2431,327929,312
FORMULA HealthRecord-PT-12-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Graph (trivial) has 216 edges and 160 vertex of which 6 / 160 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 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 91 place count 67 transition count 138
Iterating global reduction 0 with 90 rules applied. Total rules applied 181 place count 67 transition count 138
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 192 place count 56 transition count 116
Iterating global reduction 0 with 11 rules applied. Total rules applied 203 place count 56 transition count 116
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 212 place count 56 transition count 107
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 214 place count 54 transition count 101
Iterating global reduction 1 with 2 rules applied. Total rules applied 216 place count 54 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 218 place count 52 transition count 97
Iterating global reduction 1 with 2 rules applied. Total rules applied 220 place count 52 transition count 97
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 226 place count 52 transition count 91
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 230 place count 50 transition count 89
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 242 place count 44 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 244 place count 44 transition count 121
Applied a total of 244 rules in 26 ms. Remains 44 /160 variables (removed 116) and now considering 121/312 (removed 191) transitions.
[2021-05-17 20:08:31] [INFO ] Flatten gal took : 8 ms
[2021-05-17 20:08:31] [INFO ] Flatten gal took : 9 ms
[2021-05-17 20:08:31] [INFO ] Input system was already deterministic with 121 transitions.
[2021-05-17 20:08:31] [INFO ] Flatten gal took : 8 ms
[2021-05-17 20:08:31] [INFO ] Flatten gal took : 8 ms
[2021-05-17 20:08:39] [INFO ] Time to serialize gal into /tmp/CTLFireability17850569135374863326.gal : 7515 ms
[2021-05-17 20:08:39] [INFO ] Time to serialize properties into /tmp/CTLFireability15610633924830910046.ctl : 134 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/CTLFireability17850569135374863326.gal, -t, CGAL, -ctl, /tmp/CTLFireability15610633924830910046.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/CTLFireability17850569135374863326.gal -t CGAL -ctl /tmp/CTLFireability15610633924830910046.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,141701,0.126413,7420,2,2248,5,13408,6,0,291,7639,0
Converting to forward existential form...Done !
original formula: AF(AG(AF(((((((p68==1)||(p9==1))||(p59==1))||(p28==1))||(p15==1))||((p114==1)&&(p154==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(EG(!(((((((p68==1)||(p9==1))||(p59==1))||(p28==1))||(p15==1))||((p114==1)&&(p154==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, t16, t17, t26, t27, t29, t30, t31, t32, t35, t58, t59, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/95/26/121
(forward)formula 0,0,1.18314,36984,1,0,294,179926,266,116,2880,140896,382
FORMULA HealthRecord-PT-12-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2021-05-17 20:08:40] [INFO ] Flatten gal took : 64 ms
[2021-05-17 20:08:40] [INFO ] Flatten gal took : 41 ms
[2021-05-17 20:08:40] [INFO ] Applying decomposition
[2021-05-17 20:08:40] [INFO ] Flatten gal took : 26 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/graph17761882002170286993.txt, -o, /tmp/graph17761882002170286993.bin, -w, /tmp/graph17761882002170286993.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/graph17761882002170286993.bin, -l, -1, -v, -w, /tmp/graph17761882002170286993.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:08:40] [INFO ] Decomposing Gal with order
[2021-05-17 20:08:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:08:41] [INFO ] Removed a total of 50 redundant transitions.
[2021-05-17 20:08:41] [INFO ] Flatten gal took : 52 ms
[2021-05-17 20:08:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 4 ms.
[2021-05-17 20:08:41] [INFO ] Time to serialize gal into /tmp/CTLFireability5030002647819016284.gal : 3 ms
[2021-05-17 20:08:41] [INFO ] Time to serialize properties into /tmp/CTLFireability2403201129759640275.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/CTLFireability5030002647819016284.gal, -t, CGAL, -ctl, /tmp/CTLFireability2403201129759640275.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/CTLFireability5030002647819016284.gal -t CGAL -ctl /tmp/CTLFireability2403201129759640275.ctl
No direction supplied, using forward translation only.
Parsed 13 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.83934e+09,17.2424,425044,2015,2524,583860,83827,379,1.42074e+06,385,1.76242e+06,0
Converting to forward existential form...Done !
original formula: EF((AX((EF((((((u1.p33==1)||(i8.u11.p98==1))||(u0.p12==1))||(i8.u11.p95==1))||(i8.u11.p94==1))) * AG((((i8.u11.p114==0)||(u13.p125==0))&&(u0.p2==0))))) * (((((u13.p137==1)||(u1.p28==1))||(u13.p125==1)) + !(EG(((((((i8.u11.p98==1)||((u7.p80==1)&&(u13.p157==1)))||((u1.p35==1)&&(u13.p157==1)))||(u8.p84==1))||(u0.p6==1))&&((((((((((((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(i3.u4.p60==1))&&(u5.p67==1))&&(u6.p74==1))&&(u7.p81==1))&&(u8.p88==1))&&(i8.u11.p114==1))&&(u13.p158==1))||(u2.p48==1))||(i8.u11.p98==1))||(u2.p53==1))||(i8.u11.p102==1))||(u0.p11==1))||(u13.p142==1))||(u7.p79==1))||(u0.p14==1)))))) + !(EG(A((((((((((u13.p131==1)||(u0.p2==1))||(u1.p34==1))||((i8.u11.p114==1)&&(u13.p141==1)))||(u2.p51==1))||(i8.u11.p104==1))||(u13.p159==1))||(i8.u9.p109==1))||(u7.p78==1)) U (((((i8.u11.p96==1)||((u0.p16==1)&&(u13.p157==1)))||(u13.p120==1))||(u13.p152==1))||(u1.p31==1))))))))
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !(EX(!((E(TRUE U (((((u1.p33==1)||(i8.u11.p98==1))||(u0.p12==1))||(i8.u11.p95==1))||(i8.u11.p94==1))) * !(E(TRUE U !((((i8.u11.p114==0)||(u13.p125==0))&&(u0.p2==0)))))))))) * (((u13.p137==1)||(u1.p28==1))||(u13.p125==1)))] != FALSE + [((FwdU(Init,TRUE) * !(EX(!((E(TRUE U (((((u1.p33==1)||(i8.u11.p98==1))||(u0.p12==1))||(i8.u11.p95==1))||(i8.u11.p94==1))) * !(E(TRUE U !((((i8.u11.p114==0)||(u13.p125==0))&&(u0.p2==0)))))))))) * !(EG(((((((i8.u11.p98==1)||((u7.p80==1)&&(u13.p157==1)))||((u1.p35==1)&&(u13.p157==1)))||(u8.p84==1))||(u0.p6==1))&&((((((((((((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(i3.u4.p60==1))&&(u5.p67==1))&&(u6.p74==1))&&(u7.p81==1))&&(u8.p88==1))&&(i8.u11.p114==1))&&(u13.p158==1))||(u2.p48==1))||(i8.u11.p98==1))||(u2.p53==1))||(i8.u11.p102==1))||(u0.p11==1))||(u13.p142==1))||(u7.p79==1))||(u0.p14==1))))))] != FALSE) + [((FwdU(Init,TRUE) * !(EX(!((E(TRUE U (((((u1.p33==1)||(i8.u11.p98==1))||(u0.p12==1))||(i8.u11.p95==1))||(i8.u11.p94==1))) * !(E(TRUE U !((((i8.u11.p114==0)||(u13.p125==0))&&(u0.p2==0)))))))))) * !(EG(!((E(!((((((i8.u11.p96==1)||((u0.p16==1)&&(u13.p157==1)))||(u13.p120==1))||(u13.p152==1))||(u1.p31==1))) U (!((((((((((u13.p131==1)||(u0.p2==1))||(u1.p34==1))||((i8.u11.p114==1)&&(u13.p141==1)))||(u2.p51==1))||(i8.u11.p104==1))||(u13.p159==1))||(i8.u9.p109==1))||(u7.p78==1))) * !((((((i8.u11.p96==1)||((u0.p16==1)&&(u13.p157==1)))||(u13.p120==1))||(u13.p152==1))||(u1.p31==1))))) + EG(!((((((i8.u11.p96==1)||((u0.p16==1)&&(u13.p157==1)))||(u13.p120==1))||(u13.p152==1))||(u1.p31==1)))))))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t12, t248, t253, t257, t261, t265, t270, t273, t276, 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.t231, 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.t62, i8.u11.t60, i8.u11.t61, i8.u11.t70, i8.u11.t71, i8.u11.t72, i8.u11.t73, i8.u11.t74, i8.u11.t75, i8.u11.t76, i8.u11.t77, i8.u11.t78, i8.u11.t79, i8.u11.t80, i8.u11.t81, i8.u11.t82, i8.u11.t83, i8.u11.t84, i8.u11.t85, i8.u11.t86, i8.u11.t87, i8.u11.t88, i8.u11.t89, i8.u11.t90, i8.u11.t91, i8.u11.t92, i8.u11.t93, i8.u11.t94, i8.u11.t95, i8.u11.t96, i8.u11.t97, i8.u11.t98, i8.u11.t99, i8.u11.t100, i8.u11.t101, i8.u11.t102, i8.u11.t103, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/83/224/307
(forward)formula 0,1,20.2555,425044,1,0,583860,83827,2401,1.42074e+06,2177,1.76242e+06,486010
FORMULA HealthRecord-PT-12-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (EF(!(E((((u7.p82==1)||((u0.p16==1)&&(u13.p157==1)))||(u2.p54==1)) U ((((((((((u0.p16==0)||(u13.p157==0))&&(u12.p151==0))&&(u12.p149==0))&&(u13.p120==0))&&(u1.p27==0))&&(u1.p33==0))&&(u8.p86==0))||((((i8.u11.p99==0)&&(u6.p70==0))&&(u2.p43==0))&&(u1.p28==0)))||(u13.p153==0))))) * EG(((((((AG(EF(EX(((((((u2.p54==1)&&(u13.p157==1))||(u8.p85==1))||(u2.p54==1))||(u13.p153==1))||(i8.u9.p109==1))))) + !(E((((((((((u1.p19==1)&&(u13.p157==1))||(u2.p52==1))||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u13.p157==1)))||(i8.u11.p91==1))||(u13.p120==1))||(u0.p11==1))||((i8.u11.p114==1)&&(u13.p143==1)))||(u0.p14==1)) U ((((((((u2.p48==1)||((u1.p35==1)&&(u13.p157==1)))||(i3.u4.p69==1))||((u8.p87==1)&&(u13.p157==1)))||(i3.u4.p57==1))||(u13.p155==1))||(u13.p152==1))||(u2.p43==1))))) + !(EX((((((((((((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(i3.u4.p60==1))&&(u5.p67==1))&&(u6.p74==1))&&(u7.p81==1))&&(u8.p88==1))&&(i8.u11.p114==1))&&(u13.p158==1))||(u1.p33==1))||(u1.p34==1))||(u0.p18==1))||(u13.p132==1))||(i8.u11.p106==1))||(u2.p40==1))||(u2.p45==1))))) + (u13.p144==1)) + (u0.p5==1)) + (i3.u4.p76==1)) + ((((((((i8.u10.p112==0)&&(u0.p3==0))&&(i8.u11.p102==0))&&(i8.u11.p94==0))&&(u1.p31==0))&&(u13.p141==0))&&(u2.p41==0))&&(i3.u4.p117==0)))))
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U !(E((((u7.p82==1)||((u0.p16==1)&&(u13.p157==1)))||(u2.p54==1)) U ((((((((((u0.p16==0)||(u13.p157==0))&&(u12.p151==0))&&(u12.p149==0))&&(u13.p120==0))&&(u1.p27==0))&&(u1.p33==0))&&(u8.p86==0))||((((i8.u11.p99==0)&&(u6.p70==0))&&(u2.p43==0))&&(u1.p28==0)))||(u13.p153==0)))))),((((((!(E(TRUE U !(E(TRUE U EX(((((((u2.p54==1)&&(u13.p157==1))||(u8.p85==1))||(u2.p54==1))||(u13.p153==1))||(i8.u9.p109==1))))))) + !(E((((((((((u1.p19==1)&&(u13.p157==1))||(u2.p52==1))||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u13.p157==1)))||(i8.u11.p91==1))||(u13.p120==1))||(u0.p11==1))||((i8.u11.p114==1)&&(u13.p143==1)))||(u0.p14==1)) U ((((((((u2.p48==1)||((u1.p35==1)&&(u13.p157==1)))||(i3.u4.p69==1))||((u8.p87==1)&&(u13.p157==1)))||(i3.u4.p57==1))||(u13.p155==1))||(u13.p152==1))||(u2.p43==1))))) + !(EX((((((((((((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(i3.u4.p60==1))&&(u5.p67==1))&&(u6.p74==1))&&(u7.p81==1))&&(u8.p88==1))&&(i8.u11.p114==1))&&(u13.p158==1))||(u1.p33==1))||(u1.p34==1))||(u0.p18==1))||(u13.p132==1))||(i8.u11.p106==1))||(u2.p40==1))||(u2.p45==1))))) + (u13.p144==1)) + (u0.p5==1)) + (i3.u4.p76==1)) + ((((((((i8.u10.p112==0)&&(u0.p3==0))&&(i8.u11.p102==0))&&(i8.u11.p94==0))&&(u1.p31==0))&&(u13.p141==0))&&(u2.p41==0))&&(i3.u4.p117==0))))] != FALSE
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 1,1,86.7769,2175948,1,0,3.50232e+06,134639,2788,7.35801e+06,2277,3.13867e+06,1755910
FORMULA HealthRecord-PT-12-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EF((AX((((((((((((((((((((((((u0.p17==0)||(u1.p36==0))||(u2.p55==0))||(i3.u4.p60==0))||(u5.p67==0))||(u6.p74==0))||(u7.p81==0))||(u8.p88==0))||(i8.u11.p114==0))||(u13.p158==0))&&(u0.p18==0))&&(u1.p34==0))&&(i8.u11.p98==0))&&(u12.p150==0))&&((((u0.p16==0)||(u1.p35==0))||(u2.p54==0))||(u13.p132==0)))&&(i8.u11.p103==0))&&(i8.u11.p107==0))&&(u2.p40==0))&&(u2.p47==0))&&(u1.p28==0))&&(u0.p13==0))||(i3.u4.p20==0)) * EG((((((((((((i8.u11.p114==1)&&(u13.p125==1))||((u0.p16==1)&&(u13.p157==1)))||(i8.u11.p100==1))||((u8.p87==1)&&(u13.p157==1)))||(u6.p71==1))||(u1.p22==1))||(u1.p25==1))||(u1.p28==1))||(i8.u10.p111==1))||(u2.p44==1))))) * E((((((u5.p65==1)||(u6.p75==1))&&(u1.p35==1))&&(u13.p157==1))&&((((((((((((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(i3.u4.p60==1))&&(u5.p67==1))&&(u6.p74==1))&&(u7.p81==1))&&(u8.p88==1))&&(i8.u11.p114==1))&&(u13.p158==1))||(i3.u4.p83==1))||(u8.p85==1))||(u0.p6==1))||((u5.p66==1)&&(u13.p157==1)))||(u2.p43==1))||(u2.p44==1))||(u1.p30==1))||(i8.u9.p108==1))) U ((((((u1.p32==1)||(u1.p23==1))||(u13.p138==1))||(u2.p56==1))||(u2.p45==1))||(u1.p31==1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(EX(!((((((((((((((((((((((((u0.p17==0)||(u1.p36==0))||(u2.p55==0))||(i3.u4.p60==0))||(u5.p67==0))||(u6.p74==0))||(u7.p81==0))||(u8.p88==0))||(i8.u11.p114==0))||(u13.p158==0))&&(u0.p18==0))&&(u1.p34==0))&&(i8.u11.p98==0))&&(u12.p150==0))&&((((u0.p16==0)||(u1.p35==0))||(u2.p54==0))||(u13.p132==0)))&&(i8.u11.p103==0))&&(i8.u11.p107==0))&&(u2.p40==0))&&(u2.p47==0))&&(u1.p28==0))&&(u0.p13==0))||(i3.u4.p20==0)) * EG((((((((((((i8.u11.p114==1)&&(u13.p125==1))||((u0.p16==1)&&(u13.p157==1)))||(i8.u11.p100==1))||((u8.p87==1)&&(u13.p157==1)))||(u6.p71==1))||(u1.p22==1))||(u1.p25==1))||(u1.p28==1))||(i8.u10.p111==1))||(u2.p44==1)))))))),(((((u5.p65==1)||(u6.p75==1))&&(u1.p35==1))&&(u13.p157==1))&&((((((((((((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(i3.u4.p60==1))&&(u5.p67==1))&&(u6.p74==1))&&(u7.p81==1))&&(u8.p88==1))&&(i8.u11.p114==1))&&(u13.p158==1))||(i3.u4.p83==1))||(u8.p85==1))||(u0.p6==1))||((u5.p66==1)&&(u13.p157==1)))||(u2.p43==1))||(u2.p44==1))||(u1.p30==1))||(i8.u9.p108==1)))) * ((((((u1.p32==1)||(u1.p23==1))||(u13.p138==1))||(u2.p56==1))||(u2.p45==1))||(u1.p31==1)))] != FALSE
(forward)formula 2,1,103.295,2200764,1,0,3.54359e+06,137032,1188,7.44953e+06,1121,3.15782e+06,87859
FORMULA HealthRecord-PT-12-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: !(E(EX((((((((((((u0.p16==1)||(u13.p144==1))||(i8.u11.p98==1))||(u0.p4==1))||(u1.p22==1))||(u13.p138==1))||(i8.u11.p107==1))||((i8.u11.p114==1)&&(u13.p133==1)))||(u6.p75==1))||(u13.p127==1)) * EF(EG((u1.p31==1))))) U (((u1.p27==1)||(i8.u9.p108==1))||(u7.p78==1))))
=> equivalent forward existential formula: [(FwdU(Init,EX((((((((((((u0.p16==1)||(u13.p144==1))||(i8.u11.p98==1))||(u0.p4==1))||(u1.p22==1))||(u13.p138==1))||(i8.u11.p107==1))||((i8.u11.p114==1)&&(u13.p133==1)))||(u6.p75==1))||(u13.p127==1)) * E(TRUE U EG((u1.p31==1)))))) * (((u1.p27==1)||(i8.u9.p108==1))||(u7.p78==1)))] = FALSE
(forward)formula 3,0,146.433,2199400,1,0,3.54359e+06,137032,1330,7.44953e+06,1173,3.59345e+06,1124119
FORMULA HealthRecord-PT-12-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EX(EF((EF(((((((AX(((u8.p84==1)||(u0.p5==1))) * (u13.p148==0)) * (u0.p9==0)) * (u0.p10==0)) * (u0.p12==0)) * (i3.u4.p61==0)) * ((((u0.p16==0)||(u1.p35==0))||(u2.p54==0))||(u13.p153==0)))) * (((u1.p35==1)||(u1.p25==1))||(i8.u11.p104==1)))))
=> equivalent forward existential formula: [(((((((FwdU((FwdU(EY(Init),TRUE) * (((u1.p35==1)||(u1.p25==1))||(i8.u11.p104==1))),TRUE) * ((((u0.p16==0)||(u1.p35==0))||(u2.p54==0))||(u13.p153==0))) * (i3.u4.p61==0)) * (u0.p12==0)) * (u0.p10==0)) * (u0.p9==0)) * (u13.p148==0)) * !(EX(!(((u8.p84==1)||(u0.p5==1))))))] != FALSE
(forward)formula 4,1,154.335,2199400,1,0,3.65263e+06,146038,1610,7.44953e+06,1309,4.08328e+06,1469384
FORMULA HealthRecord-PT-12-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AG(E(((u13.p132==1)||(u12.p149==1)) U A(((((((((((((AX(((((((((i8.u11.p99==1)||(i8.u11.p100==1))||(u13.p135==1))||(u5.p68==1))||(i3.u4.p39==1))||(u2.p54==1))||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u13.p157==1)))||(u2.p45==1))) + (u13.p128==1)) + (u7.p82==1)) + (u1.p35==1)) + (u2.p54==1)) + (u0.p8==1)) + (u1.p25==1)) + (u2.p43==1)) + (u1.p27==1)) + (u13.p142==1)) + (i3.u4.p61==1)) + (u2.p47==1)) + (((((((((((u1.p33==1)||(u0.p6==1))||(u6.p71==1))||(u0.p9==1))||(u1.p25==1))||(i8.u11.p91==1))||(u7.p78==1))||((i8.u11.p114==1)&&(u13.p139==1)))||((u8.p87==1)&&(u13.p157==1)))&&((((((((u1.p35==1)||(u2.p54==1))||(i3.u4.p57==1))||(u2.p43==1))||(u2.p45==1))||(u0.p14==1))||(u1.p30==1))||((u6.p73==1)&&(u13.p157==1))))&&(((((((((((((((u5.p64==1)||(i8.u11.p96==1))||(u0.p18==1))||(u0.p8==1))||(u6.p75==1))||(u1.p30==1))||(u0.p15==1))||(u2.p51==1))||(i8.u11.p98==1))||(u7.p82==1))||(u12.p151==1))||(u13.p136==1))||(u1.p31==1))||((u0.p16==1)&&(u13.p157==1)))||((i8.u11.p114==1)&&(u13.p137==1))))) U (!(E((((((i8.u10.p113==1)||((u2.p54==1)&&(u13.p157==1)))||(u13.p129==1))||(i8.u11.p106==1))||(u2.p45==1)) U (u0.p10==1))) + !(EF(((i8.u11.p98==1)||(u2.p54==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(((u13.p132==1)||(u12.p149==1)) U !((E(!((!(E((((((i8.u10.p113==1)||((u2.p54==1)&&(u13.p157==1)))||(u13.p129==1))||(i8.u11.p106==1))||(u2.p45==1)) U (u0.p10==1))) + !(E(TRUE U ((i8.u11.p98==1)||(u2.p54==1)))))) U (!(((((((((((((!(EX(!(((((((((i8.u11.p99==1)||(i8.u11.p100==1))||(u13.p135==1))||(u5.p68==1))||(i3.u4.p39==1))||(u2.p54==1))||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u13.p157==1)))||(u2.p45==1))))) + (u13.p128==1)) + (u7.p82==1)) + (u1.p35==1)) + (u2.p54==1)) + (u0.p8==1)) + (u1.p25==1)) + (u2.p43==1)) + (u1.p27==1)) + (u13.p142==1)) + (i3.u4.p61==1)) + (u2.p47==1)) + (((((((((((u1.p33==1)||(u0.p6==1))||(u6.p71==1))||(u0.p9==1))||(u1.p25==1))||(i8.u11.p91==1))||(u7.p78==1))||((i8.u11.p114==1)&&(u13.p139==1)))||((u8.p87==1)&&(u13.p157==1)))&&((((((((u1.p35==1)||(u2.p54==1))||(i3.u4.p57==1))||(u2.p43==1))||(u2.p45==1))||(u0.p14==1))||(u1.p30==1))||((u6.p73==1)&&(u13.p157==1))))&&(((((((((((((((u5.p64==1)||(i8.u11.p96==1))||(u0.p18==1))||(u0.p8==1))||(u6.p75==1))||(u1.p30==1))||(u0.p15==1))||(u2.p51==1))||(i8.u11.p98==1))||(u7.p82==1))||(u12.p151==1))||(u13.p136==1))||(u1.p31==1))||((u0.p16==1)&&(u13.p157==1)))||((i8.u11.p114==1)&&(u13.p137==1)))))) * !((!(E((((((i8.u10.p113==1)||((u2.p54==1)&&(u13.p157==1)))||(u13.p129==1))||(i8.u11.p106==1))||(u2.p45==1)) U (u0.p10==1))) + !(E(TRUE U ((i8.u11.p98==1)||(u2.p54==1)))))))) + EG(!((!(E((((((i8.u10.p113==1)||((u2.p54==1)&&(u13.p157==1)))||(u13.p129==1))||(i8.u11.p106==1))||(u2.p45==1)) U (u0.p10==1))) + !(E(TRUE U ((i8.u11.p98==1)||(u2.p54==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 5,0,158.084,2360700,1,0,3.97941e+06,158491,1806,8.02529e+06,1324,4.20145e+06,1651890
FORMULA HealthRecord-PT-12-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: A((((((AF((((((((((u13.p144==1)||((u1.p35==1)&&(u13.p157==1)))||(i8.u11.p116==1))||(u6.p71==1))||(u0.p8==1))||(u0.p9==1))||((i8.u11.p114==1)&&(u13.p133==1)))||(i8.u11.p93==1))||(i8.u10.p111==1))) * (u0.p10==1)) * AF(((((((((((i3.u4.p1==1)||((i8.u11.p114==1)&&(u13.p154==1)))||(u1.p34==1))||((u7.p80==1)&&(u13.p157==1)))||((u0.p16==1)&&(u13.p157==1)))||(u13.p132==1))||(u6.p75==1))||(i8.u11.p102==1))||(u13.p120==1))||(u2.p46==1)))) * (u1.p24==0)) * (u7.p77==0)) * EF(EG(((((((((u0.p18==1)||((i8.u11.p114==1)&&(u13.p141==1)))||(u12.p149==1))||(i3.u4.p117==1))||(u0.p12==1))||((u2.p38==1)&&(u13.p157==1)))||(i8.u11.p92==1))||(i8.u11.p94==1))))) U A((((((((EX(((((((((((((((((u0.p16==1)&&(u13.p157==1))||(u13.p134==1))||(i8.u11.p102==1))||(u0.p8==1))||(u6.p72==1))||(u0.p9==1))||((u6.p73==1)&&(u13.p157==1)))||(u7.p77==1))||(u13.p140==1))||(u2.p49==1))||((u1.p35==1)&&(u13.p157==1)))||(i8.u11.p100==1))||(u12.p149==1))||(u2.p56==1))&&((((u5.p64==1)||(i8.u11.p102==1))||(u13.p142==1))||(u2.p46==1)))) * (u0.p16==0)) * (i8.u11.p99==0)) * (u5.p68==0)) * (u1.p29==0)) * (u5.p63==0)) * !(EX((((((((u1.p33==1)||((u7.p80==1)&&(u13.p157==1)))||(i3.u4.p69==1))||(u13.p134==1))||(i8.u11.p116==1))||(u0.p10==1))||(u13.p153==1))))) * ((((((u13.p131==1)||(u2.p52==1))||(u8.p86==1))||(u2.p43==1))||((u1.p35==1)&&(u13.p157==1)))||((i8.u11.p114==1)&&(u13.p127==1)))) U ((((((((((u13.p152==0)&&(u1.p27==0))&&(i3.u4.p61==0))&&(u7.p77==0))&&(u0.p14==0))&&(u5.p63==0)) * AF(E((((((u13.p146==1)||(u1.p35==1))||(i8.u11.p101==1))||(u8.p85==1))||(u13.p159==1)) U (u13.p142==1)))) * ((i8.u11.p114==0)||(u13.p154==0))) * ((u7.p80==0)||(u13.p157==0))) * ((u0.p16==0)||(u13.p157==0)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(((((((((((u13.p152==0)&&(u1.p27==0))&&(i3.u4.p61==0))&&(u7.p77==0))&&(u0.p14==0))&&(u5.p63==0)) * !(EG(!(E((((((u13.p146==1)||(u1.p35==1))||(i8.u11.p101==1))||(u8.p85==1))||(u13.p159==1)) U (u13.p142==1)))))) * ((i8.u11.p114==0)||(u13.p154==0))) * ((u7.p80==0)||(u13.p157==0))) * ((u0.p16==0)||(u13.p157==0)))) U (!((((((((EX(((((((((((((((((u0.p16==1)&&(u13.p157==1))||(u13.p134==1))||(i8.u11.p102==1))||(u0.p8==1))||(u6.p72==1))||(u0.p9==1))||((u6.p73==1)&&(u13.p157==1)))||(u7.p77==1))||(u13.p140==1))||(u2.p49==1))||((u1.p35==1)&&(u13.p157==1)))||(i8.u11.p100==1))||(u12.p149==1))||(u2.p56==1))&&((((u5.p64==1)||(i8.u11.p102==1))||(u13.p142==1))||(u2.p46==1)))) * (u0.p16==0)) * (i8.u11.p99==0)) * (u5.p68==0)) * (u1.p29==0)) * (u5.p63==0)) * !(EX((((((((u1.p33==1)||((u7.p80==1)&&(u13.p157==1)))||(i3.u4.p69==1))||(u13.p134==1))||(i8.u11.p116==1))||(u0.p10==1))||(u13.p153==1))))) * ((((((u13.p131==1)||(u2.p52==1))||(u8.p86==1))||(u2.p43==1))||((u1.p35==1)&&(u13.p157==1)))||((i8.u11.p114==1)&&(u13.p127==1))))) * !(((((((((((u13.p152==0)&&(u1.p27==0))&&(i3.u4.p61==0))&&(u7.p77==0))&&(u0.p14==0))&&(u5.p63==0)) * !(EG(!(E((((((u13.p146==1)||(u1.p35==1))||(i8.u11.p101==1))||(u8.p85==1))||(u13.p159==1)) U (u13.p142==1)))))) * ((i8.u11.p114==0)||(u13.p154==0))) * ((u7.p80==0)||(u13.p157==0))) * ((u0.p16==0)||(u13.p157==0)))))) + EG(!(((((((((((u13.p152==0)&&(u1.p27==0))&&(i3.u4.p61==0))&&(u7.p77==0))&&(u0.p14==0))&&(u5.p63==0)) * !(EG(!(E((((((u13.p146==1)||(u1.p35==1))||(i8.u11.p101==1))||(u8.p85==1))||(u13.p159==1)) U (u13.p142==1)))))) * ((i8.u11.p114==0)||(u13.p154==0))) * ((u7.p80==0)||(u13.p157==0))) * ((u0.p16==0)||(u13.p157==0))))))))))) * !(E(!(!((E(!(((((((((((u13.p152==0)&&(u1.p27==0))&&(i3.u4.p61==0))&&(u7.p77==0))&&(u0.p14==0))&&(u5.p63==0)) * !(EG(!(E((((((u13.p146==1)||(u1.p35==1))||(i8.u11.p101==1))||(u8.p85==1))||(u13.p159==1)) U (u13.p142==1)))))) * ((i8.u11.p114==0)||(u13.p154==0))) * ((u7.p80==0)||(u13.p157==0))) * ((u0.p16==0)||(u13.p157==0)))) U (!((((((((EX(((((((((((((((((u0.p16==1)&&(u13.p157==1))||(u13.p134==1))||(i8.u11.p102==1))||(u0.p8==1))||(u6.p72==1))||(u0.p9==1))||((u6.p73==1)&&(u13.p157==1)))||(u7.p77==1))||(u13.p140==1))||(u2.p49==1))||((u1.p35==1)&&(u13.p157==1)))||(i8.u11.p100==1))||(u12.p149==1))||(u2.p56==1))&&((((u5.p64==1)||(i8.u11.p102==1))||(u13.p142==1))||(u2.p46==1)))) * (u0.p16==0)) * (i8.u11.p99==0)) * (u5.p68==0)) * (u1.p29==0)) * (u5.p63==0)) * !(EX((((((((u1.p33==1)||((u7.p80==1)&&(u13.p157==1)))||(i3.u4.p69==1))||(u13.p134==1))||(i8.u11.p116==1))||(u0.p10==1))||(u13.p153==1))))) * ((((((u13.p131==1)||(u2.p52==1))||(u8.p86==1))||(u2.p43==1))||((u1.p35==1)&&(u13.p157==1)))||((i8.u11.p114==1)&&(u13.p127==1))))) * !(((((((((((u13.p152==0)&&(u1.p27==0))&&(i3.u4.p61==0))&&(u7.p77==0))&&(u0.p14==0))&&(u5.p63==0)) * !(EG(!(E((((((u13.p146==1)||(u1.p35==1))||(i8.u11.p101==1))||(u8.p85==1))||(u13.p159==1)) U (u13.p142==1)))))) * ((i8.u11.p114==0)||(u13.p154==0))) * ((u7.p80==0)||(u13.p157==0))) * ((u0.p16==0)||(u13.p157==0)))))) + EG(!(((((((((((u13.p152==0)&&(u1.p27==0))&&(i3.u4.p61==0))&&(u7.p77==0))&&(u0.p14==0))&&(u5.p63==0)) * !(EG(!(E((((((u13.p146==1)||(u1.p35==1))||(i8.u11.p101==1))||(u8.p85==1))||(u13.p159==1)) U (u13.p142==1)))))) * ((i8.u11.p114==0)||(u13.p154==0))) * ((u7.p80==0)||(u13.p157==0))) * ((u0.p16==0)||(u13.p157==0)))))))) U (!((((((!(EG(!((((((((((u13.p144==1)||((u1.p35==1)&&(u13.p157==1)))||(i8.u11.p116==1))||(u6.p71==1))||(u0.p8==1))||(u0.p9==1))||((i8.u11.p114==1)&&(u13.p133==1)))||(i8.u11.p93==1))||(i8.u10.p111==1))))) * (u0.p10==1)) * !(EG(!(((((((((((i3.u4.p1==1)||((i8.u11.p114==1)&&(u13.p154==1)))||(u1.p34==1))||((u7.p80==1)&&(u13.p157==1)))||((u0.p16==1)&&(u13.p157==1)))||(u13.p132==1))||(u6.p75==1))||(i8.u11.p102==1))||(u13.p120==1))||(u2.p46==1)))))) * (u1.p24==0)) * (u7.p77==0)) * E(TRUE U EG(((((((((u0.p18==1)||((i8.u11.p114==1)&&(u13.p141==1)))||(u12.p149==1))||(i3.u4.p117==1))||(u0.p12==1))||((u2.p38==1)&&(u13.p157==1)))||(i8.u11.p92==1))||(i8.u11.p94==1)))))) * !(!((E(!(((((((((((u13.p152==0)&&(u1.p27==0))&&(i3.u4.p61==0))&&(u7.p77==0))&&(u0.p14==0))&&(u5.p63==0)) * !(EG(!(E((((((u13.p146==1)||(u1.p35==1))||(i8.u11.p101==1))||(u8.p85==1))||(u13.p159==1)) U (u13.p142==1)))))) * ((i8.u11.p114==0)||(u13.p154==0))) * ((u7.p80==0)||(u13.p157==0))) * ((u0.p16==0)||(u13.p157==0)))) U (!((((((((EX(((((((((((((((((u0.p16==1)&&(u13.p157==1))||(u13.p134==1))||(i8.u11.p102==1))||(u0.p8==1))||(u6.p72==1))||(u0.p9==1))||((u6.p73==1)&&(u13.p157==1)))||(u7.p77==1))||(u13.p140==1))||(u2.p49==1))||((u1.p35==1)&&(u13.p157==1)))||(i8.u11.p100==1))||(u12.p149==1))||(u2.p56==1))&&((((u5.p64==1)||(i8.u11.p102==1))||(u13.p142==1))||(u2.p46==1)))) * (u0.p16==0)) * (i8.u11.p99==0)) * (u5.p68==0)) * (u1.p29==0)) * (u5.p63==0)) * !(EX((((((((u1.p33==1)||((u7.p80==1)&&(u13.p157==1)))||(i3.u4.p69==1))||(u13.p134==1))||(i8.u11.p116==1))||(u0.p10==1))||(u13.p153==1))))) * ((((((u13.p131==1)||(u2.p52==1))||(u8.p86==1))||(u2.p43==1))||((u1.p35==1)&&(u13.p157==1)))||((i8.u11.p114==1)&&(u13.p127==1))))) * !(((((((((((u13.p152==0)&&(u1.p27==0))&&(i3.u4.p61==0))&&(u7.p77==0))&&(u0.p14==0))&&(u5.p63==0)) * !(EG(!(E((((((u13.p146==1)||(u1.p35==1))||(i8.u11.p101==1))||(u8.p85==1))||(u13.p159==1)) U (u13.p142==1)))))) * ((i8.u11.p114==0)||(u13.p154==0))) * ((u7.p80==0)||(u13.p157==0))) * ((u0.p16==0)||(u13.p157==0)))))) + EG(!(((((((((((u13.p152==0)&&(u1.p27==0))&&(i3.u4.p61==0))&&(u7.p77==0))&&(u0.p14==0))&&(u5.p63==0)) * !(EG(!(E((((((u13.p146==1)||(u1.p35==1))||(i8.u11.p101==1))||(u8.p85==1))||(u13.p159==1)) U (u13.p142==1)))))) * ((i8.u11.p114==0)||(u13.p154==0))) * ((u7.p80==0)||(u13.p157==0))) * ((u0.p16==0)||(u13.p157==0))))))))))))] != 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
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 9
Fast SCC detection found an SCC at level 10
(forward)formula 6,0,192.052,2484516,1,0,4.21012e+06,164990,1248,8.47575e+06,1089,4.25198e+06,822017
FORMULA HealthRecord-PT-12-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF((AX(((A((((((((i8.u11.p114==1)&&(u13.p135==1))||((((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(i3.u4.p60==1))&&(u5.p67==1))&&(u6.p74==1))&&(u7.p81==1))&&(u8.p88==1))&&(i8.u11.p115==1))&&(u13.p152==1)))||(u13.p122==1))||(u1.p25==1))||(u13.p153==1))||(u2.p46==1)) U (((i8.u11.p99==1)||(u0.p9==1))||(i8.u9.p109==1))) + (((((((((((((((((i8.u11.p114==1)&&(u13.p154==1))||(i3.u4.p83==1))||(u0.p5==1))||(u0.p8==1))||(u0.p10==1))||(i8.u11.p91==1))||(u1.p26==1))||((i8.u11.p114==1)&&(u13.p148==1)))||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u13.p153==1)))||(u2.p48==1))||(u0.p8==1))||(u6.p75==1))||(i8.u11.p105==1))||(u1.p31==1))&&((((((((i8.u11.p97==1)||(u0.p16==1))||(u7.p82==1))||((u0.p16==1)&&(u13.p157==1)))||(i8.u11.p116==1))||((i8.u11.p114==1)&&(u13.p131==1)))||(u1.p27==1))||(u7.p79==1)))&&((((((i8.u11.p99==1)||((u1.p35==1)&&(u13.p157==1)))||(u6.p71==1))||(u7.p77==1))||(u13.p124==1))||(u7.p78==1)))) + !(EG(((((((((i8.u11.p96==1)||(i8.u11.p99==1))||(u13.p118==1))||(u2.p40==1))||(i8.u9.p110==1))||(i3.u4.p76==1))||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u13.p140==1)))||((i8.u11.p114==1)&&(u13.p129==1))))))) * EF((((u1.p34==1)||(i8.u11.p101==1))||(u1.p23==1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(EX(!(((!((E(!((((i8.u11.p99==1)||(u0.p9==1))||(i8.u9.p109==1))) U (!((((((((i8.u11.p114==1)&&(u13.p135==1))||((((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(i3.u4.p60==1))&&(u5.p67==1))&&(u6.p74==1))&&(u7.p81==1))&&(u8.p88==1))&&(i8.u11.p115==1))&&(u13.p152==1)))||(u13.p122==1))||(u1.p25==1))||(u13.p153==1))||(u2.p46==1))) * !((((i8.u11.p99==1)||(u0.p9==1))||(i8.u9.p109==1))))) + EG(!((((i8.u11.p99==1)||(u0.p9==1))||(i8.u9.p109==1)))))) + (((((((((((((((((i8.u11.p114==1)&&(u13.p154==1))||(i3.u4.p83==1))||(u0.p5==1))||(u0.p8==1))||(u0.p10==1))||(i8.u11.p91==1))||(u1.p26==1))||((i8.u11.p114==1)&&(u13.p148==1)))||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u13.p153==1)))||(u2.p48==1))||(u0.p8==1))||(u6.p75==1))||(i8.u11.p105==1))||(u1.p31==1))&&((((((((i8.u11.p97==1)||(u0.p16==1))||(u7.p82==1))||((u0.p16==1)&&(u13.p157==1)))||(i8.u11.p116==1))||((i8.u11.p114==1)&&(u13.p131==1)))||(u1.p27==1))||(u7.p79==1)))&&((((((i8.u11.p99==1)||((u1.p35==1)&&(u13.p157==1)))||(u6.p71==1))||(u7.p77==1))||(u13.p124==1))||(u7.p78==1)))) + !(EG(((((((((i8.u11.p96==1)||(i8.u11.p99==1))||(u13.p118==1))||(u2.p40==1))||(i8.u9.p110==1))||(i3.u4.p76==1))||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u13.p140==1)))||((i8.u11.p114==1)&&(u13.p129==1)))))))))),TRUE) * (((u1.p34==1)||(i8.u11.p101==1))||(u1.p23==1)))] != FALSE
(forward)formula 7,1,197.262,2484516,1,0,4.21012e+06,164990,1843,8.47575e+06,1254,4.25198e+06,1159416
FORMULA HealthRecord-PT-12-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AG(A(EF((((i8.u11.p100==0)&&(i8.u11.p116==0))&&(u2.p46==0))) U ((!(EF((u13.p124==1))) + !(AX(AF((u1.p33==1))))) + ((((((((((u2.p46==0)&&(u2.p49==0))&&(u13.p130==0))&&(u5.p64==0))&&(i8.u11.p116==0))&&(u6.p70==0))&&(i3.u4.p61==0))&&(i8.u11.p92==0))&&((((((((((u0.p17==0)||(u1.p36==0))||(u2.p55==0))||(i3.u4.p60==0))||(u5.p67==0))||(u6.p74==0))||(u7.p81==0))||(u8.p88==0))||(i8.u11.p114==0))||(u13.p158==0)))&&((((i3.u4.p0==0)&&((u5.p66==0)||(u13.p157==0)))&&((((u0.p16==0)||(u1.p35==0))||(u2.p54==0))||(u13.p157==0)))||((((((((u2.p50==0)&&(u12.p151==0))&&(u0.p11==0))&&(u0.p12==0))&&(u13.p159==0))&&(u0.p13==0))&&(u13.p141==0))&&((((u0.p16==0)||(u1.p35==0))||(u2.p54==0))||(u13.p153==0))))))))
=> equivalent forward existential formula: ([(FwdU((((FwdU(FwdU(Init,TRUE),!(((!(E(TRUE U (u13.p124==1))) + !(!(EX(!(!(EG(!((u1.p33==1))))))))) + ((((((((((u2.p46==0)&&(u2.p49==0))&&(u13.p130==0))&&(u5.p64==0))&&(i8.u11.p116==0))&&(u6.p70==0))&&(i3.u4.p61==0))&&(i8.u11.p92==0))&&((((((((((u0.p17==0)||(u1.p36==0))||(u2.p55==0))||(i3.u4.p60==0))||(u5.p67==0))||(u6.p74==0))||(u7.p81==0))||(u8.p88==0))||(i8.u11.p114==0))||(u13.p158==0)))&&((((i3.u4.p0==0)&&((u5.p66==0)||(u13.p157==0)))&&((((u0.p16==0)||(u1.p35==0))||(u2.p54==0))||(u13.p157==0)))||((((((((u2.p50==0)&&(u12.p151==0))&&(u0.p11==0))&&(u0.p12==0))&&(u13.p159==0))&&(u0.p13==0))&&(u13.p141==0))&&((((u0.p16==0)||(u1.p35==0))||(u2.p54==0))||(u13.p153==0)))))))) * !(E(TRUE U (((i8.u11.p100==0)&&(i8.u11.p116==0))&&(u2.p46==0))))) * !(((((((((((u2.p46==0)&&(u2.p49==0))&&(u13.p130==0))&&(u5.p64==0))&&(i8.u11.p116==0))&&(u6.p70==0))&&(i3.u4.p61==0))&&(i8.u11.p92==0))&&((((((((((u0.p17==0)||(u1.p36==0))||(u2.p55==0))||(i3.u4.p60==0))||(u5.p67==0))||(u6.p74==0))||(u7.p81==0))||(u8.p88==0))||(i8.u11.p114==0))||(u13.p158==0)))&&((((i3.u4.p0==0)&&((u5.p66==0)||(u13.p157==0)))&&((((u0.p16==0)||(u1.p35==0))||(u2.p54==0))||(u13.p157==0)))||((((((((u2.p50==0)&&(u12.p151==0))&&(u0.p11==0))&&(u0.p12==0))&&(u13.p159==0))&&(u0.p13==0))&&(u13.p141==0))&&((((u0.p16==0)||(u1.p35==0))||(u2.p54==0))||(u13.p153==0))))))) * !(!(!(EX(!(!(EG(!((u1.p33==1)))))))))),TRUE) * (u13.p124==1))] = FALSE * [FwdG(FwdU(Init,TRUE),!(((!(E(TRUE U (u13.p124==1))) + !(!(EX(!(!(EG(!((u1.p33==1))))))))) + ((((((((((u2.p46==0)&&(u2.p49==0))&&(u13.p130==0))&&(u5.p64==0))&&(i8.u11.p116==0))&&(u6.p70==0))&&(i3.u4.p61==0))&&(i8.u11.p92==0))&&((((((((((u0.p17==0)||(u1.p36==0))||(u2.p55==0))||(i3.u4.p60==0))||(u5.p67==0))||(u6.p74==0))||(u7.p81==0))||(u8.p88==0))||(i8.u11.p114==0))||(u13.p158==0)))&&((((i3.u4.p0==0)&&((u5.p66==0)||(u13.p157==0)))&&((((u0.p16==0)||(u1.p35==0))||(u2.p54==0))||(u13.p157==0)))||((((((((u2.p50==0)&&(u12.p151==0))&&(u0.p11==0))&&(u0.p12==0))&&(u13.p159==0))&&(u0.p13==0))&&(u13.p141==0))&&((((u0.p16==0)||(u1.p35==0))||(u2.p54==0))||(u13.p153==0))))))))] = FALSE)
(forward)formula 8,1,200.482,2484516,1,0,4.21012e+06,164990,2010,8.47575e+06,1275,4.25198e+06,1329240
FORMULA HealthRecord-PT-12-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: AG(E(E((((((((((((((u2.p50==1)||(u13.p134==1))||(i8.u11.p106==1))||(i3.u3.p58==1))||(u2.p52==1))||(u12.p151==1))||(i3.u4.p117==1))||(u2.p54==1))||(i8.u11.p107==1))||(u1.p26==1))||(u2.p44==1))||(u0.p13==1)) + AX(((((u0.p16==1)&&(u13.p157==1))||(i3.u4.p69==1))||(i8.u11.p105==1)))) U !(AX(((((((u8.p87==1)&&(u13.p157==1))||(u1.p23==1))||(u13.p152==1))||(i8.u11.p92==1))||(u2.p46==1))))) U (((((((((((AF(AG((((((((i8.u11.p97==1)||(i3.u4.p83==1))||((u1.p35==1)&&(u13.p157==1)))||(u6.p71==1))||(u8.p86==1))||(u6.p75==1))||(u1.p28==1)))) + (u2.p49==1)) + (i8.u11.p98==1)) + (u0.p7==1)) + (u1.p24==1)) + (u2.p40==1)) + (i8.u10.p111==1)) + AG((((u0.p5==1)||(u13.p120==1))||(u0.p14==1)))) + ((((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(i3.u4.p60==1))&&(u5.p67==1))&&(u6.p74==1))&&(u7.p81==1))&&(u8.p88==1))&&(i8.u11.p114==1))&&(u13.p158==1))) + ((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u13.p147==1))) + ((u0.p16==1)&&(u13.p157==1))) + (AX(((((((((u0.p16==1)||(u1.p33==1))||(u2.p54==1))||(u1.p24==1))||(u1.p26==1))||(i8.u11.p105==1))||(u1.p29==1))||(u2.p47==1))) * AF((((((((i3.u4.p1==1)||(i8.u11.p96==1))||(u12.p151==1))||(i8.u11.p103==1))||(u13.p153==1))||(u2.p42==1))||(i3.u4.p76==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(E((((((((((((((u2.p50==1)||(u13.p134==1))||(i8.u11.p106==1))||(i3.u3.p58==1))||(u2.p52==1))||(u12.p151==1))||(i3.u4.p117==1))||(u2.p54==1))||(i8.u11.p107==1))||(u1.p26==1))||(u2.p44==1))||(u0.p13==1)) + !(EX(!(((((u0.p16==1)&&(u13.p157==1))||(i3.u4.p69==1))||(i8.u11.p105==1)))))) U !(!(EX(!(((((((u8.p87==1)&&(u13.p157==1))||(u1.p23==1))||(u13.p152==1))||(i8.u11.p92==1))||(u2.p46==1))))))) U (((((((((((!(EG(!(!(E(TRUE U !((((((((i8.u11.p97==1)||(i3.u4.p83==1))||((u1.p35==1)&&(u13.p157==1)))||(u6.p71==1))||(u8.p86==1))||(u6.p75==1))||(u1.p28==1)))))))) + (u2.p49==1)) + (i8.u11.p98==1)) + (u0.p7==1)) + (u1.p24==1)) + (u2.p40==1)) + (i8.u10.p111==1)) + !(E(TRUE U !((((u0.p5==1)||(u13.p120==1))||(u0.p14==1)))))) + ((((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(i3.u4.p60==1))&&(u5.p67==1))&&(u6.p74==1))&&(u7.p81==1))&&(u8.p88==1))&&(i8.u11.p114==1))&&(u13.p158==1))) + ((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u13.p147==1))) + ((u0.p16==1)&&(u13.p157==1))) + (!(EX(!(((((((((u0.p16==1)||(u1.p33==1))||(u2.p54==1))||(u1.p24==1))||(u1.p26==1))||(i8.u11.p105==1))||(u1.p29==1))||(u2.p47==1))))) * !(EG(!((((((((i3.u4.p1==1)||(i8.u11.p96==1))||(u12.p151==1))||(i8.u11.p103==1))||(u13.p153==1))||(u2.p42==1))||(i3.u4.p76==1))))))))))] = FALSE
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 9,0,210.651,2484516,1,0,4.21012e+06,164990,2152,8.47575e+06,1293,4.25198e+06,1799724
FORMULA HealthRecord-PT-12-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EX(E(AX(EG(EF(((((((((u13.p146==1)||(u0.p16==1))||(u1.p34==1))||(u0.p18==1))||(u1.p25==1))||(u0.p9==1))||((u2.p54==1)&&(u13.p157==1)))||((u1.p35==1)&&(u13.p157==1)))))) U (((((u2.p49==1)||(u2.p41==1))||(u2.p43==1))||(u2.p46==1))||((i8.u11.p114==1)&&(u13.p125==1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),!(EX(!(EG(E(TRUE U ((((((((u13.p146==1)||(u0.p16==1))||(u1.p34==1))||(u0.p18==1))||(u1.p25==1))||(u0.p9==1))||((u2.p54==1)&&(u13.p157==1)))||((u1.p35==1)&&(u13.p157==1))))))))) * (((((u2.p49==1)||(u2.p41==1))||(u2.p43==1))||(u2.p46==1))||((i8.u11.p114==1)&&(u13.p125==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,1,271.918,2734788,1,0,4.5774e+06,190872,835,9.19711e+06,957,4.25198e+06,273877
FORMULA HealthRecord-PT-12-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EG(AX((AX(((((((((((u0.p5==0)&&(u1.p32==0))&&((((((((((u0.p17==0)||(u1.p36==0))||(u2.p55==0))||(i3.u4.p60==0))||(u5.p67==0))||(u6.p74==0))||(u7.p81==0))||(u8.p88==0))||(i8.u11.p115==0))||(u13.p152==0)))&&(u8.p84==0))&&(u0.p5==0))&&(u6.p71==0))&&(u2.p54==0))&&(i3.u4.p90==0))&&(u0.p13==0))&&(u13.p124==0))) * EG((((((((((((((((((((u5.p64==0)&&(u13.p144==0))&&(i8.u10.p113==0))&&(i8.u11.p100==0))&&(u6.p70==0))&&(u13.p152==0))&&(i3.u4.p61==0))&&(u1.p28==0))&&(i8.u9.p109==0))&&(u1.p32==0))&&(u5.p64==0))&&(i8.u10.p112==0))&&((u7.p80==0)||(u13.p157==0)))&&(u2.p53==0))&&((((u0.p16==0)||(u1.p35==0))||(u2.p54==0))||(u13.p132==0)))&&(u13.p153==0))&&(u2.p42==0))&&(u13.p142==0))&&(i8.u11.p94==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((!(EX(!(((((((((((u0.p5==0)&&(u1.p32==0))&&((((((((((u0.p17==0)||(u1.p36==0))||(u2.p55==0))||(i3.u4.p60==0))||(u5.p67==0))||(u6.p74==0))||(u7.p81==0))||(u8.p88==0))||(i8.u11.p115==0))||(u13.p152==0)))&&(u8.p84==0))&&(u0.p5==0))&&(u6.p71==0))&&(u2.p54==0))&&(i3.u4.p90==0))&&(u0.p13==0))&&(u13.p124==0))))) * EG((((((((((((((((((((u5.p64==0)&&(u13.p144==0))&&(i8.u10.p113==0))&&(i8.u11.p100==0))&&(u6.p70==0))&&(u13.p152==0))&&(i3.u4.p61==0))&&(u1.p28==0))&&(i8.u9.p109==0))&&(u1.p32==0))&&(u5.p64==0))&&(i8.u10.p112==0))&&((u7.p80==0)||(u13.p157==0)))&&(u2.p53==0))&&((((u0.p16==0)||(u1.p35==0))||(u2.p54==0))||(u13.p132==0)))&&(u13.p153==0))&&(u2.p42==0))&&(u13.p142==0))&&(i8.u11.p94==0))))))))] != FALSE
(forward)formula 11,0,276.416,2734788,1,0,4.5774e+06,190872,1166,9.19711e+06,1131,4.25198e+06,577429
FORMULA HealthRecord-PT-12-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AX(AX((((((((((i8.u11.p97==1)||(i3.u4.p39==1))||(u0.p10==1))||(u2.p43==1))||(u1.p28==1))||((u1.p35==1)&&(u13.p157==1)))||((i8.u11.p114==1)&&(u13.p143==1)))&&(((((u2.p51==1)||(u13.p134==1))||(u8.p84==1))||(u1.p24==1))||(u0.p9==1))) + ((AX((((((((((((u13.p118==1)||(u0.p15==1))||(u1.p33==1))||((u2.p54==1)&&(u13.p157==1)))||(i3.u4.p20==1))||(u6.p70==1))||(u2.p56==1))||(u13.p137==1))||(u1.p28==1))||(u2.p45==1))||(u2.p44==1))) * EX((((u1.p37==1)||(u1.p21==1))||(i3.u3.p58==1)))) * (EF((u0.p2==1)) + EG((((((((((u0.p5==1)||((u8.p87==1)&&(u13.p157==1)))||(u6.p75==1))||(u2.p43==1))||(i8.u11.p105==1))||((i8.u11.p114==1)&&(u13.p148==1)))||(u13.p142==1))||(i8.u11.p93==1))||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u13.p140==1)))))))))
=> equivalent forward existential formula: (([(EY((EY(EY(Init)) * !(((((((((i8.u11.p97==1)||(i3.u4.p39==1))||(u0.p10==1))||(u2.p43==1))||(u1.p28==1))||((u1.p35==1)&&(u13.p157==1)))||((i8.u11.p114==1)&&(u13.p143==1)))&&(((((u2.p51==1)||(u13.p134==1))||(u8.p84==1))||(u1.p24==1))||(u0.p9==1)))))) * !((((((((((((u13.p118==1)||(u0.p15==1))||(u1.p33==1))||((u2.p54==1)&&(u13.p157==1)))||(i3.u4.p20==1))||(u6.p70==1))||(u2.p56==1))||(u13.p137==1))||(u1.p28==1))||(u2.p45==1))||(u2.p44==1))))] = FALSE * [((EY(EY(Init)) * !(((((((((i8.u11.p97==1)||(i3.u4.p39==1))||(u0.p10==1))||(u2.p43==1))||(u1.p28==1))||((u1.p35==1)&&(u13.p157==1)))||((i8.u11.p114==1)&&(u13.p143==1)))&&(((((u2.p51==1)||(u13.p134==1))||(u8.p84==1))||(u1.p24==1))||(u0.p9==1))))) * !(EX((((u1.p37==1)||(u1.p21==1))||(i3.u3.p58==1)))))] = FALSE) * [(((EY(EY(Init)) * !(((((((((i8.u11.p97==1)||(i3.u4.p39==1))||(u0.p10==1))||(u2.p43==1))||(u1.p28==1))||((u1.p35==1)&&(u13.p157==1)))||((i8.u11.p114==1)&&(u13.p143==1)))&&(((((u2.p51==1)||(u13.p134==1))||(u8.p84==1))||(u1.p24==1))||(u0.p9==1))))) * !(EG((((((((((u0.p5==1)||((u8.p87==1)&&(u13.p157==1)))||(u6.p75==1))||(u2.p43==1))||(i8.u11.p105==1))||((i8.u11.p114==1)&&(u13.p148==1)))||(u13.p142==1))||(i8.u11.p93==1))||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u13.p140==1)))))) * !(E(TRUE U (u0.p2==1))))] = FALSE)
(forward)formula 12,0,277.706,2734788,1,0,4.5774e+06,190872,1345,9.19711e+06,1171,4.25198e+06,675033
FORMULA HealthRecord-PT-12-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
BK_STOP 1621282403526
--------------------
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-12"
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-12, 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-162124156300346"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-12.tgz
mv HealthRecord-PT-12 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;