About the Execution of ITS-Tools for HealthRecord-PT-01
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 572.455 | 46719.00 | 36625.00 | 8616.20 | FTFFFFTFFFTFFTFT | 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-162124156200258.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-01, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156200258
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 113K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 2.8K May 11 18:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 11 18:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 11 15:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 11 15:46 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 33K 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-01-CTLFireability-00
FORMULA_NAME HealthRecord-PT-01-CTLFireability-01
FORMULA_NAME HealthRecord-PT-01-CTLFireability-02
FORMULA_NAME HealthRecord-PT-01-CTLFireability-03
FORMULA_NAME HealthRecord-PT-01-CTLFireability-04
FORMULA_NAME HealthRecord-PT-01-CTLFireability-05
FORMULA_NAME HealthRecord-PT-01-CTLFireability-06
FORMULA_NAME HealthRecord-PT-01-CTLFireability-07
FORMULA_NAME HealthRecord-PT-01-CTLFireability-08
FORMULA_NAME HealthRecord-PT-01-CTLFireability-09
FORMULA_NAME HealthRecord-PT-01-CTLFireability-10
FORMULA_NAME HealthRecord-PT-01-CTLFireability-11
FORMULA_NAME HealthRecord-PT-01-CTLFireability-12
FORMULA_NAME HealthRecord-PT-01-CTLFireability-13
FORMULA_NAME HealthRecord-PT-01-CTLFireability-14
FORMULA_NAME HealthRecord-PT-01-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1621280873296
Running Version 0
[2021-05-17 19:48:06] [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 19:48:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 19:48:07] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2021-05-17 19:48:07] [INFO ] Transformed 117 places.
[2021-05-17 19:48:07] [INFO ] Transformed 218 transitions.
[2021-05-17 19:48:07] [INFO ] Found NUPN structural information;
[2021-05-17 19:48:07] [INFO ] Parsed PT model containing 117 places and 218 transitions in 124 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
[2021-05-17 19:48:07] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 19:48:07] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 19:48:07] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 19:48:07] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 19:48:07] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 19:48:07] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 19:48:07] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 19:48:07] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 19:48:07] [INFO ] Reduced 1 identical enabling conditions.
Ensure Unique test removed 5 transitions
Reduce redundant transitions removed 5 transitions.
Support contains 115 out of 117 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 117/117 places, 213/213 transitions.
Applied a total of 0 rules in 13 ms. Remains 117 /117 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2021-05-17 19:48:07] [INFO ] Flow matrix only has 205 transitions (discarded 8 similar events)
// Phase 1: matrix 205 rows 117 cols
[2021-05-17 19:48:07] [INFO ] Computed 14 place invariants in 11 ms
[2021-05-17 19:48:07] [INFO ] Implicit Places using invariants in 126 ms returned []
[2021-05-17 19:48:07] [INFO ] Flow matrix only has 205 transitions (discarded 8 similar events)
// Phase 1: matrix 205 rows 117 cols
[2021-05-17 19:48:07] [INFO ] Computed 14 place invariants in 13 ms
[2021-05-17 19:48:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 19:48:07] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2021-05-17 19:48:07] [INFO ] Flow matrix only has 205 transitions (discarded 8 similar events)
// Phase 1: matrix 205 rows 117 cols
[2021-05-17 19:48:07] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-17 19:48:07] [INFO ] Dead Transitions using invariants and state equation in 135 ms returned []
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 213/213 transitions.
[2021-05-17 19:48:07] [INFO ] Flatten gal took : 47 ms
[2021-05-17 19:48:07] [INFO ] Flatten gal took : 19 ms
[2021-05-17 19:48:08] [INFO ] Input system was already deterministic with 213 transitions.
Incomplete random walk after 100000 steps, including 5242 resets, run finished after 364 ms. (steps per millisecond=274 ) properties (out of 82) seen :74
Running SMT prover for 8 properties.
[2021-05-17 19:48:08] [INFO ] Flow matrix only has 205 transitions (discarded 8 similar events)
// Phase 1: matrix 205 rows 117 cols
[2021-05-17 19:48:08] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-17 19:48:08] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-17 19:48:08] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-17 19:48:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:48:08] [INFO ] [Real]Absence check using state equation in 34 ms returned unsat
[2021-05-17 19:48:08] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-17 19:48:08] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-17 19:48:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:48:08] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-17 19:48:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 19:48:08] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 19:48:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:48:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-17 19:48:08] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-17 19:48:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:48:08] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2021-05-17 19:48:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:48:08] [INFO ] Computed and/alt/rep : 164/173/164 causal constraints (skipped 40 transitions) in 18 ms.
[2021-05-17 19:48:08] [INFO ] Added : 47 causal constraints over 10 iterations in 154 ms. Result :sat
[2021-05-17 19:48:08] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-17 19:48:08] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 43 ms returned sat
[2021-05-17 19:48:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:48:09] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2021-05-17 19:48:09] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:48:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:48:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2021-05-17 19:48:09] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-17 19:48:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:48:09] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2021-05-17 19:48:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:48:09] [INFO ] Computed and/alt/rep : 164/173/164 causal constraints (skipped 40 transitions) in 17 ms.
[2021-05-17 19:48:09] [INFO ] Added : 48 causal constraints over 10 iterations in 120 ms. Result :sat
[2021-05-17 19:48:09] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-17 19:48:09] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-17 19:48:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:48:09] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2021-05-17 19:48:09] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-17 19:48:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:48:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-17 19:48:09] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 19:48:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:48:09] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2021-05-17 19:48:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:48:09] [INFO ] Computed and/alt/rep : 164/173/164 causal constraints (skipped 40 transitions) in 15 ms.
[2021-05-17 19:48:09] [INFO ] Added : 46 causal constraints over 10 iterations in 113 ms. Result :sat
[2021-05-17 19:48:09] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-17 19:48:09] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-17 19:48:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:48:09] [INFO ] [Real]Absence check using state equation in 46 ms returned unsat
[2021-05-17 19:48:09] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-17 19:48:09] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-17 19:48:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:48:09] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2021-05-17 19:48:09] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:48:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:48:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-17 19:48:09] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-17 19:48:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:48:09] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2021-05-17 19:48:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 19:48:09] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 3 ms to minimize.
[2021-05-17 19:48:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2021-05-17 19:48:09] [INFO ] Computed and/alt/rep : 164/173/164 causal constraints (skipped 40 transitions) in 20 ms.
[2021-05-17 19:48:09] [INFO ] Added : 46 causal constraints over 10 iterations in 128 ms. Result :sat
[2021-05-17 19:48:10] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-17 19:48:10] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-17 19:48:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:48:10] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-05-17 19:48:10] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 19:48:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:48:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-17 19:48:10] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-17 19:48:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:48:10] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-17 19:48:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 19:48:10] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 1 ms to minimize.
[2021-05-17 19:48:10] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 0 ms to minimize.
[2021-05-17 19:48:10] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2021-05-17 19:48:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 129 ms
[2021-05-17 19:48:10] [INFO ] Computed and/alt/rep : 164/173/164 causal constraints (skipped 40 transitions) in 15 ms.
[2021-05-17 19:48:10] [INFO ] Added : 52 causal constraints over 12 iterations in 133 ms. Result :sat
[2021-05-17 19:48:10] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-17 19:48:10] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-17 19:48:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:48:10] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2021-05-17 19:48:10] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:48:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:48:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-17 19:48:10] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-17 19:48:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:48:10] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2021-05-17 19:48:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 19:48:10] [INFO ] Computed and/alt/rep : 164/173/164 causal constraints (skipped 40 transitions) in 27 ms.
[2021-05-17 19:48:10] [INFO ] Added : 45 causal constraints over 9 iterations in 114 ms. Result :sat
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
Graph (trivial) has 44 edges and 117 vertex of which 10 / 117 are part of one of the 5 SCC in 27 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 40 place count 73 transition count 137
Iterating global reduction 0 with 39 rules applied. Total rules applied 79 place count 73 transition count 137
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 83 place count 69 transition count 129
Iterating global reduction 0 with 4 rules applied. Total rules applied 87 place count 69 transition count 129
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 0 with 2 rules applied. Total rules applied 89 place count 68 transition count 128
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 68 transition count 128
Applied a total of 90 rules in 73 ms. Remains 68 /117 variables (removed 49) and now considering 128/213 (removed 85) transitions.
[2021-05-17 19:48:10] [INFO ] Flatten gal took : 16 ms
[2021-05-17 19:48:10] [INFO ] Flatten gal took : 8 ms
[2021-05-17 19:48:10] [INFO ] Input system was already deterministic with 128 transitions.
[2021-05-17 19:48:10] [INFO ] Flatten gal took : 7 ms
[2021-05-17 19:48:11] [INFO ] Flatten gal took : 22 ms
[2021-05-17 19:48:11] [INFO ] Time to serialize gal into /tmp/CTLFireability1342233024546336031.gal : 6 ms
[2021-05-17 19:48:11] [INFO ] Time to serialize properties into /tmp/CTLFireability5031528681560984702.ctl : 12 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/CTLFireability1342233024546336031.gal, -t, CGAL, -ctl, /tmp/CTLFireability5031528681560984702.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/CTLFireability1342233024546336031.gal -t CGAL -ctl /tmp/CTLFireability5031528681560984702.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,201537,0.063112,6516,2,1024,5,7546,6,0,393,8582,0
Converting to forward existential form...Done !
original formula: (!(AG(AF(((((((((((p16==1)||(p49==1))||((p71==1)&&(p102==1)))||(p36==1))||(p87==1))||((p16==1)&&(p97==1)))||(p59==1))||(p42==1))||(p12==1))||((((((((p17==1)&&(p23==1))&&(p28==1))&&(p33==1))&&(p38==1))&&(p45==1))&&(p71==1))&&(p115==1)))))) * EF(AG((((((((((((p101==1)||((p16==1)&&(p93==1)))||(p5==1))||(p116==1))||(p89==1))||(p42==1))||(p13==1))||(p108==1))||(p14==1)) * !(AG((p83==1)))) * A(((((((((p65==1)||(p18==1))||(p4==1))||(p36==1))||(p100==1))||(p70==1))||(p11==1))||(p76==1)) U ((((p16==1)&&(p114==1))||(p42==1))||(p14==1)))))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(E(TRUE U !(!(EG(!(((((((((((p16==1)||(p49==1))||((p71==1)&&(p102==1)))||(p36==1))||(p87==1))||((p16==1)&&(p97==1)))||(p59==1))||(p42==1))||(p12==1))||((((((((p17==1)&&(p23==1))&&(p28==1))&&(p33==1))&&(p38==1))&&(p45==1))&&(p71==1))&&(p115==1))))))))))),TRUE) * !(E(TRUE U !((((((((((((p101==1)||((p16==1)&&(p93==1)))||(p5==1))||(p116==1))||(p89==1))||(p42==1))||(p13==1))||(p108==1))||(p14==1)) * !(!(E(TRUE U !((p83==1)))))) * !((E(!(((((p16==1)&&(p114==1))||(p42==1))||(p14==1))) U (!(((((((((p65==1)||(p18==1))||(p4==1))||(p36==1))||(p100==1))||(p70==1))||(p11==1))||(p76==1))) * !(((((p16==1)&&(p114==1))||(p42==1))||(p14==1))))) + EG(!(((((p16==1)&&(p114==1))||(p42==1))||(p14==1)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t36, t37, t38, t39, t41, t42, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t66, t67, t68, t69, t70, t71, t72, t73, t74, t75, t76, t77, t78, t79, t80, t82, t83, t91, t93, t107, t116, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/57/71/128
(forward)formula 0,0,1.47778,57980,1,0,396,346611,284,177,2805,261813,425
FORMULA HealthRecord-PT-01-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Graph (trivial) has 81 edges and 117 vertex of which 4 / 117 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 40 place count 76 transition count 138
Iterating global reduction 0 with 39 rules applied. Total rules applied 79 place count 76 transition count 138
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 85 place count 70 transition count 126
Iterating global reduction 0 with 6 rules applied. Total rules applied 91 place count 70 transition count 126
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 93 place count 70 transition count 124
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 99 place count 67 transition count 121
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
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 103 place count 65 transition count 125
Applied a total of 103 rules in 16 ms. Remains 65 /117 variables (removed 52) and now considering 125/213 (removed 88) transitions.
[2021-05-17 19:48:12] [INFO ] Flatten gal took : 7 ms
[2021-05-17 19:48:12] [INFO ] Flatten gal took : 7 ms
[2021-05-17 19:48:12] [INFO ] Input system was already deterministic with 125 transitions.
[2021-05-17 19:48:12] [INFO ] Flatten gal took : 7 ms
[2021-05-17 19:48:12] [INFO ] Flatten gal took : 7 ms
[2021-05-17 19:48:12] [INFO ] Time to serialize gal into /tmp/CTLFireability8622373434315774469.gal : 3 ms
[2021-05-17 19:48:12] [INFO ] Time to serialize properties into /tmp/CTLFireability10032342871209802645.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/CTLFireability8622373434315774469.gal, -t, CGAL, -ctl, /tmp/CTLFireability10032342871209802645.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/CTLFireability8622373434315774469.gal -t CGAL -ctl /tmp/CTLFireability10032342871209802645.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,68104,0.126886,9340,2,2314,5,13793,6,0,375,25794,0
Converting to forward existential form...Done !
original formula: EF(AG((A(((((((((((p65==1)||(p48==1))||(p68==1))||(p116==1))||(p6==1))||(p89==1))||((p71==1)&&(p94==1)))||(p11==1))||(p27==1))||(p58==1)) U (((((((((p1==1)||(p4==1))||(p6==1))||(p70==1))||(p73==1))||(p8==1))||((p16==1)&&(p114==1)))||((p71==1)&&(p92==1)))||(p14==1))) * (A(((((((p36==1)||(p87==1))||(p10==1))||(p11==1))||(p42==1))||(p111==1)) U (((((((p16==1)&&(p89==1))||(p6==1))||(p103==1))||((p71==1)&&(p96==1)))||(p106==1))||((p16==1)&&(p114==1)))) + (((p24==0)&&(p30==0))&&((p16==0)||(p114==0)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!((E(!((((((((((p1==1)||(p4==1))||(p6==1))||(p70==1))||(p73==1))||(p8==1))||((p16==1)&&(p114==1)))||((p71==1)&&(p92==1)))||(p14==1))) U (!(((((((((((p65==1)||(p48==1))||(p68==1))||(p116==1))||(p6==1))||(p89==1))||((p71==1)&&(p94==1)))||(p11==1))||(p27==1))||(p58==1))) * !((((((((((p1==1)||(p4==1))||(p6==1))||(p70==1))||(p73==1))||(p8==1))||((p16==1)&&(p114==1)))||((p71==1)&&(p92==1)))||(p14==1))))) + EG(!((((((((((p1==1)||(p4==1))||(p6==1))||(p70==1))||(p73==1))||(p8==1))||((p16==1)&&(p114==1)))||((p71==1)&&(p92==1)))||(p14==1)))))) * (!((E(!((((((((p16==1)&&(p89==1))||(p6==1))||(p103==1))||((p71==1)&&(p96==1)))||(p106==1))||((p16==1)&&(p114==1)))) U (!(((((((p36==1)||(p87==1))||(p10==1))||(p11==1))||(p42==1))||(p111==1))) * !((((((((p16==1)&&(p89==1))||(p6==1))||(p103==1))||((p71==1)&&(p96==1)))||(p106==1))||((p16==1)&&(p114==1)))))) + EG(!((((((((p16==1)&&(p89==1))||(p6==1))||(p103==1))||((p71==1)&&(p96==1)))||(p106==1))||((p16==1)&&(p114==1))))))) + (((p24==0)&&(p30==0))&&((p16==0)||(p114==0)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t33, t34, t35, t37, t39, t41, t42, t43, t44, t45, t46, t47, t48, t57, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t70, t75, t83, t85, t91, t93, t97, t113, t114, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/58/67/125
(forward)formula 0,0,3.23676,114792,1,0,514,613861,287,237,2888,613136,559
FORMULA HealthRecord-PT-01-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Graph (trivial) has 136 edges and 117 vertex of which 14 / 117 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 55 place count 55 transition count 104
Iterating global reduction 0 with 54 rules applied. Total rules applied 109 place count 55 transition count 104
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 119 place count 45 transition count 84
Iterating global reduction 0 with 10 rules applied. Total rules applied 129 place count 45 transition count 84
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 134 place count 45 transition count 79
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 136 place count 43 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 138 place count 43 transition count 73
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 140 place count 41 transition count 69
Iterating global reduction 1 with 2 rules applied. Total rules applied 142 place count 41 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 144 place count 41 transition count 67
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 148 place count 39 transition count 65
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 153 place count 39 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 38 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 155 place count 37 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 36 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 157 place count 35 transition count 56
Applied a total of 157 rules in 21 ms. Remains 35 /117 variables (removed 82) and now considering 56/213 (removed 157) transitions.
[2021-05-17 19:48:16] [INFO ] Flatten gal took : 3 ms
[2021-05-17 19:48:16] [INFO ] Flatten gal took : 18 ms
[2021-05-17 19:48:16] [INFO ] Input system was already deterministic with 56 transitions.
[2021-05-17 19:48:16] [INFO ] Flatten gal took : 3 ms
[2021-05-17 19:48:16] [INFO ] Flatten gal took : 3 ms
[2021-05-17 19:48:26] [INFO ] Time to serialize gal into /tmp/CTLFireability9935737060198999942.gal : 10188 ms
[2021-05-17 19:48:27] [INFO ] Time to serialize properties into /tmp/CTLFireability6457181103185305490.ctl : 1061 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/CTLFireability9935737060198999942.gal, -t, CGAL, -ctl, /tmp/CTLFireability6457181103185305490.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/CTLFireability9935737060198999942.gal -t CGAL -ctl /tmp/CTLFireability6457181103185305490.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,7204,0.010763,4644,2,233,5,1059,6,0,184,900,0
Converting to forward existential form...Done !
original formula: EF(EG((((p71==1)&&(p100==1))||((p16==1)&&(p97==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((p71==1)&&(p100==1))||((p16==1)&&(p97==1))))] != FALSE
Hit Full ! (commute/partial/dont) 34/0/22
(forward)formula 0,1,0.026579,5348,1,0,8,4671,19,2,978,2139,8
FORMULA HealthRecord-PT-01-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Graph (trivial) has 123 edges and 117 vertex of which 14 / 117 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 47 place count 64 transition count 121
Iterating global reduction 0 with 46 rules applied. Total rules applied 93 place count 64 transition count 121
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 101 place count 56 transition count 105
Iterating global reduction 0 with 8 rules applied. Total rules applied 109 place count 56 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 112 place count 56 transition count 102
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 1 with 6 rules applied. Total rules applied 118 place count 53 transition count 99
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 126 place count 49 transition count 110
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 127 place count 49 transition count 109
Applied a total of 127 rules in 37 ms. Remains 49 /117 variables (removed 68) and now considering 109/213 (removed 104) transitions.
[2021-05-17 19:48:27] [INFO ] Flatten gal took : 9 ms
[2021-05-17 19:48:27] [INFO ] Flatten gal took : 7 ms
[2021-05-17 19:48:27] [INFO ] Input system was already deterministic with 109 transitions.
[2021-05-17 19:48:27] [INFO ] Flatten gal took : 11 ms
[2021-05-17 19:48:27] [INFO ] Flatten gal took : 7 ms
[2021-05-17 19:48:27] [INFO ] Time to serialize gal into /tmp/CTLFireability5065963811795605159.gal : 5 ms
[2021-05-17 19:48:27] [INFO ] Time to serialize properties into /tmp/CTLFireability4604547175450045404.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/CTLFireability5065963811795605159.gal, -t, CGAL, -ctl, /tmp/CTLFireability4604547175450045404.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/CTLFireability5065963811795605159.gal -t CGAL -ctl /tmp/CTLFireability4604547175450045404.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,22341,0.079003,7348,2,1129,5,7666,6,0,297,11276,0
Converting to forward existential form...Done !
original formula: EG(A((((((((((p16==0)&&(p49==0))&&(p85==0))&&(p41==0))&&(p9==0))&&(p42==0))&&(p93==0))&&(p12==0))&&((p71==0)||(p92==0))) U (((p116==1)||(p60==1))&&((p7==1)||(p41==1)))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!((((p116==1)||(p60==1))&&((p7==1)||(p41==1)))) U (!((((((((((p16==0)&&(p49==0))&&(p85==0))&&(p41==0))&&(p9==0))&&(p42==0))&&(p93==0))&&(p12==0))&&((p71==0)||(p92==0)))) * !((((p116==1)||(p60==1))&&((p7==1)||(p41==1)))))) + EG(!((((p116==1)||(p60==1))&&((p7==1)||(p41==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, t37, t42, t43, t44, t45, t46, t47, t48, t49, t56, t62, t99, t100, t101, t103, t104, t105, t107, t108, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/54/55/109
(forward)formula 0,0,1.07116,42404,1,0,343,232525,241,144,2581,183647,367
FORMULA HealthRecord-PT-01-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2021-05-17 19:48:28] [INFO ] Flatten gal took : 18 ms
[2021-05-17 19:48:28] [INFO ] Flatten gal took : 37 ms
[2021-05-17 19:48:28] [INFO ] Applying decomposition
[2021-05-17 19:48:28] [INFO ] Flatten gal took : 10 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/graph13933157979827647198.txt, -o, /tmp/graph13933157979827647198.bin, -w, /tmp/graph13933157979827647198.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/graph13933157979827647198.bin, -l, -1, -v, -w, /tmp/graph13933157979827647198.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 19:48:28] [INFO ] Decomposing Gal with order
[2021-05-17 19:48:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 19:48:28] [INFO ] Removed a total of 47 redundant transitions.
[2021-05-17 19:48:28] [INFO ] Flatten gal took : 102 ms
[2021-05-17 19:48:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 6 ms.
[2021-05-17 19:48:28] [INFO ] Time to serialize gal into /tmp/CTLFireability297888398285962469.gal : 7 ms
[2021-05-17 19:48:29] [INFO ] Time to serialize properties into /tmp/CTLFireability9244068302710202895.ctl : 18 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/CTLFireability297888398285962469.gal, -t, CGAL, -ctl, /tmp/CTLFireability9244068302710202895.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/CTLFireability297888398285962469.gal -t CGAL -ctl /tmp/CTLFireability9244068302710202895.ctl
No direction supplied, using forward translation only.
Parsed 12 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.83784e+06,0.339696,15812,520,847,11846,17018,435,29057,278,74628,0
Converting to forward existential form...Done !
original formula: E(AG(((i6.u12.p53==1)||((((((((((i9.u15.p83==0)&&(u10.p65==0))&&(i9.u14.p88==0))&&(u0.p10==0))&&(i9.u14.p77==0))&&((u0.p16==0)||(i9.u15.p114==0)))&&((u0.p16==0)||(i9.u14.p89==0)))&&((u0.p16==0)||(i9.u14.p93==0)))&&((i6.u12.p71==0)||(i9.u14.p82==0)))&&((u0.p16==0)||(i9.u15.p114==0))))) U (E(AX((((((((i6.u12.p57==1)||(i9.u14.p96==1))||(i6.u11.p69==1))||(i6.u12.p57==1))||(i9.u15.p79==1))||(i3.u5.p31==1))||((((((((((u0.p16==0)||(i9.u14.p89==0))&&((i6.u12.p71==0)||(i9.u14.p113==0)))&&(i6.u12.p54==0))&&(u13.p106==0))&&((i6.u12.p71==0)||(i9.u14.p111==0)))&&(u0.p13==0))&&((u9.p44==0)||(i9.u15.p114==0)))&&(i9.u15.p79==0))&&(i3.u5.p31==0)))) U !(AX((((((((((i1.u1.p22==1)||((u0.p16==1)&&(i9.u15.p114==1)))||(i3.u6.p74==1))||(i3.u5.p31==1))||((u0.p16==1)&&(i9.u14.p89==1)))||(u0.p2==1))||(i9.u15.p101==1))||((u0.p16==1)&&(i9.u15.p114==1)))||(u13.p108==1))))) * AG(AF((((((((((i6.u12.p48==1)||(i9.u14.p82==1))||(u0.p5==1))||(i4.u8.p39==1))||((u0.p16==1)&&(i9.u15.p114==1)))||(i6.u12.p60==1))||(i9.u14.p78==1))&&((((((((u0.p3==1)||(u0.p4==1))||(u0.p7==1))||(u13.p106==1))||(i9.u14.p89==1))||(u0.p9==1))||(i2.u3.p26==1))||((i6.u12.p71==1)&&(i9.u14.p94==1))))&&(((((((((u0.p18==1)||(i9.u14.p85==1))||(i9.u15.p103==1))||(i1.u2.p24==1))||(i6.u12.p73==1))||(i9.u14.p89==1))||(i6.u12.p57==1))||(u0.p12==1))||(i6.u12.p63==1)))))))
=> equivalent forward existential formula: [((FwdU(Init,!(E(TRUE U !(((i6.u12.p53==1)||((((((((((i9.u15.p83==0)&&(u10.p65==0))&&(i9.u14.p88==0))&&(u0.p10==0))&&(i9.u14.p77==0))&&((u0.p16==0)||(i9.u15.p114==0)))&&((u0.p16==0)||(i9.u14.p89==0)))&&((u0.p16==0)||(i9.u14.p93==0)))&&((i6.u12.p71==0)||(i9.u14.p82==0)))&&((u0.p16==0)||(i9.u15.p114==0)))))))) * E(!(EX(!((((((((i6.u12.p57==1)||(i9.u14.p96==1))||(i6.u11.p69==1))||(i6.u12.p57==1))||(i9.u15.p79==1))||(i3.u5.p31==1))||((((((((((u0.p16==0)||(i9.u14.p89==0))&&((i6.u12.p71==0)||(i9.u14.p113==0)))&&(i6.u12.p54==0))&&(u13.p106==0))&&((i6.u12.p71==0)||(i9.u14.p111==0)))&&(u0.p13==0))&&((u9.p44==0)||(i9.u15.p114==0)))&&(i9.u15.p79==0))&&(i3.u5.p31==0)))))) U !(!(EX(!((((((((((i1.u1.p22==1)||((u0.p16==1)&&(i9.u15.p114==1)))||(i3.u6.p74==1))||(i3.u5.p31==1))||((u0.p16==1)&&(i9.u14.p89==1)))||(u0.p2==1))||(i9.u15.p101==1))||((u0.p16==1)&&(i9.u15.p114==1)))||(u13.p108==1)))))))) * !(E(TRUE U !(!(EG(!((((((((((i6.u12.p48==1)||(i9.u14.p82==1))||(u0.p5==1))||(i4.u8.p39==1))||((u0.p16==1)&&(i9.u15.p114==1)))||(i6.u12.p60==1))||(i9.u14.p78==1))&&((((((((u0.p3==1)||(u0.p4==1))||(u0.p7==1))||(u13.p106==1))||(i9.u14.p89==1))||(u0.p9==1))||(i2.u3.p26==1))||((i6.u12.p71==1)&&(i9.u14.p94==1))))&&(((((((((u0.p18==1)||(i9.u14.p85==1))||(i9.u15.p103==1))||(i1.u2.p24==1))||(i6.u12.p73==1))||(i9.u14.p89==1))||(i6.u12.p57==1))||(u0.p12==1))||(i6.u12.p63==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t66, u0.t128, u0.t129, u0.t130, u0.t131, u0.t132, u0.t133, u0.t134, u0.t135, u0.t136, u0.t137, u0.t138, u0.t139, u0.t140, u0.t141, u0.t142, u0.t143, u0.t144, u0.t145, u0.t146, u0.t147, u0.t148, u0.t149, u0.t150, u0.t151, u0.t152, u0.t153, u0.t154, u0.t155, u0.t156, u0.t158, u9.t104, u9.t105, u9.t106, u9.t107, u9.t108, u9.t109, u9.t110, u9.t111, i6.t64, i6.u12.t60, i6.u12.t61, i6.u12.t70, i6.u12.t71, i6.u12.t72, i6.u12.t73, i6.u12.t74, i6.u12.t75, i6.u12.t76, i6.u12.t77, i6.u12.t78, i6.u12.t79, i6.u12.t80, i6.u12.t81, i6.u12.t82, i6.u12.t83, i6.u12.t84, i6.u12.t85, i6.u12.t86, i6.u12.t87, i6.u12.t88, i6.u12.t89, i6.u12.t90, i6.u12.t91, i6.u12.t92, i6.u12.t93, i6.u12.t94, i6.u12.t95, i6.u12.t96, i6.u12.t97, i6.u12.t98, i6.u12.t99, i6.u12.t100, i6.u12.t101, i6.u12.t102, i6.u12.t103, i9.t50, i9.t8, i9.t1, i9.u14.t3, i9.u14.t6, i9.u14.t7, i9.u14.t14, i9.u14.t15, i9.u14.t18, i9.u14.t21, i9.u14.t24, i9.u14.t25, i9.u14.t26, i9.u14.t30, i9.u14.t31, i9.u14.t32, i9.u14.t36, i9.u14.t37, i9.u14.t38, i9.u14.t42, i9.u14.t43, i9.u14.t44, i9.u14.t48, i9.u14.t49, i9.u14.t51, i9.u14.t54, i9.u14.t55, i9.u14.t57, i9.u15.t2, i9.u15.t5, i9.u15.t9, i9.u15.t17, i9.u15.t20, i9.u15.t23, i9.u15.t28, i9.u15.t34, i9.u15.t40, i9.u15.t46, i9.u15.t53, i9.u15.t59, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/78/117/195
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
(forward)formula 0,0,1.48469,53480,1,0,65853,33550,2487,138767,1504,113657,129722
FORMULA HealthRecord-PT-01-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AX((!(AX(EF(((((((u0.p16==1)&&(i9.u14.p104==1))||(i6.u12.p73==1))||(u0.p8==1))||(i3.u6.p74==1))||(i6.u12.p50==1))))) * EF((((((((((((i6.u12.p71==1)&&(i9.u14.p86==1))||(i9.u15.p87==1))||((((((((u0.p17==1)&&(i1.u2.p23==1))&&(i2.u4.p28==1))&&(i3.u6.p33==1))&&(i4.u8.p38==1))&&(u9.p45==1))&&(i6.u12.p72==1))&&(i9.u15.p109==1)))||(u0.p8==1))||(i9.u14.p88==1))||(u9.p43==1))||(i9.u14.p93==1))||(i9.u15.p95==1))||(i9.u15.p109==1)) * EX((((((((((i9.u14.p97==1)||(u10.p67==1))||((i6.u12.p71==1)&&(i9.u14.p84==1)))||(i9.u15.p116==1))||(i6.u12.p56==1))||(i6.u12.p58==1))||(u0.p14==1))||(i3.u5.p31==1))||(i6.u12.p62==1)))))))
=> equivalent forward existential formula: ([(EY(Init) * !(EX(!(E(TRUE U ((((((u0.p16==1)&&(i9.u14.p104==1))||(i6.u12.p73==1))||(u0.p8==1))||(i3.u6.p74==1))||(i6.u12.p50==1)))))))] = FALSE * [(EY(Init) * !(E(TRUE U (((((((((((i6.u12.p71==1)&&(i9.u14.p86==1))||(i9.u15.p87==1))||((((((((u0.p17==1)&&(i1.u2.p23==1))&&(i2.u4.p28==1))&&(i3.u6.p33==1))&&(i4.u8.p38==1))&&(u9.p45==1))&&(i6.u12.p72==1))&&(i9.u15.p109==1)))||(u0.p8==1))||(i9.u14.p88==1))||(u9.p43==1))||(i9.u14.p93==1))||(i9.u15.p95==1))||(i9.u15.p109==1)) * EX((((((((((i9.u14.p97==1)||(u10.p67==1))||((i6.u12.p71==1)&&(i9.u14.p84==1)))||(i9.u15.p116==1))||(i6.u12.p56==1))||(i6.u12.p58==1))||(u0.p14==1))||(i3.u5.p31==1))||(i6.u12.p62==1)))))))] = FALSE)
(forward)formula 1,1,1.84395,66416,1,0,81166,45905,2610,184279,1547,161318,156233
FORMULA HealthRecord-PT-01-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: A(!(A(((((((u0.p16==1)||(i6.u12.p51==1))||(i9.u14.p85==1))||(i6.u11.p68==1))||(i6.u12.p57==1)) * E(EG(((i6.u12.p71==1)&&(i9.u14.p78==1))) U ((((((((((u0.p16==1)&&(i9.u14.p89==1))||(u0.p18==1))||(i1.u1.p21==1))||(i6.u12.p54==1))||(i9.u15.p75==1))||(u9.p42==1))||((i6.u12.p71==1)&&(i9.u14.p78==1)))||((u9.p44==1)&&(i9.u15.p114==1)))||(i9.u15.p95==1)))) U EF((u0.p6==1)))) U AG(EF(AX(((((((((((((u0.p6==1)||(i6.u12.p48==1))||(i9.u14.p84==1))||(u0.p7==1))||(u9.p41==1))||(i2.u3.p26==1))||(u9.p43==1))||(i6.u12.p60==1))||(u0.p15==1))||(i6.u12.p62==1))||((i6.u12.p71==1)&&(i9.u14.p111==1)))||((u0.p16==1)&&(i9.u15.p114==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(E(TRUE U !(EX(!(((((((((((((u0.p6==1)||(i6.u12.p48==1))||(i9.u14.p84==1))||(u0.p7==1))||(u9.p41==1))||(i2.u3.p26==1))||(u9.p43==1))||(i6.u12.p60==1))||(u0.p15==1))||(i6.u12.p62==1))||((i6.u12.p71==1)&&(i9.u14.p111==1)))||((u0.p16==1)&&(i9.u15.p114==1)))))))))))))) * !(E(!(!(E(TRUE U !(E(TRUE U !(EX(!(((((((((((((u0.p6==1)||(i6.u12.p48==1))||(i9.u14.p84==1))||(u0.p7==1))||(u9.p41==1))||(i2.u3.p26==1))||(u9.p43==1))||(i6.u12.p60==1))||(u0.p15==1))||(i6.u12.p62==1))||((i6.u12.p71==1)&&(i9.u14.p111==1)))||((u0.p16==1)&&(i9.u15.p114==1))))))))))) U (!(!(!((E(!(E(TRUE U (u0.p6==1))) U (!(((((((u0.p16==1)||(i6.u12.p51==1))||(i9.u14.p85==1))||(i6.u11.p68==1))||(i6.u12.p57==1)) * E(EG(((i6.u12.p71==1)&&(i9.u14.p78==1))) U ((((((((((u0.p16==1)&&(i9.u14.p89==1))||(u0.p18==1))||(i1.u1.p21==1))||(i6.u12.p54==1))||(i9.u15.p75==1))||(u9.p42==1))||((i6.u12.p71==1)&&(i9.u14.p78==1)))||((u9.p44==1)&&(i9.u15.p114==1)))||(i9.u15.p95==1))))) * !(E(TRUE U (u0.p6==1))))) + EG(!(E(TRUE U (u0.p6==1)))))))) * !(!(E(TRUE U !(E(TRUE U !(EX(!(((((((((((((u0.p6==1)||(i6.u12.p48==1))||(i9.u14.p84==1))||(u0.p7==1))||(u9.p41==1))||(i2.u3.p26==1))||(u9.p43==1))||(i6.u12.p60==1))||(u0.p15==1))||(i6.u12.p62==1))||((i6.u12.p71==1)&&(i9.u14.p111==1)))||((u0.p16==1)&&(i9.u15.p114==1)))))))))))))))] != 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 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
(forward)formula 2,0,2.96963,99680,1,0,127765,63067,2727,298331,1556,242042,218181
FORMULA HealthRecord-PT-01-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: E(EX((AF((((((i6.u12.p71==0)||(i9.u14.p100==0))&&(u0.p5==0))&&((((((((u0.p17==0)||(i1.u2.p23==0))||(i2.u4.p28==0))||(i3.u6.p33==0))||(i4.u8.p38==0))||(u9.p45==0))||(i6.u12.p71==0))||(i9.u14.p115==0)))&&(((((((i6.u12.p55==1)||(i6.u12.p54==1))||(i6.u12.p56==1))||(u9.p42==1))||(i1.u1.p21==1))||(u0.p9==1))||(i2.u3.p26==1)))) * ((((!(EG((u0.p3==1))) + (u10.p67==1)) + (i6.u12.p55==1)) + (i6.u12.p57==1)) + (i9.u14.p88==1)))) U EF((((EG((((((i9.u14.p82==1)||(u0.p5==1))||(i6.u12.p57==1))||(i4.u8.p30==1))||(i6.u12.p62==1))) * EG((i9.u15.p95==1))) * EF((((((((u0.p18==1)||((u0.p16==1)&&(i9.u15.p114==1)))||(u9.p43==1))||(i9.u15.p75==1))||((i6.u12.p71==1)&&(i9.u14.p78==1)))||(i6.u12.p61==1))||(u13.p108==1)))) * (EX((((((((((i9.u14.p81==1)||((u0.p16==1)&&(i9.u14.p104==1)))||(u0.p16==1))||(i6.u12.p48==1))||(i6.u12.p53==1))||(i9.u14.p84==1))||(i6.u12.p55==1))||((u0.p16==1)&&(i9.u15.p114==1)))||(i6.u12.p61==1))) + EX((((((((i9.u15.p83==1)||(i9.u15.p116==1))||(u13.p106==1))||(i9.u14.p89==1))||(i9.u15.p75==1))||(u9.p46==1))&&((((((((((u10.p67==1)||(i6.u12.p51==1))||(i9.u14.p85==1))||(u0.p7==1))||(u9.p41==1))||(i2.u3.p26==1))||(u9.p42==1))||(i9.u14.p92==1))||(u0.p14==1))||(i9.u15.p79==1))))))))
=> equivalent forward existential formula: ([(EY((FwdU(FwdU(Init,EX((!(EG(!((((((i6.u12.p71==0)||(i9.u14.p100==0))&&(u0.p5==0))&&((((((((u0.p17==0)||(i1.u2.p23==0))||(i2.u4.p28==0))||(i3.u6.p33==0))||(i4.u8.p38==0))||(u9.p45==0))||(i6.u12.p71==0))||(i9.u14.p115==0)))&&(((((((i6.u12.p55==1)||(i6.u12.p54==1))||(i6.u12.p56==1))||(u9.p42==1))||(i1.u1.p21==1))||(u0.p9==1))||(i2.u3.p26==1)))))) * ((((!(EG((u0.p3==1))) + (u10.p67==1)) + (i6.u12.p55==1)) + (i6.u12.p57==1)) + (i9.u14.p88==1))))),TRUE) * ((EG((((((i9.u14.p82==1)||(u0.p5==1))||(i6.u12.p57==1))||(i4.u8.p30==1))||(i6.u12.p62==1))) * EG((i9.u15.p95==1))) * E(TRUE U (((((((u0.p18==1)||((u0.p16==1)&&(i9.u15.p114==1)))||(u9.p43==1))||(i9.u15.p75==1))||((i6.u12.p71==1)&&(i9.u14.p78==1)))||(i6.u12.p61==1))||(u13.p108==1)))))) * (((((((((i9.u14.p81==1)||((u0.p16==1)&&(i9.u14.p104==1)))||(u0.p16==1))||(i6.u12.p48==1))||(i6.u12.p53==1))||(i9.u14.p84==1))||(i6.u12.p55==1))||((u0.p16==1)&&(i9.u15.p114==1)))||(i6.u12.p61==1)))] != FALSE + [(EY((FwdU(FwdU(Init,EX((!(EG(!((((((i6.u12.p71==0)||(i9.u14.p100==0))&&(u0.p5==0))&&((((((((u0.p17==0)||(i1.u2.p23==0))||(i2.u4.p28==0))||(i3.u6.p33==0))||(i4.u8.p38==0))||(u9.p45==0))||(i6.u12.p71==0))||(i9.u14.p115==0)))&&(((((((i6.u12.p55==1)||(i6.u12.p54==1))||(i6.u12.p56==1))||(u9.p42==1))||(i1.u1.p21==1))||(u0.p9==1))||(i2.u3.p26==1)))))) * ((((!(EG((u0.p3==1))) + (u10.p67==1)) + (i6.u12.p55==1)) + (i6.u12.p57==1)) + (i9.u14.p88==1))))),TRUE) * ((EG((((((i9.u14.p82==1)||(u0.p5==1))||(i6.u12.p57==1))||(i4.u8.p30==1))||(i6.u12.p62==1))) * EG((i9.u15.p95==1))) * E(TRUE U (((((((u0.p18==1)||((u0.p16==1)&&(i9.u15.p114==1)))||(u9.p43==1))||(i9.u15.p75==1))||((i6.u12.p71==1)&&(i9.u14.p78==1)))||(i6.u12.p61==1))||(u13.p108==1)))))) * (((((((i9.u15.p83==1)||(i9.u15.p116==1))||(u13.p106==1))||(i9.u14.p89==1))||(i9.u15.p75==1))||(u9.p46==1))&&((((((((((u10.p67==1)||(i6.u12.p51==1))||(i9.u14.p85==1))||(u0.p7==1))||(u9.p41==1))||(i2.u3.p26==1))||(u9.p42==1))||(i9.u14.p92==1))||(u0.p14==1))||(i9.u15.p79==1))))] != FALSE)
(forward)formula 3,0,3.08244,103712,1,0,131597,65617,2843,310622,1567,254778,229528
FORMULA HealthRecord-PT-01-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (!(A((((((((AG(!(EG((((((u0.p16==1)||(i9.u14.p82==1))||(u0.p8==1))||((i6.u12.p71==1)&&(i9.u14.p111==1)))||(u9.p42==1))))) + ((i6.u12.p71==1)&&(i9.u14.p100==1))) + ((i6.u12.p71==1)&&(i9.u14.p111==1))) + (i6.u12.p58==1)) + ((u0.p16==1)&&(i9.u14.p85==1))) + (u0.p13==1)) + (i3.u5.p31==1)) + (u0.p15==1)) U (((((((((u10.p65==0)&&(i9.u15.p101==0))&&(i1.u1.p21==0))&&(i6.u11.p70==0))&&((i6.u12.p71==0)||(i9.u14.p80==0)))&&(i6.u12.p61==0))&&(i9.u14.p111==0))||((((((((i9.u14.p97==0)&&(i9.u15.p112==0))&&((i6.u12.p71==0)||(i9.u14.p86==0)))&&(i3.u6.p35==0))&&(u0.p3==0))&&((u0.p16==0)||(i9.u14.p93==0)))&&(u0.p11==0))&&(i9.u14.p92==0))) * E(((EG((((((((i6.u12.p49==1)||(i6.u12.p54==1))||(i6.u12.p57==1))||(u0.p9==1))||((u0.p16==1)&&(i9.u15.p114==1)))||(i2.u4.p29==1))||(i9.u15.p95==1))) + (i9.u14.p104==1)) + (i9.u15.p95==1)) U AX((((i9.u14.p89==1)||(i2.u3.p26==1))||(i4.u8.p30==1))))))) + AG((((i9.u14.p97==1)||((i6.u12.p71==1)&&(i9.u14.p96==1)))||((((((((u0.p17==1)&&(i1.u2.p23==1))&&(i2.u4.p28==1))&&(i3.u6.p33==1))&&(i4.u8.p38==1))&&(u9.p45==1))&&(i6.u12.p71==1))&&(i9.u14.p115==1)))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(!((E(!((((((((((u10.p65==0)&&(i9.u15.p101==0))&&(i1.u1.p21==0))&&(i6.u11.p70==0))&&((i6.u12.p71==0)||(i9.u14.p80==0)))&&(i6.u12.p61==0))&&(i9.u14.p111==0))||((((((((i9.u14.p97==0)&&(i9.u15.p112==0))&&((i6.u12.p71==0)||(i9.u14.p86==0)))&&(i3.u6.p35==0))&&(u0.p3==0))&&((u0.p16==0)||(i9.u14.p93==0)))&&(u0.p11==0))&&(i9.u14.p92==0))) * E(((EG((((((((i6.u12.p49==1)||(i6.u12.p54==1))||(i6.u12.p57==1))||(u0.p9==1))||((u0.p16==1)&&(i9.u15.p114==1)))||(i2.u4.p29==1))||(i9.u15.p95==1))) + (i9.u14.p104==1)) + (i9.u15.p95==1)) U !(EX(!((((i9.u14.p89==1)||(i2.u3.p26==1))||(i4.u8.p30==1)))))))) U (!((((((((!(E(TRUE U !(!(EG((((((u0.p16==1)||(i9.u14.p82==1))||(u0.p8==1))||((i6.u12.p71==1)&&(i9.u14.p111==1)))||(u9.p42==1))))))) + ((i6.u12.p71==1)&&(i9.u14.p100==1))) + ((i6.u12.p71==1)&&(i9.u14.p111==1))) + (i6.u12.p58==1)) + ((u0.p16==1)&&(i9.u14.p85==1))) + (u0.p13==1)) + (i3.u5.p31==1)) + (u0.p15==1))) * !((((((((((u10.p65==0)&&(i9.u15.p101==0))&&(i1.u1.p21==0))&&(i6.u11.p70==0))&&((i6.u12.p71==0)||(i9.u14.p80==0)))&&(i6.u12.p61==0))&&(i9.u14.p111==0))||((((((((i9.u14.p97==0)&&(i9.u15.p112==0))&&((i6.u12.p71==0)||(i9.u14.p86==0)))&&(i3.u6.p35==0))&&(u0.p3==0))&&((u0.p16==0)||(i9.u14.p93==0)))&&(u0.p11==0))&&(i9.u14.p92==0))) * E(((EG((((((((i6.u12.p49==1)||(i6.u12.p54==1))||(i6.u12.p57==1))||(u0.p9==1))||((u0.p16==1)&&(i9.u15.p114==1)))||(i2.u4.p29==1))||(i9.u15.p95==1))) + (i9.u14.p104==1)) + (i9.u15.p95==1)) U !(EX(!((((i9.u14.p89==1)||(i2.u3.p26==1))||(i4.u8.p30==1)))))))))) + EG(!((((((((((u10.p65==0)&&(i9.u15.p101==0))&&(i1.u1.p21==0))&&(i6.u11.p70==0))&&((i6.u12.p71==0)||(i9.u14.p80==0)))&&(i6.u12.p61==0))&&(i9.u14.p111==0))||((((((((i9.u14.p97==0)&&(i9.u15.p112==0))&&((i6.u12.p71==0)||(i9.u14.p86==0)))&&(i3.u6.p35==0))&&(u0.p3==0))&&((u0.p16==0)||(i9.u14.p93==0)))&&(u0.p11==0))&&(i9.u14.p92==0))) * E(((EG((((((((i6.u12.p49==1)||(i6.u12.p54==1))||(i6.u12.p57==1))||(u0.p9==1))||((u0.p16==1)&&(i9.u15.p114==1)))||(i2.u4.p29==1))||(i9.u15.p95==1))) + (i9.u14.p104==1)) + (i9.u15.p95==1)) U !(EX(!((((i9.u14.p89==1)||(i2.u3.p26==1))||(i4.u8.p30==1)))))))))))))),TRUE) * !((((i9.u14.p97==1)||((i6.u12.p71==1)&&(i9.u14.p96==1)))||((((((((u0.p17==1)&&(i1.u2.p23==1))&&(i2.u4.p28==1))&&(i3.u6.p33==1))&&(i4.u8.p38==1))&&(u9.p45==1))&&(i6.u12.p71==1))&&(i9.u14.p115==1)))))] = FALSE
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
(forward)formula 4,1,4.29281,144632,1,0,193476,77625,3012,466019,1587,315184,295620
FORMULA HealthRecord-PT-01-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: (!(EF(((A(((((((((((i9.u15.p99==1)||(i3.u6.p35==1))||(i4.u7.p37==1))||((i6.u12.p71==1)&&(i9.u14.p98==1)))||(u0.p6==1))||(i9.u15.p103==1))||(u9.p43==1))||(i9.u14.p93==1))||(u9.p46==1))&&((((((((((u10.p67==1)||(i9.u15.p99==1))||(i3.u6.p34==1))||(u0.p3==1))||(i9.u15.p116==1))||(i6.u12.p73==1))||(i4.u8.p25==1))||((i6.u12.p71==1)&&(i9.u14.p94==1)))||(i9.u15.p91==1))||(u0.p13==1))) U (((((((i9.u14.p102==1)||((u0.p16==1)&&(i9.u15.p114==1)))||(i9.u14.p90==1))||(i6.u12.p60==1))||(i1.u2.p47==1))||(i9.u15.p109==1))&&((((((((i2.u4.p0==1)||(i9.u15.p101==1))||(i9.u14.p86==1))||(i6.u12.p56==1))||(i1.u2.p40==1))||(i2.u4.p29==1))||(u0.p14==1))||(i6.u12.p63==1)))) + AX(FALSE)) * ((((((((((i2.u4.p0==1)||(i9.u15.p99==1))||(i3.u6.p35==1))||((i6.u12.p71==1)&&(i9.u14.p113==1)))||((i6.u12.p71==1)&&(i9.u14.p80==1)))||(i9.u14.p90==1))||((i6.u12.p71==1)&&(i9.u14.p92==1)))||(u0.p12==1))||(i9.u14.p111==1))||(i6.u12.p62==1))))) * E(EX(E(E(((((((((u0.p16==1)||(i3.u5.p32==1))||(u10.p67==1))||(i9.u15.p112==1))||(i9.u14.p85==1))||(i6.u12.p55==1))||(i6.u12.p57==1))||(i9.u15.p79==1)) U (((((((((u0.p16==1)||(i9.u15.p99==1))||(i3.u6.p34==1))||(i9.u15.p101==1))||((((((((u0.p17==1)&&(i1.u2.p23==1))&&(i2.u4.p28==1))&&(i3.u6.p33==1))&&(i4.u8.p38==1))&&(u9.p45==1))&&(i6.u12.p72==1))&&(i9.u15.p109==1)))||((i6.u12.p71==1)&&(i9.u14.p92==1)))||((((((((u0.p17==1)&&(i1.u2.p23==1))&&(i2.u4.p28==1))&&(i3.u6.p33==1))&&(i4.u8.p38==1))&&(u9.p45==1))&&(i6.u12.p71==1))&&(i9.u14.p115==1)))||(i6.u12.p63==1))||((i6.u12.p71==1)&&(i9.u14.p105==1)))) U !(AF((((((((((i2.u4.p0==1)||(i6.u12.p48==1))||(i3.u6.p34==1))||(i6.u12.p52==1))||(i9.u15.p103==1))||(u13.p106==1))||((i6.u12.p71==1)&&(i9.u14.p111==1)))||((u0.p16==1)&&(i9.u15.p114==1)))||(u9.p42==1)))))) U (!(A(!(A((((((((((i9.u15.p83==1)||(u0.p4==1))||(i9.u15.p103==1))||(u9.p41==1))||(i9.u14.p77==1))||(i9.u14.p110==1))||((i6.u12.p71==1)&&(i9.u14.p76==1)))||(u0.p14==1))||(i3.u5.p31==1)) U ((i4.u8.p25==1)||(i9.u14.p78==1)))) U (u0.p14==1))) + EF(((((((((i3.u6.p34==1)||(u0.p3==1))||(i6.u12.p53==1))||(i9.u15.p116==1))||(i4.u8.p39==1))||((i6.u12.p71==1)&&(i9.u14.p113==1)))||(u13.p107==1))||(i6.u12.p59==1))))))
=> equivalent forward existential formula: (([(((FwdU(Init,TRUE) * ((((((((((i2.u4.p0==1)||(i9.u15.p99==1))||(i3.u6.p35==1))||((i6.u12.p71==1)&&(i9.u14.p113==1)))||((i6.u12.p71==1)&&(i9.u14.p80==1)))||(i9.u14.p90==1))||((i6.u12.p71==1)&&(i9.u14.p92==1)))||(u0.p12==1))||(i9.u14.p111==1))||(i6.u12.p62==1))) * !(EG(!((((((((i9.u14.p102==1)||((u0.p16==1)&&(i9.u15.p114==1)))||(i9.u14.p90==1))||(i6.u12.p60==1))||(i1.u2.p47==1))||(i9.u15.p109==1))&&((((((((i2.u4.p0==1)||(i9.u15.p101==1))||(i9.u14.p86==1))||(i6.u12.p56==1))||(i1.u2.p40==1))||(i2.u4.p29==1))||(u0.p14==1))||(i6.u12.p63==1))))))) * !(E(!((((((((i9.u14.p102==1)||((u0.p16==1)&&(i9.u15.p114==1)))||(i9.u14.p90==1))||(i6.u12.p60==1))||(i1.u2.p47==1))||(i9.u15.p109==1))&&((((((((i2.u4.p0==1)||(i9.u15.p101==1))||(i9.u14.p86==1))||(i6.u12.p56==1))||(i1.u2.p40==1))||(i2.u4.p29==1))||(u0.p14==1))||(i6.u12.p63==1)))) U (!(((((((((((i9.u15.p99==1)||(i3.u6.p35==1))||(i4.u7.p37==1))||((i6.u12.p71==1)&&(i9.u14.p98==1)))||(u0.p6==1))||(i9.u15.p103==1))||(u9.p43==1))||(i9.u14.p93==1))||(u9.p46==1))&&((((((((((u10.p67==1)||(i9.u15.p99==1))||(i3.u6.p34==1))||(u0.p3==1))||(i9.u15.p116==1))||(i6.u12.p73==1))||(i4.u8.p25==1))||((i6.u12.p71==1)&&(i9.u14.p94==1)))||(i9.u15.p91==1))||(u0.p13==1)))) * !((((((((i9.u14.p102==1)||((u0.p16==1)&&(i9.u15.p114==1)))||(i9.u14.p90==1))||(i6.u12.p60==1))||(i1.u2.p47==1))||(i9.u15.p109==1))&&((((((((i2.u4.p0==1)||(i9.u15.p101==1))||(i9.u14.p86==1))||(i6.u12.p56==1))||(i1.u2.p40==1))||(i2.u4.p29==1))||(u0.p14==1))||(i6.u12.p63==1))))))))] = FALSE * [((FwdU(Init,TRUE) * ((((((((((i2.u4.p0==1)||(i9.u15.p99==1))||(i3.u6.p35==1))||((i6.u12.p71==1)&&(i9.u14.p113==1)))||((i6.u12.p71==1)&&(i9.u14.p80==1)))||(i9.u14.p90==1))||((i6.u12.p71==1)&&(i9.u14.p92==1)))||(u0.p12==1))||(i9.u14.p111==1))||(i6.u12.p62==1))) * !(EX(!(FALSE))))] = FALSE) * [(Init * !(E(EX(E(E(((((((((u0.p16==1)||(i3.u5.p32==1))||(u10.p67==1))||(i9.u15.p112==1))||(i9.u14.p85==1))||(i6.u12.p55==1))||(i6.u12.p57==1))||(i9.u15.p79==1)) U (((((((((u0.p16==1)||(i9.u15.p99==1))||(i3.u6.p34==1))||(i9.u15.p101==1))||((((((((u0.p17==1)&&(i1.u2.p23==1))&&(i2.u4.p28==1))&&(i3.u6.p33==1))&&(i4.u8.p38==1))&&(u9.p45==1))&&(i6.u12.p72==1))&&(i9.u15.p109==1)))||((i6.u12.p71==1)&&(i9.u14.p92==1)))||((((((((u0.p17==1)&&(i1.u2.p23==1))&&(i2.u4.p28==1))&&(i3.u6.p33==1))&&(i4.u8.p38==1))&&(u9.p45==1))&&(i6.u12.p71==1))&&(i9.u14.p115==1)))||(i6.u12.p63==1))||((i6.u12.p71==1)&&(i9.u14.p105==1)))) U !(!(EG(!((((((((((i2.u4.p0==1)||(i6.u12.p48==1))||(i3.u6.p34==1))||(i6.u12.p52==1))||(i9.u15.p103==1))||(u13.p106==1))||((i6.u12.p71==1)&&(i9.u14.p111==1)))||((u0.p16==1)&&(i9.u15.p114==1)))||(u9.p42==1)))))))) U (!(!((E(!((u0.p14==1)) U (!(!(!((E(!(((i4.u8.p25==1)||(i9.u14.p78==1))) U (!((((((((((i9.u15.p83==1)||(u0.p4==1))||(i9.u15.p103==1))||(u9.p41==1))||(i9.u14.p77==1))||(i9.u14.p110==1))||((i6.u12.p71==1)&&(i9.u14.p76==1)))||(u0.p14==1))||(i3.u5.p31==1))) * !(((i4.u8.p25==1)||(i9.u14.p78==1))))) + EG(!(((i4.u8.p25==1)||(i9.u14.p78==1)))))))) * !((u0.p14==1)))) + EG(!((u0.p14==1)))))) + E(TRUE U ((((((((i3.u6.p34==1)||(u0.p3==1))||(i6.u12.p53==1))||(i9.u15.p116==1))||(i4.u8.p39==1))||((i6.u12.p71==1)&&(i9.u14.p113==1)))||(u13.p107==1))||(i6.u12.p59==1)))))))] = FALSE)
(forward)formula 5,0,5.93842,197960,1,0,269710,92438,3379,613162,1611,385465,431049
FORMULA HealthRecord-PT-01-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AG(((E(((((((((((((u0.p16==1)||(i9.u15.p83==1))||(i9.u15.p79==1))||(i3.u6.p1==1))||(i9.u14.p98==1))||(i9.u14.p77==1))||((i6.u12.p71==1)&&(i9.u14.p90==1)))||(i9.u14.p80==1))||(i9.u15.p99==1))||(u0.p18==1))||((u0.p16==1)&&(i9.u15.p114==1)))||(i2.u3.p26==1)) U A((((((((((((u0.p16==1)&&(i9.u14.p89==1))||(i9.u15.p99==1))||(u10.p67==1))||(i9.u14.p113==1))||(u10.p66==1))||(i4.u7.p36==1))||((i6.u12.p71==1)&&(i9.u14.p100==1)))||(i9.u15.p103==1))||(u13.p107==1))&&(((i4.u7.p37==1)||(i9.u15.p91==1))||((u9.p44==1)&&(i9.u15.p114==1)))) U AX(((((((((((i6.u12.p71==1)&&(i9.u14.p88==1))||(i9.u15.p99==1))||(i4.u7.p36==1))||(u0.p6==1))||(u9.p43==1))||(i2.u3.p27==1))||(i2.u4.p29==1))||((((((((u0.p17==1)&&(i1.u2.p23==1))&&(i2.u4.p28==1))&&(i3.u6.p33==1))&&(i4.u8.p38==1))&&(u9.p45==1))&&(i6.u12.p71==1))&&(i9.u14.p115==1)))||(i3.u5.p31==1))))) + AG((E(((i6.u12.p49==1)||(u9.p42==1)) U ((((((i6.u12.p71==1)&&(i9.u14.p98==1))||(i6.u12.p73==1))||(u13.p106==1))||(u0.p10==1))||(i6.u12.p62==1))) + A(((((((((i3.u6.p34==1)||(i9.u14.p86==1))||(u9.p41==1))||(i9.u14.p110==1))||(i2.u4.p29==1))||((i6.u12.p71==1)&&(i9.u14.p90==1)))||(u0.p14==1))||(u0.p15==1)) U (((((u0.p16==1)||(u9.p41==1))||(i9.u15.p75==1))||(u0.p13==1))||(i2.u4.p29==1)))))) + EX(EF(EX(((((((i9.u15.p99==1)||((u0.p19==1)&&(i9.u15.p114==1)))||((i6.u12.p71==1)&&(i9.u14.p94==1)))||(u9.p43==1))||(u0.p12==1))||((u9.p44==1)&&(i9.u15.p114==1))))))))
=> equivalent forward existential formula: [((FwdU(((FwdU(Init,TRUE) * !(EX(E(TRUE U EX(((((((i9.u15.p99==1)||((u0.p19==1)&&(i9.u15.p114==1)))||((i6.u12.p71==1)&&(i9.u14.p94==1)))||(u9.p43==1))||(u0.p12==1))||((u9.p44==1)&&(i9.u15.p114==1)))))))) * !(E(((((((((((((u0.p16==1)||(i9.u15.p83==1))||(i9.u15.p79==1))||(i3.u6.p1==1))||(i9.u14.p98==1))||(i9.u14.p77==1))||((i6.u12.p71==1)&&(i9.u14.p90==1)))||(i9.u14.p80==1))||(i9.u15.p99==1))||(u0.p18==1))||((u0.p16==1)&&(i9.u15.p114==1)))||(i2.u3.p26==1)) U !((E(!(!(EX(!(((((((((((i6.u12.p71==1)&&(i9.u14.p88==1))||(i9.u15.p99==1))||(i4.u7.p36==1))||(u0.p6==1))||(u9.p43==1))||(i2.u3.p27==1))||(i2.u4.p29==1))||((((((((u0.p17==1)&&(i1.u2.p23==1))&&(i2.u4.p28==1))&&(i3.u6.p33==1))&&(i4.u8.p38==1))&&(u9.p45==1))&&(i6.u12.p71==1))&&(i9.u14.p115==1)))||(i3.u5.p31==1)))))) U (!((((((((((((u0.p16==1)&&(i9.u14.p89==1))||(i9.u15.p99==1))||(u10.p67==1))||(i9.u14.p113==1))||(u10.p66==1))||(i4.u7.p36==1))||((i6.u12.p71==1)&&(i9.u14.p100==1)))||(i9.u15.p103==1))||(u13.p107==1))&&(((i4.u7.p37==1)||(i9.u15.p91==1))||((u9.p44==1)&&(i9.u15.p114==1))))) * !(!(EX(!(((((((((((i6.u12.p71==1)&&(i9.u14.p88==1))||(i9.u15.p99==1))||(i4.u7.p36==1))||(u0.p6==1))||(u9.p43==1))||(i2.u3.p27==1))||(i2.u4.p29==1))||((((((((u0.p17==1)&&(i1.u2.p23==1))&&(i2.u4.p28==1))&&(i3.u6.p33==1))&&(i4.u8.p38==1))&&(u9.p45==1))&&(i6.u12.p71==1))&&(i9.u14.p115==1)))||(i3.u5.p31==1)))))))) + EG(!(!(EX(!(((((((((((i6.u12.p71==1)&&(i9.u14.p88==1))||(i9.u15.p99==1))||(i4.u7.p36==1))||(u0.p6==1))||(u9.p43==1))||(i2.u3.p27==1))||(i2.u4.p29==1))||((((((((u0.p17==1)&&(i1.u2.p23==1))&&(i2.u4.p28==1))&&(i3.u6.p33==1))&&(i4.u8.p38==1))&&(u9.p45==1))&&(i6.u12.p71==1))&&(i9.u14.p115==1)))||(i3.u5.p31==1)))))))))))),TRUE) * !(!((E(!((((((u0.p16==1)||(u9.p41==1))||(i9.u15.p75==1))||(u0.p13==1))||(i2.u4.p29==1))) U (!(((((((((i3.u6.p34==1)||(i9.u14.p86==1))||(u9.p41==1))||(i9.u14.p110==1))||(i2.u4.p29==1))||((i6.u12.p71==1)&&(i9.u14.p90==1)))||(u0.p14==1))||(u0.p15==1))) * !((((((u0.p16==1)||(u9.p41==1))||(i9.u15.p75==1))||(u0.p13==1))||(i2.u4.p29==1))))) + EG(!((((((u0.p16==1)||(u9.p41==1))||(i9.u15.p75==1))||(u0.p13==1))||(i2.u4.p29==1)))))))) * !(E(((i6.u12.p49==1)||(u9.p42==1)) U ((((((i6.u12.p71==1)&&(i9.u14.p98==1))||(i6.u12.p73==1))||(u13.p106==1))||(u0.p10==1))||(i6.u12.p62==1)))))] = FALSE
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
(forward)formula 6,0,7.41163,248912,1,0,357763,98917,3835,780488,1714,427787,535171
FORMULA HealthRecord-PT-01-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (EX(!(EF((((((i9.u14.p82==1)||(i4.u7.p36==1))||(i6.u12.p55==1))||(u9.p42==1))||(i9.u14.p111==1))))) + !(E((E((((((((((i9.u14.p97==1)||((i6.u12.p71==1)&&(i9.u14.p88==1)))||(u0.p18==1))||(i6.u11.p69==1))||(i1.u1.p22==1))||(u0.p9==1))||((u0.p16==1)&&(i9.u15.p114==1)))||(i9.u14.p93==1))||((u9.p44==1)&&(i9.u15.p114==1))) U ((((u0.p16==1)&&(i9.u14.p104==1))||(u0.p9==1))||(u0.p12==1))) * (!(EF((((u10.p65==1)||((i6.u12.p71==1)&&(i9.u14.p96==1)))||(u0.p13==1)))) + ((((((i6.u12.p71==0)||(i9.u14.p88==0))&&(u0.p18==0))&&(i9.u14.p100==0))&&((i6.u12.p71==0)||(i9.u14.p76==0)))&&((u9.p44==0)||(i9.u15.p114==0))))) U (E((((((((((((u0.p16==0)&&(i3.u6.p1==0))&&(u0.p18==0))&&(u0.p5==0))&&(i9.u15.p103==0))&&(u13.p106==0))&&(i1.u2.p40==0))&&(i2.u3.p26==0))&&(u9.p42==0))&&(i2.u4.p29==0))||((((((i9.u14.p96==0)&&(u10.p67==0))&&(u0.p3==0))&&(i6.u12.p50==0))&&(i4.u7.p36==0))&&(i6.u12.p56==0))) U EG(((((i9.u14.p96==1)||(i3.u6.p35==1))||(i9.u14.p93==1))||(u0.p14==1)))) * EF((((((((i9.u14.p85==1)||((i6.u12.p71==1)&&(i9.u14.p82==1)))||(u0.p7==1))||((i6.u12.p71==1)&&(i9.u14.p113==1)))||(u0.p10==1))||(i9.u14.p90==1))||(i6.u12.p62==1)))))))
=> equivalent forward existential formula: [(FwdU((FwdU((Init * !(EX(!(E(TRUE U (((((i9.u14.p82==1)||(i4.u7.p36==1))||(i6.u12.p55==1))||(u9.p42==1))||(i9.u14.p111==1))))))),(E((((((((((i9.u14.p97==1)||((i6.u12.p71==1)&&(i9.u14.p88==1)))||(u0.p18==1))||(i6.u11.p69==1))||(i1.u1.p22==1))||(u0.p9==1))||((u0.p16==1)&&(i9.u15.p114==1)))||(i9.u14.p93==1))||((u9.p44==1)&&(i9.u15.p114==1))) U ((((u0.p16==1)&&(i9.u14.p104==1))||(u0.p9==1))||(u0.p12==1))) * (!(E(TRUE U (((u10.p65==1)||((i6.u12.p71==1)&&(i9.u14.p96==1)))||(u0.p13==1)))) + ((((((i6.u12.p71==0)||(i9.u14.p88==0))&&(u0.p18==0))&&(i9.u14.p100==0))&&((i6.u12.p71==0)||(i9.u14.p76==0)))&&((u9.p44==0)||(i9.u15.p114==0)))))) * E((((((((((((u0.p16==0)&&(i3.u6.p1==0))&&(u0.p18==0))&&(u0.p5==0))&&(i9.u15.p103==0))&&(u13.p106==0))&&(i1.u2.p40==0))&&(i2.u3.p26==0))&&(u9.p42==0))&&(i2.u4.p29==0))||((((((i9.u14.p96==0)&&(u10.p67==0))&&(u0.p3==0))&&(i6.u12.p50==0))&&(i4.u7.p36==0))&&(i6.u12.p56==0))) U EG(((((i9.u14.p96==1)||(i3.u6.p35==1))||(i9.u14.p93==1))||(u0.p14==1))))),TRUE) * (((((((i9.u14.p85==1)||((i6.u12.p71==1)&&(i9.u14.p82==1)))||(u0.p7==1))||((i6.u12.p71==1)&&(i9.u14.p113==1)))||(u0.p10==1))||(i9.u14.p90==1))||(i6.u12.p62==1)))] = FALSE
(forward)formula 7,0,9.23777,298280,1,0,434299,114800,4031,938308,1733,517326,615362
FORMULA HealthRecord-PT-01-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AX(AG(((i2.u3.p26==1)||((i6.u12.p71==1)&&(i9.u14.p113==1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(((i2.u3.p26==1)||((i6.u12.p71==1)&&(i9.u14.p113==1)))))] = FALSE
(forward)formula 8,0,9.24165,298544,1,0,434352,114800,4033,938489,1733,517326,615660
FORMULA HealthRecord-PT-01-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: (AX(((((((((u0.p16==1)||(i9.u14.p85==1))||((i6.u12.p71==1)&&(i9.u14.p100==1)))||(i1.u1.p21==1))||(i9.u14.p89==1))||(i9.u14.p104==1))||(i9.u15.p91==1))||(i6.u12.p59==1))) + EX(E((((((((((((AF(((((u0.p16==1)||((i6.u12.p71==1)&&(i9.u14.p88==1)))||(i6.u12.p53==1))||(u0.p11==1))) * (((((((((((((((u0.p2==1)||(u0.p3==1))||((i6.u12.p71==1)&&(i9.u14.p100==1)))||(i6.u12.p52==1))||(u0.p6==1))||(i6.u12.p60==1))||(u0.p14==1))||(i6.u12.p63==1))||(i6.u12.p50==1))||(i1.u1.p21==1))||(i1.u2.p24==1))||(i2.u3.p26==1))||((i6.u12.p71==1)&&(i9.u14.p78==1)))||(i9.u14.p77==1))||((u9.p44==1)&&(i9.u15.p114==1)))) + EF(((((((((i3.u6.p34==1)||(i6.u12.p53==1))||(i6.u11.p68==1))||(i9.u14.p102==1))||(i1.u2.p24==1))||(i9.u14.p93==1))||(i9.u14.p76==1))||(i6.u12.p63==1)))) + (u0.p18==1)) + (u0.p3==1)) + (i3.u6.p35==1)) + ((i6.u12.p71==1)&&(i9.u14.p98==1))) + (i1.u1.p22==1)) + (i4.u8.p25==1)) + (i6.u12.p59==1)) + (i6.u12.p58==1)) + ((((((((u0.p17==1)&&(i1.u2.p23==1))&&(i2.u4.p28==1))&&(i3.u6.p33==1))&&(i4.u8.p38==1))&&(u9.p45==1))&&(i6.u12.p71==1))&&(i9.u14.p115==1))) U !(AX((((((((((i9.u14.p85==0)&&((u0.p16==0)||(i9.u14.p93==0)))&&(i1.u1.p21==0))&&((((((((u0.p17==0)||(i1.u2.p23==0))||(i2.u4.p28==0))||(i3.u6.p33==0))||(i4.u8.p38==0))||(u9.p45==0))||(i6.u12.p72==0))||(i9.u15.p109==0)))&&(i9.u14.p88==0))&&(u9.p42==0))&&(i9.u14.p76==0))&&((u0.p16==0)||(i9.u14.p85==0)))&&(u9.p46==0)))))))
=> equivalent forward existential formula: [(EY((Init * !(EX(E((((((((((((!(EG(!(((((u0.p16==1)||((i6.u12.p71==1)&&(i9.u14.p88==1)))||(i6.u12.p53==1))||(u0.p11==1))))) * (((((((((((((((u0.p2==1)||(u0.p3==1))||((i6.u12.p71==1)&&(i9.u14.p100==1)))||(i6.u12.p52==1))||(u0.p6==1))||(i6.u12.p60==1))||(u0.p14==1))||(i6.u12.p63==1))||(i6.u12.p50==1))||(i1.u1.p21==1))||(i1.u2.p24==1))||(i2.u3.p26==1))||((i6.u12.p71==1)&&(i9.u14.p78==1)))||(i9.u14.p77==1))||((u9.p44==1)&&(i9.u15.p114==1)))) + E(TRUE U ((((((((i3.u6.p34==1)||(i6.u12.p53==1))||(i6.u11.p68==1))||(i9.u14.p102==1))||(i1.u2.p24==1))||(i9.u14.p93==1))||(i9.u14.p76==1))||(i6.u12.p63==1)))) + (u0.p18==1)) + (u0.p3==1)) + (i3.u6.p35==1)) + ((i6.u12.p71==1)&&(i9.u14.p98==1))) + (i1.u1.p22==1)) + (i4.u8.p25==1)) + (i6.u12.p59==1)) + (i6.u12.p58==1)) + ((((((((u0.p17==1)&&(i1.u2.p23==1))&&(i2.u4.p28==1))&&(i3.u6.p33==1))&&(i4.u8.p38==1))&&(u9.p45==1))&&(i6.u12.p71==1))&&(i9.u14.p115==1))) U !(!(EX(!((((((((((i9.u14.p85==0)&&((u0.p16==0)||(i9.u14.p93==0)))&&(i1.u1.p21==0))&&((((((((u0.p17==0)||(i1.u2.p23==0))||(i2.u4.p28==0))||(i3.u6.p33==0))||(i4.u8.p38==0))||(u9.p45==0))||(i6.u12.p72==0))||(i9.u15.p109==0)))&&(i9.u14.p88==0))&&(u9.p42==0))&&(i9.u14.p76==0))&&((u0.p16==0)||(i9.u14.p85==0)))&&(u9.p46==0))))))))))) * !(((((((((u0.p16==1)||(i9.u14.p85==1))||((i6.u12.p71==1)&&(i9.u14.p100==1)))||(i1.u1.p21==1))||(i9.u14.p89==1))||(i9.u14.p104==1))||(i9.u15.p91==1))||(i6.u12.p59==1))))] = FALSE
(forward)formula 9,1,9.69733,316232,1,0,461821,117908,4187,1.00191e+06,1755,537223,651956
FORMULA HealthRecord-PT-01-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: EX(EG((A((((i9.u15.p99==0)&&(i9.u14.p88==0))&&((i6.u12.p71==0)||(i9.u14.p78==0))) U (i6.u12.p54==1)) * (((((((u10.p67==1)||(i9.u14.p84==1))||(i9.u14.p100==1))||(i2.u3.p26==1))||(u9.p42==1))||(i4.u8.p30==1))||((i6.u12.p71==1)&&(i9.u14.p105==1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),(!((E(!((i6.u12.p54==1)) U (!((((i9.u15.p99==0)&&(i9.u14.p88==0))&&((i6.u12.p71==0)||(i9.u14.p78==0)))) * !((i6.u12.p54==1)))) + EG(!((i6.u12.p54==1))))) * (((((((u10.p67==1)||(i9.u14.p84==1))||(i9.u14.p100==1))||(i2.u3.p26==1))||(u9.p42==1))||(i4.u8.p30==1))||((i6.u12.p71==1)&&(i9.u14.p105==1)))))] != FALSE
(forward)formula 10,0,9.86621,321512,1,0,468509,119437,4237,1.01569e+06,1757,545585,668166
FORMULA HealthRecord-PT-01-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: AX(!(EX((((((((((u0.p16==1)&&(i9.u14.p104==1))||(u10.p66==1))||(i9.u14.p100==1))||(i9.u15.p103==1))||(i6.u12.p54==1))||(i9.u14.p89==1))||(i9.u14.p105==1))||((u9.p44==1)&&(i9.u15.p114==1))))))
=> equivalent forward existential formula: [(EY(EY(Init)) * (((((((((u0.p16==1)&&(i9.u14.p104==1))||(u10.p66==1))||(i9.u14.p100==1))||(i9.u15.p103==1))||(i6.u12.p54==1))||(i9.u14.p89==1))||(i9.u14.p105==1))||((u9.p44==1)&&(i9.u15.p114==1))))] = FALSE
(forward)formula 11,1,9.86943,322040,1,0,468557,119437,4256,1.01572e+06,1759,545585,668520
FORMULA HealthRecord-PT-01-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
BK_STOP 1621280920015
--------------------
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-01"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-01, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r292-tall-162124156200258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-01.tgz
mv HealthRecord-PT-01 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;