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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 14K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 127K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.2K May 11 18:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 11 18:41 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 84K 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-16-CTLFireability-00
FORMULA_NAME HealthRecord-PT-16-CTLFireability-01
FORMULA_NAME HealthRecord-PT-16-CTLFireability-02
FORMULA_NAME HealthRecord-PT-16-CTLFireability-03
FORMULA_NAME HealthRecord-PT-16-CTLFireability-04
FORMULA_NAME HealthRecord-PT-16-CTLFireability-05
FORMULA_NAME HealthRecord-PT-16-CTLFireability-06
FORMULA_NAME HealthRecord-PT-16-CTLFireability-07
FORMULA_NAME HealthRecord-PT-16-CTLFireability-08
FORMULA_NAME HealthRecord-PT-16-CTLFireability-09
FORMULA_NAME HealthRecord-PT-16-CTLFireability-10
FORMULA_NAME HealthRecord-PT-16-CTLFireability-11
FORMULA_NAME HealthRecord-PT-16-CTLFireability-12
FORMULA_NAME HealthRecord-PT-16-CTLFireability-13
FORMULA_NAME HealthRecord-PT-16-CTLFireability-14
FORMULA_NAME HealthRecord-PT-16-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1621283421152

Running Version 0
[2021-05-17 20:30:22] [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:30:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 20:30:22] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2021-05-17 20:30:22] [INFO ] Transformed 453 places.
[2021-05-17 20:30:22] [INFO ] Transformed 594 transitions.
[2021-05-17 20:30:22] [INFO ] Found NUPN structural information;
[2021-05-17 20:30:22] [INFO ] Parsed PT model containing 453 places and 594 transitions in 100 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
[2021-05-17 20:30:22] [INFO ] Reduced 1 identical enabling conditions.
Support contains 232 out of 453 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 453/453 places, 594/594 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 417 transition count 557
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 417 transition count 557
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 85 place count 404 transition count 544
Iterating global reduction 0 with 13 rules applied. Total rules applied 98 place count 404 transition count 544
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 100 place count 404 transition count 542
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 104 place count 400 transition count 534
Iterating global reduction 1 with 4 rules applied. Total rules applied 108 place count 400 transition count 534
Applied a total of 108 rules in 69 ms. Remains 400 /453 variables (removed 53) and now considering 534/594 (removed 60) transitions.
// Phase 1: matrix 534 rows 400 cols
[2021-05-17 20:30:22] [INFO ] Computed 14 place invariants in 19 ms
[2021-05-17 20:30:23] [INFO ] Implicit Places using invariants in 199 ms returned []
// Phase 1: matrix 534 rows 400 cols
[2021-05-17 20:30:23] [INFO ] Computed 14 place invariants in 9 ms
[2021-05-17 20:30:23] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
// Phase 1: matrix 534 rows 400 cols
[2021-05-17 20:30:23] [INFO ] Computed 14 place invariants in 19 ms
[2021-05-17 20:30:23] [INFO ] Dead Transitions using invariants and state equation in 278 ms returned []
Finished structural reductions, in 1 iterations. Remains : 400/453 places, 534/594 transitions.
[2021-05-17 20:30:23] [INFO ] Flatten gal took : 73 ms
[2021-05-17 20:30:23] [INFO ] Flatten gal took : 29 ms
[2021-05-17 20:30:24] [INFO ] Input system was already deterministic with 534 transitions.
Incomplete random walk after 100000 steps, including 8 resets, run finished after 498 ms. (steps per millisecond=200 ) properties (out of 44) seen :34
Running SMT prover for 10 properties.
// Phase 1: matrix 534 rows 400 cols
[2021-05-17 20:30:24] [INFO ] Computed 14 place invariants in 6 ms
[2021-05-17 20:30:24] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-17 20:30:24] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-17 20:30:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:24] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2021-05-17 20:30:25] [INFO ] Deduced a trap composed of 107 places in 134 ms of which 5 ms to minimize.
[2021-05-17 20:30:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2021-05-17 20:30:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:30:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-17 20:30:25] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-17 20:30:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:25] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2021-05-17 20:30:25] [INFO ] Deduced a trap composed of 107 places in 96 ms of which 2 ms to minimize.
[2021-05-17 20:30:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2021-05-17 20:30:25] [INFO ] Computed and/alt/rep : 493/645/493 causal constraints (skipped 40 transitions) in 45 ms.
[2021-05-17 20:30:27] [INFO ] Added : 329 causal constraints over 67 iterations in 1872 ms. Result :sat
[2021-05-17 20:30:27] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-17 20:30:27] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-17 20:30:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:27] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2021-05-17 20:30:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:30:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-17 20:30:27] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-17 20:30:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:27] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2021-05-17 20:30:27] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 1 ms to minimize.
[2021-05-17 20:30:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2021-05-17 20:30:27] [INFO ] Computed and/alt/rep : 493/645/493 causal constraints (skipped 40 transitions) in 32 ms.
[2021-05-17 20:30:29] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 2 ms to minimize.
[2021-05-17 20:30:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2021-05-17 20:30:29] [INFO ] Added : 322 causal constraints over 66 iterations in 1808 ms. Result :sat
[2021-05-17 20:30:29] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-17 20:30:29] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-17 20:30:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:29] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2021-05-17 20:30:29] [INFO ] Computed and/alt/rep : 493/645/493 causal constraints (skipped 40 transitions) in 28 ms.
[2021-05-17 20:30:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:30:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-17 20:30:30] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-17 20:30:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:30] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2021-05-17 20:30:30] [INFO ] Computed and/alt/rep : 493/645/493 causal constraints (skipped 40 transitions) in 32 ms.
[2021-05-17 20:30:32] [INFO ] Added : 324 causal constraints over 65 iterations in 1709 ms. Result :sat
[2021-05-17 20:30:32] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-17 20:30:32] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-17 20:30:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:32] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2021-05-17 20:30:32] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 1 ms to minimize.
[2021-05-17 20:30:32] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 0 ms to minimize.
[2021-05-17 20:30:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 270 ms
[2021-05-17 20:30:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:30:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-17 20:30:32] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-17 20:30:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:32] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2021-05-17 20:30:32] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 1 ms to minimize.
[2021-05-17 20:30:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2021-05-17 20:30:32] [INFO ] Computed and/alt/rep : 493/645/493 causal constraints (skipped 40 transitions) in 26 ms.
[2021-05-17 20:30:34] [INFO ] Added : 326 causal constraints over 66 iterations in 1638 ms. Result :sat
[2021-05-17 20:30:34] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-17 20:30:34] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 20:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:34] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2021-05-17 20:30:34] [INFO ] Deduced a trap composed of 97 places in 83 ms of which 1 ms to minimize.
[2021-05-17 20:30:34] [INFO ] Deduced a trap composed of 97 places in 81 ms of which 0 ms to minimize.
[2021-05-17 20:30:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 208 ms
[2021-05-17 20:30:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:30:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-17 20:30:35] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-17 20:30:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:35] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2021-05-17 20:30:35] [INFO ] Deduced a trap composed of 97 places in 80 ms of which 0 ms to minimize.
[2021-05-17 20:30:35] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 0 ms to minimize.
[2021-05-17 20:30:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 204 ms
[2021-05-17 20:30:35] [INFO ] Computed and/alt/rep : 493/645/493 causal constraints (skipped 40 transitions) in 26 ms.
[2021-05-17 20:30:37] [INFO ] Added : 326 causal constraints over 66 iterations in 1649 ms. Result :sat
[2021-05-17 20:30:37] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-17 20:30:37] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-17 20:30:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:37] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2021-05-17 20:30:37] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 0 ms to minimize.
[2021-05-17 20:30:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2021-05-17 20:30:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:30:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-17 20:30:37] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-17 20:30:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:37] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2021-05-17 20:30:37] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 0 ms to minimize.
[2021-05-17 20:30:37] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 0 ms to minimize.
[2021-05-17 20:30:37] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 0 ms to minimize.
[2021-05-17 20:30:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 309 ms
[2021-05-17 20:30:37] [INFO ] Computed and/alt/rep : 493/645/493 causal constraints (skipped 40 transitions) in 20 ms.
[2021-05-17 20:30:39] [INFO ] Added : 318 causal constraints over 64 iterations in 1711 ms. Result :sat
[2021-05-17 20:30:39] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-17 20:30:39] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-17 20:30:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:39] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2021-05-17 20:30:39] [INFO ] Deduced a trap composed of 104 places in 84 ms of which 0 ms to minimize.
[2021-05-17 20:30:39] [INFO ] Deduced a trap composed of 85 places in 69 ms of which 0 ms to minimize.
[2021-05-17 20:30:40] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 0 ms to minimize.
[2021-05-17 20:30:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 287 ms
[2021-05-17 20:30:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:30:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-17 20:30:40] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-17 20:30:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:40] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2021-05-17 20:30:40] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 0 ms to minimize.
[2021-05-17 20:30:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2021-05-17 20:30:40] [INFO ] Computed and/alt/rep : 493/645/493 causal constraints (skipped 40 transitions) in 26 ms.
[2021-05-17 20:30:42] [INFO ] Added : 343 causal constraints over 69 iterations in 1762 ms. Result :sat
[2021-05-17 20:30:42] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2021-05-17 20:30:42] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-17 20:30:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:42] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2021-05-17 20:30:42] [INFO ] Deduced a trap composed of 93 places in 78 ms of which 1 ms to minimize.
[2021-05-17 20:30:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2021-05-17 20:30:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:30:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-17 20:30:42] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-17 20:30:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:42] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2021-05-17 20:30:42] [INFO ] Computed and/alt/rep : 493/645/493 causal constraints (skipped 40 transitions) in 21 ms.
[2021-05-17 20:30:44] [INFO ] Deduced a trap composed of 92 places in 58 ms of which 0 ms to minimize.
[2021-05-17 20:30:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2021-05-17 20:30:44] [INFO ] Added : 337 causal constraints over 69 iterations in 1906 ms. Result :sat
[2021-05-17 20:30:44] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-17 20:30:44] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 20:30:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:44] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2021-05-17 20:30:44] [INFO ] Computed and/alt/rep : 493/645/493 causal constraints (skipped 40 transitions) in 25 ms.
[2021-05-17 20:30:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:30:44] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-17 20:30:44] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 20:30:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:45] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2021-05-17 20:30:45] [INFO ] Computed and/alt/rep : 493/645/493 causal constraints (skipped 40 transitions) in 28 ms.
[2021-05-17 20:30:46] [INFO ] Added : 338 causal constraints over 68 iterations in 1693 ms. Result :sat
[2021-05-17 20:30:46] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-17 20:30:46] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-17 20:30:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:46] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2021-05-17 20:30:46] [INFO ] Computed and/alt/rep : 493/645/493 causal constraints (skipped 40 transitions) in 27 ms.
[2021-05-17 20:30:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:30:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2021-05-17 20:30:47] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 5 ms returned sat
[2021-05-17 20:30:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:47] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2021-05-17 20:30:47] [INFO ] Computed and/alt/rep : 493/645/493 causal constraints (skipped 40 transitions) in 27 ms.
[2021-05-17 20:30:48] [INFO ] Added : 333 causal constraints over 67 iterations in 1699 ms. Result :sat
Graph (trivial) has 444 edges and 400 vertex of which 48 / 400 are part of one of the 17 SCC in 3 ms
Free SCC test removed 31 places
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 150 place count 368 transition count 350
Reduce places removed 149 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 162 rules applied. Total rules applied 312 place count 219 transition count 337
Reduce places removed 5 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 13 rules applied. Total rules applied 325 place count 214 transition count 329
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 10 rules applied. Total rules applied 335 place count 206 transition count 327
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 336 place count 205 transition count 327
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 336 place count 205 transition count 318
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 354 place count 196 transition count 318
Discarding 46 places :
Symmetric choice reduction at 5 with 46 rule applications. Total rules 400 place count 150 transition count 230
Iterating global reduction 5 with 46 rules applied. Total rules applied 446 place count 150 transition count 230
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 3 rules applied. Total rules applied 449 place count 150 transition count 227
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 452 place count 147 transition count 227
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 465 place count 134 transition count 205
Iterating global reduction 7 with 13 rules applied. Total rules applied 478 place count 134 transition count 205
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 479 place count 134 transition count 204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 480 place count 133 transition count 204
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 483 place count 130 transition count 199
Iterating global reduction 9 with 3 rules applied. Total rules applied 486 place count 130 transition count 199
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 487 place count 129 transition count 197
Iterating global reduction 9 with 1 rules applied. Total rules applied 488 place count 129 transition count 197
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 489 place count 128 transition count 196
Iterating global reduction 9 with 1 rules applied. Total rules applied 490 place count 128 transition count 196
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 491 place count 127 transition count 194
Iterating global reduction 9 with 1 rules applied. Total rules applied 492 place count 127 transition count 194
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 493 place count 126 transition count 192
Iterating global reduction 9 with 1 rules applied. Total rules applied 494 place count 126 transition count 192
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 9 with 58 rules applied. Total rules applied 552 place count 97 transition count 163
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 554 place count 97 transition count 161
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 555 place count 96 transition count 159
Iterating global reduction 10 with 1 rules applied. Total rules applied 556 place count 96 transition count 159
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 557 place count 95 transition count 158
Iterating global reduction 10 with 1 rules applied. Total rules applied 558 place count 95 transition count 158
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 10 with 22 rules applied. Total rules applied 580 place count 84 transition count 207
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 583 place count 81 transition count 198
Iterating global reduction 10 with 3 rules applied. Total rules applied 586 place count 81 transition count 198
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 588 place count 79 transition count 194
Iterating global reduction 10 with 2 rules applied. Total rules applied 590 place count 79 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 591 place count 79 transition count 193
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 592 place count 78 transition count 189
Iterating global reduction 11 with 1 rules applied. Total rules applied 593 place count 78 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 595 place count 78 transition count 187
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 12 with 13 rules applied. Total rules applied 608 place count 78 transition count 174
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 610 place count 77 transition count 185
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 611 place count 77 transition count 185
Applied a total of 611 rules in 105 ms. Remains 77 /400 variables (removed 323) and now considering 185/534 (removed 349) transitions.
[2021-05-17 20:30:49] [INFO ] Flatten gal took : 9 ms
[2021-05-17 20:30:49] [INFO ] Flatten gal took : 11 ms
[2021-05-17 20:30:49] [INFO ] Input system was already deterministic with 185 transitions.
[2021-05-17 20:30:49] [INFO ] Flatten gal took : 10 ms
[2021-05-17 20:30:49] [INFO ] Flatten gal took : 11 ms
[2021-05-17 20:30:49] [INFO ] Time to serialize gal into /tmp/CTLFireability4602265625648067159.gal : 5 ms
[2021-05-17 20:30:49] [INFO ] Time to serialize properties into /tmp/CTLFireability13150258678058104457.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/CTLFireability4602265625648067159.gal, -t, CGAL, -ctl, /tmp/CTLFireability13150258678058104457.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/CTLFireability4602265625648067159.gal -t CGAL -ctl /tmp/CTLFireability13150258678058104457.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.17098e+07,0.532267,22352,2,2213,5,79170,6,0,484,76909,0


