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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K 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 3.0K May 11 18:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 11 18:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 11 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 11 15:47 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 49K 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-08-CTLFireability-00
FORMULA_NAME HealthRecord-PT-08-CTLFireability-01
FORMULA_NAME HealthRecord-PT-08-CTLFireability-02
FORMULA_NAME HealthRecord-PT-08-CTLFireability-03
FORMULA_NAME HealthRecord-PT-08-CTLFireability-04
FORMULA_NAME HealthRecord-PT-08-CTLFireability-05
FORMULA_NAME HealthRecord-PT-08-CTLFireability-06
FORMULA_NAME HealthRecord-PT-08-CTLFireability-07
FORMULA_NAME HealthRecord-PT-08-CTLFireability-08
FORMULA_NAME HealthRecord-PT-08-CTLFireability-09
FORMULA_NAME HealthRecord-PT-08-CTLFireability-10
FORMULA_NAME HealthRecord-PT-08-CTLFireability-11
FORMULA_NAME HealthRecord-PT-08-CTLFireability-12
FORMULA_NAME HealthRecord-PT-08-CTLFireability-13
FORMULA_NAME HealthRecord-PT-08-CTLFireability-14
FORMULA_NAME HealthRecord-PT-08-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1621281466088

Running Version 0
[2021-05-17 19:57:47] [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:57:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 19:57:47] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2021-05-17 19:57:47] [INFO ] Transformed 156 places.
[2021-05-17 19:57:47] [INFO ] Transformed 326 transitions.
[2021-05-17 19:57:47] [INFO ] Found NUPN structural information;
[2021-05-17 19:57:47] [INFO ] Parsed PT model containing 156 places and 326 transitions in 91 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
[2021-05-17 19:57:47] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 19:57:47] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 19:57:47] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 19:57:47] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 19:57:47] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 19:57:47] [INFO ] Reduced 1 identical enabling conditions.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Support contains 150 out of 156 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 156/156 places, 300/300 transitions.
Applied a total of 0 rules in 13 ms. Remains 156 /156 variables (removed 0) and now considering 300/300 (removed 0) transitions.
[2021-05-17 19:57:47] [INFO ] Flow matrix only has 288 transitions (discarded 12 similar events)
// Phase 1: matrix 288 rows 156 cols
[2021-05-17 19:57:47] [INFO ] Computed 18 place invariants in 18 ms
[2021-05-17 19:57:48] [INFO ] Implicit Places using invariants in 155 ms returned []
[2021-05-17 19:57:48] [INFO ] Flow matrix only has 288 transitions (discarded 12 similar events)
// Phase 1: matrix 288 rows 156 cols
[2021-05-17 19:57:48] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 19:57:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 19:57:48] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2021-05-17 19:57:48] [INFO ] Flow matrix only has 288 transitions (discarded 12 similar events)
// Phase 1: matrix 288 rows 156 cols
[2021-05-17 19:57:48] [INFO ] Computed 18 place invariants in 3 ms
[2021-05-17 19:57:48] [INFO ] Dead Transitions using invariants and state equation in 187 ms returned []
Finished structural reductions, in 1 iterations. Remains : 156/156 places, 300/300 transitions.
[2021-05-17 19:57:48] [INFO ] Flatten gal took : 52 ms
[2021-05-17 19:57:48] [INFO ] Flatten gal took : 22 ms
[2021-05-17 19:57:48] [INFO ] Input system was already deterministic with 300 transitions.
Incomplete random walk after 100000 steps, including 5592 resets, run finished after 399 ms. (steps per millisecond=250 ) properties (out of 70) seen :65
Running SMT prover for 5 properties.
[2021-05-17 19:57:49] [INFO ] Flow matrix only has 288 transitions (discarded 12 similar events)
// Phase 1: matrix 288 rows 156 cols
[2021-05-17 19:57:49] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 19:57:49] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 19:57:49] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 19:57:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:49] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2021-05-17 19:57:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 19:57:49] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2021-05-17 19:57:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:57:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2021-05-17 19:57:49] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-17 19:57:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:49] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2021-05-17 19:57:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 19:57:49] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 18 ms.
[2021-05-17 19:57:49] [INFO ] Added : 90 causal constraints over 19 iterations in 338 ms. Result :sat
[2021-05-17 19:57:49] [INFO ] [Real]Absence check using 10 positive place invariants in 12 ms returned sat
[2021-05-17 19:57:49] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-17 19:57:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:49] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-17 19:57:49] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 19:57:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:57:49] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-17 19:57:49] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2021-05-17 19:57:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:50] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2021-05-17 19:57:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 19:57:50] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 4 ms to minimize.
[2021-05-17 19:57:50] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2021-05-17 19:57:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 170 ms
[2021-05-17 19:57:50] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 17 ms.
[2021-05-17 19:57:50] [INFO ] Added : 83 causal constraints over 17 iterations in 257 ms. Result :sat
[2021-05-17 19:57:50] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 19:57:50] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 19:57:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:50] [INFO ] [Real]Absence check using state equation in 51 ms returned unsat
[2021-05-17 19:57:50] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 19:57:50] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 19:57:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:50] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2021-05-17 19:57:50] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 19:57:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:57:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 19:57:50] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 19:57:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:50] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2021-05-17 19:57:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 19:57:50] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2021-05-17 19:57:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2021-05-17 19:57:50] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 22 ms.
[2021-05-17 19:57:51] [INFO ] Added : 81 causal constraints over 17 iterations in 278 ms. Result :sat
[2021-05-17 19:57:51] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 19:57:51] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 19:57:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:51] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-05-17 19:57:51] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 19:57:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:57:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-17 19:57:51] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-17 19:57:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:51] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2021-05-17 19:57:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 19:57:51] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 0 ms to minimize.
[2021-05-17 19:57:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2021-05-17 19:57:51] [INFO ] Computed and/alt/rep : 227/259/227 causal constraints (skipped 60 transitions) in 23 ms.
[2021-05-17 19:57:51] [INFO ] Added : 87 causal constraints over 19 iterations in 267 ms. Result :sat
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
Graph (trivial) has 177 edges and 156 vertex of which 12 / 156 are part of one of the 6 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 74 places :
Symmetric choice reduction at 0 with 74 rule applications. Total rules 75 place count 76 transition count 154
Iterating global reduction 0 with 74 rules applied. Total rules applied 149 place count 76 transition count 154
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 156 place count 69 transition count 140
Iterating global reduction 0 with 7 rules applied. Total rules applied 163 place count 69 transition count 140
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 169 place count 69 transition count 134
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 175 place count 66 transition count 131
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 183 place count 62 transition count 163
Applied a total of 183 rules in 34 ms. Remains 62 /156 variables (removed 94) and now considering 163/300 (removed 137) transitions.
[2021-05-17 19:57:51] [INFO ] Flatten gal took : 12 ms
[2021-05-17 19:57:51] [INFO ] Flatten gal took : 12 ms
[2021-05-17 19:57:51] [INFO ] Input system was already deterministic with 163 transitions.
[2021-05-17 19:57:51] [INFO ] Flatten gal took : 11 ms
[2021-05-17 19:57:51] [INFO ] Flatten gal took : 11 ms
[2021-05-17 19:57:51] [INFO ] Time to serialize gal into /tmp/CTLFireability3335212725769163721.gal : 6 ms
[2021-05-17 19:57:51] [INFO ] Time to serialize properties into /tmp/CTLFireability8074679161504940221.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/CTLFireability3335212725769163721.gal, -t, CGAL, -ctl, /tmp/CTLFireability8074679161504940221.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/CTLFireability3335212725769163721.gal -t CGAL -ctl /tmp/CTLFireability8074679161504940221.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,432005,0.324528,15228,2,4178,5,41463,6,0,399,35459,0


