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-162124156200266.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-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156200266
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 8.8K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 78K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 15K 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.9K May 11 18:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 11 18:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 11 15:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 34K 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-02-CTLFireability-00
FORMULA_NAME HealthRecord-PT-02-CTLFireability-01
FORMULA_NAME HealthRecord-PT-02-CTLFireability-02
FORMULA_NAME HealthRecord-PT-02-CTLFireability-03
FORMULA_NAME HealthRecord-PT-02-CTLFireability-04
FORMULA_NAME HealthRecord-PT-02-CTLFireability-05
FORMULA_NAME HealthRecord-PT-02-CTLFireability-06
FORMULA_NAME HealthRecord-PT-02-CTLFireability-07
FORMULA_NAME HealthRecord-PT-02-CTLFireability-08
FORMULA_NAME HealthRecord-PT-02-CTLFireability-09
FORMULA_NAME HealthRecord-PT-02-CTLFireability-10
FORMULA_NAME HealthRecord-PT-02-CTLFireability-11
FORMULA_NAME HealthRecord-PT-02-CTLFireability-12
FORMULA_NAME HealthRecord-PT-02-CTLFireability-13
FORMULA_NAME HealthRecord-PT-02-CTLFireability-14
FORMULA_NAME HealthRecord-PT-02-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1621280949803

Running Version 0
[2021-05-17 19:49:11] [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:49:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 19:49:11] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2021-05-17 19:49:11] [INFO ] Transformed 119 places.
[2021-05-17 19:49:11] [INFO ] Transformed 225 transitions.
[2021-05-17 19:49:11] [INFO ] Found NUPN structural information;
[2021-05-17 19:49:11] [INFO ] Parsed PT model containing 119 places and 225 transitions in 82 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
[2021-05-17 19:49:11] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 19:49:11] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 19:49:11] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 19:49:11] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 19:49:11] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 19:49:11] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 19:49:11] [INFO ] Reduced 2 identical enabling conditions.
[2021-05-17 19:49:11] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 19:49:11] [INFO ] Reduced 1 identical enabling conditions.
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 transitions.
Support contains 116 out of 119 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 119/119 places, 219/219 transitions.
Applied a total of 0 rules in 12 ms. Remains 119 /119 variables (removed 0) and now considering 219/219 (removed 0) transitions.
[2021-05-17 19:49:11] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
// Phase 1: matrix 211 rows 119 cols
[2021-05-17 19:49:11] [INFO ] Computed 14 place invariants in 12 ms
[2021-05-17 19:49:11] [INFO ] Implicit Places using invariants in 142 ms returned []
[2021-05-17 19:49:11] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
// Phase 1: matrix 211 rows 119 cols
[2021-05-17 19:49:11] [INFO ] Computed 14 place invariants in 3 ms
[2021-05-17 19:49:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 19:49:12] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2021-05-17 19:49:12] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
// Phase 1: matrix 211 rows 119 cols
[2021-05-17 19:49:12] [INFO ] Computed 14 place invariants in 4 ms
[2021-05-17 19:49:12] [INFO ] Dead Transitions using invariants and state equation in 127 ms returned []
Finished structural reductions, in 1 iterations. Remains : 119/119 places, 219/219 transitions.
[2021-05-17 19:49:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2021-05-17 19:49:12] [INFO ] Flatten gal took : 48 ms
FORMULA HealthRecord-PT-02-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 19:49:12] [INFO ] Flatten gal took : 18 ms
[2021-05-17 19:49:12] [INFO ] Input system was already deterministic with 219 transitions.
Incomplete random walk after 100000 steps, including 5925 resets, run finished after 411 ms. (steps per millisecond=243 ) properties (out of 56) seen :50
Running SMT prover for 6 properties.
[2021-05-17 19:49:12] [INFO ] Flow matrix only has 211 transitions (discarded 8 similar events)
// Phase 1: matrix 211 rows 119 cols
[2021-05-17 19:49:12] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-17 19:49:12] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-17 19:49:12] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-17 19:49:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:49:13] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2021-05-17 19:49:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:49:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-17 19:49:13] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-17 19:49:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:49:13] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2021-05-17 19:49:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 19:49:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 19:49:13] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 2 ms to minimize.
[2021-05-17 19:49:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2021-05-17 19:49:13] [INFO ] Computed and/alt/rep : 167/178/167 causal constraints (skipped 43 transitions) in 16 ms.
[2021-05-17 19:49:13] [INFO ] Added : 47 causal constraints over 10 iterations in 142 ms. Result :sat
[2021-05-17 19:49:13] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-17 19:49:13] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-17 19:49:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:49:13] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2021-05-17 19:49:13] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-17 19:49:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:49:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-17 19:49:13] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-17 19:49:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:49:13] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2021-05-17 19:49:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:49:13] [INFO ] Computed and/alt/rep : 167/178/167 causal constraints (skipped 43 transitions) in 14 ms.
[2021-05-17 19:49:13] [INFO ] Added : 50 causal constraints over 11 iterations in 126 ms. Result :sat
[2021-05-17 19:49:13] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-17 19:49:13] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-17 19:49:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:49:13] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2021-05-17 19:49:13] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:49:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:49:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-17 19:49:13] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-17 19:49:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:49:13] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2021-05-17 19:49:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:49:13] [INFO ] Computed and/alt/rep : 167/178/167 causal constraints (skipped 43 transitions) in 13 ms.
[2021-05-17 19:49:14] [INFO ] Added : 52 causal constraints over 11 iterations in 130 ms. Result :sat
[2021-05-17 19:49:14] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-17 19:49:14] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-17 19:49:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:49:14] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2021-05-17 19:49:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:49:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-17 19:49:14] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-17 19:49:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:49:14] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-17 19:49:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:49:14] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 1 ms to minimize.
[2021-05-17 19:49:14] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2021-05-17 19:49:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2021-05-17 19:49:14] [INFO ] Computed and/alt/rep : 167/178/167 causal constraints (skipped 43 transitions) in 12 ms.
[2021-05-17 19:49:14] [INFO ] Added : 52 causal constraints over 11 iterations in 125 ms. Result :sat
[2021-05-17 19:49:14] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-17 19:49:14] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-17 19:49:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:49:14] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2021-05-17 19:49:14] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 19:49:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:49:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-17 19:49:14] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-17 19:49:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:49:14] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2021-05-17 19:49:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 19:49:14] [INFO ] Computed and/alt/rep : 167/178/167 causal constraints (skipped 43 transitions) in 13 ms.
[2021-05-17 19:49:14] [INFO ] Added : 46 causal constraints over 10 iterations in 117 ms. Result :sat
[2021-05-17 19:49:14] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2021-05-17 19:49:14] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 2 ms returned sat
[2021-05-17 19:49:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:49:14] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2021-05-17 19:49:14] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:49:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:49:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-17 19:49:14] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-17 19:49:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:49:14] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2021-05-17 19:49:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:49:14] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 1 ms to minimize.
[2021-05-17 19:49:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2021-05-17 19:49:14] [INFO ] Computed and/alt/rep : 167/178/167 causal constraints (skipped 43 transitions) in 16 ms.
[2021-05-17 19:49:15] [INFO ] Added : 49 causal constraints over 10 iterations in 122 ms. Result :sat
Graph (trivial) has 71 edges and 119 vertex of which 10 / 119 are part of one of the 5 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 34 place count 81 transition count 154
Iterating global reduction 0 with 33 rules applied. Total rules applied 67 place count 81 transition count 154
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 68 place count 80 transition count 152
Iterating global reduction 0 with 1 rules applied. Total rules applied 69 place count 80 transition count 152
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 0 with 4 rules applied. Total rules applied 73 place count 78 transition count 150
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 0 with 4 rules applied. Total rules applied 77 place count 76 transition count 152
Applied a total of 77 rules in 27 ms. Remains 76 /119 variables (removed 43) and now considering 152/219 (removed 67) transitions.
[2021-05-17 19:49:15] [INFO ] Flatten gal took : 10 ms
[2021-05-17 19:49:15] [INFO ] Flatten gal took : 9 ms
[2021-05-17 19:49:15] [INFO ] Input system was already deterministic with 152 transitions.
[2021-05-17 19:49:15] [INFO ] Flatten gal took : 9 ms
[2021-05-17 19:49:15] [INFO ] Flatten gal took : 9 ms
[2021-05-17 19:49:15] [INFO ] Time to serialize gal into /tmp/CTLFireability11577450353008548508.gal : 4 ms
[2021-05-17 19:49:15] [INFO ] Time to serialize properties into /tmp/CTLFireability7492215279951270887.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/CTLFireability11577450353008548508.gal, -t, CGAL, -ctl, /tmp/CTLFireability7492215279951270887.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/CTLFireability11577450353008548508.gal -t CGAL -ctl /tmp/CTLFireability7492215279951270887.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,179359,0.203376,11408,2,2068,5,26670,6,0,448,29505,0