Converting to forward existential form...Done !
original formula: AG(((((((((AF((((((((p247==1)||(p240==1))||(p170==1))||(p316==1))||(p233==1))||(p427==1))||(p30==1))) + (p247==1)) + (p421==1)) + (p119==1)) + (p181==1)) + (p171==1)) + (p380==1)) + (p189==1)) + (p267==1)))
=> equivalent forward existential formula: [FwdG(((((((((FwdU(Init,TRUE) * !((p267==1))) * !((p189==1))) * !((p380==1))) * !((p171==1))) * !((p181==1))) * !((p119==1))) * !((p421==1))) * !((p247==1))),!((((((((p247==1)||(p240==1))||(p170==1))||(p316==1))||(p233==1))||(p427==1))||(p30==1))))] = FALSE
Hit Full ! (commute/partial/dont) 149/216/36
(forward)formula 0,0,1.2363,34320,1,0,36,148564,36,20,2795,132252,17
FORMULA HealthRecord-PT-16-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Graph (trivial) has 424 edges and 400 vertex of which 42 / 400 are part of one of the 16 SCC in 1 ms
Free SCC test removed 26 places
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 146 rules applied. Total rules applied 147 place count 373 transition count 359
Reduce places removed 146 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 159 rules applied. Total rules applied 306 place count 227 transition count 346
Reduce places removed 5 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 2 with 17 rules applied. Total rules applied 323 place count 222 transition count 334
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 16 rules applied. Total rules applied 339 place count 210 transition count 330
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 341 place count 208 transition count 330
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 341 place count 208 transition count 322
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 357 place count 200 transition count 322
Discarding 42 places :
Symmetric choice reduction at 5 with 42 rule applications. Total rules 399 place count 158 transition count 244
Iterating global reduction 5 with 42 rules applied. Total rules applied 441 place count 158 transition count 244
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 442 place count 158 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 443 place count 157 transition count 243
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 451 place count 149 transition count 231
Iterating global reduction 7 with 8 rules applied. Total rules applied 459 place count 149 transition count 231
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 7 with 62 rules applied. Total rules applied 521 place count 118 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 523 place count 118 transition count 198
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 527 place count 114 transition count 190
Iterating global reduction 8 with 4 rules applied. Total rules applied 531 place count 114 transition count 190
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 533 place count 112 transition count 186
Iterating global reduction 8 with 2 rules applied. Total rules applied 535 place count 112 transition count 186
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 537 place count 110 transition count 184
Iterating global reduction 8 with 2 rules applied. Total rules applied 539 place count 110 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 540 place count 110 transition count 183
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 560 place count 100 transition count 231
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 568 place count 100 transition count 223
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 570 place count 99 transition count 235
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 574 place count 99 transition count 235
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 575 place count 98 transition count 234
Iterating global reduction 9 with 1 rules applied. Total rules applied 576 place count 98 transition count 234
Applied a total of 576 rules in 63 ms. Remains 98 /400 variables (removed 302) and now considering 234/534 (removed 300) transitions.
[2021-05-17 20:30:50] [INFO ] Flatten gal took : 11 ms
[2021-05-17 20:30:50] [INFO ] Flatten gal took : 12 ms
[2021-05-17 20:30:50] [INFO ] Input system was already deterministic with 234 transitions.
[2021-05-17 20:30:50] [INFO ] Flatten gal took : 11 ms
[2021-05-17 20:30:50] [INFO ] Flatten gal took : 11 ms
[2021-05-17 20:30:50] [INFO ] Time to serialize gal into /tmp/CTLFireability1084480528665928409.gal : 2 ms
[2021-05-17 20:30:50] [INFO ] Time to serialize properties into /tmp/CTLFireability3951820929225468866.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/CTLFireability1084480528665928409.gal, -t, CGAL, -ctl, /tmp/CTLFireability3951820929225468866.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/CTLFireability1084480528665928409.gal -t CGAL -ctl /tmp/CTLFireability3951820929225468866.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,5.73494e+07,1.46693,45104,2,6163,5,171272,6,0,618,167540,0


