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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 11K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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 27K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 2.7K May 11 18:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K May 11 18:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 11 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 11 15:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 51K May 12 08:13 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HealthRecord-PT-11-CTLFireability-00
FORMULA_NAME HealthRecord-PT-11-CTLFireability-01
FORMULA_NAME HealthRecord-PT-11-CTLFireability-02
FORMULA_NAME HealthRecord-PT-11-CTLFireability-03
FORMULA_NAME HealthRecord-PT-11-CTLFireability-04
FORMULA_NAME HealthRecord-PT-11-CTLFireability-05
FORMULA_NAME HealthRecord-PT-11-CTLFireability-06
FORMULA_NAME HealthRecord-PT-11-CTLFireability-07
FORMULA_NAME HealthRecord-PT-11-CTLFireability-08
FORMULA_NAME HealthRecord-PT-11-CTLFireability-09
FORMULA_NAME HealthRecord-PT-11-CTLFireability-10
FORMULA_NAME HealthRecord-PT-11-CTLFireability-11
FORMULA_NAME HealthRecord-PT-11-CTLFireability-12
FORMULA_NAME HealthRecord-PT-11-CTLFireability-13
FORMULA_NAME HealthRecord-PT-11-CTLFireability-14
FORMULA_NAME HealthRecord-PT-11-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1621281857971

Running Version 0
[2021-05-17 20:04:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 20:04:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 20:04:19] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2021-05-17 20:04:19] [INFO ] Transformed 159 places.
[2021-05-17 20:04:19] [INFO ] Transformed 334 transitions.
[2021-05-17 20:04:19] [INFO ] Found NUPN structural information;
[2021-05-17 20:04:19] [INFO ] Parsed PT model containing 159 places and 334 transitions in 90 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
[2021-05-17 20:04:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 20:04:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 20:04:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 20:04:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 20:04:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 20:04:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 20:04:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 20:04:19] [INFO ] Reduced 1 identical enabling conditions.
[2021-05-17 20:04:19] [INFO ] Reduced 1 identical enabling conditions.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
Support contains 147 out of 159 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 159/159 places, 307/307 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 157 transition count 303
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 157 transition count 303
Applied a total of 4 rules in 18 ms. Remains 157 /159 variables (removed 2) and now considering 303/307 (removed 4) transitions.
[2021-05-17 20:04:19] [INFO ] Flow matrix only has 291 transitions (discarded 12 similar events)
// Phase 1: matrix 291 rows 157 cols
[2021-05-17 20:04:19] [INFO ] Computed 18 place invariants in 15 ms
[2021-05-17 20:04:19] [INFO ] Implicit Places using invariants in 136 ms returned []
[2021-05-17 20:04:19] [INFO ] Flow matrix only has 291 transitions (discarded 12 similar events)
// Phase 1: matrix 291 rows 157 cols
[2021-05-17 20:04:19] [INFO ] Computed 18 place invariants in 12 ms
[2021-05-17 20:04:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:04:20] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2021-05-17 20:04:20] [INFO ] Flow matrix only has 291 transitions (discarded 12 similar events)
// Phase 1: matrix 291 rows 157 cols
[2021-05-17 20:04:20] [INFO ] Computed 18 place invariants in 5 ms
[2021-05-17 20:04:20] [INFO ] Dead Transitions using invariants and state equation in 202 ms returned []
Finished structural reductions, in 1 iterations. Remains : 157/159 places, 303/307 transitions.
[2021-05-17 20:04:20] [INFO ] Flatten gal took : 55 ms
[2021-05-17 20:04:20] [INFO ] Flatten gal took : 23 ms
[2021-05-17 20:04:20] [INFO ] Input system was already deterministic with 303 transitions.
Incomplete random walk after 100000 steps, including 6715 resets, run finished after 424 ms. (steps per millisecond=235 ) properties (out of 68) seen :60
Running SMT prover for 8 properties.
[2021-05-17 20:04:21] [INFO ] Flow matrix only has 291 transitions (discarded 12 similar events)
// Phase 1: matrix 291 rows 157 cols
[2021-05-17 20:04:21] [INFO ] Computed 18 place invariants in 3 ms
[2021-05-17 20:04:21] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 20:04:21] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:04:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:04:21] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2021-05-17 20:04:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:04:21] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-17 20:04:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:04:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:04:21] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:04:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:04:21] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2021-05-17 20:04:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:04:21] [INFO ] Computed and/alt/rep : 226/265/226 causal constraints (skipped 64 transitions) in 25 ms.
[2021-05-17 20:04:21] [INFO ] Added : 81 causal constraints over 17 iterations in 291 ms. Result :sat
[2021-05-17 20:04:21] [INFO ] [Real]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-17 20:04:21] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:04:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:04:21] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2021-05-17 20:04:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:04:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 20:04:21] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:04:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:04:21] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2021-05-17 20:04:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 20:04:21] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 4 ms to minimize.
[2021-05-17 20:04:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2021-05-17 20:04:21] [INFO ] Computed and/alt/rep : 226/265/226 causal constraints (skipped 64 transitions) in 26 ms.
[2021-05-17 20:04:22] [INFO ] Added : 78 causal constraints over 16 iterations in 243 ms. Result :sat
[2021-05-17 20:04:22] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 20:04:22] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:04:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:04:22] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2021-05-17 20:04:22] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:04:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:04:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 20:04:22] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:04:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:04:22] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2021-05-17 20:04:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 20:04:22] [INFO ] Computed and/alt/rep : 226/265/226 causal constraints (skipped 64 transitions) in 22 ms.
[2021-05-17 20:04:22] [INFO ] Added : 82 causal constraints over 17 iterations in 252 ms. Result :sat
[2021-05-17 20:04:22] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 20:04:22] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:04:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:04:22] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2021-05-17 20:04:22] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:04:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:04:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 20:04:22] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-17 20:04:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:04:22] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2021-05-17 20:04:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 20:04:22] [INFO ] Computed and/alt/rep : 226/265/226 causal constraints (skipped 64 transitions) in 21 ms.
[2021-05-17 20:04:23] [INFO ] Added : 82 causal constraints over 17 iterations in 239 ms. Result :sat
[2021-05-17 20:04:23] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 20:04:23] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:04:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:04:23] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2021-05-17 20:04:23] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:04:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:04:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 20:04:23] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:04:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:04:23] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2021-05-17 20:04:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:04:23] [INFO ] Computed and/alt/rep : 226/265/226 causal constraints (skipped 64 transitions) in 21 ms.
[2021-05-17 20:04:23] [INFO ] Added : 81 causal constraints over 17 iterations in 222 ms. Result :sat
[2021-05-17 20:04:23] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2021-05-17 20:04:23] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:04:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:04:23] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2021-05-17 20:04:23] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:04:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:04:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 20:04:23] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:04:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:04:23] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2021-05-17 20:04:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:04:23] [INFO ] Computed and/alt/rep : 226/265/226 causal constraints (skipped 64 transitions) in 16 ms.
[2021-05-17 20:04:23] [INFO ] Added : 79 causal constraints over 16 iterations in 216 ms. Result :sat
[2021-05-17 20:04:23] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:04:23] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:04:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:04:24] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2021-05-17 20:04:24] [INFO ] [Real]Added 1 Read/Feed constraints in 4 ms returned sat
[2021-05-17 20:04:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:04:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 20:04:24] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:04:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:04:24] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2021-05-17 20:04:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:04:24] [INFO ] Computed and/alt/rep : 226/265/226 causal constraints (skipped 64 transitions) in 20 ms.
[2021-05-17 20:04:24] [INFO ] Added : 80 causal constraints over 16 iterations in 219 ms. Result :sat
[2021-05-17 20:04:24] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 20:04:24] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:04:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:04:24] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2021-05-17 20:04:24] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:04:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:04:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-17 20:04:24] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-17 20:04:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:04:24] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2021-05-17 20:04:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:04:24] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 2 ms to minimize.
[2021-05-17 20:04:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2021-05-17 20:04:24] [INFO ] Computed and/alt/rep : 226/265/226 causal constraints (skipped 64 transitions) in 20 ms.
[2021-05-17 20:04:24] [INFO ] Added : 84 causal constraints over 17 iterations in 241 ms. Result :sat
Graph (trivial) has 229 edges and 157 vertex of which 10 / 157 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 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 84 place count 69 transition count 141
Iterating global reduction 0 with 83 rules applied. Total rules applied 167 place count 69 transition count 141
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 176 place count 60 transition count 123
Iterating global reduction 0 with 9 rules applied. Total rules applied 185 place count 60 transition count 123
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 195 place count 60 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 196 place count 59 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 197 place count 59 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 198 place count 58 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 199 place count 58 transition count 108
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 202 place count 58 transition count 105
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 2 with 6 rules applied. Total rules applied 208 place count 55 transition count 102
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 220 place count 49 transition count 128
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 222 place count 49 transition count 126
Applied a total of 222 rules in 38 ms. Remains 49 /157 variables (removed 108) and now considering 126/303 (removed 177) transitions.
[2021-05-17 20:04:24] [INFO ] Flatten gal took : 9 ms
[2021-05-17 20:04:24] [INFO ] Flatten gal took : 10 ms
[2021-05-17 20:04:24] [INFO ] Input system was already deterministic with 126 transitions.
[2021-05-17 20:04:25] [INFO ] Flatten gal took : 9 ms
[2021-05-17 20:04:25] [INFO ] Flatten gal took : 9 ms
[2021-05-17 20:04:25] [INFO ] Time to serialize gal into /tmp/CTLFireability13932829405369392657.gal : 4 ms
[2021-05-17 20:04:25] [INFO ] Time to serialize properties into /tmp/CTLFireability8760109653835662867.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/CTLFireability13932829405369392657.gal, -t, CGAL, -ctl, /tmp/CTLFireability8760109653835662867.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/CTLFireability13932829405369392657.gal -t CGAL -ctl /tmp/CTLFireability8760109653835662867.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,132341,0.094908,7656,2,1405,5,13788,6,0,314,10380,0