Converting to forward existential form...Done !
original formula: EF((AF(E((((((((((((((((((((p114==1)||(p65==1))||((p16==1)&&(p106==1)))||(p118==1))||(p89==1))||(p111==1))||(p44==1))||((p46==1)&&(p116==1)))||(p31==1))||(p81==1))||((p39==1)&&(p116==1)))||(p9==1))||(p104==1))||(p105==1))||((p16==1)&&(p116==1)))||(p76==1))||(p15==1))||(p31==1))||(((((((((p97==0)&&(p113==0))&&(p66==0))&&(p118==0))&&((p73==0)||(p84==0)))&&((p16==0)||(p99==0)))&&(p58==0))&&(p90==0))&&((p16==0)||(p116==0)))) U ((((((((((p65==0)&&(p48==0))&&(p113==0))&&(p55==0))&&(p6==0))&&(p7==0))&&(p89==0))&&(p88==0))&&((p73==0)||(p94==0)))&&((p46==0)||(p116==0))))) * (AG(((((((((p82==1)||(p56==1))||((p73==1)&&(p78==1)))||((p46==1)&&(p116==1)))||(p111==1))||((p73==1)&&(p107==1)))||(p62==1))&&((((p37==1)||(p6==1))||(p57==1))||(p58==1)))) + AG(((((p69==0)&&((p73==0)||(p104==0)))&&(p44==0)) * !(AG(((((((p96==1)||(p83==1))||(p2==1))||((p73==1)&&(p86==1)))||(p110==1))||(p77==1)))))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(E((((((((((((((((((((p114==1)||(p65==1))||((p16==1)&&(p106==1)))||(p118==1))||(p89==1))||(p111==1))||(p44==1))||((p46==1)&&(p116==1)))||(p31==1))||(p81==1))||((p39==1)&&(p116==1)))||(p9==1))||(p104==1))||(p105==1))||((p16==1)&&(p116==1)))||(p76==1))||(p15==1))||(p31==1))||(((((((((p97==0)&&(p113==0))&&(p66==0))&&(p118==0))&&((p73==0)||(p84==0)))&&((p16==0)||(p99==0)))&&(p58==0))&&(p90==0))&&((p16==0)||(p116==0)))) U ((((((((((p65==0)&&(p48==0))&&(p113==0))&&(p55==0))&&(p6==0))&&(p7==0))&&(p89==0))&&(p88==0))&&((p73==0)||(p94==0)))&&((p46==0)||(p116==0)))))))) * !(E(TRUE U !(((((((((p82==1)||(p56==1))||((p73==1)&&(p78==1)))||((p46==1)&&(p116==1)))||(p111==1))||((p73==1)&&(p107==1)))||(p62==1))&&((((p37==1)||(p6==1))||(p57==1))||(p58==1)))))))] != FALSE + [((FwdU(Init,TRUE) * !(EG(!(E((((((((((((((((((((p114==1)||(p65==1))||((p16==1)&&(p106==1)))||(p118==1))||(p89==1))||(p111==1))||(p44==1))||((p46==1)&&(p116==1)))||(p31==1))||(p81==1))||((p39==1)&&(p116==1)))||(p9==1))||(p104==1))||(p105==1))||((p16==1)&&(p116==1)))||(p76==1))||(p15==1))||(p31==1))||(((((((((p97==0)&&(p113==0))&&(p66==0))&&(p118==0))&&((p73==0)||(p84==0)))&&((p16==0)||(p99==0)))&&(p58==0))&&(p90==0))&&((p16==0)||(p116==0)))) U ((((((((((p65==0)&&(p48==0))&&(p113==0))&&(p55==0))&&(p6==0))&&(p7==0))&&(p89==0))&&(p88==0))&&((p73==0)||(p94==0)))&&((p46==0)||(p116==0)))))))) * !(E(TRUE U !(((((p69==0)&&((p73==0)||(p104==0)))&&(p44==0)) * !(!(E(TRUE U !(((((((p96==1)||(p83==1))||(p2==1))||((p73==1)&&(p86==1)))||(p110==1))||(p77==1)))))))))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, 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, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t51, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t70, t71, t72, t73, t74, t75, t76, t77, t82, t83, t84, t85, t86, t87, t88, t89, t90, t91, t92, t93, t95, t100, t104, t130, t133, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/59/93/152
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,2.52611,86448,1,0,426,527260,335,180,3569,351938,423
FORMULA HealthRecord-PT-02-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Graph (trivial) has 50 edges and 119 vertex of which 12 / 119 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 47 place count 67 transition count 128
Iterating global reduction 0 with 46 rules applied. Total rules applied 93 place count 67 transition count 128
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 99 place count 61 transition count 116
Iterating global reduction 0 with 6 rules applied. Total rules applied 105 place count 61 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 106 place count 61 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 60 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 60 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 59 transition count 111
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 111 place count 59 transition count 111
Applied a total of 111 rules in 18 ms. Remains 59 /119 variables (removed 60) and now considering 111/219 (removed 108) transitions.
[2021-05-17 19:49:17] [INFO ] Flatten gal took : 12 ms
[2021-05-17 19:49:17] [INFO ] Flatten gal took : 6 ms
[2021-05-17 19:49:17] [INFO ] Input system was already deterministic with 111 transitions.
[2021-05-17 19:49:17] [INFO ] Flatten gal took : 5 ms
[2021-05-17 19:49:17] [INFO ] Flatten gal took : 6 ms
[2021-05-17 19:49:17] [INFO ] Time to serialize gal into /tmp/CTLFireability15653322211907281970.gal : 1 ms
[2021-05-17 19:49:17] [INFO ] Time to serialize properties into /tmp/CTLFireability13145027612429723930.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/CTLFireability15653322211907281970.gal, -t, CGAL, -ctl, /tmp/CTLFireability13145027612429723930.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/CTLFireability15653322211907281970.gal -t CGAL -ctl /tmp/CTLFireability13145027612429723930.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,170025,0.073677,7024,2,848,5,10612,6,0,340,11990,0


Converting to forward existential form...Done !
original formula: EF((AF(!(AF((((((((p58==1)||(p110==1))||(p92==1))||(p79==1))||(p95==1))||(p15==1))&&(((((((((p0==1)||(p85==1))||(p5==1))||(p100==1))||(p102==1))||(p43==1))||(p110==1))||(p111==1))||(p79==1)))))) * A(!(A(((((((((p16==1)&&(p106==1))||(p113==1))||(p101==1))||((p19==1)&&(p116==1)))||(p43==1))||(p62==1))||((p16==1)&&(p87==1))) U ((((((((p17==1)&&(p23==1))&&(p28==1))&&(p33==1))&&(p40==1))&&(p47==1))&&(p73==1))&&(p117==1)))) U ((((((p16==1)||(p2==1))||(p56==1))||(p110==1))||((p16==1)&&(p116==1)))||(p44==1)))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(EG(!(!(!(EG(!((((((((p58==1)||(p110==1))||(p92==1))||(p79==1))||(p95==1))||(p15==1))&&(((((((((p0==1)||(p85==1))||(p5==1))||(p100==1))||(p102==1))||(p43==1))||(p110==1))||(p111==1))||(p79==1))))))))))) * !(EG(!(((((((p16==1)||(p2==1))||(p56==1))||(p110==1))||((p16==1)&&(p116==1)))||(p44==1)))))) * !(E(!(((((((p16==1)||(p2==1))||(p56==1))||(p110==1))||((p16==1)&&(p116==1)))||(p44==1))) U (!(!(!((E(!(((((((((p17==1)&&(p23==1))&&(p28==1))&&(p33==1))&&(p40==1))&&(p47==1))&&(p73==1))&&(p117==1))) U (!(((((((((p16==1)&&(p106==1))||(p113==1))||(p101==1))||((p19==1)&&(p116==1)))||(p43==1))||(p62==1))||((p16==1)&&(p87==1)))) * !(((((((((p17==1)&&(p23==1))&&(p28==1))&&(p33==1))&&(p40==1))&&(p47==1))&&(p73==1))&&(p117==1))))) + EG(!(((((((((p17==1)&&(p23==1))&&(p28==1))&&(p33==1))&&(p40==1))&&(p47==1))&&(p73==1))&&(p117==1)))))))) * !(((((((p16==1)||(p2==1))||(p56==1))||(p110==1))||((p16==1)&&(p116==1)))||(p44==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, 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, t36, t37, t38, t39, t40, t41, t42, t45, t46, t47, t48, t59, t60, t61, t62, t63, t64, t65, t66, t68, t69, t70, t73, t75, t82, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/52/59/111
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,3.95407,128952,1,0,712,839284,260,353,2524,631379,787
FORMULA HealthRecord-PT-02-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Graph (trivial) has 175 edges and 119 vertex of which 12 / 119 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 55 transition count 105
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 55 transition count 105
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 125 place count 45 transition count 85
Iterating global reduction 0 with 10 rules applied. Total rules applied 135 place count 45 transition count 85
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 139 place count 45 transition count 81
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 142 place count 42 transition count 72
Iterating global reduction 1 with 3 rules applied. Total rules applied 145 place count 42 transition count 72
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 148 place count 39 transition count 66
Iterating global reduction 1 with 3 rules applied. Total rules applied 151 place count 39 transition count 66
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 154 place count 39 transition count 63
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 158 place count 37 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 160 place count 36 transition count 66
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 165 place count 36 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 166 place count 35 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 167 place count 34 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 168 place count 33 transition count 58
Applied a total of 168 rules in 22 ms. Remains 33 /119 variables (removed 86) and now considering 58/219 (removed 161) transitions.
[2021-05-17 19:49:21] [INFO ] Flatten gal took : 3 ms
[2021-05-17 19:49:21] [INFO ] Flatten gal took : 3 ms
[2021-05-17 19:49:21] [INFO ] Input system was already deterministic with 58 transitions.
[2021-05-17 19:49:21] [INFO ] Flatten gal took : 3 ms
[2021-05-17 19:49:21] [INFO ] Flatten gal took : 3 ms
[2021-05-17 19:49:21] [INFO ] Time to serialize gal into /tmp/CTLFireability9101257089188081386.gal : 1 ms
[2021-05-17 19:49:21] [INFO ] Time to serialize properties into /tmp/CTLFireability5473140104355916327.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/CTLFireability9101257089188081386.gal, -t, CGAL, -ctl, /tmp/CTLFireability5473140104355916327.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/CTLFireability9101257089188081386.gal -t CGAL -ctl /tmp/CTLFireability5473140104355916327.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,6916,0.011824,4692,2,199,5,1265,6,0,180,1078,0


Converting to forward existential form...Done !
original formula: !(EF((p84==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * (p84==1))] = FALSE
(forward)formula 0,0,0.012247,5068,1,0,7,1265,8,1,183,1078,1
FORMULA HealthRecord-PT-02-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Graph (trivial) has 98 edges and 119 vertex of which 10 / 119 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 48 place count 67 transition count 127
Iterating global reduction 0 with 47 rules applied. Total rules applied 95 place count 67 transition count 127
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 100 place count 62 transition count 117
Iterating global reduction 0 with 5 rules applied. Total rules applied 105 place count 62 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 107 place count 62 transition count 115
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 113 place count 59 transition count 112
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
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 119 place count 56 transition count 118
Applied a total of 119 rules in 17 ms. Remains 56 /119 variables (removed 63) and now considering 118/219 (removed 101) transitions.
[2021-05-17 19:49:21] [INFO ] Flatten gal took : 23 ms
[2021-05-17 19:49:21] [INFO ] Flatten gal took : 7 ms
[2021-05-17 19:49:22] [INFO ] Input system was already deterministic with 118 transitions.
[2021-05-17 19:49:22] [INFO ] Flatten gal took : 7 ms
[2021-05-17 19:49:22] [INFO ] Flatten gal took : 6 ms
[2021-05-17 19:49:22] [INFO ] Time to serialize gal into /tmp/CTLFireability8935980761490570243.gal : 2 ms
[2021-05-17 19:49:22] [INFO ] Time to serialize properties into /tmp/CTLFireability7644762512870945850.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/CTLFireability8935980761490570243.gal, -t, CGAL, -ctl, /tmp/CTLFireability7644762512870945850.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/CTLFireability8935980761490570243.gal -t CGAL -ctl /tmp/CTLFireability7644762512870945850.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,37086,0.064464,6908,2,1283,5,9757,6,0,336,9698,0


Converting to forward existential form...Done !
original formula: AG((((((((EF((((((((((((((((((p114==0)&&(p80==0))&&(p64==0))&&(p50==0))&&((p73==0)||(p88==0)))&&(p59==0))&&((p16==0)||(p99==0)))&&((p16==0)||(p116==0)))&&(p92==0))&&((p16==0)||(p87==0)))&&(p0==0))&&(p112==0))&&((p73==0)||(p84==0)))&&(p41==0))&&(p24==0))&&(p107==0))&&(p108==0))) + (p97==1)) + (p53==1)) + (p8==1)) + (p57==1)) + (p9==1)) + (p94==1)) + ((p16==1)&&(p106==1))))
=> equivalent forward existential formula: [((((((((FwdU(Init,TRUE) * !(((p16==1)&&(p106==1)))) * !((p94==1))) * !((p9==1))) * !((p57==1))) * !((p8==1))) * !((p53==1))) * !((p97==1))) * !(E(TRUE U (((((((((((((((((p114==0)&&(p80==0))&&(p64==0))&&(p50==0))&&((p73==0)||(p88==0)))&&(p59==0))&&((p16==0)||(p99==0)))&&((p16==0)||(p116==0)))&&(p92==0))&&((p16==0)||(p87==0)))&&(p0==0))&&(p112==0))&&((p73==0)||(p84==0)))&&(p41==0))&&(p24==0))&&(p107==0))&&(p108==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, 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, t40, t41, t42, t43, t44, t45, t53, t54, t55, t56, t57, t58, t61, t62, t70, t81, t85, t86, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/61/57/118
(forward)formula 0,1,0.333252,16528,1,0,238,62896,251,91,2543,42843,248
FORMULA HealthRecord-PT-02-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Graph (trivial) has 68 edges and 119 vertex of which 6 / 119 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 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 28 place count 89 transition count 166
Iterating global reduction 0 with 27 rules applied. Total rules applied 55 place count 89 transition count 166
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 0 with 4 rules applied. Total rules applied 59 place count 87 transition count 164
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 65 place count 84 transition count 174
Applied a total of 65 rules in 13 ms. Remains 84 /119 variables (removed 35) and now considering 174/219 (removed 45) transitions.
[2021-05-17 19:49:22] [INFO ] Flatten gal took : 9 ms
[2021-05-17 19:49:22] [INFO ] Flatten gal took : 9 ms
[2021-05-17 19:49:22] [INFO ] Input system was already deterministic with 174 transitions.
[2021-05-17 19:49:22] [INFO ] Flatten gal took : 8 ms
[2021-05-17 19:49:22] [INFO ] Flatten gal took : 8 ms
[2021-05-17 19:49:22] [INFO ] Time to serialize gal into /tmp/CTLFireability9662715979499182607.gal : 2 ms
[2021-05-17 19:49:22] [INFO ] Time to serialize properties into /tmp/CTLFireability10181305101326680074.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/CTLFireability9662715979499182607.gal, -t, CGAL, -ctl, /tmp/CTLFireability10181305101326680074.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/CTLFireability9662715979499182607.gal -t CGAL -ctl /tmp/CTLFireability10181305101326680074.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,240416,0.348499,17464,2,3262,5,38794,6,0,497,61563,0


Converting to forward existential form...Done !
original formula: E(((((((((p16==1)||(p103==1))||(p45==1))||(p78==1)) + AF((((((((((p4==1)||(p101==1))||(p37==1))||(p68==1))||((p73==1)&&(p100==1)))||(p7==1))||(p89==1))||((p16==1)&&(p116==1)))||(p111==1)))) + (((((((((p49==0)&&(p81==0))&&(p51==0))&&(p37==0))&&(p87==0))&&(p59==0))&&(p44==0))&&(p78==0))&&((p73==0)||(p90==0)))) + (((((((p18==0)&&(p85==0))&&(p75==0))&&(p93==0))&&(p62==0))&&((p73==0)||(p98==0)))&&((p16==0)||(p116==0)))) + (((((((((p87==0)&&(p22==0))&&(p103==0))&&(p38==0))&&(p12==0))&&(p15==0))&&(((((p5==1)||(p30==1))||(p15==1))||(p31==1))||(p16==1)))&&((((((p16==1)||(p85==1))||(p6==1))||(p55==1))||(p54==1))||(p11==1)))&&((p16==0)||(p116==0)))) U E(((((((p16==1)||(p50==1))||(p20==1))||(p22==1))||(p13==1))||(p79==1)) U (EG(((((((p82==1)||((p73==1)&&(p100==1)))||(p12==1))||(p110==1))||(p95==1))||((p73==1)&&(p107==1)))) * ((((p115==1)||(p5==1))||(p58==1))||((p73==1)&&(p78==1))))))
=> equivalent forward existential formula: [FwdG((FwdU(FwdU(Init,((((((((p16==1)||(p103==1))||(p45==1))||(p78==1)) + !(EG(!((((((((((p4==1)||(p101==1))||(p37==1))||(p68==1))||((p73==1)&&(p100==1)))||(p7==1))||(p89==1))||((p16==1)&&(p116==1)))||(p111==1)))))) + (((((((((p49==0)&&(p81==0))&&(p51==0))&&(p37==0))&&(p87==0))&&(p59==0))&&(p44==0))&&(p78==0))&&((p73==0)||(p90==0)))) + (((((((p18==0)&&(p85==0))&&(p75==0))&&(p93==0))&&(p62==0))&&((p73==0)||(p98==0)))&&((p16==0)||(p116==0)))) + (((((((((p87==0)&&(p22==0))&&(p103==0))&&(p38==0))&&(p12==0))&&(p15==0))&&(((((p5==1)||(p30==1))||(p15==1))||(p31==1))||(p16==1)))&&((((((p16==1)||(p85==1))||(p6==1))||(p55==1))||(p54==1))||(p11==1)))&&((p16==0)||(p116==0))))),((((((p16==1)||(p50==1))||(p20==1))||(p22==1))||(p13==1))||(p79==1))) * ((((p115==1)||(p5==1))||(p58==1))||((p73==1)&&(p78==1)))),((((((p82==1)||((p73==1)&&(p100==1)))||(p12==1))||(p110==1))||(p95==1))||((p73==1)&&(p107==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t7, 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, t36, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t70, t71, t72, t73, t74, t75, t76, t82, t83, t84, t85, t86, t87, t88, t89, t90, t91, t92, t93, t94, t95, t96, t97, t98, t99, t100, t102, t108, t125, t131, t138, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/75/99/174
Hit Full ! (commute/partial/dont) 134/0/40
Hit Full ! (commute/partial/dont) 127/0/47
(forward)formula 0,1,6.58068,209284,1,0,589,1.03329e+06,387,257,4065,1.09105e+06,590
FORMULA HealthRecord-PT-02-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Graph (trivial) has 154 edges and 119 vertex of which 12 / 119 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 57 place count 56 transition count 107
Iterating global reduction 0 with 56 rules applied. Total rules applied 113 place count 56 transition count 107
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 121 place count 48 transition count 91
Iterating global reduction 0 with 8 rules applied. Total rules applied 129 place count 48 transition count 91
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 48 transition count 86
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 1 with 4 rules applied. Total rules applied 138 place count 46 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 45 transition count 94
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 144 place count 45 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 145 place count 44 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 146 place count 43 transition count 88
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 147 place count 42 transition count 87
Applied a total of 147 rules in 19 ms. Remains 42 /119 variables (removed 77) and now considering 87/219 (removed 132) transitions.
[2021-05-17 19:49:29] [INFO ] Flatten gal took : 4 ms
[2021-05-17 19:49:29] [INFO ] Flatten gal took : 4 ms
[2021-05-17 19:49:29] [INFO ] Input system was already deterministic with 87 transitions.
Finished random walk after 3535 steps, including 371 resets, run visited all 1 properties in 25 ms. (steps per millisecond=141 )
FORMULA HealthRecord-PT-02-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Graph (trivial) has 51 edges and 119 vertex of which 12 / 119 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 53 place count 61 transition count 116
Iterating global reduction 0 with 52 rules applied. Total rules applied 105 place count 61 transition count 116
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 113 place count 53 transition count 100
Iterating global reduction 0 with 8 rules applied. Total rules applied 121 place count 53 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 123 place count 53 transition count 98
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 126 place count 50 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 129 place count 50 transition count 89
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 131 place count 48 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 133 place count 48 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 135 place count 48 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 47 transition count 82
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 138 place count 47 transition count 82
Applied a total of 138 rules in 14 ms. Remains 47 /119 variables (removed 72) and now considering 82/219 (removed 137) transitions.
[2021-05-17 19:49:29] [INFO ] Flatten gal took : 3 ms
[2021-05-17 19:49:29] [INFO ] Flatten gal took : 3 ms
[2021-05-17 19:49:29] [INFO ] Input system was already deterministic with 82 transitions.
[2021-05-17 19:49:29] [INFO ] Flatten gal took : 4 ms
[2021-05-17 19:49:29] [INFO ] Flatten gal took : 3 ms
[2021-05-17 19:49:29] [INFO ] Time to serialize gal into /tmp/CTLFireability7026783105140427335.gal : 0 ms
[2021-05-17 19:49:29] [INFO ] Time to serialize properties into /tmp/CTLFireability2560195987673825640.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/CTLFireability7026783105140427335.gal, -t, CGAL, -ctl, /tmp/CTLFireability2560195987673825640.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/CTLFireability7026783105140427335.gal -t CGAL -ctl /tmp/CTLFireability2560195987673825640.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,72177,0.023159,5032,2,539,5,3311,6,0,263,2780,0


Converting to forward existential form...Done !
original formula: !(EF(AG(!(AF((((((((((p0==1)||(p51==1))||(p52==1))||((((((((p17==1)&&(p23==1))&&(p28==1))&&(p33==1))&&(p40==1))&&(p47==1))&&(p73==1))&&(p117==1)))||((p16==1)&&(p116==1)))||(p110==1))||(p60==1))||(p62==1))||(p103==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(!(EG(!((((((((((p0==1)||(p51==1))||(p52==1))||((((((((p17==1)&&(p23==1))&&(p28==1))&&(p33==1))&&(p40==1))&&(p47==1))&&(p73==1))&&(p117==1)))||((p16==1)&&(p116==1)))||(p110==1))||(p60==1))||(p62==1))||(p103==1))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, 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, t55, t57, t60, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/48/34/82
(forward)formula 0,0,0.570373,25976,1,0,296,131395,185,134,1908,111119,324
FORMULA HealthRecord-PT-02-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2021-05-17 19:49:29] [INFO ] Flatten gal took : 9 ms
[2021-05-17 19:49:29] [INFO ] Flatten gal took : 9 ms
[2021-05-17 19:49:29] [INFO ] Applying decomposition
[2021-05-17 19:49:29] [INFO ] Flatten gal took : 12 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/graph10605526125449825015.txt, -o, /tmp/graph10605526125449825015.bin, -w, /tmp/graph10605526125449825015.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/graph10605526125449825015.bin, -l, -1, -v, -w, /tmp/graph10605526125449825015.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 19:49:29] [INFO ] Decomposing Gal with order
[2021-05-17 19:49:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 19:49:29] [INFO ] Removed a total of 54 redundant transitions.
[2021-05-17 19:49:29] [INFO ] Flatten gal took : 48 ms
[2021-05-17 19:49:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 6 ms.
[2021-05-17 19:49:29] [INFO ] Time to serialize gal into /tmp/CTLFireability5680756182366971581.gal : 3 ms
[2021-05-17 19:49:29] [INFO ] Time to serialize properties into /tmp/CTLFireability11794578287421419988.ctl : 3 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/CTLFireability5680756182366971581.gal, -t, CGAL, -ctl, /tmp/CTLFireability11794578287421419988.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/CTLFireability5680756182366971581.gal -t CGAL -ctl /tmp/CTLFireability11794578287421419988.ctl
No direction supplied, using forward translation only.
Parsed 8 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,3.05544e+06,0.495175,21180,560,866,16588,22740,438,41219,276,95706,0


Converting to forward existential form...Done !
original formula: E(A(AX(!(AF((((((((u0.p16==1)||(i7.u13.p83==1))||(i6.u9.p69==1))||(i7.u14.p88==1))||(i7.u13.p111==1))||(i2.u4.p29==1))||((u8.p46==1)&&(i7.u13.p116==1)))))) U (!(EX(((((((u0.p16==1)||(i1.u2.p1==1))||(u0.p6==1))||(i6.u10.p70==1))||(u0.p11==1))&&((((((((((i6.u11.p65==1)||(i6.u11.p66==1))||(i6.u11.p53==1))||(i6.u11.p52==1))||(i6.u11.p55==1))||(i6.u10.p70==1))||(i7.u14.p106==1))||(u0.p8==1))||((u0.p16==1)&&(i7.u13.p116==1)))||(i6.u11.p62==1))))) + (!(AF((((u0.p16==1)||(i7.u14.p86==1))||(i6.u10.p72==1)))) * ((((((((((((((((u8.p45==1)||(i3.u5.p31==1))||(i7.u13.p97==1))||(u7.p41==1))||(i6.u11.p59==1))||(i6.u11.p58==1))||(i6.u11.p65==1))||(i7.u14.p96==1))||(u8.p48==1))||(i7.u13.p83==1))||(i7.u14.p88==1))||(i7.u14.p91==1))||(u8.p43==1))||((i6.u11.p73==1)&&(i7.u14.p80==1)))||((i6.u11.p73==1)&&(i7.u14.p102==1)))||((i6.u11.p73==1)&&(i7.u14.p78==1)))))) U E(AF((AF((i6.u11.p55==1)) + ((A((((((i7.u14.p99==1)||(i7.u13.p118==1))||(i1.u2.p24==1))||(i6.u11.p57==1))||(u12.p110==1)) U ((((((((((u0.p16==1)||(u8.p48==1))||((i6.u11.p73==1)&&(i7.u14.p86==1)))||((u0.p16==1)&&(i7.u14.p112==1)))||(i7.u14.p107==1))||(i7.u13.p93==1))||((u8.p46==1)&&(i7.u13.p116==1)))||(i2.u4.p29==1))||(u8.p44==1))||(u12.p108==1))) * ((((((i3.u6.p0==1)||(i6.u11.p64==1))||(u8.p44==1))||(i7.u13.p111==1))||((i6.u11.p73==1)&&(i7.u14.p115==1)))||((u0.p16==1)&&(i7.u13.p116==1)))) * ((((((((((i6.u11.p65==1)||(u0.p2==1))||(i6.u11.p55==1))||(i7.u14.p87==1))||(i6.u10.p70==1))||(i7.u14.p88==1))||(i6.u11.p58==1))||(i7.u13.p105==1))||(i6.u11.p61==1))||(i6.u11.p60==1))))) U AG((((((((((i6.u11.p65==0)&&(u0.p16==0))&&(i6.u11.p64==0))&&(i7.u14.p99==0))&&(i6.u9.p67==0))&&(u0.p2==0))&&(i1.u1.p21==0))&&(i7.u14.p100==0))&&(i2.u4.p29==0)))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!((E(!((!(EX(((((((u0.p16==1)||(i1.u2.p1==1))||(u0.p6==1))||(i6.u10.p70==1))||(u0.p11==1))&&((((((((((i6.u11.p65==1)||(i6.u11.p66==1))||(i6.u11.p53==1))||(i6.u11.p52==1))||(i6.u11.p55==1))||(i6.u10.p70==1))||(i7.u14.p106==1))||(u0.p8==1))||((u0.p16==1)&&(i7.u13.p116==1)))||(i6.u11.p62==1))))) + (!(!(EG(!((((u0.p16==1)||(i7.u14.p86==1))||(i6.u10.p72==1)))))) * ((((((((((((((((u8.p45==1)||(i3.u5.p31==1))||(i7.u13.p97==1))||(u7.p41==1))||(i6.u11.p59==1))||(i6.u11.p58==1))||(i6.u11.p65==1))||(i7.u14.p96==1))||(u8.p48==1))||(i7.u13.p83==1))||(i7.u14.p88==1))||(i7.u14.p91==1))||(u8.p43==1))||((i6.u11.p73==1)&&(i7.u14.p80==1)))||((i6.u11.p73==1)&&(i7.u14.p102==1)))||((i6.u11.p73==1)&&(i7.u14.p78==1)))))) U (!(!(EX(!(!(!(EG(!((((((((u0.p16==1)||(i7.u13.p83==1))||(i6.u9.p69==1))||(i7.u14.p88==1))||(i7.u13.p111==1))||(i2.u4.p29==1))||((u8.p46==1)&&(i7.u13.p116==1))))))))))) * !((!(EX(((((((u0.p16==1)||(i1.u2.p1==1))||(u0.p6==1))||(i6.u10.p70==1))||(u0.p11==1))&&((((((((((i6.u11.p65==1)||(i6.u11.p66==1))||(i6.u11.p53==1))||(i6.u11.p52==1))||(i6.u11.p55==1))||(i6.u10.p70==1))||(i7.u14.p106==1))||(u0.p8==1))||((u0.p16==1)&&(i7.u13.p116==1)))||(i6.u11.p62==1))))) + (!(!(EG(!((((u0.p16==1)||(i7.u14.p86==1))||(i6.u10.p72==1)))))) * ((((((((((((((((u8.p45==1)||(i3.u5.p31==1))||(i7.u13.p97==1))||(u7.p41==1))||(i6.u11.p59==1))||(i6.u11.p58==1))||(i6.u11.p65==1))||(i7.u14.p96==1))||(u8.p48==1))||(i7.u13.p83==1))||(i7.u14.p88==1))||(i7.u14.p91==1))||(u8.p43==1))||((i6.u11.p73==1)&&(i7.u14.p80==1)))||((i6.u11.p73==1)&&(i7.u14.p102==1)))||((i6.u11.p73==1)&&(i7.u14.p78==1)))))))) + EG(!((!(EX(((((((u0.p16==1)||(i1.u2.p1==1))||(u0.p6==1))||(i6.u10.p70==1))||(u0.p11==1))&&((((((((((i6.u11.p65==1)||(i6.u11.p66==1))||(i6.u11.p53==1))||(i6.u11.p52==1))||(i6.u11.p55==1))||(i6.u10.p70==1))||(i7.u14.p106==1))||(u0.p8==1))||((u0.p16==1)&&(i7.u13.p116==1)))||(i6.u11.p62==1))))) + (!(!(EG(!((((u0.p16==1)||(i7.u14.p86==1))||(i6.u10.p72==1)))))) * ((((((((((((((((u8.p45==1)||(i3.u5.p31==1))||(i7.u13.p97==1))||(u7.p41==1))||(i6.u11.p59==1))||(i6.u11.p58==1))||(i6.u11.p65==1))||(i7.u14.p96==1))||(u8.p48==1))||(i7.u13.p83==1))||(i7.u14.p88==1))||(i7.u14.p91==1))||(u8.p43==1))||((i6.u11.p73==1)&&(i7.u14.p80==1)))||((i6.u11.p73==1)&&(i7.u14.p102==1)))||((i6.u11.p73==1)&&(i7.u14.p78==1)))))))))),!(EG(!((!(EG(!((i6.u11.p55==1)))) + ((!((E(!(((((((((((u0.p16==1)||(u8.p48==1))||((i6.u11.p73==1)&&(i7.u14.p86==1)))||((u0.p16==1)&&(i7.u14.p112==1)))||(i7.u14.p107==1))||(i7.u13.p93==1))||((u8.p46==1)&&(i7.u13.p116==1)))||(i2.u4.p29==1))||(u8.p44==1))||(u12.p108==1))) U (!((((((i7.u14.p99==1)||(i7.u13.p118==1))||(i1.u2.p24==1))||(i6.u11.p57==1))||(u12.p110==1))) * !(((((((((((u0.p16==1)||(u8.p48==1))||((i6.u11.p73==1)&&(i7.u14.p86==1)))||((u0.p16==1)&&(i7.u14.p112==1)))||(i7.u14.p107==1))||(i7.u13.p93==1))||((u8.p46==1)&&(i7.u13.p116==1)))||(i2.u4.p29==1))||(u8.p44==1))||(u12.p108==1))))) + EG(!(((((((((((u0.p16==1)||(u8.p48==1))||((i6.u11.p73==1)&&(i7.u14.p86==1)))||((u0.p16==1)&&(i7.u14.p112==1)))||(i7.u14.p107==1))||(i7.u13.p93==1))||((u8.p46==1)&&(i7.u13.p116==1)))||(i2.u4.p29==1))||(u8.p44==1))||(u12.p108==1)))))) * ((((((i3.u6.p0==1)||(i6.u11.p64==1))||(u8.p44==1))||(i7.u13.p111==1))||((i6.u11.p73==1)&&(i7.u14.p115==1)))||((u0.p16==1)&&(i7.u13.p116==1)))) * ((((((((((i6.u11.p65==1)||(u0.p2==1))||(i6.u11.p55==1))||(i7.u14.p87==1))||(i6.u10.p70==1))||(i7.u14.p88==1))||(i6.u11.p58==1))||(i7.u13.p105==1))||(i6.u11.p61==1))||(i6.u11.p60==1)))))))) * !(E(TRUE U !((((((((((i6.u11.p65==0)&&(u0.p16==0))&&(i6.u11.p64==0))&&(i7.u14.p99==0))&&(i6.u9.p67==0))&&(u0.p2==0))&&(i1.u1.p21==0))&&(i7.u14.p100==0))&&(i2.u4.p29==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, 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.t157, u0.t158, u0.t159, u0.t160, u0.t162, 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, i6.t66, i6.t62, i6.u11.t60, i6.u11.t61, i6.u11.t70, i6.u11.t71, i6.u11.t72, i6.u11.t73, i6.u11.t74, i6.u11.t75, i6.u11.t76, i6.u11.t77, i6.u11.t78, i6.u11.t79, i6.u11.t80, i6.u11.t81, i6.u11.t82, i6.u11.t83, i6.u11.t84, i6.u11.t85, i6.u11.t86, i6.u11.t87, i6.u11.t88, i6.u11.t89, i6.u11.t90, i6.u11.t91, i6.u11.t92, i6.u11.t93, i6.u11.t94, i6.u11.t95, i6.u11.t96, i6.u11.t97, i6.u11.t98, i6.u11.t99, i6.u11.t100, i6.u11.t101, i6.u11.t102, i6.u11.t103, i7.t52, i7.t41, i7.t8, i7.u13.t2, i7.u13.t5, i7.u13.t9, i7.u13.t17, i7.u13.t20, i7.u13.t23, i7.u13.t28, i7.u13.t34, i7.u13.t46, i7.u13.t50, i7.u13.t53, i7.u13.t56, i7.u14.t3, i7.u14.t6, i7.u14.t7, i7.u14.t14, i7.u14.t15, i7.u14.t18, i7.u14.t21, i7.u14.t24, i7.u14.t25, i7.u14.t26, i7.u14.t30, i7.u14.t31, i7.u14.t32, i7.u14.t36, i7.u14.t37, i7.u14.t38, i7.u14.t39, i7.u14.t42, i7.u14.t43, i7.u14.t44, i7.u14.t48, i7.u14.t51, i7.u14.t54, i7.u14.t57, i7.u14.t58, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/75/125/200
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 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 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
(forward)formula 0,1,4.7278,139404,1,0,168859,66517,2845,350023,1620,225387,366781
FORMULA HealthRecord-PT-02-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(!(EG(((((((((EG(EX((((i7.u13.p97==1)||(u0.p4==1))||(i2.u4.p29==1)))) * ((((((((((u7.p38==1)||(i6.u11.p59==1))||(i7.u14.p99==1))||(i6.u11.p50==1))||(u7.p36==1))||(u0.p6==1))||(i6.u11.p54==1))||(i7.u14.p94==1))||((u0.p16==1)&&(i7.u14.p87==1)))||((((((((((i3.u6.p34==0)&&(i6.u11.p66==0))&&(i7.u13.p118==0))&&(i6.u11.p52==0))&&(i7.u14.p88==0))&&(u0.p11==0))&&(i7.u14.p90==0))&&(u12.p110==0))&&(i6.u11.p63==0))&&(u12.p108==0)))) * (((((i6.u11.p65==1)||(i3.u5.p32==1))||((u0.p16==1)&&(i7.u14.p112==1)))||(u0.p14==1))||(i7.u14.p94==1))) * ((((i7.u13.p101==1)||(u0.p10==1))||(i6.u11.p58==1))||((u8.p46==1)&&(i7.u13.p116==1)))) * (u0.p3==0)) * (i1.u1.p21==0)) * (i1.u1.p22==0)) * ((u0.p16==0)||(i7.u14.p87==0))) * (i3.u5.p31==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((((((((EG(EX((((i7.u13.p97==1)||(u0.p4==1))||(i2.u4.p29==1)))) * ((((((((((u7.p38==1)||(i6.u11.p59==1))||(i7.u14.p99==1))||(i6.u11.p50==1))||(u7.p36==1))||(u0.p6==1))||(i6.u11.p54==1))||(i7.u14.p94==1))||((u0.p16==1)&&(i7.u14.p87==1)))||((((((((((i3.u6.p34==0)&&(i6.u11.p66==0))&&(i7.u13.p118==0))&&(i6.u11.p52==0))&&(i7.u14.p88==0))&&(u0.p11==0))&&(i7.u14.p90==0))&&(u12.p110==0))&&(i6.u11.p63==0))&&(u12.p108==0)))) * (((((i6.u11.p65==1)||(i3.u5.p32==1))||((u0.p16==1)&&(i7.u14.p112==1)))||(u0.p14==1))||(i7.u14.p94==1))) * ((((i7.u13.p101==1)||(u0.p10==1))||(i6.u11.p58==1))||((u8.p46==1)&&(i7.u13.p116==1)))) * (u0.p3==0)) * (i1.u1.p21==0)) * (i1.u1.p22==0)) * ((u0.p16==0)||(i7.u14.p87==0))) * (i3.u5.p31==0)))] = 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
(forward)formula 1,0,5.14626,152340,1,0,185762,69731,2977,381041,1640,241959,403962
FORMULA HealthRecord-PT-02-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX((!(EF(AG(((((((((i6.u9.p67==0)&&(i7.u14.p82==0))&&(i7.u13.p101==0))&&(i7.u13.p85==0))&&(i7.u14.p100==0))&&(i7.u14.p89==0))&&(i6.u11.p61==0))&&(i7.u13.p79==0))))) * ((((((((i7.u13.p97==1)||(i7.u13.p81==1))||(i3.u6.p34==1))||(u7.p37==1))||(i6.u10.p70==1))||(u0.p9==1))||(i7.u14.p107==1))||(u12.p109==1))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),TRUE) * !(E(TRUE U !(((((((((i6.u9.p67==0)&&(i7.u14.p82==0))&&(i7.u13.p101==0))&&(i7.u13.p85==0))&&(i7.u14.p100==0))&&(i7.u14.p89==0))&&(i6.u11.p61==0))&&(i7.u13.p79==0))))))] = FALSE * [(EY(Init) * !(((((((((i7.u13.p97==1)||(i7.u13.p81==1))||(i3.u6.p34==1))||(u7.p37==1))||(i6.u10.p70==1))||(u0.p9==1))||(i7.u14.p107==1))||(u12.p109==1))))] = FALSE)
(forward)formula 2,0,6.0166,172668,1,0,205642,86246,3341,439410,1751,330129,440870
FORMULA HealthRecord-PT-02-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (((A((A(A((i7.u14.p89==1) U (((((((i7.u14.p115==1)||(i6.u11.p51==1))||(i6.u9.p69==1))||(i6.u11.p75==1))||(i6.u11.p58==1))||(i3.u5.p31==1))||(i7.u14.p78==1))) U (((((((((u0.p17==0)||(i1.u2.p23==0))||(i2.u4.p28==0))||(i3.u6.p33==0))||(u7.p40==0))||(u8.p47==0))||(i6.u11.p73==0))||(i7.u14.p117==0))&&(i7.u14.p95==0))) * ((((((u0.p16==1)||(i6.u11.p51==1))||(u0.p5==1))||(i7.u14.p106==1))||(i7.u14.p77==1))||(u8.p44==1))) U AX(EF((((((((i7.u14.p113==1)||(i6.u11.p52==1))||(i7.u14.p86==1))||((u0.p16==1)&&(i7.u13.p116==1)))||(i6.u11.p60==1))||((i6.u11.p73==1)&&(i7.u14.p92==1)))||(i6.u11.p62==1))))) * EF((EG((((i7.u13.p85==1)||(i6.u11.p55==1))||(i6.u11.p58==1))) * ((((((((u0.p16==1)||(i7.u14.p99==1))||(i6.u11.p50==1))||(i7.u13.p101==1))||(i6.u11.p61==1))||((u0.p16==1)&&(i7.u13.p116==1)))||(i7.u14.p95==1))||(u7.p36==1))))) * EX(((((((i7.u14.p106==1)||(i7.u14.p91==1))||(u8.p45==1))||(u8.p44==1))||(u0.p14==1)) + E((u0.p16==1) U ((((((((i7.u14.p96==1)||(u8.p48==1))||(i7.u14.p82==1))||(i6.u10.p71==1))||((i6.u11.p73==1)&&(i7.u14.p115==1)))||(i6.u10.p70==1))||(u12.p109==1))||(i7.u14.p94==1)))))) * AX(!(AX((u7.p41==1)))))
=> equivalent forward existential formula: (((([(EY((FwdU(Init,!(!(EX(!(E(TRUE U (((((((i7.u14.p113==1)||(i6.u11.p52==1))||(i7.u14.p86==1))||((u0.p16==1)&&(i7.u13.p116==1)))||(i6.u11.p60==1))||((i6.u11.p73==1)&&(i7.u14.p92==1)))||(i6.u11.p62==1)))))))) * !((!((E(!((((((((((u0.p17==0)||(i1.u2.p23==0))||(i2.u4.p28==0))||(i3.u6.p33==0))||(u7.p40==0))||(u8.p47==0))||(i6.u11.p73==0))||(i7.u14.p117==0))&&(i7.u14.p95==0))) U (!(!((E(!((((((((i7.u14.p115==1)||(i6.u11.p51==1))||(i6.u9.p69==1))||(i6.u11.p75==1))||(i6.u11.p58==1))||(i3.u5.p31==1))||(i7.u14.p78==1))) U (!((i7.u14.p89==1)) * !((((((((i7.u14.p115==1)||(i6.u11.p51==1))||(i6.u9.p69==1))||(i6.u11.p75==1))||(i6.u11.p58==1))||(i3.u5.p31==1))||(i7.u14.p78==1))))) + EG(!((((((((i7.u14.p115==1)||(i6.u11.p51==1))||(i6.u9.p69==1))||(i6.u11.p75==1))||(i6.u11.p58==1))||(i3.u5.p31==1))||(i7.u14.p78==1))))))) * !((((((((((u0.p17==0)||(i1.u2.p23==0))||(i2.u4.p28==0))||(i3.u6.p33==0))||(u7.p40==0))||(u8.p47==0))||(i6.u11.p73==0))||(i7.u14.p117==0))&&(i7.u14.p95==0))))) + EG(!((((((((((u0.p17==0)||(i1.u2.p23==0))||(i2.u4.p28==0))||(i3.u6.p33==0))||(u7.p40==0))||(u8.p47==0))||(i6.u11.p73==0))||(i7.u14.p117==0))&&(i7.u14.p95==0)))))) * ((((((u0.p16==1)||(i6.u11.p51==1))||(u0.p5==1))||(i7.u14.p106==1))||(i7.u14.p77==1))||(u8.p44==1)))))) * !(E(TRUE U (((((((i7.u14.p113==1)||(i6.u11.p52==1))||(i7.u14.p86==1))||((u0.p16==1)&&(i7.u13.p116==1)))||(i6.u11.p60==1))||((i6.u11.p73==1)&&(i7.u14.p92==1)))||(i6.u11.p62==1)))))] = FALSE * [FwdG(Init,!(!(EX(!(E(TRUE U (((((((i7.u14.p113==1)||(i6.u11.p52==1))||(i7.u14.p86==1))||((u0.p16==1)&&(i7.u13.p116==1)))||(i6.u11.p60==1))||((i6.u11.p73==1)&&(i7.u14.p92==1)))||(i6.u11.p62==1))))))))] = FALSE) * [(Init * !(E(TRUE U (EG((((i7.u13.p85==1)||(i6.u11.p55==1))||(i6.u11.p58==1))) * ((((((((u0.p16==1)||(i7.u14.p99==1))||(i6.u11.p50==1))||(i7.u13.p101==1))||(i6.u11.p61==1))||((u0.p16==1)&&(i7.u13.p116==1)))||(i7.u14.p95==1))||(u7.p36==1))))))] = FALSE) * [(Init * !(EX(((((((i7.u14.p106==1)||(i7.u14.p91==1))||(u8.p45==1))||(u8.p44==1))||(u0.p14==1)) + E((u0.p16==1) U ((((((((i7.u14.p96==1)||(u8.p48==1))||(i7.u14.p82==1))||(i6.u10.p71==1))||((i6.u11.p73==1)&&(i7.u14.p115==1)))||(i6.u10.p70==1))||(u12.p109==1))||(i7.u14.p94==1)))))))] = FALSE) * [(EY(Init) * !(EX(!((u7.p41==1)))))] = FALSE)
(forward)formula 3,1,7.53815,213852,1,0,252542,105118,3561,542019,1772,404641,549038
FORMULA HealthRecord-PT-02-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(((((((((((((i7.u13.p81==0)&&(i3.u6.p0==0))&&(i7.u14.p80==0))&&(u0.p5==0)) * !(AF(((((((((((i6.u11.p66==1)||(u0.p5==1))||(u0.p6==1))||(i7.u14.p86==1))||(i7.u14.p102==1))||(i7.u14.p89==1))||(i2.u3.p26==1))||(i7.u13.p93==1))||((u0.p16==1)&&(i7.u13.p116==1)))||(i2.u4.p30==1))))) * ((i6.u11.p73==0)||(i7.u14.p90==0))) * ((u0.p16==0)||(i7.u13.p116==0))) * ((((((((i7.u13.p97==1)||(i7.u14.p82==1))||(u7.p37==1))||(i7.u14.p91==1))||(i7.u13.p105==1))||(i7.u13.p111==1))||(u12.p109==1))||((u0.p16==1)&&(i7.u13.p116==1)))) * ((((u7.p37==1)||(u0.p7==1))||(i6.u11.p57==1))||(i7.u14.p91==1))) * ((i6.u11.p54==1)||(i6.u11.p57==1))) * (((((((((i6.u11.p65==1)||(i6.u9.p69==1))||(i1.u1.p22==1))||(i6.u11.p75==1))||(i7.u14.p77==1))||(u0.p14==1))||((i6.u11.p73==1)&&(i7.u14.p113==1)))||((i6.u11.p73==1)&&(i7.u14.p96==1)))||((i6.u11.p73==1)&&(i7.u14.p86==1)))) * (AX(((i6.u11.p66==1)||(u7.p38==1))) + EG((i7.u14.p89==1)))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (((((((((((i7.u13.p81==0)&&(i3.u6.p0==0))&&(i7.u14.p80==0))&&(u0.p5==0)) * !(!(EG(!(((((((((((i6.u11.p66==1)||(u0.p5==1))||(u0.p6==1))||(i7.u14.p86==1))||(i7.u14.p102==1))||(i7.u14.p89==1))||(i2.u3.p26==1))||(i7.u13.p93==1))||((u0.p16==1)&&(i7.u13.p116==1)))||(i2.u4.p30==1))))))) * ((i6.u11.p73==0)||(i7.u14.p90==0))) * ((u0.p16==0)||(i7.u13.p116==0))) * ((((((((i7.u13.p97==1)||(i7.u14.p82==1))||(u7.p37==1))||(i7.u14.p91==1))||(i7.u13.p105==1))||(i7.u13.p111==1))||(u12.p109==1))||((u0.p16==1)&&(i7.u13.p116==1)))) * ((((u7.p37==1)||(u0.p7==1))||(i6.u11.p57==1))||(i7.u14.p91==1))) * ((i6.u11.p54==1)||(i6.u11.p57==1))) * (((((((((i6.u11.p65==1)||(i6.u9.p69==1))||(i1.u1.p22==1))||(i6.u11.p75==1))||(i7.u14.p77==1))||(u0.p14==1))||((i6.u11.p73==1)&&(i7.u14.p113==1)))||((i6.u11.p73==1)&&(i7.u14.p96==1)))||((i6.u11.p73==1)&&(i7.u14.p86==1))))) * !(EX(!(((i6.u11.p66==1)||(u7.p38==1))))))] != FALSE + [FwdG((FwdU(Init,TRUE) * (((((((((((i7.u13.p81==0)&&(i3.u6.p0==0))&&(i7.u14.p80==0))&&(u0.p5==0)) * !(!(EG(!(((((((((((i6.u11.p66==1)||(u0.p5==1))||(u0.p6==1))||(i7.u14.p86==1))||(i7.u14.p102==1))||(i7.u14.p89==1))||(i2.u3.p26==1))||(i7.u13.p93==1))||((u0.p16==1)&&(i7.u13.p116==1)))||(i2.u4.p30==1))))))) * ((i6.u11.p73==0)||(i7.u14.p90==0))) * ((u0.p16==0)||(i7.u13.p116==0))) * ((((((((i7.u13.p97==1)||(i7.u14.p82==1))||(u7.p37==1))||(i7.u14.p91==1))||(i7.u13.p105==1))||(i7.u13.p111==1))||(u12.p109==1))||((u0.p16==1)&&(i7.u13.p116==1)))) * ((((u7.p37==1)||(u0.p7==1))||(i6.u11.p57==1))||(i7.u14.p91==1))) * ((i6.u11.p54==1)||(i6.u11.p57==1))) * (((((((((i6.u11.p65==1)||(i6.u9.p69==1))||(i1.u1.p22==1))||(i6.u11.p75==1))||(i7.u14.p77==1))||(u0.p14==1))||((i6.u11.p73==1)&&(i7.u14.p113==1)))||((i6.u11.p73==1)&&(i7.u14.p96==1)))||((i6.u11.p73==1)&&(i7.u14.p86==1))))),(i7.u14.p89==1))] != FALSE)
(forward)formula 4,0,8.37862,236556,1,0,279490,110762,3682,595187,1781,432757,600874
FORMULA HealthRecord-PT-02-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF((AF(EG((((((((((((i6.u11.p73==1)&&(i7.u14.p96==1))||((u0.p16==1)&&(i7.u14.p106==1)))||(i6.u11.p51==1))||(i7.u14.p82==1))||(u7.p36==1))||(i1.u1.p22==1))||(i6.u11.p56==1))||(i7.u14.p91==1))||((i6.u11.p73==1)&&(i7.u14.p92==1)))||(i6.u11.p62==1)))) * AX(A(((u0.p9==1)||(i7.u13.p79==1)) U ((((((((((i1.u2.p49==0)&&(i7.u13.p97==0))&&((i6.u11.p73==0)||(i7.u14.p80==0)))&&(i7.u14.p113==0))&&(i6.u9.p68==0))&&(i7.u14.p87==0))&&((i6.u11.p73==0)||(i7.u14.p115==0)))&&(i7.u13.p79==0))&&(((((((i3.u6.p34==1)||(i1.u2.p20==1))||(i6.u9.p68==1))||(i6.u11.p55==1))||(i6.u11.p59==1))||(i7.u13.p93==1))||((i6.u11.p73==1)&&(i7.u14.p94==1))))&&((((((((u7.p37==1)||(i6.u9.p68==1))||(i1.u2.p24==1))||(i6.u10.p72==1))||(u0.p10==1))||((u0.p16==1)&&(i7.u13.p116==1)))||(u8.p45==1))||(i2.u4.p29==1)))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(EG((((((((((((i6.u11.p73==1)&&(i7.u14.p96==1))||((u0.p16==1)&&(i7.u14.p106==1)))||(i6.u11.p51==1))||(i7.u14.p82==1))||(u7.p36==1))||(i1.u1.p22==1))||(i6.u11.p56==1))||(i7.u14.p91==1))||((i6.u11.p73==1)&&(i7.u14.p92==1)))||(i6.u11.p62==1))))))) * !(EX(!(!((E(!(((((((((((i1.u2.p49==0)&&(i7.u13.p97==0))&&((i6.u11.p73==0)||(i7.u14.p80==0)))&&(i7.u14.p113==0))&&(i6.u9.p68==0))&&(i7.u14.p87==0))&&((i6.u11.p73==0)||(i7.u14.p115==0)))&&(i7.u13.p79==0))&&(((((((i3.u6.p34==1)||(i1.u2.p20==1))||(i6.u9.p68==1))||(i6.u11.p55==1))||(i6.u11.p59==1))||(i7.u13.p93==1))||((i6.u11.p73==1)&&(i7.u14.p94==1))))&&((((((((u7.p37==1)||(i6.u9.p68==1))||(i1.u2.p24==1))||(i6.u10.p72==1))||(u0.p10==1))||((u0.p16==1)&&(i7.u13.p116==1)))||(u8.p45==1))||(i2.u4.p29==1)))) U (!(((u0.p9==1)||(i7.u13.p79==1))) * !(((((((((((i1.u2.p49==0)&&(i7.u13.p97==0))&&((i6.u11.p73==0)||(i7.u14.p80==0)))&&(i7.u14.p113==0))&&(i6.u9.p68==0))&&(i7.u14.p87==0))&&((i6.u11.p73==0)||(i7.u14.p115==0)))&&(i7.u13.p79==0))&&(((((((i3.u6.p34==1)||(i1.u2.p20==1))||(i6.u9.p68==1))||(i6.u11.p55==1))||(i6.u11.p59==1))||(i7.u13.p93==1))||((i6.u11.p73==1)&&(i7.u14.p94==1))))&&((((((((u7.p37==1)||(i6.u9.p68==1))||(i1.u2.p24==1))||(i6.u10.p72==1))||(u0.p10==1))||((u0.p16==1)&&(i7.u13.p116==1)))||(u8.p45==1))||(i2.u4.p29==1)))))) + EG(!(((((((((((i1.u2.p49==0)&&(i7.u13.p97==0))&&((i6.u11.p73==0)||(i7.u14.p80==0)))&&(i7.u14.p113==0))&&(i6.u9.p68==0))&&(i7.u14.p87==0))&&((i6.u11.p73==0)||(i7.u14.p115==0)))&&(i7.u13.p79==0))&&(((((((i3.u6.p34==1)||(i1.u2.p20==1))||(i6.u9.p68==1))||(i6.u11.p55==1))||(i6.u11.p59==1))||(i7.u13.p93==1))||((i6.u11.p73==1)&&(i7.u14.p94==1))))&&((((((((u7.p37==1)||(i6.u9.p68==1))||(i1.u2.p24==1))||(i6.u10.p72==1))||(u0.p10==1))||((u0.p16==1)&&(i7.u13.p116==1)))||(u8.p45==1))||(i2.u4.p29==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
(forward)formula 5,1,12.8789,351924,1,0,432207,126251,3819,882328,1791,504397,827459
FORMULA HealthRecord-PT-02-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(EF(AG(((((((((((i7.u14.p96==1)||(i6.u11.p53==1))||(i7.u14.p84==1))||(i2.u3.p26==1))||(i7.u14.p91==1))||(i7.u13.p93==1))||(i7.u14.p95==1))||((u0.p16==1)&&(i7.u14.p106==1)))||((u7.p39==1)&&(i7.u13.p116==1)))||((u0.p16==1)&&(i7.u13.p116==1))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U !(((((((((((i7.u14.p96==1)||(i6.u11.p53==1))||(i7.u14.p84==1))||(i2.u3.p26==1))||(i7.u14.p91==1))||(i7.u13.p93==1))||(i7.u14.p95==1))||((u0.p16==1)&&(i7.u14.p106==1)))||((u7.p39==1)&&(i7.u13.p116==1)))||((u0.p16==1)&&(i7.u13.p116==1)))))))] != FALSE
(forward)formula 6,0,12.9825,354564,1,0,434631,127493,3853,890472,1797,511556,834132
FORMULA HealthRecord-PT-02-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(A(A((((u0.p7==0)&&(i2.u4.p42==0))&&(u0.p15==0)) U EF(((((((((i6.u11.p66==1)||(i7.u13.p85==1))||(i7.u14.p89==1))||(i6.u11.p58==1))||(i1.u1.p21==1))||(i2.u4.p29==1))||((i6.u11.p73==1)&&(i7.u14.p96==1)))||((u7.p39==1)&&(i7.u13.p116==1))))) U A(AX((((i6.u11.p55==1)||(i6.u10.p70==1))&&(((i7.u14.p86==1)||(u0.p15==1))||((u0.p16==1)&&(i7.u14.p112==1))))) U (AF(((((((u0.p5==1)||(u8.p45==1))||(i7.u14.p77==1))||((u0.p16==1)&&(i7.u13.p116==1)))||(i2.u4.p29==1))||(u8.p44==1))) + !(E((((((((((i6.u11.p64==1)||((i6.u11.p73==1)&&(i7.u14.p86==1)))||((u0.p19==1)&&(i7.u13.p116==1)))||((i6.u11.p73==1)&&(i7.u14.p115==1)))||(u0.p9==1))||(i7.u14.p88==1))||(u8.p45==1))||(i2.u4.p29==1))||((i6.u11.p73==1)&&(i7.u14.p107==1))) U ((((i7.u13.p97==1)||(i7.u14.p87==1))||(u0.p7==1))||((u0.p16==1)&&(i7.u13.p116==1)))))))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!((E(!((!(EG(!(((((((u0.p5==1)||(u8.p45==1))||(i7.u14.p77==1))||((u0.p16==1)&&(i7.u13.p116==1)))||(i2.u4.p29==1))||(u8.p44==1))))) + !(E((((((((((i6.u11.p64==1)||((i6.u11.p73==1)&&(i7.u14.p86==1)))||((u0.p19==1)&&(i7.u13.p116==1)))||((i6.u11.p73==1)&&(i7.u14.p115==1)))||(u0.p9==1))||(i7.u14.p88==1))||(u8.p45==1))||(i2.u4.p29==1))||((i6.u11.p73==1)&&(i7.u14.p107==1))) U ((((i7.u13.p97==1)||(i7.u14.p87==1))||(u0.p7==1))||((u0.p16==1)&&(i7.u13.p116==1))))))) U (!(!(EX(!((((i6.u11.p55==1)||(i6.u10.p70==1))&&(((i7.u14.p86==1)||(u0.p15==1))||((u0.p16==1)&&(i7.u14.p112==1)))))))) * !((!(EG(!(((((((u0.p5==1)||(u8.p45==1))||(i7.u14.p77==1))||((u0.p16==1)&&(i7.u13.p116==1)))||(i2.u4.p29==1))||(u8.p44==1))))) + !(E((((((((((i6.u11.p64==1)||((i6.u11.p73==1)&&(i7.u14.p86==1)))||((u0.p19==1)&&(i7.u13.p116==1)))||((i6.u11.p73==1)&&(i7.u14.p115==1)))||(u0.p9==1))||(i7.u14.p88==1))||(u8.p45==1))||(i2.u4.p29==1))||((i6.u11.p73==1)&&(i7.u14.p107==1))) U ((((i7.u13.p97==1)||(i7.u14.p87==1))||(u0.p7==1))||((u0.p16==1)&&(i7.u13.p116==1))))))))) + EG(!((!(EG(!(((((((u0.p5==1)||(u8.p45==1))||(i7.u14.p77==1))||((u0.p16==1)&&(i7.u13.p116==1)))||(i2.u4.p29==1))||(u8.p44==1))))) + !(E((((((((((i6.u11.p64==1)||((i6.u11.p73==1)&&(i7.u14.p86==1)))||((u0.p19==1)&&(i7.u13.p116==1)))||((i6.u11.p73==1)&&(i7.u14.p115==1)))||(u0.p9==1))||(i7.u14.p88==1))||(u8.p45==1))||(i2.u4.p29==1))||((i6.u11.p73==1)&&(i7.u14.p107==1))) U ((((i7.u13.p97==1)||(i7.u14.p87==1))||(u0.p7==1))||((u0.p16==1)&&(i7.u13.p116==1)))))))))))))) * !(E(!(!((E(!((!(EG(!(((((((u0.p5==1)||(u8.p45==1))||(i7.u14.p77==1))||((u0.p16==1)&&(i7.u13.p116==1)))||(i2.u4.p29==1))||(u8.p44==1))))) + !(E((((((((((i6.u11.p64==1)||((i6.u11.p73==1)&&(i7.u14.p86==1)))||((u0.p19==1)&&(i7.u13.p116==1)))||((i6.u11.p73==1)&&(i7.u14.p115==1)))||(u0.p9==1))||(i7.u14.p88==1))||(u8.p45==1))||(i2.u4.p29==1))||((i6.u11.p73==1)&&(i7.u14.p107==1))) U ((((i7.u13.p97==1)||(i7.u14.p87==1))||(u0.p7==1))||((u0.p16==1)&&(i7.u13.p116==1))))))) U (!(!(EX(!((((i6.u11.p55==1)||(i6.u10.p70==1))&&(((i7.u14.p86==1)||(u0.p15==1))||((u0.p16==1)&&(i7.u14.p112==1)))))))) * !((!(EG(!(((((((u0.p5==1)||(u8.p45==1))||(i7.u14.p77==1))||((u0.p16==1)&&(i7.u13.p116==1)))||(i2.u4.p29==1))||(u8.p44==1))))) + !(E((((((((((i6.u11.p64==1)||((i6.u11.p73==1)&&(i7.u14.p86==1)))||((u0.p19==1)&&(i7.u13.p116==1)))||((i6.u11.p73==1)&&(i7.u14.p115==1)))||(u0.p9==1))||(i7.u14.p88==1))||(u8.p45==1))||(i2.u4.p29==1))||((i6.u11.p73==1)&&(i7.u14.p107==1))) U ((((i7.u13.p97==1)||(i7.u14.p87==1))||(u0.p7==1))||((u0.p16==1)&&(i7.u13.p116==1))))))))) + EG(!((!(EG(!(((((((u0.p5==1)||(u8.p45==1))||(i7.u14.p77==1))||((u0.p16==1)&&(i7.u13.p116==1)))||(i2.u4.p29==1))||(u8.p44==1))))) + !(E((((((((((i6.u11.p64==1)||((i6.u11.p73==1)&&(i7.u14.p86==1)))||((u0.p19==1)&&(i7.u13.p116==1)))||((i6.u11.p73==1)&&(i7.u14.p115==1)))||(u0.p9==1))||(i7.u14.p88==1))||(u8.p45==1))||(i2.u4.p29==1))||((i6.u11.p73==1)&&(i7.u14.p107==1))) U ((((i7.u13.p97==1)||(i7.u14.p87==1))||(u0.p7==1))||((u0.p16==1)&&(i7.u13.p116==1))))))))))) U (!(!((E(!(E(TRUE U ((((((((i6.u11.p66==1)||(i7.u13.p85==1))||(i7.u14.p89==1))||(i6.u11.p58==1))||(i1.u1.p21==1))||(i2.u4.p29==1))||((i6.u11.p73==1)&&(i7.u14.p96==1)))||((u7.p39==1)&&(i7.u13.p116==1))))) U (!((((u0.p7==0)&&(i2.u4.p42==0))&&(u0.p15==0))) * !(E(TRUE U ((((((((i6.u11.p66==1)||(i7.u13.p85==1))||(i7.u14.p89==1))||(i6.u11.p58==1))||(i1.u1.p21==1))||(i2.u4.p29==1))||((i6.u11.p73==1)&&(i7.u14.p96==1)))||((u7.p39==1)&&(i7.u13.p116==1))))))) + EG(!(E(TRUE U ((((((((i6.u11.p66==1)||(i7.u13.p85==1))||(i7.u14.p89==1))||(i6.u11.p58==1))||(i1.u1.p21==1))||(i2.u4.p29==1))||((i6.u11.p73==1)&&(i7.u14.p96==1)))||((u7.p39==1)&&(i7.u13.p116==1))))))))) * !(!((E(!((!(EG(!(((((((u0.p5==1)||(u8.p45==1))||(i7.u14.p77==1))||((u0.p16==1)&&(i7.u13.p116==1)))||(i2.u4.p29==1))||(u8.p44==1))))) + !(E((((((((((i6.u11.p64==1)||((i6.u11.p73==1)&&(i7.u14.p86==1)))||((u0.p19==1)&&(i7.u13.p116==1)))||((i6.u11.p73==1)&&(i7.u14.p115==1)))||(u0.p9==1))||(i7.u14.p88==1))||(u8.p45==1))||(i2.u4.p29==1))||((i6.u11.p73==1)&&(i7.u14.p107==1))) U ((((i7.u13.p97==1)||(i7.u14.p87==1))||(u0.p7==1))||((u0.p16==1)&&(i7.u13.p116==1))))))) U (!(!(EX(!((((i6.u11.p55==1)||(i6.u10.p70==1))&&(((i7.u14.p86==1)||(u0.p15==1))||((u0.p16==1)&&(i7.u14.p112==1)))))))) * !((!(EG(!(((((((u0.p5==1)||(u8.p45==1))||(i7.u14.p77==1))||((u0.p16==1)&&(i7.u13.p116==1)))||(i2.u4.p29==1))||(u8.p44==1))))) + !(E((((((((((i6.u11.p64==1)||((i6.u11.p73==1)&&(i7.u14.p86==1)))||((u0.p19==1)&&(i7.u13.p116==1)))||((i6.u11.p73==1)&&(i7.u14.p115==1)))||(u0.p9==1))||(i7.u14.p88==1))||(u8.p45==1))||(i2.u4.p29==1))||((i6.u11.p73==1)&&(i7.u14.p107==1))) U ((((i7.u13.p97==1)||(i7.u14.p87==1))||(u0.p7==1))||((u0.p16==1)&&(i7.u13.p116==1))))))))) + EG(!((!(EG(!(((((((u0.p5==1)||(u8.p45==1))||(i7.u14.p77==1))||((u0.p16==1)&&(i7.u13.p116==1)))||(i2.u4.p29==1))||(u8.p44==1))))) + !(E((((((((((i6.u11.p64==1)||((i6.u11.p73==1)&&(i7.u14.p86==1)))||((u0.p19==1)&&(i7.u13.p116==1)))||((i6.u11.p73==1)&&(i7.u14.p115==1)))||(u0.p9==1))||(i7.u14.p88==1))||(u8.p45==1))||(i2.u4.p29==1))||((i6.u11.p73==1)&&(i7.u14.p107==1))) U ((((i7.u13.p97==1)||(i7.u14.p87==1))||(u0.p7==1))||((u0.p16==1)&&(i7.u13.p116==1)))))))))))))))] != FALSE
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local 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 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
(forward)formula 7,1,15.024,416880,1,0,507329,143405,3962,1.06597e+06,1804,588228,969127
FORMULA HealthRecord-PT-02-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1621280986860

--------------------
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-02"
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-02, 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-162124156200266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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