Converting to forward existential form...Done !
original formula: EF((!(AG((AF((((((((((p438==1)||(p211==1))||(p404==1))||(p338==1))||(p56==1))||(p399==1))||(p350==1))||(p29==1))||(p157==1))) * ((((((p181==1)||(p219==1))||(p187==1))||(p155==1))||(p271==1))||(p47==1))))) * ((((((((p373==1)||(p324==1))||(p128==1))||(p119==1))||(p73==1))||(p380==1))||(p377==1))||(p267==1))))
=> equivalent forward existential formula: ([FwdG(FwdU((FwdU(Init,TRUE) * ((((((((p373==1)||(p324==1))||(p128==1))||(p119==1))||(p73==1))||(p380==1))||(p377==1))||(p267==1))),TRUE),!((((((((((p438==1)||(p211==1))||(p404==1))||(p338==1))||(p56==1))||(p399==1))||(p350==1))||(p29==1))||(p157==1))))] != FALSE + [(FwdU((FwdU(Init,TRUE) * ((((((((p373==1)||(p324==1))||(p128==1))||(p119==1))||(p73==1))||(p380==1))||(p377==1))||(p267==1))),TRUE) * !(((((((p181==1)||(p219==1))||(p187==1))||(p155==1))||(p271==1))||(p47==1))))] != FALSE)
Hit Full ! (commute/partial/dont) 193/328/41
(forward)formula 0,1,4.70785,103156,1,0,31,474557,22,5,3645,331510,29
FORMULA HealthRecord-PT-16-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Graph (trivial) has 454 edges and 400 vertex of which 46 / 400 are part of one of the 16 SCC in 1 ms
Free SCC test removed 30 places
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 152 transitions
Trivial Post-agglo rules discarded 152 transitions
Performed 152 trivial Post agglomeration. Transition count delta: 152
Iterating post reduction 0 with 152 rules applied. Total rules applied 153 place count 369 transition count 348
Reduce places removed 152 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 168 rules applied. Total rules applied 321 place count 217 transition count 332
Reduce places removed 7 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 10 rules applied. Total rules applied 331 place count 210 transition count 329
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 334 place count 207 transition count 329
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 334 place count 207 transition count 320
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 352 place count 198 transition count 320
Discarding 53 places :
Symmetric choice reduction at 4 with 53 rule applications. Total rules 405 place count 145 transition count 226
Iterating global reduction 4 with 53 rules applied. Total rules applied 458 place count 145 transition count 226
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 460 place count 145 transition count 224
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 462 place count 143 transition count 224
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 478 place count 127 transition count 195
Iterating global reduction 6 with 16 rules applied. Total rules applied 494 place count 127 transition count 195
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 495 place count 127 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 496 place count 126 transition count 194
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 504 place count 118 transition count 179
Iterating global reduction 8 with 8 rules applied. Total rules applied 512 place count 118 transition count 179
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 517 place count 113 transition count 173
Iterating global reduction 8 with 5 rules applied. Total rules applied 522 place count 113 transition count 173
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 524 place count 113 transition count 171
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 526 place count 111 transition count 168
Iterating global reduction 9 with 2 rules applied. Total rules applied 528 place count 111 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 529 place count 111 transition count 167
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 530 place count 110 transition count 165
Iterating global reduction 10 with 1 rules applied. Total rules applied 531 place count 110 transition count 165
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 532 place count 109 transition count 163
Iterating global reduction 10 with 1 rules applied. Total rules applied 533 place count 109 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 534 place count 109 transition count 162
Performed 35 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 11 with 70 rules applied. Total rules applied 604 place count 74 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 605 place count 74 transition count 125
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 606 place count 73 transition count 123
Iterating global reduction 12 with 1 rules applied. Total rules applied 607 place count 73 transition count 123
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 608 place count 72 transition count 122
Iterating global reduction 12 with 1 rules applied. Total rules applied 609 place count 72 transition count 122
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 610 place count 71 transition count 118
Iterating global reduction 12 with 1 rules applied. Total rules applied 611 place count 71 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 612 place count 71 transition count 117
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 13 with 12 rules applied. Total rules applied 624 place count 65 transition count 167
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 625 place count 64 transition count 165
Iterating global reduction 13 with 1 rules applied. Total rules applied 626 place count 64 transition count 165
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 13 with 13 rules applied. Total rules applied 639 place count 64 transition count 152
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 13 with 4 rules applied. Total rules applied 643 place count 64 transition count 152
Applied a total of 643 rules in 49 ms. Remains 64 /400 variables (removed 336) and now considering 152/534 (removed 382) transitions.
[2021-05-17 20:30:55] [INFO ] Flatten gal took : 7 ms
[2021-05-17 20:30:55] [INFO ] Flatten gal took : 7 ms
[2021-05-17 20:30:55] [INFO ] Input system was already deterministic with 152 transitions.
[2021-05-17 20:30:55] [INFO ] Flatten gal took : 8 ms
[2021-05-17 20:30:55] [INFO ] Flatten gal took : 7 ms
[2021-05-17 20:30:55] [INFO ] Time to serialize gal into /tmp/CTLFireability16273649680988054801.gal : 2 ms
[2021-05-17 20:30:55] [INFO ] Time to serialize properties into /tmp/CTLFireability4183173279719147604.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/CTLFireability16273649680988054801.gal, -t, CGAL, -ctl, /tmp/CTLFireability4183173279719147604.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/CTLFireability16273649680988054801.gal -t CGAL -ctl /tmp/CTLFireability4183173279719147604.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,3.15793e+06,0.09741,7916,2,2353,5,14820,6,0,399,9107,0