Converting to forward existential form...Done !
original formula: !(EF(!(EF((((((p97==1)||(p81==1))||(p8==1))||(p158==1))||(p94==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((((p97==1)||(p81==1))||(p8==1))||(p158==1))||(p94==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, t38, t39, t41, t42, t66, t67, t74, t75, t122, t123, t124, t125, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/87/39/126
(forward)formula 0,0,0.463708,20252,1,0,227,81702,265,77,2923,50800,268
FORMULA HealthRecord-PT-11-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Graph (trivial) has 237 edges and 157 vertex of which 10 / 157 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 87 places :
Symmetric choice reduction at 0 with 87 rule applications. Total rules 88 place count 64 transition count 132
Iterating global reduction 0 with 87 rules applied. Total rules applied 175 place count 64 transition count 132
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 185 place count 54 transition count 112
Iterating global reduction 0 with 10 rules applied. Total rules applied 195 place count 54 transition count 112
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 205 place count 54 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 207 place count 52 transition count 96
Iterating global reduction 1 with 2 rules applied. Total rules applied 209 place count 52 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 211 place count 50 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 213 place count 50 transition count 92
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 219 place count 50 transition count 86
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 223 place count 48 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 227 place count 46 transition count 103
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 232 place count 46 transition count 98
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 233 place count 45 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 234 place count 44 transition count 96
Applied a total of 234 rules in 33 ms. Remains 44 /157 variables (removed 113) and now considering 96/303 (removed 207) transitions.
[2021-05-17 20:04:25] [INFO ] Flatten gal took : 5 ms
[2021-05-17 20:04:25] [INFO ] Flatten gal took : 5 ms
[2021-05-17 20:04:25] [INFO ] Input system was already deterministic with 96 transitions.
Incomplete random walk after 10000 steps, including 1047 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 36950 steps, run visited all 1 properties in 92 ms. (steps per millisecond=401 )
Probabilistic random walk after 36950 steps, saw 6653 distinct states, run finished after 92 ms. (steps per millisecond=401 ) properties seen :{0=1}
FORMULA HealthRecord-PT-11-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Graph (trivial) has 198 edges and 157 vertex of which 10 / 157 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 84 places :
Symmetric choice reduction at 0 with 84 rule applications. Total rules 85 place count 68 transition count 138
Iterating global reduction 0 with 84 rules applied. Total rules applied 169 place count 68 transition count 138
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 178 place count 59 transition count 120
Iterating global reduction 0 with 9 rules applied. Total rules applied 187 place count 59 transition count 120
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 194 place count 59 transition count 113
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 196 place count 57 transition count 107
Iterating global reduction 1 with 2 rules applied. Total rules applied 198 place count 57 transition count 107
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 200 place count 55 transition count 103
Iterating global reduction 1 with 2 rules applied. Total rules applied 202 place count 55 transition count 103
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 207 place count 55 transition count 98
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 2 with 6 rules applied. Total rules applied 213 place count 52 transition count 95
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 223 place count 47 transition count 133
Applied a total of 223 rules in 33 ms. Remains 47 /157 variables (removed 110) and now considering 133/303 (removed 170) transitions.
[2021-05-17 20:04:25] [INFO ] Flatten gal took : 10 ms
[2021-05-17 20:04:25] [INFO ] Flatten gal took : 18 ms
[2021-05-17 20:04:25] [INFO ] Input system was already deterministic with 133 transitions.
[2021-05-17 20:04:25] [INFO ] Flatten gal took : 9 ms
[2021-05-17 20:04:25] [INFO ] Flatten gal took : 9 ms
[2021-05-17 20:04:25] [INFO ] Time to serialize gal into /tmp/CTLFireability66954723279856990.gal : 3 ms
[2021-05-17 20:04:25] [INFO ] Time to serialize properties into /tmp/CTLFireability2611846358615084556.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/CTLFireability66954723279856990.gal, -t, CGAL, -ctl, /tmp/CTLFireability2611846358615084556.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/CTLFireability66954723279856990.gal -t CGAL -ctl /tmp/CTLFireability2611846358615084556.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,104549,0.075461,7016,2,1572,5,10615,6,0,310,6380,0


Converting to forward existential form...Done !
original formula: EG((((((((p96==0)&&(p51==0))&&(p36==0))&&(p40==0))&&(p143==0))&&(p62==0))&&((p113==0)||(p134==0))))
=> equivalent forward existential formula: [FwdG(Init,(((((((p96==0)&&(p51==0))&&(p36==0))&&(p40==0))&&(p143==0))&&(p62==0))&&((p113==0)||(p134==0))))] != FALSE
Hit Full ! (commute/partial/dont) 68/337/65
(forward)formula 0,0,0.227142,12412,1,0,9,36465,19,3,2304,14053,9
FORMULA HealthRecord-PT-11-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Graph (trivial) has 201 edges and 157 vertex of which 10 / 157 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 85 places :
Symmetric choice reduction at 0 with 85 rule applications. Total rules 86 place count 67 transition count 137
Iterating global reduction 0 with 85 rules applied. Total rules applied 171 place count 67 transition count 137
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 181 place count 57 transition count 117
Iterating global reduction 0 with 10 rules applied. Total rules applied 191 place count 57 transition count 117
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 201 place count 57 transition count 107
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 203 place count 55 transition count 101
Iterating global reduction 1 with 2 rules applied. Total rules applied 205 place count 55 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 207 place count 53 transition count 97
Iterating global reduction 1 with 2 rules applied. Total rules applied 209 place count 53 transition count 97
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 215 place count 53 transition count 91
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 2 with 6 rules applied. Total rules applied 221 place count 50 transition count 88
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 233 place count 44 transition count 121
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 234 place count 44 transition count 120
Applied a total of 234 rules in 23 ms. Remains 44 /157 variables (removed 113) and now considering 120/303 (removed 183) transitions.
[2021-05-17 20:04:26] [INFO ] Flatten gal took : 8 ms
[2021-05-17 20:04:26] [INFO ] Flatten gal took : 8 ms
[2021-05-17 20:04:26] [INFO ] Input system was already deterministic with 120 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
FORMULA HealthRecord-PT-11-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2021-05-17 20:04:26] [INFO ] Flatten gal took : 14 ms
[2021-05-17 20:04:26] [INFO ] Flatten gal took : 17 ms
[2021-05-17 20:04:26] [INFO ] Applying decomposition
[2021-05-17 20:04:26] [INFO ] Flatten gal took : 13 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/graph6683741376805986745.txt, -o, /tmp/graph6683741376805986745.bin, -w, /tmp/graph6683741376805986745.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/graph6683741376805986745.bin, -l, -1, -v, -w, /tmp/graph6683741376805986745.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:04:26] [INFO ] Decomposing Gal with order
[2021-05-17 20:04:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:04:26] [INFO ] Removed a total of 49 redundant transitions.
[2021-05-17 20:04:26] [INFO ] Flatten gal took : 54 ms
[2021-05-17 20:04:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 5 ms.
[2021-05-17 20:04:26] [INFO ] Time to serialize gal into /tmp/CTLFireability6903273068972121379.gal : 5 ms
[2021-05-17 20:04:26] [INFO ] Time to serialize properties into /tmp/CTLFireability2166717842770307735.ctl : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/CTLFireability6903273068972121379.gal, -t, CGAL, -ctl, /tmp/CTLFireability2166717842770307735.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/CTLFireability6903273068972121379.gal -t CGAL -ctl /tmp/CTLFireability2166717842770307735.ctl
No direction supplied, using forward translation only.
Parsed 12 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.24975e+09,7.89181,193956,1437,2224,198637,59262,372,599641,328,1.20821e+06,0


Converting to forward existential form...Done !
original formula: (EX((EG(AF((((u0.p4==1)||(u14.p132==1))||(i7.u12.p105==1)))) + (EX(((((((u14.p130==1)||(i3.i1.u6.p67==1))||(i7.u12.p98==1))||(u14.p134==1))||(u1.p36==1))||(u0.p7==1))) * EX((((((((((u1.p32==1)||(u14.p145==1))||(u7.p69==1))||(u2.p54==1))||(u2.p41==1))||(u14.p136==1))||(i3.i1.u6.p75==1))||((u8.p79==1)&&(u14.p156==1)))||(u1.p31==1)))))) + !(AG(EF((i7.u12.p96==1)))))
=> equivalent forward existential formula: (([FwdG(EY(Init),!(EG(!((((u0.p4==1)||(u14.p132==1))||(i7.u12.p105==1))))))] != FALSE + [(EY((EY(Init) * EX(((((((u14.p130==1)||(i3.i1.u6.p67==1))||(i7.u12.p98==1))||(u14.p134==1))||(u1.p36==1))||(u0.p7==1))))) * (((((((((u1.p32==1)||(u14.p145==1))||(u7.p69==1))||(u2.p54==1))||(u2.p41==1))||(u14.p136==1))||(i3.i1.u6.p75==1))||((u8.p79==1)&&(u14.p156==1)))||(u1.p31==1)))] != FALSE) + [(FwdU(Init,TRUE) * !(E(TRUE U (i7.u12.p96==1))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t12, 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.t224, 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, u7.t116, u7.t117, u7.t118, u7.t119, u7.t120, u7.t121, u7.t122, u7.t123, u8.t108, u8.t109, u8.t110, u8.t111, u8.t112, u8.t113, u8.t114, u8.t115, u9.t100, u9.t101, u9.t102, u9.t103, u9.t104, u9.t105, u9.t106, u9.t107, u14.t1, u14.t2, u14.t3, u14.t4, u14.t5, u14.t6, u14.t7, u14.t8, u14.t9, u14.t14, u14.t15, u14.t16, u14.t17, u14.t18, u14.t19, u14.t20, u14.t21, u14.t22, u14.t23, u14.t24, u14.t25, u14.t26, u14.t27, u14.t28, u14.t29, u14.t30, u14.t31, u14.t32, u14.t33, u14.t34, u14.t35, u14.t36, u14.t37, u14.t38, u14.t39, u14.t40, u14.t41, u14.t42, u14.t43, u14.t44, u14.t45, u14.t46, u14.t47, u14.t48, u14.t49, u14.t50, u14.t51, u14.t52, u14.t53, u14.t54, u14.t55, u14.t56, u14.t57, u14.t58, u14.t59, i7.t64, i7.t62, i7.u12.t68, i7.u12.t69, i7.u12.t70, i7.u12.t71, i7.u12.t72, i7.u12.t73, i7.u12.t74, i7.u12.t75, i7.u12.t76, i7.u12.t77, i7.u12.t78, i7.u12.t79, i7.u12.t80, i7.u12.t81, i7.u12.t82, i7.u12.t83, i7.u12.t84, i7.u12.t85, i7.u12.t86, i7.u12.t87, i7.u12.t88, i7.u12.t89, i7.u12.t90, i7.u12.t91, i7.u12.t92, i7.u12.t93, i7.u12.t94, i7.u12.t95, i7.u12.t96, i7.u12.t97, i7.u12.t98, i7.u12.t99, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/93/204/297
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,11.676,194340,1,0,275093,62375,2385,599641,1865,1.20821e+06,439497
FORMULA HealthRecord-PT-11-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(EF(AX((((EG(((i7.u12.p113==1)&&(u14.p140==1))) * EX(((((((((((u1.p36==1)&&(u14.p156==1))||(u0.p6==1))||(i7.u10.p107==1))||(i3.i0.u3.p59==1))||((u0.p17==1)&&(u14.p156==1)))||(u14.p127==1))||(u1.p29==1))||(u2.p46==1))||(u14.p125==1)))) * (((((((((((((i3.i0.u4.p2==1)||(u13.p148==1))||(u2.p43==1))||(u0.p14==1))||(u1.p36==1))||(u1.p24==1))||(u1.p25==1))||(u1.p26==1))||(u0.p11==1))||(u14.p141==1))||(u14.p125==1))||(u2.p46==1))||((u2.p55==1)&&(u14.p156==1)))) * ((((((((((((i3.i1.u6.p21==1)||(u1.p38==1))||(i7.u12.p95==1))||(i3.i0.u4.p62==1))||(u0.p16==1))||(i3.i1.u5.p64==1))||(u14.p129==1))||(u14.p118==1))||(u1.p27==1))||((u1.p36==1)&&(u14.p156==1)))||((u7.p72==1)&&(u14.p156==1)))||((u0.p1==1)&&(u14.p156==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!((((EG(((i7.u12.p113==1)&&(u14.p140==1))) * EX(((((((((((u1.p36==1)&&(u14.p156==1))||(u0.p6==1))||(i7.u10.p107==1))||(i3.i0.u3.p59==1))||((u0.p17==1)&&(u14.p156==1)))||(u14.p127==1))||(u1.p29==1))||(u2.p46==1))||(u14.p125==1)))) * (((((((((((((i3.i0.u4.p2==1)||(u13.p148==1))||(u2.p43==1))||(u0.p14==1))||(u1.p36==1))||(u1.p24==1))||(u1.p25==1))||(u1.p26==1))||(u0.p11==1))||(u14.p141==1))||(u14.p125==1))||(u2.p46==1))||((u2.p55==1)&&(u14.p156==1)))) * ((((((((((((i3.i1.u6.p21==1)||(u1.p38==1))||(i7.u12.p95==1))||(i3.i0.u4.p62==1))||(u0.p16==1))||(i3.i1.u5.p64==1))||(u14.p129==1))||(u14.p118==1))||(u1.p27==1))||((u1.p36==1)&&(u14.p156==1)))||((u7.p72==1)&&(u14.p156==1)))||((u0.p1==1)&&(u14.p156==1))))))))))] = FALSE
(forward)formula 1,0,12.8028,212820,1,0,346055,67067,2530,599641,1884,1.20821e+06,510481
FORMULA HealthRecord-PT-11-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AX(EX(AG(((((u13.p150==0)&&(i7.u12.p100==0))&&(u14.p153==0))&&(u1.p29==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EX(!(E(TRUE U !(((((u13.p150==0)&&(i7.u12.p100==0))&&(u14.p153==0))&&(u1.p29==0))))))))] = FALSE
(forward)formula 2,1,13.2947,229980,1,0,374066,71693,2548,618853,1888,1.20821e+06,535268
FORMULA HealthRecord-PT-11-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: ((E(EF((EG(((u14.p125==0)&&(i7.u12.p94==0))) + EF(((((i7.u11.p112==1)||(u9.p85==1))||((i7.u12.p113==1)&&(u14.p122==1)))||(u14.p119==1))))) U ((((((((i7.u12.p101==1)||(u14.p151==1))||(u7.p71==1))||(i3.i1.u6.p89==1))||((u0.p17==1)&&(u14.p156==1)))||(u0.p14==1))||(u2.p46==1)) * E((((((((u14.p146==1)||(i7.u12.p97==1))||(u0.p17==1))||(i3.i1.u6.p67==1))||(u14.p151==1))||((u0.p17==1)&&(u14.p156==1)))||(u2.p44==1)) U ((((((((u8.p81==1)||(i7.u12.p101==1))||(u9.p84==1))||(i7.u12.p102==1))||(u0.p10==1))||(u14.p125==1))||(i7.u12.p94==1))&&(((((((u0.p16==1)||((i7.u12.p113==1)&&(u14.p136==1)))||(u0.p10==1))||((u8.p79==1)&&(u14.p156==1)))||(u0.p12==1))||(u14.p127==1))||(u8.p78==1)))))) + AG((((((((((((((i7.u12.p113==1)&&(u14.p126==1))||(i7.u12.p99==1))||(u1.p27==1))||(u0.p12==1))||(u2.p45==1))||(u14.p126==1))||(i7.u11.p110==1))||(i7.u12.p95==1))||(u14.p141==1))||((((i3.i1.u6.p67==0)&&(u14.p135==0))&&(u2.p57==0))&&(u14.p120==0))) + EG((((i3.i1.u6.p82==1)||(u7.p71==1))||(u1.p25==1)))) + (((((((((i7.u12.p113==1)&&(u14.p126==1))||((u1.p20==1)&&(u14.p156==1)))||(u7.p69==1))||(u7.p71==1))||((u8.p79==1)&&(u14.p156==1)))||(i7.u12.p95==1))||(i7.u12.p94==1))&&(((((((u2.p51==1)||(u1.p35==1))||(u0.p7==1))||(u9.p88==1))||(u14.p127==1))||((u2.p39==1)&&(u14.p156==1)))||(u1.p31==1)))))) + E(E(!(AX(((((((((i7.u12.p96==1)||(u2.p54==1))||(u0.p8==1))||(i7.u12.p106==1))||(u14.p123==1))||(u1.p26==1))||(i7.u11.p110==1))||(u2.p47==1)))) U !(EX((((i7.u11.p112==1)||(u0.p10==1))||(u1.p29==1))))) U EX((E((((((((((i7.u12.p113==1)&&(u14.p140==1))||(u1.p22==1))||(u0.p6==1))||(u14.p122==1))||(u14.p139==1))||(u1.p25==1))||((((((((((u0.p18==1)&&(u1.p37==1))&&(u2.p56==1))&&(i3.i0.u4.p61==1))&&(i3.i1.u6.p66==1))&&(u7.p73==1))&&(u8.p80==1))&&(u9.p87==1))&&(i7.u12.p113==1))&&(u14.p157==1)))||(u1.p28==1)) U ((((u14.p131==1)||(i7.u12.p91==1))||(i3.i1.u6.p75==1))||(i7.u12.p94==1))) * (((((((u9.p86==1)&&(u14.p156==1))||(u0.p17==1))||(u1.p34==1))||(i3.i1.u6.p21==1))||(i7.u12.p106==1))||(u14.p143==1))))))
=> equivalent forward existential formula: [(((FwdU(((Init * !(E(E(!(!(EX(!(((((((((i7.u12.p96==1)||(u2.p54==1))||(u0.p8==1))||(i7.u12.p106==1))||(u14.p123==1))||(u1.p26==1))||(i7.u11.p110==1))||(u2.p47==1)))))) U !(EX((((i7.u11.p112==1)||(u0.p10==1))||(u1.p29==1))))) U EX((E((((((((((i7.u12.p113==1)&&(u14.p140==1))||(u1.p22==1))||(u0.p6==1))||(u14.p122==1))||(u14.p139==1))||(u1.p25==1))||((((((((((u0.p18==1)&&(u1.p37==1))&&(u2.p56==1))&&(i3.i0.u4.p61==1))&&(i3.i1.u6.p66==1))&&(u7.p73==1))&&(u8.p80==1))&&(u9.p87==1))&&(i7.u12.p113==1))&&(u14.p157==1)))||(u1.p28==1)) U ((((u14.p131==1)||(i7.u12.p91==1))||(i3.i1.u6.p75==1))||(i7.u12.p94==1))) * (((((((u9.p86==1)&&(u14.p156==1))||(u0.p17==1))||(u1.p34==1))||(i3.i1.u6.p21==1))||(i7.u12.p106==1))||(u14.p143==1))))))) * !(E(E(TRUE U (EG(((u14.p125==0)&&(i7.u12.p94==0))) + E(TRUE U ((((i7.u11.p112==1)||(u9.p85==1))||((i7.u12.p113==1)&&(u14.p122==1)))||(u14.p119==1))))) U ((((((((i7.u12.p101==1)||(u14.p151==1))||(u7.p71==1))||(i3.i1.u6.p89==1))||((u0.p17==1)&&(u14.p156==1)))||(u0.p14==1))||(u2.p46==1)) * E((((((((u14.p146==1)||(i7.u12.p97==1))||(u0.p17==1))||(i3.i1.u6.p67==1))||(u14.p151==1))||((u0.p17==1)&&(u14.p156==1)))||(u2.p44==1)) U ((((((((u8.p81==1)||(i7.u12.p101==1))||(u9.p84==1))||(i7.u12.p102==1))||(u0.p10==1))||(u14.p125==1))||(i7.u12.p94==1))&&(((((((u0.p16==1)||((i7.u12.p113==1)&&(u14.p136==1)))||(u0.p10==1))||((u8.p79==1)&&(u14.p156==1)))||(u0.p12==1))||(u14.p127==1))||(u8.p78==1)))))))),TRUE) * !((((((((((i7.u12.p113==1)&&(u14.p126==1))||((u1.p20==1)&&(u14.p156==1)))||(u7.p69==1))||(u7.p71==1))||((u8.p79==1)&&(u14.p156==1)))||(i7.u12.p95==1))||(i7.u12.p94==1))&&(((((((u2.p51==1)||(u1.p35==1))||(u0.p7==1))||(u9.p88==1))||(u14.p127==1))||((u2.p39==1)&&(u14.p156==1)))||(u1.p31==1))))) * !((((((((((((i7.u12.p113==1)&&(u14.p126==1))||(i7.u12.p99==1))||(u1.p27==1))||(u0.p12==1))||(u2.p45==1))||(u14.p126==1))||(i7.u11.p110==1))||(i7.u12.p95==1))||(u14.p141==1))||((((i3.i1.u6.p67==0)&&(u14.p135==0))&&(u2.p57==0))&&(u14.p120==0))))) * !(EG((((i3.i1.u6.p82==1)||(u7.p71==1))||(u1.p25==1)))))] = FALSE
(forward)formula 3,1,32.7157,820828,1,0,1.32744e+06,105556,2894,2.57327e+06,1917,1.20821e+06,1266210
FORMULA HealthRecord-PT-11-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AX(AX(EF((((((u7.p69==1)||(u7.p70==1))||(u2.p45==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u14.p152==1)))||((i7.u12.p113==1)&&(u14.p147==1))))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(E(TRUE U (((((u7.p69==1)||(u7.p70==1))||(u2.p45==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u14.p152==1)))||((i7.u12.p113==1)&&(u14.p147==1))))))] = FALSE
(forward)formula 4,0,33.1628,836668,1,0,1.35741e+06,106080,2916,2.62184e+06,1920,1.20821e+06,1291425
FORMULA HealthRecord-PT-11-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AG((!(A((((u7.p70==1)||(i7.u11.p110==1)) + AG((((((u0.p7==1)||(i7.u10.p107==1))||(u0.p9==1))||((((((((((u0.p18==1)&&(u1.p37==1))&&(u2.p56==1))&&(i3.i0.u4.p61==1))&&(i3.i1.u6.p66==1))&&(u7.p73==1))&&(u8.p80==1))&&(u9.p87==1))&&(i7.u12.p113==1))&&(u14.p157==1)))||((u2.p55==1)&&(u14.p156==1))))) U ((((((((((((u14.p131==1)||((u1.p36==1)&&(u14.p156==1)))||(u14.p144==1))||(i7.u12.p98==1))||(u14.p117==1))||((u0.p1==1)&&(u14.p156==1)))||(u0.p9==1))||(u1.p25==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u14.p146==1)))||((u0.p17==1)&&(u14.p156==1))) * A(((((((((u14.p135==1)||(u14.p151==1))||(u1.p26==1))||(u0.p11==1))||(u14.p143==1))||(i3.i1.u6.p63==1))||(i7.u12.p94==1))||(u14.p141==1)) U ((((((u2.p48==1)||(u0.p3==1))||(u2.p55==1))||(u2.p54==1))||(u14.p153==1))||(u1.p29==1)))) * AX(((((((u1.p34==1)||(u9.p85==1))||(i7.u12.p103==1))||(u2.p43==1))||(u7.p74==1))||(i7.u12.p95==1)))))) * !(EF(AG(AF((((((((((((u9.p86==1)&&(u14.p156==1))||((u1.p36==1)&&(u14.p156==1)))||(u1.p35==1))||(i7.u12.p103==1))||(u14.p138==1))||(u9.p88==1))||((i7.u12.p113==1)&&(u14.p130==1)))||(u0.p13==1))||(u8.p78==1))||(u14.p125==1))))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EG(!(((((((((((((u14.p131==1)||((u1.p36==1)&&(u14.p156==1)))||(u14.p144==1))||(i7.u12.p98==1))||(u14.p117==1))||((u0.p1==1)&&(u14.p156==1)))||(u0.p9==1))||(u1.p25==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u14.p146==1)))||((u0.p17==1)&&(u14.p156==1))) * !((E(!(((((((u2.p48==1)||(u0.p3==1))||(u2.p55==1))||(u2.p54==1))||(u14.p153==1))||(u1.p29==1))) U (!(((((((((u14.p135==1)||(u14.p151==1))||(u1.p26==1))||(u0.p11==1))||(u14.p143==1))||(i3.i1.u6.p63==1))||(i7.u12.p94==1))||(u14.p141==1))) * !(((((((u2.p48==1)||(u0.p3==1))||(u2.p55==1))||(u2.p54==1))||(u14.p153==1))||(u1.p29==1))))) + EG(!(((((((u2.p48==1)||(u0.p3==1))||(u2.p55==1))||(u2.p54==1))||(u14.p153==1))||(u1.p29==1))))))) * !(EX(!(((((((u1.p34==1)||(u9.p85==1))||(i7.u12.p103==1))||(u2.p43==1))||(u7.p74==1))||(i7.u12.p95==1)))))))))) * !(E(!(((((((((((((u14.p131==1)||((u1.p36==1)&&(u14.p156==1)))||(u14.p144==1))||(i7.u12.p98==1))||(u14.p117==1))||((u0.p1==1)&&(u14.p156==1)))||(u0.p9==1))||(u1.p25==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u14.p146==1)))||((u0.p17==1)&&(u14.p156==1))) * !((E(!(((((((u2.p48==1)||(u0.p3==1))||(u2.p55==1))||(u2.p54==1))||(u14.p153==1))||(u1.p29==1))) U (!(((((((((u14.p135==1)||(u14.p151==1))||(u1.p26==1))||(u0.p11==1))||(u14.p143==1))||(i3.i1.u6.p63==1))||(i7.u12.p94==1))||(u14.p141==1))) * !(((((((u2.p48==1)||(u0.p3==1))||(u2.p55==1))||(u2.p54==1))||(u14.p153==1))||(u1.p29==1))))) + EG(!(((((((u2.p48==1)||(u0.p3==1))||(u2.p55==1))||(u2.p54==1))||(u14.p153==1))||(u1.p29==1))))))) * !(EX(!(((((((u1.p34==1)||(u9.p85==1))||(i7.u12.p103==1))||(u2.p43==1))||(u7.p74==1))||(i7.u12.p95==1))))))) U (!((((u7.p70==1)||(i7.u11.p110==1)) + !(E(TRUE U !((((((u0.p7==1)||(i7.u10.p107==1))||(u0.p9==1))||((((((((((u0.p18==1)&&(u1.p37==1))&&(u2.p56==1))&&(i3.i0.u4.p61==1))&&(i3.i1.u6.p66==1))&&(u7.p73==1))&&(u8.p80==1))&&(u9.p87==1))&&(i7.u12.p113==1))&&(u14.p157==1)))||((u2.p55==1)&&(u14.p156==1)))))))) * !(((((((((((((u14.p131==1)||((u1.p36==1)&&(u14.p156==1)))||(u14.p144==1))||(i7.u12.p98==1))||(u14.p117==1))||((u0.p1==1)&&(u14.p156==1)))||(u0.p9==1))||(u1.p25==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u14.p146==1)))||((u0.p17==1)&&(u14.p156==1))) * !((E(!(((((((u2.p48==1)||(u0.p3==1))||(u2.p55==1))||(u2.p54==1))||(u14.p153==1))||(u1.p29==1))) U (!(((((((((u14.p135==1)||(u14.p151==1))||(u1.p26==1))||(u0.p11==1))||(u14.p143==1))||(i3.i1.u6.p63==1))||(i7.u12.p94==1))||(u14.p141==1))) * !(((((((u2.p48==1)||(u0.p3==1))||(u2.p55==1))||(u2.p54==1))||(u14.p153==1))||(u1.p29==1))))) + EG(!(((((((u2.p48==1)||(u0.p3==1))||(u2.p55==1))||(u2.p54==1))||(u14.p153==1))||(u1.p29==1))))))) * !(EX(!(((((((u1.p34==1)||(u9.p85==1))||(i7.u12.p103==1))||(u2.p43==1))||(u7.p74==1))||(i7.u12.p95==1)))))))))))] = FALSE * [(FwdU(FwdU(Init,TRUE),TRUE) * !(E(TRUE U !(!(EG(!((((((((((((u9.p86==1)&&(u14.p156==1))||((u1.p36==1)&&(u14.p156==1)))||(u1.p35==1))||(i7.u12.p103==1))||(u14.p138==1))||(u9.p88==1))||((i7.u12.p113==1)&&(u14.p130==1)))||(u0.p13==1))||(u8.p78==1))||(u14.p125==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 8
Fast SCC detection found an SCC at level 9
(forward)formula 5,0,45.8299,1165172,1,0,1.91621e+06,123033,3074,3.59004e+06,1937,1.20821e+06,1736143
FORMULA HealthRecord-PT-11-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EX(AF((((((E(!(AX(((((((u1.p32==1)||((u1.p36==1)&&(u14.p156==1)))||(u1.p36==1))||(u0.p10==1))||(u14.p127==1))||(u8.p78==1)))) U EG((u2.p55==1))) + (i7.u12.p104==1)) + (u2.p43==1)) + (u14.p127==1)) + (u8.p78==1)) + ((u1.p36==1)&&(u14.p156==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((((((E(!(!(EX(!(((((((u1.p32==1)||((u1.p36==1)&&(u14.p156==1)))||(u1.p36==1))||(u0.p10==1))||(u14.p127==1))||(u8.p78==1)))))) U EG((u2.p55==1))) + (i7.u12.p104==1)) + (u2.p43==1)) + (u14.p127==1)) + (u8.p78==1)) + ((u1.p36==1)&&(u14.p156==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 8
Fast SCC detection found an SCC at level 9
(forward)formula 6,1,48.0279,1248860,1,0,2.07444e+06,126406,3106,3.86042e+06,1938,1.20821e+06,1838341
FORMULA HealthRecord-PT-11-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EF((((((((((u14.p144==1)||(u2.p50==1))||(i7.u12.p100==1))||(u14.p135==1))||(u0.p5==1))||(u0.p6==1))||(u14.p154==1))||(u2.p57==1))||(u14.p126==1))) * (EG(((((EF(((u9.p86==1)&&(u14.p156==1))) * E((u1.p32==1) U ((((((((u0.p16==1)||(u14.p154==1))||((u0.p1==1)&&(u14.p156==1)))||(u2.p43==1))||(i7.u12.p91==1))||(u1.p26==1))||(u14.p127==1))||(u14.p124==1)))) * AX((i7.u12.p101==1))) + AX((((((u14.p131==1)||(u14.p119==1))||(u2.p43==1))||((i7.u12.p113==1)&&(u14.p144==1)))&&((((((((((u0.p17==1)||(i7.u12.p101==1))||(u14.p119==1))||(u14.p132==1))||(u1.p23==1))||((u0.p17==1)&&(u14.p156==1)))||((u8.p79==1)&&(u14.p156==1)))||(u2.p45==1))||(u8.p76==1))||(u2.p46==1))))) * AG(!(E(((((((i7.u12.p113==1)&&(u14.p136==1))||(u14.p155==1))||(i7.u10.p107==1))||(u14.p153==1))||(u1.p29==1)) U ((((((u8.p81==1)||(i7.u12.p96==1))||((u1.p36==1)&&(u14.p156==1)))||(u1.p24==1))||(u1.p25==1))||(u8.p78==1))))))) + EG(AX(((((((((u0.p16==1)||(u14.p129==1))||(u1.p23==1))||(i3.i1.u6.p75==1))||((u0.p17==1)&&(u14.p156==1)))||(u14.p137==1))||(u0.p11==1))||(i7.u10.p109==1))))))
=> equivalent forward existential formula: ([FwdG((Init * E(TRUE U (((((((((u14.p144==1)||(u2.p50==1))||(i7.u12.p100==1))||(u14.p135==1))||(u0.p5==1))||(u0.p6==1))||(u14.p154==1))||(u2.p57==1))||(u14.p126==1)))),((((E(TRUE U ((u9.p86==1)&&(u14.p156==1))) * E((u1.p32==1) U ((((((((u0.p16==1)||(u14.p154==1))||((u0.p1==1)&&(u14.p156==1)))||(u2.p43==1))||(i7.u12.p91==1))||(u1.p26==1))||(u14.p127==1))||(u14.p124==1)))) * !(EX(!((i7.u12.p101==1))))) + !(EX(!((((((u14.p131==1)||(u14.p119==1))||(u2.p43==1))||((i7.u12.p113==1)&&(u14.p144==1)))&&((((((((((u0.p17==1)||(i7.u12.p101==1))||(u14.p119==1))||(u14.p132==1))||(u1.p23==1))||((u0.p17==1)&&(u14.p156==1)))||((u8.p79==1)&&(u14.p156==1)))||(u2.p45==1))||(u8.p76==1))||(u2.p46==1))))))) * !(E(TRUE U !(!(E(((((((i7.u12.p113==1)&&(u14.p136==1))||(u14.p155==1))||(i7.u10.p107==1))||(u14.p153==1))||(u1.p29==1)) U ((((((u8.p81==1)||(i7.u12.p96==1))||((u1.p36==1)&&(u14.p156==1)))||(u1.p24==1))||(u1.p25==1))||(u8.p78==1)))))))))] != FALSE + [FwdG((Init * E(TRUE U (((((((((u14.p144==1)||(u2.p50==1))||(i7.u12.p100==1))||(u14.p135==1))||(u0.p5==1))||(u0.p6==1))||(u14.p154==1))||(u2.p57==1))||(u14.p126==1)))),!(EX(!(((((((((u0.p16==1)||(u14.p129==1))||(u1.p23==1))||(i3.i1.u6.p75==1))||((u0.p17==1)&&(u14.p156==1)))||(u14.p137==1))||(u0.p11==1))||(i7.u10.p109==1))))))] != FALSE)
(forward)formula 7,0,50.4036,1329644,1,0,2.20348e+06,136538,3284,4.12904e+06,1958,1.22883e+06,1947396
FORMULA HealthRecord-PT-11-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EX((((((((((u1.p36==1)&&(u14.p156==1))||(u14.p144==1))||(u0.p7==1))||(u2.p57==1))||(u1.p27==1))||(u2.p45==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u14.p127==1))) + EX(E(((((((((((((((u2.p50==1)||(u14.p135==1))||(u0.p6==1))||(u14.p132==1))||(u0.p8==1))||(i7.u12.p97==1))||(u1.p36==1))||(u7.p69==1))||(u7.p71==1))||(i7.u12.p103==1))||(u1.p24==1))||(u14.p123==1))||(u1.p30==1))||(u2.p47==1)) U ((((((((i3.i1.u5.p65==0)&&(u2.p51==0))&&(u0.p3==0))&&(u7.p69==0))&&(u0.p8==0))&&(u1.p26==0))&&(u8.p76==0))&&(i7.u11.p111==0)))))) + EG(EX(((u1.p25==1) + ((((((u0.p17==1)||(u0.p6==1))||(u8.p77==1))||(u14.p158==1))&&(((((((u0.p4==1)||(u14.p136==1))||(u8.p77==1))||((i7.u12.p113==1)&&(u14.p144==1)))||(u1.p36==1))||(u0.p8==1))||(u2.p46==1))) * AG((((((((((u14.p131==1)||(i7.u12.p98==1))||(i3.i1.u6.p82==1))||(u7.p69==1))||(u7.p71==1))||(u0.p11==1))||(i7.u12.p90==1))||(u8.p77==1))||((u2.p55==1)&&(u14.p156==1)))))))))
=> equivalent forward existential formula: (([(EY(Init) * ((((((((u1.p36==1)&&(u14.p156==1))||(u14.p144==1))||(u0.p7==1))||(u2.p57==1))||(u1.p27==1))||(u2.p45==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u14.p127==1))))] != FALSE + [(FwdU(EY(EY(Init)),((((((((((((((u2.p50==1)||(u14.p135==1))||(u0.p6==1))||(u14.p132==1))||(u0.p8==1))||(i7.u12.p97==1))||(u1.p36==1))||(u7.p69==1))||(u7.p71==1))||(i7.u12.p103==1))||(u1.p24==1))||(u14.p123==1))||(u1.p30==1))||(u2.p47==1))) * ((((((((i3.i1.u5.p65==0)&&(u2.p51==0))&&(u0.p3==0))&&(u7.p69==0))&&(u0.p8==0))&&(u1.p26==0))&&(u8.p76==0))&&(i7.u11.p111==0)))] != FALSE) + [FwdG(Init,EX(((u1.p25==1) + ((((((u0.p17==1)||(u0.p6==1))||(u8.p77==1))||(u14.p158==1))&&(((((((u0.p4==1)||(u14.p136==1))||(u8.p77==1))||((i7.u12.p113==1)&&(u14.p144==1)))||(u1.p36==1))||(u0.p8==1))||(u2.p46==1))) * !(E(TRUE U !((((((((((u14.p131==1)||(i7.u12.p98==1))||(i3.i1.u6.p82==1))||(u7.p69==1))||(u7.p71==1))||(u0.p11==1))||(i7.u12.p90==1))||(u8.p77==1))||((u2.p55==1)&&(u14.p156==1))))))))))] != FALSE)
(forward)formula 8,1,50.4482,1331492,1,0,2.2069e+06,136589,3380,4.13112e+06,1973,1.23076e+06,1954798
FORMULA HealthRecord-PT-11-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AF(((u14.p153==1) * EF(EX(AF(((u2.p55==1)&&(u14.p156==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(((u14.p153==1) * E(TRUE U EX(!(EG(!(((u2.p55==1)&&(u14.p156==1))))))))))] = FALSE
(forward)formula 9,0,65.765,1783368,1,0,2.846e+06,162073,3413,5.65478e+06,1973,2.54207e+06,2243213
FORMULA HealthRecord-PT-11-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EF(((EX((((((u0.p5==1)||(u7.p70==1))||((u2.p55==1)&&(u14.p156==1)))||(i3.i0.u4.p62==1)) * E((((((u1.p32==1)||(u0.p6==1))||(u1.p38==1))||(u14.p136==1))||(u1.p31==1)) U (((((((((u1.p36==1)&&(u14.p156==1))||((i7.u12.p113==1)&&(u14.p124==1)))||(u2.p51==1))||(u0.p6==1))||((i7.u12.p113==1)&&(u14.p120==1)))||(i3.i1.u6.p75==1))||(u14.p137==1))||(u0.p15==1))))) * AG(((((((u0.p3==1)||(u0.p4==1))||(i7.u12.p101==1))||(u0.p9==1))||(u14.p153==1))||(u14.p127==1)))) * ((((((((((((u0.p8==1)||(u2.p57==1))||(u14.p152==1))||(i7.u12.p91==1))||(u0.p10==1))||(i7.u12.p90==1))||(u14.p158==1))||(u8.p77==1))||((u1.p36==1)&&(u14.p156==1)))&&((i7.u11.p112==1)||(u2.p53==1)))&&((((((((((u0.p16==1)||(u0.p3==1))||(i3.i0.u4.p68==1))||(i3.i1.u6.p116==1))||(u1.p28==1))||(u0.p13==1))||(i7.u12.p94==1))||(((u0.p19==0)&&(u14.p125==0))&&((u1.p36==0)||(u14.p156==0))))||((u1.p36==1)&&(u14.p156==1)))||((i7.u12.p113==1)&&(u14.p153==1)))) + ((AG(((((((i7.u12.p113==1)&&(u14.p126==1))||(u0.p9==1))||(u1.p28==1))&&((((u2.p52==1)||(u0.p7==1))||(u1.p29==1))||(u2.p47==1)))&&((u14.p135==1)||(u8.p77==1)))) * (((((((((u14.p133==1)||(u14.p147==1))||(u0.p4==1))||(u14.p119==1))||(i3.i1.u6.p116==1))||(i7.u12.p102==1))||(u7.p70==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u14.p131==1)))||((u7.p72==1)&&(u14.p156==1)))) * ((EX(((((u1.p36==1)||(u1.p26==1))||(i3.i0.u3.p60==1))||(u14.p127==1))) + AG(((((i7.u12.p97==1)||(u1.p22==1))||(i7.u10.p107==1))||(u14.p137==1)))) + ((u8.p77==1)&&((((u14.p123==1)||(i3.i0.u3.p59==1))||(u0.p11==1))||((i7.u12.p113==1)&&(u14.p153==1)))))))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (EX((((((u0.p5==1)||(u7.p70==1))||((u2.p55==1)&&(u14.p156==1)))||(i3.i0.u4.p62==1)) * E((((((u1.p32==1)||(u0.p6==1))||(u1.p38==1))||(u14.p136==1))||(u1.p31==1)) U (((((((((u1.p36==1)&&(u14.p156==1))||((i7.u12.p113==1)&&(u14.p124==1)))||(u2.p51==1))||(u0.p6==1))||((i7.u12.p113==1)&&(u14.p120==1)))||(i3.i1.u6.p75==1))||(u14.p137==1))||(u0.p15==1))))) * !(E(TRUE U !(((((((u0.p3==1)||(u0.p4==1))||(i7.u12.p101==1))||(u0.p9==1))||(u14.p153==1))||(u14.p127==1))))))) * (((((((((((u0.p8==1)||(u2.p57==1))||(u14.p152==1))||(i7.u12.p91==1))||(u0.p10==1))||(i7.u12.p90==1))||(u14.p158==1))||(u8.p77==1))||((u1.p36==1)&&(u14.p156==1)))&&((i7.u11.p112==1)||(u2.p53==1)))&&((((((((((u0.p16==1)||(u0.p3==1))||(i3.i0.u4.p68==1))||(i3.i1.u6.p116==1))||(u1.p28==1))||(u0.p13==1))||(i7.u12.p94==1))||(((u0.p19==0)&&(u14.p125==0))&&((u1.p36==0)||(u14.p156==0))))||((u1.p36==1)&&(u14.p156==1)))||((i7.u12.p113==1)&&(u14.p153==1)))))] != FALSE + (([(EY(((FwdU(Init,TRUE) * (EX((((((u0.p5==1)||(u7.p70==1))||((u2.p55==1)&&(u14.p156==1)))||(i3.i0.u4.p62==1)) * E((((((u1.p32==1)||(u0.p6==1))||(u1.p38==1))||(u14.p136==1))||(u1.p31==1)) U (((((((((u1.p36==1)&&(u14.p156==1))||((i7.u12.p113==1)&&(u14.p124==1)))||(u2.p51==1))||(u0.p6==1))||((i7.u12.p113==1)&&(u14.p120==1)))||(i3.i1.u6.p75==1))||(u14.p137==1))||(u0.p15==1))))) * !(E(TRUE U !(((((((u0.p3==1)||(u0.p4==1))||(i7.u12.p101==1))||(u0.p9==1))||(u14.p153==1))||(u14.p127==1))))))) * (!(E(TRUE U !(((((((i7.u12.p113==1)&&(u14.p126==1))||(u0.p9==1))||(u1.p28==1))&&((((u2.p52==1)||(u0.p7==1))||(u1.p29==1))||(u2.p47==1)))&&((u14.p135==1)||(u8.p77==1)))))) * (((((((((u14.p133==1)||(u14.p147==1))||(u0.p4==1))||(u14.p119==1))||(i3.i1.u6.p116==1))||(i7.u12.p102==1))||(u7.p70==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u14.p131==1)))||((u7.p72==1)&&(u14.p156==1)))))) * ((((u1.p36==1)||(u1.p26==1))||(i3.i0.u3.p60==1))||(u14.p127==1)))] != FALSE + [(((FwdU(Init,TRUE) * (EX((((((u0.p5==1)||(u7.p70==1))||((u2.p55==1)&&(u14.p156==1)))||(i3.i0.u4.p62==1)) * E((((((u1.p32==1)||(u0.p6==1))||(u1.p38==1))||(u14.p136==1))||(u1.p31==1)) U (((((((((u1.p36==1)&&(u14.p156==1))||((i7.u12.p113==1)&&(u14.p124==1)))||(u2.p51==1))||(u0.p6==1))||((i7.u12.p113==1)&&(u14.p120==1)))||(i3.i1.u6.p75==1))||(u14.p137==1))||(u0.p15==1))))) * !(E(TRUE U !(((((((u0.p3==1)||(u0.p4==1))||(i7.u12.p101==1))||(u0.p9==1))||(u14.p153==1))||(u14.p127==1))))))) * (!(E(TRUE U !(((((((i7.u12.p113==1)&&(u14.p126==1))||(u0.p9==1))||(u1.p28==1))&&((((u2.p52==1)||(u0.p7==1))||(u1.p29==1))||(u2.p47==1)))&&((u14.p135==1)||(u8.p77==1)))))) * (((((((((u14.p133==1)||(u14.p147==1))||(u0.p4==1))||(u14.p119==1))||(i3.i1.u6.p116==1))||(i7.u12.p102==1))||(u7.p70==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u14.p131==1)))||((u7.p72==1)&&(u14.p156==1))))) * !(E(TRUE U !(((((i7.u12.p97==1)||(u1.p22==1))||(i7.u10.p107==1))||(u14.p137==1))))))] != FALSE) + [(((FwdU(Init,TRUE) * (EX((((((u0.p5==1)||(u7.p70==1))||((u2.p55==1)&&(u14.p156==1)))||(i3.i0.u4.p62==1)) * E((((((u1.p32==1)||(u0.p6==1))||(u1.p38==1))||(u14.p136==1))||(u1.p31==1)) U (((((((((u1.p36==1)&&(u14.p156==1))||((i7.u12.p113==1)&&(u14.p124==1)))||(u2.p51==1))||(u0.p6==1))||((i7.u12.p113==1)&&(u14.p120==1)))||(i3.i1.u6.p75==1))||(u14.p137==1))||(u0.p15==1))))) * !(E(TRUE U !(((((((u0.p3==1)||(u0.p4==1))||(i7.u12.p101==1))||(u0.p9==1))||(u14.p153==1))||(u14.p127==1))))))) * (!(E(TRUE U !(((((((i7.u12.p113==1)&&(u14.p126==1))||(u0.p9==1))||(u1.p28==1))&&((((u2.p52==1)||(u0.p7==1))||(u1.p29==1))||(u2.p47==1)))&&((u14.p135==1)||(u8.p77==1)))))) * (((((((((u14.p133==1)||(u14.p147==1))||(u0.p4==1))||(u14.p119==1))||(i3.i1.u6.p116==1))||(i7.u12.p102==1))||(u7.p70==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u14.p131==1)))||((u7.p72==1)&&(u14.p156==1))))) * ((u8.p77==1)&&((((u14.p123==1)||(i3.i0.u3.p59==1))||(u0.p11==1))||((i7.u12.p113==1)&&(u14.p153==1)))))] != FALSE))
(forward)formula 10,0,66.3896,1802904,1,0,2.87706e+06,165588,3561,5.71248e+06,1990,2.56835e+06,2278610
FORMULA HealthRecord-PT-11-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (AF(((((((((u9.p86==1)&&(u14.p156==1))||((((((((((u0.p18==1)&&(u1.p37==1))&&(u2.p56==1))&&(i3.i0.u4.p61==1))&&(i3.i1.u6.p66==1))&&(u7.p73==1))&&(u8.p80==1))&&(u9.p87==1))&&(i7.u12.p114==1))&&(u14.p151==1)))||(u0.p19==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u14.p139==1)))||(u9.p88==1))||(i7.u12.p91==1))||(u14.p141==1))) + (!(AF((((((((u0.p17==1)||(u9.p83==1))||(u2.p55==1))||(i7.u12.p104==1))||(u2.p45==1))||((((u0.p17==1)||(u0.p19==1))||((u0.p17==1)&&(u14.p156==1)))&&((u14.p145==1)||(u8.p77==1)))) + AF(((((((u14.p138==1)||((u7.p72==1)&&(u14.p156==1)))||(i7.u12.p91==1))||((u8.p79==1)&&(u14.p156==1)))||(u2.p42==1))||(i3.i0.u4.p62==1)))))) * AF((!(A((((((((i3.i1.u5.p65==1)||(i7.u10.p109==1))||(u1.p22==1))||(u2.p57==1))||(u0.p10==1))||(i7.u12.p90==1))||(i3.i0.u4.p62==1)) U AX(((((((u14.p146==1)||((i7.u12.p113==1)&&(u14.p124==1)))||(i7.u11.p112==1))||(i7.u12.p98==1))||(u9.p85==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u14.p127==1)))))) + (((u1.p36==0)&&(u0.p6==0))&&(u0.p13==0))))))
=> equivalent forward existential formula: ([((Init * !(!(EG(!(((((((((u9.p86==1)&&(u14.p156==1))||((((((((((u0.p18==1)&&(u1.p37==1))&&(u2.p56==1))&&(i3.i0.u4.p61==1))&&(i3.i1.u6.p66==1))&&(u7.p73==1))&&(u8.p80==1))&&(u9.p87==1))&&(i7.u12.p114==1))&&(u14.p151==1)))||(u0.p19==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u14.p139==1)))||(u9.p88==1))||(i7.u12.p91==1))||(u14.p141==1))))))) * !(EG(!((((((((u0.p17==1)||(u9.p83==1))||(u2.p55==1))||(i7.u12.p104==1))||(u2.p45==1))||((((u0.p17==1)||(u0.p19==1))||((u0.p17==1)&&(u14.p156==1)))&&((u14.p145==1)||(u8.p77==1)))) + !(EG(!(((((((u14.p138==1)||((u7.p72==1)&&(u14.p156==1)))||(i7.u12.p91==1))||((u8.p79==1)&&(u14.p156==1)))||(u2.p42==1))||(i3.i0.u4.p62==1))))))))))] = FALSE * [FwdG((Init * !(!(EG(!(((((((((u9.p86==1)&&(u14.p156==1))||((((((((((u0.p18==1)&&(u1.p37==1))&&(u2.p56==1))&&(i3.i0.u4.p61==1))&&(i3.i1.u6.p66==1))&&(u7.p73==1))&&(u8.p80==1))&&(u9.p87==1))&&(i7.u12.p114==1))&&(u14.p151==1)))||(u0.p19==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u14.p139==1)))||(u9.p88==1))||(i7.u12.p91==1))||(u14.p141==1))))))),!((!(!((E(!(!(EX(!(((((((u14.p146==1)||((i7.u12.p113==1)&&(u14.p124==1)))||(i7.u11.p112==1))||(i7.u12.p98==1))||(u9.p85==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u14.p127==1))))))) U (!((((((((i3.i1.u5.p65==1)||(i7.u10.p109==1))||(u1.p22==1))||(u2.p57==1))||(u0.p10==1))||(i7.u12.p90==1))||(i3.i0.u4.p62==1))) * !(!(EX(!(((((((u14.p146==1)||((i7.u12.p113==1)&&(u14.p124==1)))||(i7.u11.p112==1))||(i7.u12.p98==1))||(u9.p85==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u14.p127==1))))))))) + EG(!(!(EX(!(((((((u14.p146==1)||((i7.u12.p113==1)&&(u14.p124==1)))||(i7.u11.p112==1))||(i7.u12.p98==1))||(u9.p85==1))||((((u0.p17==1)&&(u1.p36==1))&&(u2.p55==1))&&(u14.p127==1))))))))))) + (((u1.p36==0)&&(u0.p6==0))&&(u0.p13==0)))))] = 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 8
Fast SCC detection found an SCC at level 9
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 8
Fast SCC detection found an SCC at level 9
(forward)formula 11,1,79.3816,2125516,1,0,3.46869e+06,172146,3681,6.62054e+06,1993,2.6298e+06,2695140
FORMULA HealthRecord-PT-11-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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


BK_STOP 1621281947250

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

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