Converting to forward existential form...Done !
original formula: AG(E(EF((((((p44==1)||(p48==1))||(p57==1))||(p93==1))||((p110==1)&&(p137==1)))) U ((EF((((p122==1)||(p123==1))||(p43==1))) * (((p151==1)||(p42==1))||((p83==1)&&(p153==1)))) * ((((((((p114==1)||(p8==1))||(p25==1))||(p124==1))||(p48==1))||(p5==1))||(p91==1))||((p38==1)&&(p153==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(E(TRUE U (((((p44==1)||(p48==1))||(p57==1))||(p93==1))||((p110==1)&&(p137==1)))) U ((E(TRUE U (((p122==1)||(p123==1))||(p43==1))) * (((p151==1)||(p42==1))||((p83==1)&&(p153==1)))) * ((((((((p114==1)||(p8==1))||(p25==1))||(p124==1))||(p48==1))||(p5==1))||(p91==1))||((p38==1)&&(p153==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, t31, t32, t33, t34, t35, t36, t37, t38, t46, t47, t48, t49, t50, t51, t52, t53, t55, t56, t57, t58, t60, t61, t62, t63, t71, t75, t79, t103, t104, t105, t106, t109, t110, t111, t112, t113, t114, t115, t116, t117, t118, t119, t120, t121, t122, t123, t124, t127, t128, t129, t130, t139, t140, t141, t142, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/77/86/163
(forward)formula 0,0,6.21401,191152,1,0,432,1.12649e+06,343,191,3750,772898,488
FORMULA HealthRecord-PT-08-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Graph (trivial) has 151 edges and 156 vertex of which 12 / 156 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 76 places :
Symmetric choice reduction at 0 with 76 rule applications. Total rules 77 place count 74 transition count 151
Iterating global reduction 0 with 76 rules applied. Total rules applied 153 place count 74 transition count 151
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 162 place count 65 transition count 133
Iterating global reduction 0 with 9 rules applied. Total rules applied 171 place count 65 transition count 133
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 179 place count 65 transition count 125
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 183 place count 63 transition count 123
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 189 place count 60 transition count 135
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 190 place count 60 transition count 134
Applied a total of 190 rules in 19 ms. Remains 60 /156 variables (removed 96) and now considering 134/300 (removed 166) transitions.
[2021-05-17 19:57:58] [INFO ] Flatten gal took : 7 ms
[2021-05-17 19:57:58] [INFO ] Flatten gal took : 8 ms
[2021-05-17 19:57:58] [INFO ] Input system was already deterministic with 134 transitions.
[2021-05-17 19:57:58] [INFO ] Flatten gal took : 9 ms
[2021-05-17 19:57:58] [INFO ] Flatten gal took : 8 ms
[2021-05-17 19:57:58] [INFO ] Time to serialize gal into /tmp/CTLFireability11347652138403389412.gal : 2 ms
[2021-05-17 19:57:58] [INFO ] Time to serialize properties into /tmp/CTLFireability7052645086665180279.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/CTLFireability11347652138403389412.gal, -t, CGAL, -ctl, /tmp/CTLFireability7052645086665180279.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/CTLFireability11347652138403389412.gal -t CGAL -ctl /tmp/CTLFireability7052645086665180279.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,943566,0.776378,29052,2,4756,5,79811,6,0,365,107184,0


Converting to forward existential form...Done !
original formula: EF((AG(((((p147==1)||(p46==1))&&((((((((p49==1)||(p2==1))||(p66==1))||(p150==1))||(p7==1))||(p74==1))||(p29==1))||((p54==1)&&(p153==1))))||((((p16==0)||(p153==0))&&((((p16==0)||(p35==0))||(p54==0))||(p124==0)))&&(p47==0)))) * ((((((p131==1)||(p34==1))||(p82==1))||(p136==1))||(p93==1))||(p94==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * ((((((p131==1)||(p34==1))||(p82==1))||(p136==1))||(p93==1))||(p94==1))) * !(E(TRUE U !(((((p147==1)||(p46==1))&&((((((((p49==1)||(p2==1))||(p66==1))||(p150==1))||(p7==1))||(p74==1))||(p29==1))||((p54==1)&&(p153==1))))||((((p16==0)||(p153==0))&&((((p16==0)||(p35==0))||(p54==0))||(p124==0)))&&(p47==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t26, t27, t28, t29, t30, t31, t33, t34, t35, t36, t42, t43, t44, t45, t46, t47, t48, t49, t51, t52, t53, t54, t55, t56, t58, t59, t62, t63, t65, t68, t70, t71, t72, t73, t76, t77, t80, t81, t85, t86, t89, t90, t92, t110, t111, t114, t115, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/63/71/134
(forward)formula 0,1,2.60392,77028,1,0,291,410513,282,107,3143,251461,288
FORMULA HealthRecord-PT-08-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Graph (trivial) has 200 edges and 156 vertex of which 12 / 156 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 84 places :
Symmetric choice reduction at 0 with 84 rule applications. Total rules 85 place count 65 transition count 134
Iterating global reduction 0 with 84 rules applied. Total rules applied 169 place count 65 transition count 134
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 177 place count 57 transition count 118
Iterating global reduction 0 with 8 rules applied. Total rules applied 185 place count 57 transition count 118
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 191 place count 57 transition count 112
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 193 place count 55 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 195 place count 55 transition count 106
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 197 place count 53 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 199 place count 53 transition count 102
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 205 place count 53 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 209 place count 51 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
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 211 place count 50 transition count 102
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 216 place count 50 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 217 place count 49 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 218 place count 48 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 219 place count 47 transition count 94
Applied a total of 219 rules in 29 ms. Remains 47 /156 variables (removed 109) and now considering 94/300 (removed 206) transitions.
[2021-05-17 19:58:00] [INFO ] Flatten gal took : 5 ms
[2021-05-17 19:58:00] [INFO ] Flatten gal took : 5 ms
[2021-05-17 19:58:00] [INFO ] Input system was already deterministic with 94 transitions.
Finished random walk after 1035 steps, including 98 resets, run visited all 1 properties in 9 ms. (steps per millisecond=115 )
FORMULA HealthRecord-PT-08-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Graph (trivial) has 144 edges and 156 vertex of which 8 / 156 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 64 place count 89 transition count 177
Iterating global reduction 0 with 63 rules applied. Total rules applied 127 place count 89 transition count 177
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 128 place count 88 transition count 175
Iterating global reduction 0 with 1 rules applied. Total rules applied 129 place count 88 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 130 place count 88 transition count 174
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
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 138 place count 84 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 139 place count 84 transition count 169
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 147 place count 80 transition count 200
Applied a total of 147 rules in 19 ms. Remains 80 /156 variables (removed 76) and now considering 200/300 (removed 100) transitions.
[2021-05-17 19:58:00] [INFO ] Flatten gal took : 11 ms
[2021-05-17 19:58:00] [INFO ] Flatten gal took : 11 ms
[2021-05-17 19:58:00] [INFO ] Input system was already deterministic with 200 transitions.
[2021-05-17 19:58:00] [INFO ] Flatten gal took : 11 ms
[2021-05-17 19:58:00] [INFO ] Flatten gal took : 11 ms
[2021-05-17 19:58:00] [INFO ] Time to serialize gal into /tmp/CTLFireability5615244295506561543.gal : 1 ms
[2021-05-17 19:58:00] [INFO ] Time to serialize properties into /tmp/CTLFireability13290848211818112360.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/CTLFireability5615244295506561543.gal, -t, CGAL, -ctl, /tmp/CTLFireability13290848211818112360.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/CTLFireability5615244295506561543.gal -t CGAL -ctl /tmp/CTLFireability13290848211818112360.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,1.6694e+06,2.15424,66108,2,11036,5,194126,6,0,506,271260,0


Converting to forward existential form...Done !
original formula: AG(!(E((((A((((((((((((p110==1)&&(p121==1))||(p50==1))||((p110==1)&&(p131==1)))||(p107==1))||(p25==1))||(p12==1))||(p92==1))||(p47==1))||(p46==1))||(p94==1)) U (((p110==1)&&(p117==1))||(p42==1))) + (p120==1)) + (p42==1)) + (p121==1)) U ((((((p145==1)||(p87==1))||((p110==1)&&(p133==1)))||((p35==1)&&(p153==1)))&&((((((((p33==1)||(p34==1))||(p128==1))||(p35==1))||(p148==1))||(p8==1))||(p91==1))||(p28==1)))||((((p51==1)||(p53==1))||(p103==1))&&(((((((p67==1)||(p7==1))||(p23==1))||(p138==1))||((p35==1)&&(p153==1)))||((p19==1)&&(p153==1)))||(p62==1)))))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),(((!((E(!((((p110==1)&&(p117==1))||(p42==1))) U (!((((((((((((p110==1)&&(p121==1))||(p50==1))||((p110==1)&&(p131==1)))||(p107==1))||(p25==1))||(p12==1))||(p92==1))||(p47==1))||(p46==1))||(p94==1))) * !((((p110==1)&&(p117==1))||(p42==1))))) + EG(!((((p110==1)&&(p117==1))||(p42==1)))))) + (p120==1)) + (p42==1)) + (p121==1))) * ((((((p145==1)||(p87==1))||((p110==1)&&(p133==1)))||((p35==1)&&(p153==1)))&&((((((((p33==1)||(p34==1))||(p128==1))||(p35==1))||(p148==1))||(p8==1))||(p91==1))||(p28==1)))||((((p51==1)||(p53==1))||(p103==1))&&(((((((p67==1)||(p7==1))||(p23==1))||(p138==1))||((p35==1)&&(p153==1)))||((p19==1)&&(p153==1)))||(p62==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, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t58, t59, t60, t61, t62, t63, t64, t65, t66, t67, t68, t69, t71, t72, t73, t74, t75, t76, t77, t78, t79, t80, t81, t82, t84, t85, t86, t87, t88, t89, t100, t103, t119, t125, t126, t142, t143, t146, t147, t148, t149, t150, t151, t152, t153, t154, t155, t158, t159, t160, t161, t164, t165, t166, t167, t172, t173, t174, t175, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/92/108/200
Detected timeout of ITS tools.
[2021-05-17 19:58:31] [INFO ] Flatten gal took : 11 ms
[2021-05-17 19:58:31] [INFO ] Applying decomposition
[2021-05-17 19:58:31] [INFO ] Flatten gal took : 11 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/graph8971973372720032374.txt, -o, /tmp/graph8971973372720032374.bin, -w, /tmp/graph8971973372720032374.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/graph8971973372720032374.bin, -l, -1, -v, -w, /tmp/graph8971973372720032374.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 19:58:31] [INFO ] Decomposing Gal with order
[2021-05-17 19:58:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 19:58:31] [INFO ] Removed a total of 338 redundant transitions.
[2021-05-17 19:58:31] [INFO ] Flatten gal took : 53 ms
[2021-05-17 19:58:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 10 ms.
[2021-05-17 19:58:31] [INFO ] Time to serialize gal into /tmp/CTLFireability16433487459390024221.gal : 2 ms
[2021-05-17 19:58:31] [INFO ] Time to serialize properties into /tmp/CTLFireability11025841854199588113.ctl : 8 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/CTLFireability16433487459390024221.gal, -t, CGAL, -ctl, /tmp/CTLFireability11025841854199588113.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/CTLFireability16433487459390024221.gal -t CGAL -ctl /tmp/CTLFireability11025841854199588113.ctl
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.6694e+06,0.092861,8160,352,306,4452,2189,309,9617,168,12996,0


Converting to forward existential form...Done !
original formula: AG(!(E((((A((((((((((((i4.u9.p110==1)&&(i6.u13.p121==1))||(u3.p50==1))||((i4.u9.p110==1)&&(i6.u13.p131==1)))||(i4.u10.p107==1))||(u2.p25==1))||(u1.p12==1))||(i4.u9.p92==1))||(u3.p47==1))||(u3.p46==1))||(i4.u9.p94==1)) U (((i4.u9.p110==1)&&(i6.u12.p117==1))||(u3.p42==1))) + (i6.u13.p120==1)) + (u3.p42==1)) + (i6.u13.p121==1)) U ((((((u11.p145==1)||(i4.u9.p87==1))||((i4.u9.p110==1)&&(i6.u12.p133==1)))||((u2.p35==1)&&(i6.u12.p153==1)))&&((((((((u2.p33==1)||(u2.p34==1))||(i6.u13.p128==1))||(u2.p35==1))||(i6.u13.p148==1))||(u1.p8==1))||(i4.u9.p91==1))||(u2.p28==1)))||((((u3.p51==1)||(u3.p53==1))||(i4.u9.p103==1))&&(((((((i3.u6.p67==1)||(u1.p7==1))||(u2.p23==1))||(i6.u13.p138==1))||((u2.p35==1)&&(i6.u12.p153==1)))||((i3.u0.p19==1)&&(i6.u12.p153==1)))||(i3.u5.p62==1)))))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,TRUE),(((!((E(!((((i4.u9.p110==1)&&(i6.u12.p117==1))||(u3.p42==1))) U (!((((((((((((i4.u9.p110==1)&&(i6.u13.p121==1))||(u3.p50==1))||((i4.u9.p110==1)&&(i6.u13.p131==1)))||(i4.u10.p107==1))||(u2.p25==1))||(u1.p12==1))||(i4.u9.p92==1))||(u3.p47==1))||(u3.p46==1))||(i4.u9.p94==1))) * !((((i4.u9.p110==1)&&(i6.u12.p117==1))||(u3.p42==1))))) + EG(!((((i4.u9.p110==1)&&(i6.u12.p117==1))||(u3.p42==1)))))) + (i6.u13.p120==1)) + (u3.p42==1)) + (i6.u13.p121==1))) * ((((((u11.p145==1)||(i4.u9.p87==1))||((i4.u9.p110==1)&&(i6.u12.p133==1)))||((u2.p35==1)&&(i6.u12.p153==1)))&&((((((((u2.p33==1)||(u2.p34==1))||(i6.u13.p128==1))||(u2.p35==1))||(i6.u13.p148==1))||(u1.p8==1))||(i4.u9.p91==1))||(u2.p28==1)))||((((u3.p51==1)||(u3.p53==1))||(i4.u9.p103==1))&&(((((((i3.u6.p67==1)||(u1.p7==1))||(u2.p23==1))||(i6.u13.p138==1))||((u2.p35==1)&&(i6.u12.p153==1)))||((i3.u0.p19==1)&&(i6.u12.p153==1)))||(i3.u5.p62==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t34, t35, t100, t103, t126, t142, t150, t152, t165, t173, u1.t84, u1.t85, u1.t86, u1.t87, u1.t88, u1.t89, u2.t71, u2.t72, u2.t73, u2.t74, u2.t75, u2.t76, u2.t77, u2.t78, u2.t79, u2.t80, u2.t81, u2.t82, u3.t58, u3.t59, u3.t60, u3.t61, u3.t62, u3.t63, u3.t64, u3.t65, u3.t66, u3.t67, u3.t68, u3.t69, i4.t36, i4.u9.t38, i4.u9.t39, i4.u9.t40, i4.u9.t41, i4.u9.t42, i4.u9.t43, i4.u9.t44, i4.u9.t45, i4.u9.t46, i4.u9.t47, i4.u9.t48, i4.u9.t49, i4.u9.t50, i6.t33, i6.t32, i6.t30, i6.t25, i6.t16, i6.t13, i6.t12, i6.t4, i6.u12.t15, i6.u12.t27, i6.u13.t0, i6.u13.t1, i6.u13.t2, i6.u13.t3, i6.u13.t7, i6.u13.t8, i6.u13.t9, i6.u13.t10, i6.u13.t14, i6.u13.t17, i6.u13.t18, i6.u13.t20, i6.u13.t21, i6.u13.t22, i6.u13.t26, i6.u13.t28, i6.u13.t29, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/48/82/130
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
(forward)formula 0,0,0.444815,20360,1,0,26538,7581,1840,45249,867,29919,54997
FORMULA HealthRecord-PT-08-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Graph (trivial) has 59 edges and 156 vertex of which 8 / 156 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 77 places :
Symmetric choice reduction at 0 with 77 rule applications. Total rules 78 place count 75 transition count 150
Iterating global reduction 0 with 77 rules applied. Total rules applied 155 place count 75 transition count 150
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 160 place count 70 transition count 140
Iterating global reduction 0 with 5 rules applied. Total rules applied 165 place count 70 transition count 140
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 168 place count 70 transition count 137
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 169 place count 69 transition count 134
Iterating global reduction 1 with 1 rules applied. Total rules applied 170 place count 69 transition count 134
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 1 with 2 rules applied. Total rules applied 172 place count 68 transition count 133
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 175 place count 68 transition count 133
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 176 place count 67 transition count 132
Iterating global reduction 1 with 1 rules applied. Total rules applied 177 place count 67 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 178 place count 67 transition count 131
Applied a total of 178 rules in 17 ms. Remains 67 /156 variables (removed 89) and now considering 131/300 (removed 169) transitions.
[2021-05-17 19:58:31] [INFO ] Flatten gal took : 6 ms
[2021-05-17 19:58:31] [INFO ] Flatten gal took : 6 ms
[2021-05-17 19:58:31] [INFO ] Input system was already deterministic with 131 transitions.
[2021-05-17 19:58:31] [INFO ] Flatten gal took : 6 ms
[2021-05-17 19:58:31] [INFO ] Flatten gal took : 6 ms
[2021-05-17 19:58:31] [INFO ] Time to serialize gal into /tmp/CTLFireability15898671904447687473.gal : 1 ms
[2021-05-17 19:58:31] [INFO ] Time to serialize properties into /tmp/CTLFireability2675633649175004390.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/CTLFireability15898671904447687473.gal, -t, CGAL, -ctl, /tmp/CTLFireability2675633649175004390.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/CTLFireability15898671904447687473.gal -t CGAL -ctl /tmp/CTLFireability2675633649175004390.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.8646e+06,0.277319,14896,2,3499,5,36534,6,0,388,46380,0


Converting to forward existential form...Done !
original formula: EF(AG((!(EG(AF((((((((((p66==1)||(p98==1))||(p85==1))||(p68==1))||(p24==1))||(p121==1))||(p92==1))||((p110==1)&&(p141==1)))||(p15==1))))) + (EG(((((p114==1)||((((p16==1)&&(p35==1))&&(p54==1))&&(p149==1)))||(p68==1))||((p110==1)&&(p139==1)))) * (((((((((p7==1)||(p138==1))||(p104==1))||(p15==1))||(p62==1))||((p16==1)&&(p153==1)))||((p110==1)&&(p137==1)))||((((((((((p17==1)&&(p36==1))&&(p55==1))&&(p60==1))&&(p65==1))&&(p70==1))&&(p77==1))&&(p84==1))&&(p111==1))&&(p148==1)))||((p110==1)&&(p133==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(EG(!(EG(!((((((((((p66==1)||(p98==1))||(p85==1))||(p68==1))||(p24==1))||(p121==1))||(p92==1))||((p110==1)&&(p141==1)))||(p15==1))))))) + (EG(((((p114==1)||((((p16==1)&&(p35==1))&&(p54==1))&&(p149==1)))||(p68==1))||((p110==1)&&(p139==1)))) * (((((((((p7==1)||(p138==1))||(p104==1))||(p15==1))||(p62==1))||((p16==1)&&(p153==1)))||((p110==1)&&(p137==1)))||((((((((((p17==1)&&(p36==1))&&(p55==1))&&(p60==1))&&(p65==1))&&(p70==1))&&(p77==1))&&(p84==1))&&(p111==1))&&(p148==1)))||((p110==1)&&(p133==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t34, t35, t36, t37, t38, t58, t59, t60, t61, t63, t64, t65, t66, t67, t68, t77, t78, t80, t89, t97, t108, t115, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/77/54/131
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,11.5569,314776,1,0,516,1.91479e+06,293,237,3218,1.78813e+06,571
FORMULA HealthRecord-PT-08-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Graph (trivial) has 129 edges and 156 vertex of which 8 / 156 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 73 places :
Symmetric choice reduction at 0 with 73 rule applications. Total rules 74 place count 78 transition count 157
Iterating global reduction 0 with 73 rules applied. Total rules applied 147 place count 78 transition count 157
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 154 place count 71 transition count 143
Iterating global reduction 0 with 7 rules applied. Total rules applied 161 place count 71 transition count 143
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 167 place count 71 transition count 137
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 171 place count 69 transition count 135
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 173 place count 69 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 174 place count 68 transition count 132
Applied a total of 174 rules in 16 ms. Remains 68 /156 variables (removed 88) and now considering 132/300 (removed 168) transitions.
[2021-05-17 19:58:43] [INFO ] Flatten gal took : 5 ms
[2021-05-17 19:58:43] [INFO ] Flatten gal took : 5 ms
[2021-05-17 19:58:43] [INFO ] Input system was already deterministic with 132 transitions.
[2021-05-17 19:58:43] [INFO ] Flatten gal took : 5 ms
[2021-05-17 19:58:43] [INFO ] Flatten gal took : 5 ms
[2021-05-17 19:58:43] [INFO ] Time to serialize gal into /tmp/CTLFireability12478803327478530063.gal : 2 ms
[2021-05-17 19:58:43] [INFO ] Time to serialize properties into /tmp/CTLFireability8871694013501894654.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/CTLFireability12478803327478530063.gal, -t, CGAL, -ctl, /tmp/CTLFireability8871694013501894654.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/CTLFireability12478803327478530063.gal -t CGAL -ctl /tmp/CTLFireability8871694013501894654.ctl --gen-order FOLLOW
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.49972e+06,0.676016,23644,2,4517,5,58047,6,0,391,104421,0


Converting to forward existential form...Done !
original formula: AF((!(AG(((((((((p16==0)||(p153==0))&&((p76==0)||(p153==0)))&&(p35==0))&&(p100==0))&&(p7==0))&&(p26==0))&&(((((((((p110==0)||(p121==0))&&(p113==0))&&(p68==0))&&(p6==0))&&(p47==0))&&(p141==0))&&((p54==0)||(p153==0)))||(((((((((p130==0)&&(p99==0))&&(p53==0))&&(p23==0))&&(p136==0))&&(p11==0))&&(p58==0))&&(p45==0))&&(p141==0)))))) * ((p97==1)||(p101==1))))
=> equivalent forward existential formula: [FwdG(Init,!((!(!(E(TRUE U !(((((((((p16==0)||(p153==0))&&((p76==0)||(p153==0)))&&(p35==0))&&(p100==0))&&(p7==0))&&(p26==0))&&(((((((((p110==0)||(p121==0))&&(p113==0))&&(p68==0))&&(p6==0))&&(p47==0))&&(p141==0))&&((p54==0)||(p153==0)))||(((((((((p130==0)&&(p99==0))&&(p53==0))&&(p23==0))&&(p136==0))&&(p11==0))&&(p58==0))&&(p45==0))&&(p141==0)))))))) * ((p97==1)||(p101==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, t31, t32, t33, t34, t35, t36, t37, t38, t52, t53, t54, t55, t56, t57, t58, t59, t61, t62, t63, t64, t68, t69, t70, t71, t72, t73, t74, t75, t77, t78, t84, t85, t86, t88, t93, t94, t96, t101, t109, t110, t120, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/60/72/132
(forward)formula 0,0,9.15859,209064,1,0,377,892260,285,201,3009,1.29603e+06,375
FORMULA HealthRecord-PT-08-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2021-05-17 19:58:52] [INFO ] Flatten gal took : 12 ms
[2021-05-17 19:58:52] [INFO ] Flatten gal took : 11 ms
[2021-05-17 19:58:52] [INFO ] Applying decomposition
[2021-05-17 19:58:52] [INFO ] Flatten gal took : 11 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/graph13153381654234531572.txt, -o, /tmp/graph13153381654234531572.bin, -w, /tmp/graph13153381654234531572.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/graph13153381654234531572.bin, -l, -1, -v, -w, /tmp/graph13153381654234531572.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 19:58:52] [INFO ] Decomposing Gal with order
[2021-05-17 19:58:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 19:58:52] [INFO ] Removed a total of 44 redundant transitions.
[2021-05-17 19:58:52] [INFO ] Flatten gal took : 22 ms
[2021-05-17 19:58:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 1 ms.
[2021-05-17 19:58:52] [INFO ] Time to serialize gal into /tmp/CTLFireability6674548156771499685.gal : 3 ms
[2021-05-17 19:58:52] [INFO ] Time to serialize properties into /tmp/CTLFireability2850373747292851755.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/CTLFireability6674548156771499685.gal, -t, CGAL, -ctl, /tmp/CTLFireability2850373747292851755.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/CTLFireability6674548156771499685.gal -t CGAL -ctl /tmp/CTLFireability2850373747292851755.ctl
No direction supplied, using forward translation only.
Parsed 10 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,8.06932e+08,7.19353,193156,1502,2531,200998,74559,419,618392,391,1.19136e+06,0


Converting to forward existential form...Done !
original formula: EG(EF((((AX(((u10.p81==1)||(u1.p24==1))) * (((((((((((((((i3.i2.u8.p1==1)||(u1.p33==1))||(u0.p3==1))||(i3.i2.u8.p39==1))||(u15.p123==1))||(u1.p26==1))||(i6.u13.p90==1))||(u0.p12==1))||((u2.p54==1)&&(u15.p153==1)))||(u10.p81==1))||(u1.p35==1))||(i6.u13.p90==1))||(u15.p142==1))||(u2.p47==1))||(i6.u13.p94==1))) * ((((((((((u9.p76==1)&&(u15.p153==1))||(u2.p50==1))||((i6.u13.p110==1)&&(u15.p152==1)))||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u15.p143==1)))||(u1.p25==1))||(u1.p26==1))||(i3.i2.u8.p62==1))||((u2.p54==1)&&(u15.p153==1)))||(i6.u12.p109==1))) * ((((((((((u15.p114==1)||(u2.p49==1))||(u14.p147==1))||(i6.u13.p112==1))||(u1.p35==1))||(u10.p85==1))||(i6.u13.p100==1))||(u0.p5==1))||(u15.p116==1))||(u0.p9==1)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((!(EX(!(((u10.p81==1)||(u1.p24==1))))) * (((((((((((((((i3.i2.u8.p1==1)||(u1.p33==1))||(u0.p3==1))||(i3.i2.u8.p39==1))||(u15.p123==1))||(u1.p26==1))||(i6.u13.p90==1))||(u0.p12==1))||((u2.p54==1)&&(u15.p153==1)))||(u10.p81==1))||(u1.p35==1))||(i6.u13.p90==1))||(u15.p142==1))||(u2.p47==1))||(i6.u13.p94==1))) * ((((((((((u9.p76==1)&&(u15.p153==1))||(u2.p50==1))||((i6.u13.p110==1)&&(u15.p152==1)))||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u15.p143==1)))||(u1.p25==1))||(u1.p26==1))||(i3.i2.u8.p62==1))||((u2.p54==1)&&(u15.p153==1)))||(i6.u12.p109==1))) * ((((((((((u15.p114==1)||(u2.p49==1))||(u14.p147==1))||(i6.u13.p112==1))||(u1.p35==1))||(u10.p85==1))||(i6.u13.p100==1))||(u0.p5==1))||(u15.p116==1))||(u0.p9==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t234, t239, t243, t247, t251, t256, t259, t262, u0.t194, u0.t195, u0.t196, u0.t197, u0.t198, u0.t199, u0.t200, u0.t201, u0.t202, u0.t203, u0.t204, u0.t205, u0.t206, u0.t207, u0.t208, u0.t209, u0.t210, u0.t211, u0.t212, u0.t213, u0.t214, u0.t215, u0.t216, u0.t217, u0.t218, u0.t219, u0.t220, u0.t221, u0.t222, u0.t223, u1.t163, u1.t164, u1.t165, u1.t166, u1.t167, u1.t168, u1.t169, u1.t170, u1.t171, u1.t172, u1.t173, u1.t174, u1.t175, u1.t176, u1.t177, u1.t178, u1.t179, u1.t180, u1.t181, u1.t182, u1.t183, u1.t184, u1.t185, u1.t186, u1.t187, u1.t188, u1.t189, u1.t190, u1.t191, u1.t193, u2.t132, u2.t133, u2.t134, u2.t135, u2.t136, u2.t137, u2.t138, u2.t139, u2.t140, u2.t141, u2.t142, u2.t143, u2.t144, u2.t145, u2.t146, u2.t147, u2.t148, u2.t149, u2.t150, u2.t151, u2.t152, u2.t153, u2.t154, u2.t155, u2.t156, u2.t157, u2.t158, u2.t159, u2.t160, u2.t162, u9.t112, u9.t113, u9.t114, u9.t115, u9.t116, u9.t117, u9.t118, u9.t119, u10.t104, u10.t105, u10.t106, u10.t107, u10.t108, u10.t109, u10.t110, u10.t111, u15.t1, u15.t2, u15.t3, u15.t4, u15.t5, u15.t6, u15.t7, u15.t8, u15.t9, u15.t14, u15.t15, u15.t16, u15.t17, u15.t18, u15.t19, u15.t20, u15.t21, u15.t22, u15.t23, u15.t24, u15.t25, u15.t26, u15.t27, u15.t28, u15.t29, u15.t30, u15.t31, u15.t32, u15.t33, u15.t34, u15.t35, u15.t36, u15.t37, u15.t38, u15.t39, u15.t40, u15.t41, u15.t42, u15.t43, u15.t44, u15.t45, u15.t46, u15.t47, u15.t48, u15.t49, u15.t50, u15.t51, u15.t52, u15.t53, u15.t54, u15.t55, u15.t56, u15.t57, u15.t58, u15.t59, i6.t68, i6.t62, i6.u13.t60, i6.u13.t61, i6.u13.t70, i6.u13.t71, i6.u13.t72, i6.u13.t73, i6.u13.t74, i6.u13.t75, i6.u13.t76, i6.u13.t77, i6.u13.t78, i6.u13.t79, i6.u13.t80, i6.u13.t81, i6.u13.t82, i6.u13.t83, i6.u13.t84, i6.u13.t85, i6.u13.t86, i6.u13.t87, i6.u13.t88, i6.u13.t89, i6.u13.t90, i6.u13.t91, i6.u13.t92, i6.u13.t93, i6.u13.t94, i6.u13.t95, i6.u13.t96, i6.u13.t97, i6.u13.t98, i6.u13.t99, i6.u13.t100, i6.u13.t101, i6.u13.t102, i6.u13.t103, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/87/208/295
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,28.4991,677712,1,0,913619,129035,2806,2.11965e+06,2201,2.24302e+06,624802
FORMULA HealthRecord-PT-08-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(E(!(EX((((((((((((u0.p16==1)&&(u15.p153==1))||(u15.p115==1))||(i3.i1.u5.p64==1))||((((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(i3.i0.u4.p60==1))&&(i3.i1.u6.p65==1))&&(i3.i2.u8.p70==1))&&(u9.p77==1))&&(u10.p84==1))&&(i6.u13.p111==1))&&(u15.p148==1)))||(u0.p7==1))||(u15.p155==1))||(u9.p74==1))||(u15.p126==1))||(i6.u13.p92==1))||((u1.p19==1)&&(u15.p153==1))))) U (AG((EF(((((((((i6.u13.p97==1)||(u15.p131==1))||(u0.p18==1))||(u2.p50==1))||(i6.u13.p101==1))||(i3.i2.u7.p68==1))||(u15.p151==1))||(i6.u13.p89==1))) + EX((((((((((u0.p16==1)||(i6.u13.p96==1))||(u2.p48==1))||(i6.u13.p99==1))||((u10.p83==1)&&(u15.p153==1)))||(i6.u13.p103==1))||(u15.p139==1))||((i6.u13.p110==1)&&(u15.p129==1)))||(u2.p44==1))))) + (AX((((((((u1.p29==1)||(u10.p81==1))||(u15.p114==1))||(u15.p128==1))||(u9.p73==1))||(u1.p26==1))||(u15.p143==1))) * (AX(((((((u1.p35==1)||(u0.p3==1))||(u0.p4==1))||(u0.p8==1))||(i6.u11.p104==1))||(u1.p27==1))) + (((((((u1.p25==0)&&(i3.i0.u4.p72==0))&&(u0.p10==0))&&(u15.p136==0))&&(u15.p126==0))&&(i6.u13.p94==0))&&(((((((((((u1.p35==1)||(u0.p5==1))||(u2.p41==1))||(u2.p43==1))||(u15.p124==1))||(i3.i2.u8.p62==1))||(u10.p81==1))||(u2.p49==1))||(u15.p131==1))||(u15.p133==1))||((i6.u13.p110==1)&&(u15.p119==1)))))))))
=> equivalent forward existential formula: ([(FwdU(EY(Init),!(EX((((((((((((u0.p16==1)&&(u15.p153==1))||(u15.p115==1))||(i3.i1.u5.p64==1))||((((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(i3.i0.u4.p60==1))&&(i3.i1.u6.p65==1))&&(i3.i2.u8.p70==1))&&(u9.p77==1))&&(u10.p84==1))&&(i6.u13.p111==1))&&(u15.p148==1)))||(u0.p7==1))||(u15.p155==1))||(u9.p74==1))||(u15.p126==1))||(i6.u13.p92==1))||((u1.p19==1)&&(u15.p153==1)))))) * !(E(TRUE U !((E(TRUE U ((((((((i6.u13.p97==1)||(u15.p131==1))||(u0.p18==1))||(u2.p50==1))||(i6.u13.p101==1))||(i3.i2.u7.p68==1))||(u15.p151==1))||(i6.u13.p89==1))) + EX((((((((((u0.p16==1)||(i6.u13.p96==1))||(u2.p48==1))||(i6.u13.p99==1))||((u10.p83==1)&&(u15.p153==1)))||(i6.u13.p103==1))||(u15.p139==1))||((i6.u13.p110==1)&&(u15.p129==1)))||(u2.p44==1))))))))] != FALSE + ([((FwdU(EY(Init),!(EX((((((((((((u0.p16==1)&&(u15.p153==1))||(u15.p115==1))||(i3.i1.u5.p64==1))||((((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(i3.i0.u4.p60==1))&&(i3.i1.u6.p65==1))&&(i3.i2.u8.p70==1))&&(u9.p77==1))&&(u10.p84==1))&&(i6.u13.p111==1))&&(u15.p148==1)))||(u0.p7==1))||(u15.p155==1))||(u9.p74==1))||(u15.p126==1))||(i6.u13.p92==1))||((u1.p19==1)&&(u15.p153==1)))))) * !(EX(!((((((((u1.p29==1)||(u10.p81==1))||(u15.p114==1))||(u15.p128==1))||(u9.p73==1))||(u1.p26==1))||(u15.p143==1)))))) * !(EX(!(((((((u1.p35==1)||(u0.p3==1))||(u0.p4==1))||(u0.p8==1))||(i6.u11.p104==1))||(u1.p27==1))))))] != FALSE + [((FwdU(EY(Init),!(EX((((((((((((u0.p16==1)&&(u15.p153==1))||(u15.p115==1))||(i3.i1.u5.p64==1))||((((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(i3.i0.u4.p60==1))&&(i3.i1.u6.p65==1))&&(i3.i2.u8.p70==1))&&(u9.p77==1))&&(u10.p84==1))&&(i6.u13.p111==1))&&(u15.p148==1)))||(u0.p7==1))||(u15.p155==1))||(u9.p74==1))||(u15.p126==1))||(i6.u13.p92==1))||((u1.p19==1)&&(u15.p153==1)))))) * !(EX(!((((((((u1.p29==1)||(u10.p81==1))||(u15.p114==1))||(u15.p128==1))||(u9.p73==1))||(u1.p26==1))||(u15.p143==1)))))) * (((((((u1.p25==0)&&(i3.i0.u4.p72==0))&&(u0.p10==0))&&(u15.p136==0))&&(u15.p126==0))&&(i6.u13.p94==0))&&(((((((((((u1.p35==1)||(u0.p5==1))||(u2.p41==1))||(u2.p43==1))||(u15.p124==1))||(i3.i2.u8.p62==1))||(u10.p81==1))||(u2.p49==1))||(u15.p131==1))||(u15.p133==1))||((i6.u13.p110==1)&&(u15.p119==1)))))] != FALSE))
(forward)formula 1,0,31.2275,770904,1,0,1.04705e+06,157399,3057,2.42086e+06,2237,2.44656e+06,743111
FORMULA HealthRecord-PT-08-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(AX(EX(AX(AF(((((((i3.i2.u8.p1==1)||((i6.u13.p110==1)&&(u15.p152==1)))||((u9.p76==1)&&(u15.p153==1)))||(i6.u13.p98==1))||(u1.p22==1))||(i3.i0.u4.p72==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(EX(!(!(EG(!(((((((i3.i2.u8.p1==1)||((i6.u13.p110==1)&&(u15.p152==1)))||((u9.p76==1)&&(u15.p153==1)))||(i6.u13.p98==1))||(u1.p22==1))||(i3.i0.u4.p72==1)))))))))))] != FALSE
(forward)formula 2,1,35.9829,921648,1,0,1.29464e+06,171385,3090,2.85481e+06,2237,2.54575e+06,963816
FORMULA HealthRecord-PT-08-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (A(EF((((((i6.u13.p110==1)&&(u15.p133==1))||(u9.p73==1))||(i3.i0.u4.p72==1)) * E(((u2.p44==1)&&(((i6.u13.p101==1)||(u15.p122==1))||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u15.p153==1)))) U E((((((((u2.p48==1)||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u15.p128==1)))||(i6.u13.p98==1))||(i3.i2.u8.p71==1))||(u0.p8==1))||(u0.p9==1))||((((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(i3.i0.u4.p60==1))&&(i3.i1.u6.p65==1))&&(i3.i2.u8.p70==1))&&(u9.p77==1))&&(u10.p84==1))&&(i6.u13.p110==1))&&(u15.p154==1))) U (((((((i6.u13.p110==1)&&(u15.p137==1))||(i3.i2.u7.p69==1))||(u2.p54==1))||(u9.p73==1))||(u1.p24==1))||((i6.u13.p110==1)&&(u15.p139==1))))))) U AG((AF(((((((((((((((((((u10.p81==1)||((i6.u13.p110==1)&&(u15.p135==1)))||(u1.p32==1))||((u9.p76==1)&&(u15.p153==1)))||(i6.u13.p100==1))||(u2.p56==1))||(u15.p124==1))||((u2.p54==1)&&(u15.p153==1)))||(u15.p114==1))||(u10.p80==1))||(i6.u13.p96==1))||(i6.u13.p99==1))||(u2.p50==1))||(i6.u13.p87==1))||(u0.p7==1))||(u2.p43==1))||(u9.p75==1))||((i6.u13.p110==1)&&(u15.p125==1)))) * AX(AG((((((((((u0.p16==1)||(u1.p34==1))||(u2.p51==1))||((u9.p76==1)&&(u15.p153==1)))||(i3.i1.u6.p66==1))||(u15.p134==1))||(i3.i2.u8.p39==1))||(i6.u13.p91==1))||(i6.u13.p93==1))))))) + AF(!(EF(!(AF((((((i6.u13.p112==1)||(u14.p145==1))||(i3.i2.u7.p68==1))||(i6.u13.p89==1))||(u0.p13==1))))))))
=> equivalent forward existential formula: [FwdG((Init * !(!((E(!(!(E(TRUE U !((!(EG(!(((((((((((((((((((u10.p81==1)||((i6.u13.p110==1)&&(u15.p135==1)))||(u1.p32==1))||((u9.p76==1)&&(u15.p153==1)))||(i6.u13.p100==1))||(u2.p56==1))||(u15.p124==1))||((u2.p54==1)&&(u15.p153==1)))||(u15.p114==1))||(u10.p80==1))||(i6.u13.p96==1))||(i6.u13.p99==1))||(u2.p50==1))||(i6.u13.p87==1))||(u0.p7==1))||(u2.p43==1))||(u9.p75==1))||((i6.u13.p110==1)&&(u15.p125==1)))))) * !(EX(!(!(E(TRUE U !((((((((((u0.p16==1)||(u1.p34==1))||(u2.p51==1))||((u9.p76==1)&&(u15.p153==1)))||(i3.i1.u6.p66==1))||(u15.p134==1))||(i3.i2.u8.p39==1))||(i6.u13.p91==1))||(i6.u13.p93==1))))))))))))) U (!(E(TRUE U (((((i6.u13.p110==1)&&(u15.p133==1))||(u9.p73==1))||(i3.i0.u4.p72==1)) * E(((u2.p44==1)&&(((i6.u13.p101==1)||(u15.p122==1))||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u15.p153==1)))) U E((((((((u2.p48==1)||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u15.p128==1)))||(i6.u13.p98==1))||(i3.i2.u8.p71==1))||(u0.p8==1))||(u0.p9==1))||((((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(i3.i0.u4.p60==1))&&(i3.i1.u6.p65==1))&&(i3.i2.u8.p70==1))&&(u9.p77==1))&&(u10.p84==1))&&(i6.u13.p110==1))&&(u15.p154==1))) U (((((((i6.u13.p110==1)&&(u15.p137==1))||(i3.i2.u7.p69==1))||(u2.p54==1))||(u9.p73==1))||(u1.p24==1))||((i6.u13.p110==1)&&(u15.p139==1)))))))) * !(!(E(TRUE U !((!(EG(!(((((((((((((((((((u10.p81==1)||((i6.u13.p110==1)&&(u15.p135==1)))||(u1.p32==1))||((u9.p76==1)&&(u15.p153==1)))||(i6.u13.p100==1))||(u2.p56==1))||(u15.p124==1))||((u2.p54==1)&&(u15.p153==1)))||(u15.p114==1))||(u10.p80==1))||(i6.u13.p96==1))||(i6.u13.p99==1))||(u2.p50==1))||(i6.u13.p87==1))||(u0.p7==1))||(u2.p43==1))||(u9.p75==1))||((i6.u13.p110==1)&&(u15.p125==1)))))) * !(EX(!(!(E(TRUE U !((((((((((u0.p16==1)||(u1.p34==1))||(u2.p51==1))||((u9.p76==1)&&(u15.p153==1)))||(i3.i1.u6.p66==1))||(u15.p134==1))||(i3.i2.u8.p39==1))||(i6.u13.p91==1))||(i6.u13.p93==1))))))))))))))) + EG(!(!(E(TRUE U !((!(EG(!(((((((((((((((((((u10.p81==1)||((i6.u13.p110==1)&&(u15.p135==1)))||(u1.p32==1))||((u9.p76==1)&&(u15.p153==1)))||(i6.u13.p100==1))||(u2.p56==1))||(u15.p124==1))||((u2.p54==1)&&(u15.p153==1)))||(u15.p114==1))||(u10.p80==1))||(i6.u13.p96==1))||(i6.u13.p99==1))||(u2.p50==1))||(i6.u13.p87==1))||(u0.p7==1))||(u2.p43==1))||(u9.p75==1))||((i6.u13.p110==1)&&(u15.p125==1)))))) * !(EX(!(!(E(TRUE U !((((((((((u0.p16==1)||(u1.p34==1))||(u2.p51==1))||((u9.p76==1)&&(u15.p153==1)))||(i3.i1.u6.p66==1))||(u15.p134==1))||(i3.i2.u8.p39==1))||(i6.u13.p91==1))||(i6.u13.p93==1)))))))))))))))))),!(!(E(TRUE U !(!(EG(!((((((i6.u13.p112==1)||(u14.p145==1))||(i3.i2.u7.p68==1))||(i6.u13.p89==1))||(u0.p13==1))))))))))] = FALSE
(forward)formula 3,0,49.6879,1294380,1,0,1.879e+06,202486,3557,3.9616e+06,2367,3.08921e+06,1495149
FORMULA HealthRecord-PT-08-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG((((((!(AF((((((((((AX((((((((u1.p32==1)||(u15.p131==1))||(u15.p119==1))||(i3.i2.u8.p71==1))||(u0.p12==1))||(i3.i0.u4.p61==1))||(u2.p46==1))) * AX(((((((((u2.p51==1)||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u15.p149==1)))||(u0.p3==1))||(u15.p118==1))||(u15.p116==1))||(u15.p120==1))||(u15.p140==1))||((i6.u13.p110==1)&&(u15.p125==1))))) + (u15.p130==1)) + (i6.u13.p112==1)) + (u15.p134==1)) + (i6.u11.p106==1)) + (u15.p138==1)) + ((u1.p35==1)&&(u15.p153==1))) + (u0.p8==1)) + (u1.p28==1)))) + (u2.p49==1)) + (i6.u13.p100==1)) + (u2.p45==1)) + (i6.u12.p109==1)) + ((u1.p19==1)&&(u15.p153==1))))
=> equivalent forward existential formula: [((((((FwdU(Init,TRUE) * !(((u1.p19==1)&&(u15.p153==1)))) * !((i6.u12.p109==1))) * !((u2.p45==1))) * !((i6.u13.p100==1))) * !((u2.p49==1))) * !(EG(!((((((((((!(EX(!((((((((u1.p32==1)||(u15.p131==1))||(u15.p119==1))||(i3.i2.u8.p71==1))||(u0.p12==1))||(i3.i0.u4.p61==1))||(u2.p46==1))))) * !(EX(!(((((((((u2.p51==1)||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u15.p149==1)))||(u0.p3==1))||(u15.p118==1))||(u15.p116==1))||(u15.p120==1))||(u15.p140==1))||((i6.u13.p110==1)&&(u15.p125==1))))))) + (u15.p130==1)) + (i6.u13.p112==1)) + (u15.p134==1)) + (i6.u11.p106==1)) + (u15.p138==1)) + ((u1.p35==1)&&(u15.p153==1))) + (u0.p8==1)) + (u1.p28==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 7
Fast SCC detection found an SCC at level 8
(forward)formula 4,0,50.4892,1320516,1,0,1.91964e+06,206421,3634,4.04638e+06,2378,3.13373e+06,1529247
FORMULA HealthRecord-PT-08-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX((((((((((u2.p51==1)||(u10.p82==1))||(u0.p3==1))||(i6.u12.p107==1))||(u15.p142==1))||((i6.u13.p110==1)&&(u15.p135==1)))||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u15.p143==1)))||((u1.p35==1)&&(u15.p153==1)))||((i6.u13.p110==1)&&(u15.p141==1))))
=> equivalent forward existential formula: [(EY(Init) * (((((((((u2.p51==1)||(u10.p82==1))||(u0.p3==1))||(i6.u12.p107==1))||(u15.p142==1))||((i6.u13.p110==1)&&(u15.p135==1)))||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u15.p143==1)))||((u1.p35==1)&&(u15.p153==1)))||((i6.u13.p110==1)&&(u15.p141==1))))] != FALSE
(forward)formula 5,0,50.4976,1321044,1,0,1.91989e+06,206421,3655,4.04692e+06,2380,3.13374e+06,1529979
FORMULA HealthRecord-PT-08-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX((AG((EX((((((u1.p34==1)||(u0.p5==1))||((u1.p35==1)&&(u15.p153==1)))||((i6.u13.p110==1)&&(u15.p129==1)))||((i6.u13.p110==1)&&(u15.p139==1)))) + EX((((u2.p51==0)&&(u15.p120==0))&&(i6.u13.p95==0))))) * (!(AG(((((((((u10.p81==1)||(i3.i0.u4.p20==1))||(u15.p134==1))||(u15.p151==1))||(u15.p152==1))||(u2.p43==1))||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u15.p153==1)))||(u2.p47==1)))) + !(E((((((((((((u0.p16==1)||(u1.p34==1))||((((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(i3.i0.u4.p60==1))&&(i3.i1.u6.p65==1))&&(i3.i2.u8.p70==1))&&(u9.p77==1))&&(u10.p84==1))&&(i6.u13.p111==1))&&(u15.p148==1)))||(u0.p7==1))||(u2.p43==1))||(u1.p27==1))||(u2.p44==1))||(u15.p140==1))||(u9.p78==1))||((u2.p54==1)&&(u15.p153==1))) * AG((((((u15.p144==1)||(u15.p128==1))||(i3.i2.u7.p69==1))||(u15.p151==1))||(u2.p54==1)))) U (((((((((((((u10.p81==1)||((u2.p38==1)&&(u15.p153==1)))||(u2.p53==1))||(u0.p5==1))||(u15.p148==1))||(i6.u13.p103==1))||(i6.u13.p91==1))||(u15.p126==1))||(u0.p13==1))||((u9.p76==1)&&(u15.p153==1)))||(u10.p85==1))||(u2.p56==1))&&(((((((((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u15.p143==1))||(u0.p9==1))||(u0.p16==1))||(u1.p35==1))||(u15.p119==1))||(u1.p23==1))||(i6.u11.p105==1))||(u2.p44==1))))))))
=> equivalent forward existential formula: ([(FwdU((EY(Init) * !(E(TRUE U !((EX((((((u1.p34==1)||(u0.p5==1))||((u1.p35==1)&&(u15.p153==1)))||((i6.u13.p110==1)&&(u15.p129==1)))||((i6.u13.p110==1)&&(u15.p139==1)))) + EX((((u2.p51==0)&&(u15.p120==0))&&(i6.u13.p95==0)))))))),TRUE) * !(((((((((u10.p81==1)||(i3.i0.u4.p20==1))||(u15.p134==1))||(u15.p151==1))||(u15.p152==1))||(u2.p43==1))||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u15.p153==1)))||(u2.p47==1))))] != FALSE + [((EY(Init) * !(E(TRUE U !((EX((((((u1.p34==1)||(u0.p5==1))||((u1.p35==1)&&(u15.p153==1)))||((i6.u13.p110==1)&&(u15.p129==1)))||((i6.u13.p110==1)&&(u15.p139==1)))) + EX((((u2.p51==0)&&(u15.p120==0))&&(i6.u13.p95==0)))))))) * !(E((((((((((((u0.p16==1)||(u1.p34==1))||((((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(i3.i0.u4.p60==1))&&(i3.i1.u6.p65==1))&&(i3.i2.u8.p70==1))&&(u9.p77==1))&&(u10.p84==1))&&(i6.u13.p111==1))&&(u15.p148==1)))||(u0.p7==1))||(u2.p43==1))||(u1.p27==1))||(u2.p44==1))||(u15.p140==1))||(u9.p78==1))||((u2.p54==1)&&(u15.p153==1))) * !(E(TRUE U !((((((u15.p144==1)||(u15.p128==1))||(i3.i2.u7.p69==1))||(u15.p151==1))||(u2.p54==1)))))) U (((((((((((((u10.p81==1)||((u2.p38==1)&&(u15.p153==1)))||(u2.p53==1))||(u0.p5==1))||(u15.p148==1))||(i6.u13.p103==1))||(i6.u13.p91==1))||(u15.p126==1))||(u0.p13==1))||((u9.p76==1)&&(u15.p153==1)))||(u10.p85==1))||(u2.p56==1))&&(((((((((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u15.p143==1))||(u0.p9==1))||(u0.p16==1))||(u1.p35==1))||(u15.p119==1))||(u1.p23==1))||(i6.u11.p105==1))||(u2.p44==1))))))] != FALSE)
(forward)formula 6,0,52.7734,1389684,1,0,2.01916e+06,214583,3771,4.25705e+06,2397,3.21858e+06,1629432
FORMULA HealthRecord-PT-08-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E((E((EF((((((((((((u0.p16==1)&&(u15.p153==1))||(u2.p48==1))||(u0.p18==1))||((u10.p83==1)&&(u15.p153==1)))||(u2.p54==1))||(u15.p138==1))||(u15.p155==1))||(u2.p44==1))||((u2.p54==1)&&(u15.p153==1)))||(u9.p78==1))) + (((((((((((((!(EF((((((((((u2.p51==1)||(u1.p34==1))||((u9.p76==1)&&(u15.p153==1)))||(u15.p134==1))||(u15.p118==1))||(u2.p53==1))||(u0.p8==1))||(u15.p122==1))||((u1.p19==1)&&(u15.p153==1))))) * (u10.p85==0)) * (u15.p123==0)) * (i6.u13.p91==0)) * (i3.i0.u3.p58==0)) * (u2.p45==0)) * (u1.p28==0)) * ((u2.p54==0)||(u15.p153==0))) * ((i6.u13.p110==0)||(u15.p119==0))) * ((u0.p16==0)||(u15.p153==0))) * (u10.p82==0)) * (u1.p23==0)) * (u15.p123==0)) * (i6.u13.p93==0))) U EG((i6.u13.p96==1))) * ((EG((((AF((((((((((u15.p114==1)||(i3.i0.u4.p113==1))||(i6.u13.p101==1))||(u15.p119==1))||(u0.p6==1))||(u0.p8==1))||(u15.p122==1))||(u0.p10==1))||(i6.u13.p90==1))) + ((((((((u2.p48==1)||(i3.i2.u8.p1==1))||(i3.i0.u4.p113==1))||((i6.u13.p110==1)&&(u15.p117==1)))||(i3.i0.u4.p86==1))||((u1.p35==1)&&(u15.p153==1)))||(u2.p44==1))&&(((((((u0.p3==1)||(u15.p150==1))||(u0.p6==1))||(u1.p25==1))||(i6.u12.p107==1))||(u15.p120==1))||(i3.i2.u8.p62==1)))) + ((((((((u1.p35==1)||(u15.p135==1))||(u1.p24==1))||(i6.u13.p89==1))||(u9.p74==1))||(u2.p45==1))||((u2.p54==1)&&(u15.p153==1)))&&((((((((u15.p130==1)||(u15.p131==1))||(u10.p82==1))||(i3.i1.u6.p66==1))||((i6.u13.p110==1)&&(u15.p115==1)))||(i6.u13.p101==1))||(u15.p148==1))||(u1.p27==1)))) + ((((((((((i6.u13.p99==1)||(u15.p132==1))||((u1.p35==1)&&(u15.p153==1)))||(u2.p40==1))||(i6.u13.p88==1))||(u1.p28==1))||(u15.p143==1))||(u0.p14==1))||(u15.p125==1))&&(i3.i0.u4.p20==1)))) + A((((((((((u0.p16==0)||(u15.p153==0))&&(u15.p128==0))&&((i6.u13.p110==0)||(u15.p115==0)))&&(u15.p151==0))&&(u1.p21==0))&&(u0.p6==0))&&(u1.p24==0))&&(i6.u12.p108==0)) U ((((((((u2.p38==1)&&(u15.p153==1))||(u1.p33==1))||(i3.i0.u4.p113==1))||(u15.p138==1))||(u15.p136==1))||(i6.u13.p93==1))||(u15.p143==1)))) + AX(A((((((((((u2.p49==1)||((i6.u13.p110==1)&&(u15.p150==1)))||(i3.i1.u6.p66==1))||(u0.p5==1))||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u15.p132==1)))||((u1.p35==1)&&(u15.p153==1)))||(u0.p8==1))||(u0.p9==1))||(u0.p12==1)) U ((((((((u10.p82==1)||(u0.p3==1))||(i3.i2.u7.p69==1))||(i6.u13.p100==1))||(u15.p132==1))||(i6.u13.p91==1))||((i6.u13.p110==1)&&(u15.p144==1)))||(u2.p46==1)))))) U AX(((((((u15.p134==1)||(u2.p52==1))||(u15.p136==1))||(i6.u13.p92==1))||((u10.p83==1)&&(u15.p153==1)))||((u2.p54==1)&&(u15.p153==1)))))
=> equivalent forward existential formula: [(FwdU(Init,(E((E(TRUE U (((((((((((u0.p16==1)&&(u15.p153==1))||(u2.p48==1))||(u0.p18==1))||((u10.p83==1)&&(u15.p153==1)))||(u2.p54==1))||(u15.p138==1))||(u15.p155==1))||(u2.p44==1))||((u2.p54==1)&&(u15.p153==1)))||(u9.p78==1))) + (((((((((((((!(E(TRUE U (((((((((u2.p51==1)||(u1.p34==1))||((u9.p76==1)&&(u15.p153==1)))||(u15.p134==1))||(u15.p118==1))||(u2.p53==1))||(u0.p8==1))||(u15.p122==1))||((u1.p19==1)&&(u15.p153==1))))) * (u10.p85==0)) * (u15.p123==0)) * (i6.u13.p91==0)) * (i3.i0.u3.p58==0)) * (u2.p45==0)) * (u1.p28==0)) * ((u2.p54==0)||(u15.p153==0))) * ((i6.u13.p110==0)||(u15.p119==0))) * ((u0.p16==0)||(u15.p153==0))) * (u10.p82==0)) * (u1.p23==0)) * (u15.p123==0)) * (i6.u13.p93==0))) U EG((i6.u13.p96==1))) * ((EG((((!(EG(!((((((((((u15.p114==1)||(i3.i0.u4.p113==1))||(i6.u13.p101==1))||(u15.p119==1))||(u0.p6==1))||(u0.p8==1))||(u15.p122==1))||(u0.p10==1))||(i6.u13.p90==1))))) + ((((((((u2.p48==1)||(i3.i2.u8.p1==1))||(i3.i0.u4.p113==1))||((i6.u13.p110==1)&&(u15.p117==1)))||(i3.i0.u4.p86==1))||((u1.p35==1)&&(u15.p153==1)))||(u2.p44==1))&&(((((((u0.p3==1)||(u15.p150==1))||(u0.p6==1))||(u1.p25==1))||(i6.u12.p107==1))||(u15.p120==1))||(i3.i2.u8.p62==1)))) + ((((((((u1.p35==1)||(u15.p135==1))||(u1.p24==1))||(i6.u13.p89==1))||(u9.p74==1))||(u2.p45==1))||((u2.p54==1)&&(u15.p153==1)))&&((((((((u15.p130==1)||(u15.p131==1))||(u10.p82==1))||(i3.i1.u6.p66==1))||((i6.u13.p110==1)&&(u15.p115==1)))||(i6.u13.p101==1))||(u15.p148==1))||(u1.p27==1)))) + ((((((((((i6.u13.p99==1)||(u15.p132==1))||((u1.p35==1)&&(u15.p153==1)))||(u2.p40==1))||(i6.u13.p88==1))||(u1.p28==1))||(u15.p143==1))||(u0.p14==1))||(u15.p125==1))&&(i3.i0.u4.p20==1)))) + !((E(!(((((((((u2.p38==1)&&(u15.p153==1))||(u1.p33==1))||(i3.i0.u4.p113==1))||(u15.p138==1))||(u15.p136==1))||(i6.u13.p93==1))||(u15.p143==1))) U (!((((((((((u0.p16==0)||(u15.p153==0))&&(u15.p128==0))&&((i6.u13.p110==0)||(u15.p115==0)))&&(u15.p151==0))&&(u1.p21==0))&&(u0.p6==0))&&(u1.p24==0))&&(i6.u12.p108==0))) * !(((((((((u2.p38==1)&&(u15.p153==1))||(u1.p33==1))||(i3.i0.u4.p113==1))||(u15.p138==1))||(u15.p136==1))||(i6.u13.p93==1))||(u15.p143==1))))) + EG(!(((((((((u2.p38==1)&&(u15.p153==1))||(u1.p33==1))||(i3.i0.u4.p113==1))||(u15.p138==1))||(u15.p136==1))||(i6.u13.p93==1))||(u15.p143==1))))))) + !(EX(!(!((E(!(((((((((u10.p82==1)||(u0.p3==1))||(i3.i2.u7.p69==1))||(i6.u13.p100==1))||(u15.p132==1))||(i6.u13.p91==1))||((i6.u13.p110==1)&&(u15.p144==1)))||(u2.p46==1))) U (!((((((((((u2.p49==1)||((i6.u13.p110==1)&&(u15.p150==1)))||(i3.i1.u6.p66==1))||(u0.p5==1))||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u15.p132==1)))||((u1.p35==1)&&(u15.p153==1)))||(u0.p8==1))||(u0.p9==1))||(u0.p12==1))) * !(((((((((u10.p82==1)||(u0.p3==1))||(i3.i2.u7.p69==1))||(i6.u13.p100==1))||(u15.p132==1))||(i6.u13.p91==1))||((i6.u13.p110==1)&&(u15.p144==1)))||(u2.p46==1))))) + EG(!(((((((((u10.p82==1)||(u0.p3==1))||(i3.i2.u7.p69==1))||(i6.u13.p100==1))||(u15.p132==1))||(i6.u13.p91==1))||((i6.u13.p110==1)&&(u15.p144==1)))||(u2.p46==1)))))))))))) * !(EX(!(((((((u15.p134==1)||(u2.p52==1))||(u15.p136==1))||(i6.u13.p92==1))||((u10.p83==1)&&(u15.p153==1)))||((u2.p54==1)&&(u15.p153==1)))))))] != FALSE
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 7
Fast SCC detection found an SCC at level 8
(forward)formula 7,0,69.5047,1838976,1,0,2.73651e+06,240107,4130,5.56881e+06,2436,3.45464e+06,2300210
FORMULA HealthRecord-PT-08-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: !(EX(!(EF((((u1.p35==1) + AX(((((u0.p16==1)&&(u15.p153==1))||((((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(i3.i0.u4.p60==1))&&(i3.i1.u6.p65==1))&&(i3.i2.u8.p70==1))&&(u9.p77==1))&&(u10.p84==1))&&(i6.u13.p111==1))&&(u15.p148==1)))||(u15.p132==1)))) * EF(((((((((i6.u13.p97==1)||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u15.p143==1)))||(u2.p53==1))||(u15.p133==1))||(u1.p24==1))||(u2.p41==1))||(u2.p44==1))||(i6.u13.p94==1))))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (((u1.p35==1) + !(EX(!(((((u0.p16==1)&&(u15.p153==1))||((((((((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(i3.i0.u4.p60==1))&&(i3.i1.u6.p65==1))&&(i3.i2.u8.p70==1))&&(u9.p77==1))&&(u10.p84==1))&&(i6.u13.p111==1))&&(u15.p148==1)))||(u15.p132==1)))))) * E(TRUE U ((((((((i6.u13.p97==1)||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u15.p143==1)))||(u2.p53==1))||(u15.p133==1))||(u1.p24==1))||(u2.p41==1))||(u2.p44==1))||(i6.u13.p94==1)))))))] = FALSE
(forward)formula 8,1,70.3798,1864056,1,0,2.77552e+06,242974,4151,5.64888e+06,2440,3.47522e+06,2333554
FORMULA HealthRecord-PT-08-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(!(EG(((!(E(((((u15.p114==1)||(i3.i2.u8.p39==1))||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u15.p136==1)))||(u15.p141==1)) U (((((((((((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u15.p149==1))||(i6.u13.p101==1))||(u15.p118==1))||(u1.p24==1))||(i6.u12.p107==1))||(u2.p43==1))||(u2.p45==1))||(u1.p29==1))||(u15.p124==1))||(u2.p47==1)))) * ((((u9.p74==0)&&(u1.p27==0))&&(u1.p29==0))||(((u2.p38==0)||(u15.p153==0))&&(u15.p138==0)))) * EF(((((((u10.p80==0)&&((u10.p83==0)||(u15.p153==0)))&&(u15.p151==0))&&(u2.p43==0))&&(u9.p74==0))&&(u0.p11==0)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(((!(E(((((u15.p114==1)||(i3.i2.u8.p39==1))||((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u15.p136==1)))||(u15.p141==1)) U (((((((((((((u0.p16==1)&&(u1.p35==1))&&(u2.p54==1))&&(u15.p149==1))||(i6.u13.p101==1))||(u15.p118==1))||(u1.p24==1))||(i6.u12.p107==1))||(u2.p43==1))||(u2.p45==1))||(u1.p29==1))||(u15.p124==1))||(u2.p47==1)))) * ((((u9.p74==0)&&(u1.p27==0))&&(u1.p29==0))||(((u2.p38==0)||(u15.p153==0))&&(u15.p138==0)))) * E(TRUE U ((((((u10.p80==0)&&((u10.p83==0)||(u15.p153==0)))&&(u15.p151==0))&&(u2.p43==0))&&(u9.p74==0))&&(u0.p11==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 7
Fast SCC detection found an SCC at level 8
(forward)formula 9,0,74.0423,1967280,1,0,2.9449e+06,247329,4232,5.97031e+06,2447,3.52554e+06,2458510
FORMULA HealthRecord-PT-08-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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


BK_STOP 1621281608322

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

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-08.tgz
mv HealthRecord-PT-08 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 ;