Converting to forward existential form...Done !
original formula: !(EF(((((((p226==1)||(p66==1))||(p405==1))||(p352==1))||((p196==1)&&(p446==1)))||(p249==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * ((((((p226==1)||(p66==1))||(p405==1))||(p352==1))||((p196==1)&&(p446==1)))||(p249==1)))] = FALSE
(forward)formula 0,0,0.101056,8360,1,0,7,14820,8,1,420,9107,1
FORMULA HealthRecord-PT-16-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Graph (trivial) has 393 edges and 400 vertex of which 36 / 400 are part of one of the 15 SCC in 1 ms
Free SCC test removed 21 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 132 place count 378 transition count 380
Reduce places removed 131 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 145 rules applied. Total rules applied 277 place count 247 transition count 366
Reduce places removed 6 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 2 with 24 rules applied. Total rules applied 301 place count 241 transition count 348
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 21 rules applied. Total rules applied 322 place count 223 transition count 345
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 323 place count 222 transition count 345
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 323 place count 222 transition count 337
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 339 place count 214 transition count 337
Discarding 41 places :
Symmetric choice reduction at 5 with 41 rule applications. Total rules 380 place count 173 transition count 263
Iterating global reduction 5 with 41 rules applied. Total rules applied 421 place count 173 transition count 263
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 422 place count 173 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 423 place count 172 transition count 262
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 433 place count 162 transition count 246
Iterating global reduction 7 with 10 rules applied. Total rules applied 443 place count 162 transition count 246
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 445 place count 160 transition count 242
Iterating global reduction 7 with 2 rules applied. Total rules applied 447 place count 160 transition count 242
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 7 with 62 rules applied. Total rules applied 509 place count 129 transition count 211
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 511 place count 129 transition count 209
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 513 place count 127 transition count 205
Iterating global reduction 8 with 2 rules applied. Total rules applied 515 place count 127 transition count 205
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 516 place count 126 transition count 203
Iterating global reduction 8 with 1 rules applied. Total rules applied 517 place count 126 transition count 203
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 518 place count 125 transition count 202
Iterating global reduction 8 with 1 rules applied. Total rules applied 519 place count 125 transition count 202
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 20 rules applied. Total rules applied 539 place count 115 transition count 235
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 541 place count 113 transition count 230
Iterating global reduction 8 with 2 rules applied. Total rules applied 543 place count 113 transition count 230
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 544 place count 112 transition count 228
Iterating global reduction 8 with 1 rules applied. Total rules applied 545 place count 112 transition count 228
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 546 place count 112 transition count 227
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 548 place count 112 transition count 227
Applied a total of 548 rules in 47 ms. Remains 112 /400 variables (removed 288) and now considering 227/534 (removed 307) transitions.
[2021-05-17 20:30:55] [INFO ] Flatten gal took : 9 ms
[2021-05-17 20:30:55] [INFO ] Flatten gal took : 10 ms
[2021-05-17 20:30:55] [INFO ] Input system was already deterministic with 227 transitions.
[2021-05-17 20:30:55] [INFO ] Flatten gal took : 9 ms
[2021-05-17 20:30:55] [INFO ] Flatten gal took : 9 ms
[2021-05-17 20:30:55] [INFO ] Time to serialize gal into /tmp/CTLFireability11614833992739230208.gal : 2 ms
[2021-05-17 20:30:55] [INFO ] Time to serialize properties into /tmp/CTLFireability3619504561072924786.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/CTLFireability11614833992739230208.gal, -t, CGAL, -ctl, /tmp/CTLFireability3619504561072924786.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/CTLFireability11614833992739230208.gal -t CGAL -ctl /tmp/CTLFireability3619504561072924786.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.54569e+08,3.08825,77892,2,7690,5,216788,6,0,668,373957,0


Converting to forward existential form...Done !
original formula: (!(A(EF(AG((((((((((p67==1)||(p267==1))||(p211==1))||(p326==1))||(p387==1))||(p52==1))||(p55==1))||(p24==1))||(p360==1)))) U AF((((((((((((p32==1)||(p130==1))||(p51==1))||(p272==1))||(p151==1))||(p70==1))||(p431==1))||(p364==1))||(p191==1))||(p344==1))&&((((p244==1)||(p163==1))||(p416==1))||(p71==1)))))) + !(AF(((((((((((p373==1)||(p17==1))||((p334==1)&&(p445==1)))||(p385==1))||(p433==1))||(p243==1))||(p41==1))||(p349==1))||(p238==1))||(p15==1)))))
=> equivalent forward existential formula: (([FwdG((FwdU(Init,!(!(EG(!((((((((((((p32==1)||(p130==1))||(p51==1))||(p272==1))||(p151==1))||(p70==1))||(p431==1))||(p364==1))||(p191==1))||(p344==1))&&((((p244==1)||(p163==1))||(p416==1))||(p71==1)))))))) * !(E(TRUE U !(E(TRUE U !((((((((((p67==1)||(p267==1))||(p211==1))||(p326==1))||(p387==1))||(p52==1))||(p55==1))||(p24==1))||(p360==1)))))))),!((((((((((((p32==1)||(p130==1))||(p51==1))||(p272==1))||(p151==1))||(p70==1))||(p431==1))||(p364==1))||(p191==1))||(p344==1))&&((((p244==1)||(p163==1))||(p416==1))||(p71==1)))))] != FALSE + [FwdG(Init,!(!(EG(!((((((((((((p32==1)||(p130==1))||(p51==1))||(p272==1))||(p151==1))||(p70==1))||(p431==1))||(p364==1))||(p191==1))||(p344==1))&&((((p244==1)||(p163==1))||(p416==1))||(p71==1))))))))] != FALSE) + [FwdG(Init,!(((((((((((p373==1)||(p17==1))||((p334==1)&&(p445==1)))||(p385==1))||(p433==1))||(p243==1))||(p41==1))||(p349==1))||(p238==1))||(p15==1))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t6, t7, t8, t9, t10, t11, t13, t15, t17, t18, t21, t22, t24, t26, t28, t33, t36, t37, t38, t42, t47, t48, t52, t53, t55, t57, t58, t59, t62, t64, t65, t69, t70, t93, t97, t104, t105, t106, t107, t108, t111, t112, t118, t120, t128, t129, t130, t132, t133, t135, t136, t138, t140, t141, t143, t149, t150, t153, t154, t157, t158, t159, t161, t163, t164, t165, t166, t167, t168, t169, t170, t171, t172, t173, t174, t175, t176, t177, t178, t179, t180, t181, t182, t183, t185, t187, t189, t191, t192, t193, t194, t195, t196, t197, t198, t201, t202, t203, t204, t205, t207, t209, t211, t213, t215, t217, t219, t221, t223, t225, t226, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/112/115/227
Detected timeout of ITS tools.
[2021-05-17 20:31:25] [INFO ] Flatten gal took : 15 ms
[2021-05-17 20:31:25] [INFO ] Applying decomposition
[2021-05-17 20:31:25] [INFO ] Flatten gal took : 8 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/graph10674530110054051393.txt, -o, /tmp/graph10674530110054051393.bin, -w, /tmp/graph10674530110054051393.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/graph10674530110054051393.bin, -l, -1, -v, -w, /tmp/graph10674530110054051393.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:31:25] [INFO ] Decomposing Gal with order
[2021-05-17 20:31:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:31:25] [INFO ] Removed a total of 186 redundant transitions.
[2021-05-17 20:31:25] [INFO ] Flatten gal took : 44 ms
[2021-05-17 20:31:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 9 ms.
[2021-05-17 20:31:25] [INFO ] Time to serialize gal into /tmp/CTLFireability8180450978521539117.gal : 3 ms
[2021-05-17 20:31:25] [INFO ] Time to serialize properties into /tmp/CTLFireability15273334319947755298.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/CTLFireability8180450978521539117.gal, -t, CGAL, -ctl, /tmp/CTLFireability15273334319947755298.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/CTLFireability8180450978521539117.gal -t CGAL -ctl /tmp/CTLFireability15273334319947755298.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.54569e+08,0.424896,18568,456,280,17871,7295,503,53301,191,44452,0


Converting to forward existential form...Done !
original formula: (!(A(EF(AG((((((((((i0.i0.u3.p67==1)||(i4.u12.p267==1))||(i1.u4.p211==1))||(i6.u15.p326==1))||(i2.u22.p387==1))||(i0.i0.u3.p52==1))||(i0.i0.u3.p55==1))||(i0.i0.u3.p24==1))||(i5.u18.p360==1)))) U AF((((((((((((i0.i0.u3.p32==1)||(i1.u5.p130==1))||(i0.i0.u3.p51==1))||(i4.u11.p272==1))||(i2.u26.p151==1))||(i0.i1.u2.p70==1))||(i6.u24.p431==1))||(i5.u19.p364==1))||(i1.u8.p191==1))||(i6.u16.p344==1))&&((((i3.u10.p244==1)||(i2.u7.p163==1))||(i6.u23.p416==1))||(i0.i1.u2.p71==1)))))) + !(AF(((((((((((i2.u20.p373==1)||(i0.i0.u0.p17==1))||((i6.u14.p334==1)&&(i2.u26.p445==1)))||(i2.u21.p385==1))||(i6.u24.p433==1))||(i3.u10.p243==1))||(i0.i0.u3.p41==1))||(i5.u17.p349==1))||(i3.u9.p238==1))||(i0.i0.u3.p15==1)))))
=> equivalent forward existential formula: (([FwdG((FwdU(Init,!(!(EG(!((((((((((((i0.i0.u3.p32==1)||(i1.u5.p130==1))||(i0.i0.u3.p51==1))||(i4.u11.p272==1))||(i2.u26.p151==1))||(i0.i1.u2.p70==1))||(i6.u24.p431==1))||(i5.u19.p364==1))||(i1.u8.p191==1))||(i6.u16.p344==1))&&((((i3.u10.p244==1)||(i2.u7.p163==1))||(i6.u23.p416==1))||(i0.i1.u2.p71==1)))))))) * !(E(TRUE U !(E(TRUE U !((((((((((i0.i0.u3.p67==1)||(i4.u12.p267==1))||(i1.u4.p211==1))||(i6.u15.p326==1))||(i2.u22.p387==1))||(i0.i0.u3.p52==1))||(i0.i0.u3.p55==1))||(i0.i0.u3.p24==1))||(i5.u18.p360==1)))))))),!((((((((((((i0.i0.u3.p32==1)||(i1.u5.p130==1))||(i0.i0.u3.p51==1))||(i4.u11.p272==1))||(i2.u26.p151==1))||(i0.i1.u2.p70==1))||(i6.u24.p431==1))||(i5.u19.p364==1))||(i1.u8.p191==1))||(i6.u16.p344==1))&&((((i3.u10.p244==1)||(i2.u7.p163==1))||(i6.u23.p416==1))||(i0.i1.u2.p71==1)))))] != FALSE + [FwdG(Init,!(!(EG(!((((((((((((i0.i0.u3.p32==1)||(i1.u5.p130==1))||(i0.i0.u3.p51==1))||(i4.u11.p272==1))||(i2.u26.p151==1))||(i0.i1.u2.p70==1))||(i6.u24.p431==1))||(i5.u19.p364==1))||(i1.u8.p191==1))||(i6.u16.p344==1))&&((((i3.u10.p244==1)||(i2.u7.p163==1))||(i6.u23.p416==1))||(i0.i1.u2.p71==1))))))))] != FALSE) + [FwdG(Init,!(((((((((((i2.u20.p373==1)||(i0.i0.u0.p17==1))||((i6.u14.p334==1)&&(i2.u26.p445==1)))||(i2.u21.p385==1))||(i6.u24.p433==1))||(i3.u10.p243==1))||(i0.i0.u3.p41==1))||(i5.u17.p349==1))||(i3.u9.p238==1))||(i0.i0.u3.p15==1))))] != FALSE)
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t18, t21, t128, t129, t132, t135, t140, t141, t143, t149, t153, t157, t159, t161, t171, t175, t177, t183, t185, t187, t189, t197, t198, t201, t202, t205, t207, t209, t213, t219, t223, i0.i0.u3.t48, i0.i0.u3.t52, i0.i0.u3.t53, i0.i0.u3.t55, i0.i0.u3.t57, i0.i0.u3.t58, i0.i0.u3.t59, i0.i0.u3.t62, i0.i0.u3.t64, i0.i0.u3.t65, i0.i0.u3.t69, i0.i0.u3.t70, i0.i0.u3.t93, i0.i0.u3.t111, i0.i0.u3.t112, i1.t106, i1.t105, i1.u5.t47, i1.u8.t42, i1.u8.t104, i2.t214, i2.t17, i2.t13, i2.u26.t118, i2.u26.t120, i2.u26.t164, i2.u26.t165, i2.u26.t166, i2.u26.t168, i2.u26.t169, i2.u26.t170, i3.t97, i3.u9.t36, i3.u9.t37, i3.u9.t38, i4.t108, i4.u11.t33, i4.u13.t107, i6.t194, i6.t193, i6.t131, i6.t28, i6.t26, i6.t7, i6.t4, i6.u14.t196, i6.u15.t191, i6.u15.t192, i6.u16.t22, i6.u16.t24, i6.u27.t6, i6.u27.t8, i6.u27.t9, i6.u27.t10, i6.u27.t11, i6.u27.t15, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/99/89/188
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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,1,10.984,229940,1,0,286012,35152,3154,986222,1137,272229,393687
FORMULA HealthRecord-PT-16-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Graph (trivial) has 456 edges and 400 vertex of which 48 / 400 are part of one of the 17 SCC in 0 ms
Free SCC test removed 31 places
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 0 with 156 rules applied. Total rules applied 157 place count 368 transition count 343
Reduce places removed 156 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 174 rules applied. Total rules applied 331 place count 212 transition count 325
Reduce places removed 8 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 11 rules applied. Total rules applied 342 place count 204 transition count 322
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 345 place count 201 transition count 322
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 345 place count 201 transition count 312
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 365 place count 191 transition count 312
Discarding 50 places :
Symmetric choice reduction at 4 with 50 rule applications. Total rules 415 place count 141 transition count 221
Iterating global reduction 4 with 50 rules applied. Total rules applied 465 place count 141 transition count 221
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 467 place count 141 transition count 219
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 469 place count 139 transition count 219
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 483 place count 125 transition count 194
Iterating global reduction 6 with 14 rules applied. Total rules applied 497 place count 125 transition count 194
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 500 place count 122 transition count 189
Iterating global reduction 6 with 3 rules applied. Total rules applied 503 place count 122 transition count 189
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 504 place count 121 transition count 188
Iterating global reduction 6 with 1 rules applied. Total rules applied 505 place count 121 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 506 place count 121 transition count 187
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 4 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 7 with 64 rules applied. Total rules applied 570 place count 89 transition count 155
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 572 place count 89 transition count 153
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 575 place count 86 transition count 147
Iterating global reduction 8 with 3 rules applied. Total rules applied 578 place count 86 transition count 147
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 581 place count 83 transition count 141
Iterating global reduction 8 with 3 rules applied. Total rules applied 584 place count 83 transition count 141
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 588 place count 79 transition count 137
Iterating global reduction 8 with 4 rules applied. Total rules applied 592 place count 79 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 594 place count 79 transition count 135
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 596 place count 77 transition count 127
Iterating global reduction 9 with 2 rules applied. Total rules applied 598 place count 77 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 599 place count 77 transition count 126
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 10 with 16 rules applied. Total rules applied 615 place count 69 transition count 183
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 616 place count 68 transition count 181
Iterating global reduction 10 with 1 rules applied. Total rules applied 617 place count 68 transition count 181
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 10 with 11 rules applied. Total rules applied 628 place count 68 transition count 170
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 630 place count 67 transition count 182
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 633 place count 67 transition count 182
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 634 place count 66 transition count 181
Iterating global reduction 10 with 1 rules applied. Total rules applied 635 place count 66 transition count 181
Applied a total of 635 rules in 52 ms. Remains 66 /400 variables (removed 334) and now considering 181/534 (removed 353) transitions.
[2021-05-17 20:31:36] [INFO ] Flatten gal took : 7 ms
[2021-05-17 20:31:37] [INFO ] Flatten gal took : 7 ms
[2021-05-17 20:31:37] [INFO ] Input system was already deterministic with 181 transitions.
[2021-05-17 20:31:37] [INFO ] Flatten gal took : 7 ms
[2021-05-17 20:31:37] [INFO ] Flatten gal took : 7 ms
[2021-05-17 20:31:37] [INFO ] Time to serialize gal into /tmp/CTLFireability10124345297214412220.gal : 1 ms
[2021-05-17 20:31:37] [INFO ] Time to serialize properties into /tmp/CTLFireability5140435491658770807.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/CTLFireability10124345297214412220.gal, -t, CGAL, -ctl, /tmp/CTLFireability5140435491658770807.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/CTLFireability10124345297214412220.gal -t CGAL -ctl /tmp/CTLFireability5140435491658770807.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,3.66734e+06,0.1319,9344,2,1406,5,19080,6,0,438,15172,0


Converting to forward existential form...Done !
original formula: !(EG(!(AG(((((((((p100==1)||(p352==1))||(p181==1))||(p38==1))||(p8==1))||(p168==1))||(p297==1))||(p346==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((((((((p100==1)||(p352==1))||(p181==1))||(p38==1))||(p8==1))||(p168==1))||(p297==1))||(p346==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t6, t7, t8, t14, t15, t22, t24, t25, t36, t37, t49, t59, t60, t65, t66, t69, t70, t71, t72, t73, t74, t83, t84, t85, t86, t91, t92, t105, t106, t107, t108, t113, t114, t115, t116, t117, t118, t119, t122, t123, t124, t125, t128, t129, t130, t131, t134, t135, t138, t142, t143, t144, t145, t150, t151, t152, t154, t155, t156, t157, t158, t159, t160, t161, t162, t163, t164, t165, t166, t167, t168, t169, t170, t171, t172, t173, t174, t175, t176, t177, t178, t179, t180, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/93/88/181
(forward)formula 0,0,1.09578,33808,1,0,307,140021,379,95,3707,115111,393
FORMULA HealthRecord-PT-16-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Graph (trivial) has 465 edges and 400 vertex of which 46 / 400 are part of one of the 16 SCC in 0 ms
Free SCC test removed 30 places
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 163 rules applied. Total rules applied 164 place count 369 transition count 337
Reduce places removed 163 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 180 rules applied. Total rules applied 344 place count 206 transition count 320
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 352 place count 198 transition count 320
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 352 place count 198 transition count 311
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 370 place count 189 transition count 311
Discarding 51 places :
Symmetric choice reduction at 3 with 51 rule applications. Total rules 421 place count 138 transition count 213
Iterating global reduction 3 with 51 rules applied. Total rules applied 472 place count 138 transition count 213
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 475 place count 138 transition count 210
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 478 place count 135 transition count 210
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 489 place count 124 transition count 191
Iterating global reduction 5 with 11 rules applied. Total rules applied 500 place count 124 transition count 191
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 503 place count 121 transition count 186
Iterating global reduction 5 with 3 rules applied. Total rules applied 506 place count 121 transition count 186
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 507 place count 120 transition count 185
Iterating global reduction 5 with 1 rules applied. Total rules applied 508 place count 120 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 509 place count 120 transition count 184
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 581 place count 84 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 583 place count 84 transition count 146
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 585 place count 82 transition count 142
Iterating global reduction 7 with 2 rules applied. Total rules applied 587 place count 82 transition count 142
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 589 place count 80 transition count 139
Iterating global reduction 7 with 2 rules applied. Total rules applied 591 place count 80 transition count 139
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 593 place count 78 transition count 134
Iterating global reduction 7 with 2 rules applied. Total rules applied 595 place count 78 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 597 place count 78 transition count 132
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 609 place count 72 transition count 166
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 610 place count 71 transition count 163
Iterating global reduction 8 with 1 rules applied. Total rules applied 611 place count 71 transition count 163
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 613 place count 69 transition count 159
Iterating global reduction 8 with 2 rules applied. Total rules applied 615 place count 69 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 616 place count 69 transition count 158
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 617 place count 68 transition count 154
Iterating global reduction 9 with 1 rules applied. Total rules applied 618 place count 68 transition count 154
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 620 place count 68 transition count 152
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 10 with 14 rules applied. Total rules applied 634 place count 68 transition count 138
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 637 place count 68 transition count 138
Applied a total of 637 rules in 44 ms. Remains 68 /400 variables (removed 332) and now considering 138/534 (removed 396) transitions.
[2021-05-17 20:31:38] [INFO ] Flatten gal took : 5 ms
[2021-05-17 20:31:38] [INFO ] Flatten gal took : 5 ms
[2021-05-17 20:31:38] [INFO ] Input system was already deterministic with 138 transitions.
[2021-05-17 20:31:38] [INFO ] Flatten gal took : 11 ms
[2021-05-17 20:31:38] [INFO ] Flatten gal took : 5 ms
[2021-05-17 20:31:38] [INFO ] Time to serialize gal into /tmp/CTLFireability13329864044769014473.gal : 1 ms
[2021-05-17 20:31:38] [INFO ] Time to serialize properties into /tmp/CTLFireability4101142604333318281.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/CTLFireability13329864044769014473.gal, -t, CGAL, -ctl, /tmp/CTLFireability4101142604333318281.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/CTLFireability13329864044769014473.gal -t CGAL -ctl /tmp/CTLFireability4101142604333318281.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.61636e+06,0.148134,10064,2,3518,5,29373,6,0,401,23325,0


Converting to forward existential form...Done !
original formula: AG(!(A((p114==1) U AG(((((p293==1)||(p403==1))||(p12==1))||(p250==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(!(!(E(TRUE U !(((((p293==1)||(p403==1))||(p12==1))||(p250==1))))))))) * !(E(!(!(E(TRUE U !(((((p293==1)||(p403==1))||(p12==1))||(p250==1)))))) U (!((p114==1)) * !(!(E(TRUE U !(((((p293==1)||(p403==1))||(p12==1))||(p250==1))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t5, t6, t8, t9, t10, t11, t28, t29, t30, t31, t44, t45, t66, t68, t70, t71, t73, t74, t85, t86, t91, t92, t95, t96, t97, t98, t99, t100, t107, t108, t111, t112, t113, t114, t119, t121, t123, t125, t135, t136, t137, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/93/45/138
(forward)formula 0,1,1.22527,44884,1,0,242,225513,291,91,3003,167450,286
FORMULA HealthRecord-PT-16-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Graph (trivial) has 474 edges and 400 vertex of which 48 / 400 are part of one of the 17 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 167 transitions
Trivial Post-agglo rules discarded 167 transitions
Performed 167 trivial Post agglomeration. Transition count delta: 167
Iterating post reduction 0 with 167 rules applied. Total rules applied 168 place count 368 transition count 332
Reduce places removed 167 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 183 rules applied. Total rules applied 351 place count 201 transition count 316
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 358 place count 194 transition count 316
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 358 place count 194 transition count 307
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 376 place count 185 transition count 307
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 429 place count 132 transition count 205
Iterating global reduction 3 with 53 rules applied. Total rules applied 482 place count 132 transition count 205
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 485 place count 132 transition count 202
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 488 place count 129 transition count 202
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 502 place count 115 transition count 178
Iterating global reduction 5 with 14 rules applied. Total rules applied 516 place count 115 transition count 178
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 517 place count 115 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 518 place count 114 transition count 177
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 522 place count 110 transition count 170
Iterating global reduction 7 with 4 rules applied. Total rules applied 526 place count 110 transition count 170
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 529 place count 107 transition count 166
Iterating global reduction 7 with 3 rules applied. Total rules applied 532 place count 107 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 533 place count 107 transition count 165
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 535 place count 105 transition count 163
Iterating global reduction 8 with 2 rules applied. Total rules applied 537 place count 105 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 538 place count 105 transition count 162
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 539 place count 104 transition count 160
Iterating global reduction 9 with 1 rules applied. Total rules applied 540 place count 104 transition count 160
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 541 place count 103 transition count 158
Iterating global reduction 9 with 1 rules applied. Total rules applied 542 place count 103 transition count 158
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 543 place count 102 transition count 156
Iterating global reduction 9 with 1 rules applied. Total rules applied 544 place count 102 transition count 156
Performed 35 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 9 with 70 rules applied. Total rules applied 614 place count 67 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 615 place count 67 transition count 119
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 616 place count 66 transition count 117
Iterating global reduction 10 with 1 rules applied. Total rules applied 617 place count 66 transition count 117
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 618 place count 65 transition count 116
Iterating global reduction 10 with 1 rules applied. Total rules applied 619 place count 65 transition count 116
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 620 place count 64 transition count 112
Iterating global reduction 10 with 1 rules applied. Total rules applied 621 place count 64 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 622 place count 64 transition count 111
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 632 place count 59 transition count 155
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 634 place count 57 transition count 150
Iterating global reduction 11 with 2 rules applied. Total rules applied 636 place count 57 transition count 150
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 638 place count 55 transition count 146
Iterating global reduction 11 with 2 rules applied. Total rules applied 640 place count 55 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 641 place count 55 transition count 145
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 642 place count 54 transition count 141
Iterating global reduction 12 with 1 rules applied. Total rules applied 643 place count 54 transition count 141
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 645 place count 54 transition count 139
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 13 with 22 rules applied. Total rules applied 667 place count 54 transition count 117
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 668 place count 53 transition count 114
Iterating global reduction 13 with 1 rules applied. Total rules applied 669 place count 53 transition count 114
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 670 place count 52 transition count 112
Iterating global reduction 13 with 1 rules applied. Total rules applied 671 place count 52 transition count 112
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 672 place count 52 transition count 111
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 674 place count 52 transition count 111
Applied a total of 674 rules in 40 ms. Remains 52 /400 variables (removed 348) and now considering 111/534 (removed 423) transitions.
[2021-05-17 20:31:39] [INFO ] Flatten gal took : 4 ms
[2021-05-17 20:31:39] [INFO ] Flatten gal took : 4 ms
[2021-05-17 20:31:39] [INFO ] Input system was already deterministic with 111 transitions.
Finished random walk after 1550 steps, including 153 resets, run visited all 1 properties in 15 ms. (steps per millisecond=103 )
FORMULA HealthRecord-PT-16-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2021-05-17 20:31:39] [INFO ] Flatten gal took : 14 ms
[2021-05-17 20:31:39] [INFO ] Flatten gal took : 14 ms
[2021-05-17 20:31:39] [INFO ] Applying decomposition
[2021-05-17 20:31:39] [INFO ] Flatten gal took : 14 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/graph15352467133874067444.txt, -o, /tmp/graph15352467133874067444.bin, -w, /tmp/graph15352467133874067444.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/graph15352467133874067444.bin, -l, -1, -v, -w, /tmp/graph15352467133874067444.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:31:39] [INFO ] Decomposing Gal with order
[2021-05-17 20:31:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:31:39] [INFO ] Removed a total of 147 redundant transitions.
[2021-05-17 20:31:39] [INFO ] Flatten gal took : 37 ms
[2021-05-17 20:31:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 6 ms.
[2021-05-17 20:31:39] [INFO ] Time to serialize gal into /tmp/CTLFireability16278783592741900495.gal : 7 ms
[2021-05-17 20:31:39] [INFO ] Time to serialize properties into /tmp/CTLFireability11131486719110292810.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/CTLFireability16278783592741900495.gal, -t, CGAL, -ctl, /tmp/CTLFireability11131486719110292810.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/CTLFireability16278783592741900495.gal -t CGAL -ctl /tmp/CTLFireability11131486719110292810.ctl
No direction supplied, using forward translation only.
Parsed 9 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.10277e+12,13.8836,385896,3645,1491,581495,75652,892,1.62942e+06,289,454834,0


Converting to forward existential form...Done !
original formula: EF((EX(EG(!(AF(((((i20.u136.p372==1)||((i20.u136.p334==1)&&(i20.u136.p397==1)))||(i6.u37.p122==1))||(i10.u60.p186==1)))))) * AF((((i8.u46.p147==1)||(i17.i1.i0.u119.p360==1))||(i0.u56.p174==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * EX(EG(!(!(EG(!(((((i20.u136.p372==1)||((i20.u136.p334==1)&&(i20.u136.p397==1)))||(i6.u37.p122==1))||(i10.u60.p186==1))))))))) * !(EG(!((((i8.u46.p147==1)||(i17.i1.i0.u119.p360==1))||(i0.u56.p174==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t13, t121, t122, u3.t464, u31.t370, u45.t334, u58.t294, u86.t220, i2.t461, i2.t431, i2.t422, i2.t417, i2.t409, i2.t384, i2.u18.t388, i2.u18.t389, i2.u18.t390, i2.u18.t391, i2.u18.t395, i2.u18.t396, i2.u18.t399, i2.u18.t400, i2.u18.t401, i2.u18.t402, i2.u18.t403, i2.u18.t404, i2.u18.t410, i2.u18.t411, i2.u18.t413, i2.u18.t414, i2.u18.t418, i2.u18.t419, i2.u18.t424, i2.u18.t425, i2.u18.t426, i2.u18.t436, i2.u18.t437, i2.u18.t444, i2.u18.t445, i2.u18.t454, i2.u18.t455, i2.u18.t462, i6.t368, i6.t361, i6.t356, i6.t353, i6.t351, i6.t343, i6.t342, i6.u32.t367, i8.t332, i8.t325, i8.t324, i8.t319, i8.t315, i8.t307, i8.t306, i8.u47.t316, i8.u53.t331, i10.t292, i10.t285, i10.t279, i10.t276, i10.t274, i10.t266, i10.t265, i10.u68.t291, i12.t252, i12.t245, i12.t239, i12.t235, i12.t227, i12.t226, i12.u74.t251, i12.u76.t236, i12.u76.t244, i14.t218, i14.t211, i14.t205, i14.t202, i14.t200, i14.t192, i14.t191, i14.u87.t217, i16.t177, i16.t176, i16.t173, i16.t170, i16.t167, i16.t166, i16.t164, i16.t161, i16.t158, i16.t157, i16.t154, i16.t151, i16.t148, i16.t147, i16.t145, i16.t142, i16.t140, i16.t139, i16.t137, i16.t133, i16.t124, i16.u100.t143, i16.u100.t144, i16.u100.t152, i16.u100.t153, i16.u100.t162, i16.u100.t163, i16.u100.t174, i16.u100.t175, i16.u102.t169, i20.t100, i20.t81, i20.t38, i20.t36, i20.t34, i20.t31, i20.t29, i20.t25, i20.t22, i20.t19, i20.t18, i20.t17, i20.t15, i20.t14, i20.u135.t42, i20.u135.t53, i20.u135.t62, i20.u135.t79, i20.u135.t89, i20.u135.t96, i20.u136.t39, i20.u136.t40, i20.u136.t43, i20.u136.t44, i20.u136.t45, i20.u136.t46, i20.u136.t47, i20.u136.t50, i20.u136.t51, i20.u136.t54, i20.u136.t55, i20.u136.t56, i20.u136.t59, i20.u136.t60, i20.u136.t63, i20.u136.t64, i20.u136.t65, i20.u136.t68, i20.u136.t69, i20.u136.t70, i20.u136.t71, i20.u136.t72, i20.u136.t73, i20.u136.t76, i20.u136.t77, i20.u136.t86, i20.u136.t87, i20.u136.t90, i20.u136.t91, i20.u136.t92, i20.u136.t93, i20.u136.t94, i20.u136.t97, i20.u136.t98, i20.u136.t99, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/357/169/526
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
ITS-tools command line returned an error code 139
[2021-05-17 20:34:08] [INFO ] Applying decomposition
[2021-05-17 20:34:08] [INFO ] Flatten gal took : 13 ms
[2021-05-17 20:34:08] [INFO ] Decomposing Gal with order
[2021-05-17 20:34:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:34:08] [INFO ] Removed a total of 24 redundant transitions.
[2021-05-17 20:34:08] [INFO ] Flatten gal took : 21 ms
[2021-05-17 20:34:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 3 ms.
[2021-05-17 20:34:08] [INFO ] Time to serialize gal into /tmp/CTLFireability12211943180933161189.gal : 2 ms
[2021-05-17 20:34:08] [INFO ] Time to serialize properties into /tmp/CTLFireability7177660211296407250.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/CTLFireability12211943180933161189.gal, -t, CGAL, -ctl, /tmp/CTLFireability7177660211296407250.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/CTLFireability12211943180933161189.gal -t CGAL -ctl /tmp/CTLFireability7177660211296407250.ctl
No direction supplied, using forward translation only.
Parsed 9 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.10277e+12,5.64602,165464,997,7149,114320,189179,423,452081,800,1.63352e+06,0


Converting to forward existential form...Done !
original formula: EF((EX(EG(!(AF(((((i1.u14.p372==1)||((i1.u13.p334==1)&&(i1.u14.p397==1)))||(i0.i1.i0.i0.i0.u7.p122==1))||(i0.i1.i0.i0.u9.p186==1)))))) * AF((((i0.i1.i0.i0.i0.u8.p147==1)||(i1.u13.p360==1))||(i0.i1.i0.i0.i0.u8.p174==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * EX(EG(!(!(EG(!(((((i1.u14.p372==1)||((i1.u13.p334==1)&&(i1.u14.p397==1)))||(i0.i1.i0.i0.i0.u7.p122==1))||(i0.i1.i0.i0.u9.p186==1))))))))) * !(EG(!((((i0.i1.i0.i0.i0.u8.p147==1)||(i1.u13.p360==1))||(i0.i1.i0.i0.i0.u8.p174==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.u2.t384, i0.u2.t386, i0.u2.t388, i0.u2.t389, i0.u2.t390, i0.u2.t391, i0.u2.t395, i0.u2.t396, i0.u2.t399, i0.u2.t400, i0.u2.t401, i0.u2.t402, i0.u2.t403, i0.u2.t404, i0.u2.t409, i0.u2.t410, i0.u2.t411, i0.u2.t413, i0.u2.t414, i0.u2.t417, i0.u2.t418, i0.u2.t419, i0.u2.t422, i0.u2.t424, i0.u2.t425, i0.u2.t426, i0.u2.t431, i0.u2.t436, i0.u2.t437, i0.u2.t444, i0.u2.t445, i0.u2.t454, i0.u2.t455, i0.u2.t461, i0.u2.t462, i0.u2.t464, i0.i1.u11.t191, i0.i1.u11.t192, i0.i1.u11.t200, i0.i1.u11.t202, i0.i1.u11.t205, i0.i1.u11.t211, i0.i1.u11.t217, i0.i1.u11.t218, i0.i1.u11.t220, i0.i1.i0.u10.t226, i0.i1.i0.u10.t227, i0.i1.i0.u10.t235, i0.i1.i0.u10.t236, i0.i1.i0.u10.t239, i0.i1.i0.u10.t244, i0.i1.i0.u10.t245, i0.i1.i0.u10.t251, i0.i1.i0.u10.t252, i0.i1.i0.i0.u9.t265, i0.i1.i0.i0.u9.t266, i0.i1.i0.i0.u9.t274, i0.i1.i0.i0.u9.t276, i0.i1.i0.i0.u9.t279, i0.i1.i0.i0.u9.t285, i0.i1.i0.i0.u9.t291, i0.i1.i0.i0.u9.t292, i0.i1.i0.i0.u9.t294, i0.i1.i0.i0.i0.u7.t342, i0.i1.i0.i0.i0.u7.t343, i0.i1.i0.i0.i0.u7.t351, i0.i1.i0.i0.i0.u7.t353, i0.i1.i0.i0.i0.u7.t356, i0.i1.i0.i0.i0.u7.t361, i0.i1.i0.i0.i0.u7.t367, i0.i1.i0.i0.i0.u7.t368, i0.i1.i0.i0.i0.u7.t370, i0.i1.i0.i0.i0.u8.t306, i0.i1.i0.i0.i0.u8.t307, i0.i1.i0.i0.i0.u8.t315, i0.i1.i0.i0.i0.u8.t316, i0.i1.i0.i0.i0.u8.t319, i0.i1.i0.i0.i0.u8.t324, i0.i1.i0.i0.i0.u8.t325, i0.i1.i0.i0.i0.u8.t331, i0.i1.i0.i0.i0.u8.t332, i0.i1.i0.i0.i0.u8.t334, i1.u13.t121, i1.u13.t122, i1.u13.t124, i1.u13.t126, i1.u13.t131, i1.u13.t133, i1.u13.t137, i1.u13.t139, i1.u13.t140, i1.u13.t142, i1.u13.t143, i1.u13.t144, i1.u13.t145, i1.u13.t147, i1.u13.t148, i1.u13.t151, i1.u13.t152, i1.u13.t153, i1.u13.t154, i1.u13.t157, i1.u13.t158, i1.u13.t161, i1.u13.t162, i1.u13.t163, i1.u13.t164, i1.u13.t166, i1.u13.t167, i1.u13.t169, i1.u13.t170, i1.u13.t173, i1.u13.t174, i1.u13.t175, i1.u13.t176, i1.u13.t177, i1.u14.t12, i1.u14.t13, i1.u14.t14, i1.u14.t15, i1.u14.t17, i1.u14.t18, i1.u14.t19, i1.u14.t22, i1.u14.t25, i1.u14.t27, i1.u14.t29, i1.u14.t31, i1.u14.t34, i1.u14.t36, i1.u14.t38, i1.u14.t39, i1.u14.t40, i1.u14.t42, i1.u14.t43, i1.u14.t44, i1.u14.t45, i1.u14.t46, i1.u14.t47, i1.u14.t50, i1.u14.t51, i1.u14.t53, i1.u14.t54, i1.u14.t55, i1.u14.t56, i1.u14.t59, i1.u14.t60, i1.u14.t62, i1.u14.t63, i1.u14.t64, i1.u14.t65, i1.u14.t68, i1.u14.t69, i1.u14.t70, i1.u14.t71, i1.u14.t72, i1.u14.t73, i1.u14.t76, i1.u14.t77, i1.u14.t79, i1.u14.t81, i1.u14.t86, i1.u14.t87, i1.u14.t89, i1.u14.t90, i1.u14.t91, i1.u14.t92, i1.u14.t93, i1.u14.t94, i1.u14.t96, i1.u14.t97, i1.u14.t98, i1.u14.t99, i1.u14.t100, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/342/174/516
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2021-05-17 20:37:19] [INFO ] Flatten gal took : 34 ms
[2021-05-17 20:37:20] [INFO ] Input system was already deterministic with 534 transitions.
[2021-05-17 20:37:20] [INFO ] Transformed 400 places.
[2021-05-17 20:37:20] [INFO ] Transformed 534 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-17 20:37:20] [INFO ] Time to serialize gal into /tmp/CTLFireability13756701560806176273.gal : 2 ms
[2021-05-17 20:37:20] [INFO ] Time to serialize properties into /tmp/CTLFireability5715395519324247228.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/CTLFireability13756701560806176273.gal, -t, CGAL, -ctl, /tmp/CTLFireability5715395519324247228.ctl, --load-order, /home/mcc/execution/model.ord, --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/CTLFireability13756701560806176273.gal -t CGAL -ctl /tmp/CTLFireability5715395519324247228.ctl --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 9 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.10277e+12,655.587,11051720,2,972036,5,3.13176e+07,6,0,2136,3.34147e+07,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.

BK_STOP 1621285067918

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

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