Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r197-smll-167840344000298.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is HealthRecord-PT-09, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-167840344000298
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.4K Feb 26 18:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 18:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 18:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 18:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 68K Mar 5 18:22 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-09-CTLFireability-00
FORMULA_NAME HealthRecord-PT-09-CTLFireability-01
FORMULA_NAME HealthRecord-PT-09-CTLFireability-02
FORMULA_NAME HealthRecord-PT-09-CTLFireability-03
FORMULA_NAME HealthRecord-PT-09-CTLFireability-04
FORMULA_NAME HealthRecord-PT-09-CTLFireability-05
FORMULA_NAME HealthRecord-PT-09-CTLFireability-06
FORMULA_NAME HealthRecord-PT-09-CTLFireability-07
FORMULA_NAME HealthRecord-PT-09-CTLFireability-08
FORMULA_NAME HealthRecord-PT-09-CTLFireability-09
FORMULA_NAME HealthRecord-PT-09-CTLFireability-10
FORMULA_NAME HealthRecord-PT-09-CTLFireability-11
FORMULA_NAME HealthRecord-PT-09-CTLFireability-12
FORMULA_NAME HealthRecord-PT-09-CTLFireability-13
FORMULA_NAME HealthRecord-PT-09-CTLFireability-14
FORMULA_NAME HealthRecord-PT-09-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678512553929

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-09
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202303021504
[2023-03-11 05:29:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 05:29:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 05:29:17] [INFO ] Load time of PNML (sax parser for PT used): 115 ms
[2023-03-11 05:29:17] [INFO ] Transformed 157 places.
[2023-03-11 05:29:17] [INFO ] Transformed 327 transitions.
[2023-03-11 05:29:17] [INFO ] Found NUPN structural information;
[2023-03-11 05:29:17] [INFO ] Parsed PT model containing 157 places and 327 transitions and 859 arcs in 269 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 30 ms.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Support contains 107 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 301/301 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 130 transition count 255
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 130 transition count 255
Applied a total of 54 rules in 43 ms. Remains 130 /157 variables (removed 27) and now considering 255/301 (removed 46) transitions.
[2023-03-11 05:29:17] [INFO ] Flow matrix only has 251 transitions (discarded 4 similar events)
// Phase 1: matrix 251 rows 130 cols
[2023-03-11 05:29:17] [INFO ] Computed 10 place invariants in 21 ms
[2023-03-11 05:29:17] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-11 05:29:17] [INFO ] Flow matrix only has 251 transitions (discarded 4 similar events)
[2023-03-11 05:29:17] [INFO ] Invariant cache hit.
[2023-03-11 05:29:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:29:18] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2023-03-11 05:29:18] [INFO ] Flow matrix only has 251 transitions (discarded 4 similar events)
[2023-03-11 05:29:18] [INFO ] Invariant cache hit.
[2023-03-11 05:29:18] [INFO ] Dead Transitions using invariants and state equation in 343 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/157 places, 255/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1051 ms. Remains : 130/157 places, 255/301 transitions.
Support contains 107 out of 130 places after structural reductions.
[2023-03-11 05:29:18] [INFO ] Flatten gal took : 125 ms
[2023-03-11 05:29:19] [INFO ] Flatten gal took : 41 ms
[2023-03-11 05:29:19] [INFO ] Input system was already deterministic with 255 transitions.
Incomplete random walk after 10000 steps, including 587 resets, run finished after 955 ms. (steps per millisecond=10 ) properties (out of 93) seen :33
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 60) seen :2
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 58) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 58) seen :0
Running SMT prover for 58 properties.
[2023-03-11 05:29:20] [INFO ] Flow matrix only has 251 transitions (discarded 4 similar events)
[2023-03-11 05:29:20] [INFO ] Invariant cache hit.
[2023-03-11 05:29:21] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-11 05:29:21] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 12 ms returned sat
[2023-03-11 05:29:21] [INFO ] After 237ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:55
[2023-03-11 05:29:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:29:21] [INFO ] After 38ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:58
[2023-03-11 05:29:21] [INFO ] After 683ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:58
[2023-03-11 05:29:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-11 05:29:21] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 18 ms returned sat
[2023-03-11 05:29:23] [INFO ] After 944ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :54
[2023-03-11 05:29:23] [INFO ] After 702ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :4 sat :54
[2023-03-11 05:29:23] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 4 ms to minimize.
[2023-03-11 05:29:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2023-03-11 05:29:24] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2023-03-11 05:29:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-11 05:29:24] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 1 ms to minimize.
[2023-03-11 05:29:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 131 ms
[2023-03-11 05:29:24] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 3 ms to minimize.
[2023-03-11 05:29:24] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 0 ms to minimize.
[2023-03-11 05:29:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 232 ms
[2023-03-11 05:29:24] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 1 ms to minimize.
[2023-03-11 05:29:25] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 1 ms to minimize.
[2023-03-11 05:29:25] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 1 ms to minimize.
[2023-03-11 05:29:25] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 0 ms to minimize.
[2023-03-11 05:29:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 375 ms
[2023-03-11 05:29:25] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 1 ms to minimize.
[2023-03-11 05:29:25] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 1 ms to minimize.
[2023-03-11 05:29:25] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
[2023-03-11 05:29:25] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 1 ms to minimize.
[2023-03-11 05:29:25] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2023-03-11 05:29:25] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2023-03-11 05:29:26] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2023-03-11 05:29:26] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
[2023-03-11 05:29:26] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2023-03-11 05:29:26] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2023-03-11 05:29:26] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 975 ms
[2023-03-11 05:29:26] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2023-03-11 05:29:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-11 05:29:26] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2023-03-11 05:29:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-11 05:29:27] [INFO ] After 4005ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :52
Attempting to minimize the solution found.
Minimization took 729 ms.
[2023-03-11 05:29:27] [INFO ] After 6319ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :52
Fused 58 Parikh solutions to 51 different solutions.
Parikh walk visited 10 properties in 381 ms.
Support contains 59 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 255/255 transitions.
Graph (trivial) has 32 edges and 130 vertex of which 8 / 130 are part of one of the 4 SCC in 10 ms
Free SCC test removed 4 places
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 503 edges and 126 vertex of which 124 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 124 transition count 241
Reduce places removed 1 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 1 with 3 rules applied. Total rules applied 6 place count 123 transition count 239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 122 transition count 239
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 32 place count 97 transition count 189
Iterating global reduction 3 with 25 rules applied. Total rules applied 57 place count 97 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 96 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 96 transition count 187
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 63 place count 96 transition count 184
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 63 place count 96 transition count 181
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 69 place count 93 transition count 181
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 71 place count 93 transition count 179
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 73 place count 91 transition count 179
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 74 place count 91 transition count 179
Applied a total of 74 rules in 94 ms. Remains 91 /130 variables (removed 39) and now considering 179/255 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 91/130 places, 179/255 transitions.
Incomplete random walk after 10000 steps, including 908 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 42) seen :7
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 23 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 18 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) seen :3
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 16 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 16 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 17 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Running SMT prover for 32 properties.
[2023-03-11 05:29:28] [INFO ] Flow matrix only has 176 transitions (discarded 3 similar events)
// Phase 1: matrix 176 rows 91 cols
[2023-03-11 05:29:28] [INFO ] Computed 8 place invariants in 4 ms
[2023-03-11 05:29:28] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 05:29:28] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2023-03-11 05:29:29] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 05:29:29] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :32
[2023-03-11 05:29:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 05:29:29] [INFO ] After 304ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :32
[2023-03-11 05:29:29] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2023-03-11 05:29:29] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 0 ms to minimize.
[2023-03-11 05:29:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2023-03-11 05:29:30] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
[2023-03-11 05:29:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-11 05:29:30] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 0 ms to minimize.
[2023-03-11 05:29:30] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2023-03-11 05:29:30] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 0 ms to minimize.
[2023-03-11 05:29:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 206 ms
[2023-03-11 05:29:30] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2023-03-11 05:29:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-11 05:29:30] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2023-03-11 05:29:30] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2023-03-11 05:29:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2023-03-11 05:29:30] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2023-03-11 05:29:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-11 05:29:30] [INFO ] After 1371ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :32
Attempting to minimize the solution found.
Minimization took 318 ms.
[2023-03-11 05:29:31] [INFO ] After 2204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :32
Fused 32 Parikh solutions to 30 different solutions.
Parikh walk visited 25 properties in 191 ms.
Support contains 16 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 179/179 transitions.
Graph (trivial) has 67 edges and 91 vertex of which 2 / 91 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 90 transition count 176
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 89 transition count 175
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 89 transition count 172
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 84 transition count 172
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 38 place count 58 transition count 120
Iterating global reduction 2 with 26 rules applied. Total rules applied 64 place count 58 transition count 120
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 69 place count 53 transition count 110
Iterating global reduction 2 with 5 rules applied. Total rules applied 74 place count 53 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 76 place count 53 transition count 108
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 77 place count 52 transition count 105
Iterating global reduction 3 with 1 rules applied. Total rules applied 78 place count 52 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 51 transition count 105
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 83 place count 51 transition count 102
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 86 place count 48 transition count 102
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 104 place count 48 transition count 102
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 121 place count 48 transition count 102
Applied a total of 121 rules in 43 ms. Remains 48 /91 variables (removed 43) and now considering 102/179 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 48/91 places, 102/179 transitions.
Incomplete random walk after 10000 steps, including 831 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 251 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 290 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 259 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 276 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 6) seen :2
Running SMT prover for 4 properties.
[2023-03-11 05:29:32] [INFO ] Flow matrix only has 99 transitions (discarded 3 similar events)
// Phase 1: matrix 99 rows 48 cols
[2023-03-11 05:29:32] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-11 05:29:32] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 05:29:32] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-11 05:29:32] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 05:29:32] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-11 05:29:32] [INFO ] After 24ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 05:29:32] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 2 ms to minimize.
[2023-03-11 05:29:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2023-03-11 05:29:32] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-11 05:29:32] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 11 ms.
Support contains 8 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 102/102 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 47 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 47 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 46 transition count 99
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 45 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 45 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 9 place count 45 transition count 93
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 43 transition count 116
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 43 transition count 114
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 43 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 42 transition count 113
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 42 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 41 transition count 112
Applied a total of 19 rules in 43 ms. Remains 41 /48 variables (removed 7) and now considering 112/102 (removed -10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 41/48 places, 112/102 transitions.
Incomplete random walk after 10000 steps, including 974 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 247 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 279 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 279 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 293 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Finished probabilistic random walk after 3171 steps, run visited all 4 properties in 34 ms. (steps per millisecond=93 )
Probabilistic random walk after 3171 steps, saw 955 distinct states, run finished after 35 ms. (steps per millisecond=90 ) properties seen :4
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
FORMULA HealthRecord-PT-09-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 05:29:33] [INFO ] Flatten gal took : 22 ms
[2023-03-11 05:29:33] [INFO ] Flatten gal took : 19 ms
[2023-03-11 05:29:33] [INFO ] Input system was already deterministic with 255 transitions.
Computed a total of 16 stabilizing places and 28 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 255/255 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 71 transition count 138
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 71 transition count 138
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 126 place count 63 transition count 122
Iterating global reduction 0 with 8 rules applied. Total rules applied 134 place count 63 transition count 122
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 139 place count 63 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 140 place count 62 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 141 place count 62 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 142 place count 61 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 143 place count 61 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 146 place count 61 transition count 109
Applied a total of 146 rules in 8 ms. Remains 61 /130 variables (removed 69) and now considering 109/255 (removed 146) transitions.
[2023-03-11 05:29:33] [INFO ] Flow matrix only has 106 transitions (discarded 3 similar events)
// Phase 1: matrix 106 rows 61 cols
[2023-03-11 05:29:33] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 05:29:33] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-11 05:29:33] [INFO ] Flow matrix only has 106 transitions (discarded 3 similar events)
[2023-03-11 05:29:33] [INFO ] Invariant cache hit.
[2023-03-11 05:29:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:29:33] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-11 05:29:33] [INFO ] Flow matrix only has 106 transitions (discarded 3 similar events)
[2023-03-11 05:29:33] [INFO ] Invariant cache hit.
[2023-03-11 05:29:33] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 61/130 places, 109/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 213 ms. Remains : 61/130 places, 109/255 transitions.
[2023-03-11 05:29:33] [INFO ] Flatten gal took : 8 ms
[2023-03-11 05:29:33] [INFO ] Flatten gal took : 8 ms
[2023-03-11 05:29:33] [INFO ] Input system was already deterministic with 109 transitions.
[2023-03-11 05:29:33] [INFO ] Flatten gal took : 9 ms
[2023-03-11 05:29:33] [INFO ] Flatten gal took : 9 ms
[2023-03-11 05:29:33] [INFO ] Time to serialize gal into /tmp/CTLFireability3823349296817053246.gal : 4 ms
[2023-03-11 05:29:33] [INFO ] Time to serialize properties into /tmp/CTLFireability1464530664770429007.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3823349296817053246.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1464530664770429007.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
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.17664e+06,0.171728,8556,2,1580,5,18366,6,0,349,21936,0


Converting to forward existential form...Done !
original formula: (EX((AF((EX((p46==1)) * EG((p10==1)))) + AG(((p54==1) + !(E((p101==1) U (((((p18==1)&&(p37==1))&&((p56==1)&&(p61==1)))&&(((p66==1)&&(p71=...340
=> equivalent forward existential formula: [FwdG((Init * !(EX((!(EG(!((EX((p46==1)) * EG((p10==1)))))) + !(E(TRUE U !(((p54==1) + !(E((p101==1) U (((((p18=...412
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...348
(forward)formula 0,0,4.90775,134356,1,0,564,709869,260,301,2623,726748,588
FORMULA HealthRecord-PT-09-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 255/255 transitions.
Graph (trivial) has 185 edges and 130 vertex of which 12 / 130 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 58 place count 66 transition count 135
Iterating global reduction 0 with 57 rules applied. Total rules applied 115 place count 66 transition count 135
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 124 place count 57 transition count 117
Iterating global reduction 0 with 9 rules applied. Total rules applied 133 place count 57 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 136 place count 57 transition count 114
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 139 place count 54 transition count 105
Iterating global reduction 1 with 3 rules applied. Total rules applied 142 place count 54 transition count 105
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 145 place count 51 transition count 99
Iterating global reduction 1 with 3 rules applied. Total rules applied 148 place count 51 transition count 99
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 157 place count 51 transition count 90
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 161 place count 51 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 50 transition count 85
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 166 place count 47 transition count 82
Applied a total of 166 rules in 35 ms. Remains 47 /130 variables (removed 83) and now considering 82/255 (removed 173) transitions.
[2023-03-11 05:29:38] [INFO ] Flow matrix only has 74 transitions (discarded 8 similar events)
// Phase 1: matrix 74 rows 47 cols
[2023-03-11 05:29:38] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 05:29:38] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-11 05:29:38] [INFO ] Flow matrix only has 74 transitions (discarded 8 similar events)
[2023-03-11 05:29:38] [INFO ] Invariant cache hit.
[2023-03-11 05:29:38] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-11 05:29:38] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-11 05:29:38] [INFO ] Flow matrix only has 74 transitions (discarded 8 similar events)
[2023-03-11 05:29:38] [INFO ] Invariant cache hit.
[2023-03-11 05:29:38] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 47/130 places, 82/255 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 243 ms. Remains : 47/130 places, 82/255 transitions.
[2023-03-11 05:29:38] [INFO ] Flatten gal took : 6 ms
[2023-03-11 05:29:38] [INFO ] Flatten gal took : 6 ms
[2023-03-11 05:29:38] [INFO ] Input system was already deterministic with 82 transitions.
[2023-03-11 05:29:38] [INFO ] Flatten gal took : 6 ms
[2023-03-11 05:29:38] [INFO ] Flatten gal took : 6 ms
[2023-03-11 05:29:38] [INFO ] Time to serialize gal into /tmp/CTLFireability4818042404702827519.gal : 2 ms
[2023-03-11 05:29:38] [INFO ] Time to serialize properties into /tmp/CTLFireability2122429168319192218.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability4818042404702827519.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2122429168319192218.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
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,297436,0.080064,5776,2,654,5,10124,6,0,256,10661,0


Converting to forward existential form...Done !
original formula: ((EG((EF((p57==0)) + (p54==1))) * EF((EF((p117==1)) + (p44==1)))) * EF((p120==1)))
=> equivalent forward existential formula: [(FwdU((Init * (EG((E(TRUE U (p57==0)) + (p54==1))) * E(TRUE U (E(TRUE U (p117==1)) + (p44==1))))),TRUE) * (p120...170
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t17, t18, t27, t28, t29...285
(forward)formula 0,1,0.979334,30328,1,0,220,152820,184,105,1964,127910,262
FORMULA HealthRecord-PT-09-CTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 255/255 transitions.
Graph (trivial) has 159 edges and 130 vertex of which 12 / 130 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 59 place count 66 transition count 134
Iterating global reduction 0 with 58 rules applied. Total rules applied 117 place count 66 transition count 134
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 127 place count 56 transition count 114
Iterating global reduction 0 with 10 rules applied. Total rules applied 137 place count 56 transition count 114
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 146 place count 56 transition count 105
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 149 place count 53 transition count 96
Iterating global reduction 1 with 3 rules applied. Total rules applied 152 place count 53 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 154 place count 51 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 156 place count 51 transition count 92
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 161 place count 51 transition count 87
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 165 place count 51 transition count 83
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 173 place count 47 transition count 79
Applied a total of 173 rules in 28 ms. Remains 47 /130 variables (removed 83) and now considering 79/255 (removed 176) transitions.
[2023-03-11 05:29:39] [INFO ] Flow matrix only has 71 transitions (discarded 8 similar events)
// Phase 1: matrix 71 rows 47 cols
[2023-03-11 05:29:39] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-11 05:29:39] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-11 05:29:39] [INFO ] Flow matrix only has 71 transitions (discarded 8 similar events)
[2023-03-11 05:29:39] [INFO ] Invariant cache hit.
[2023-03-11 05:29:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:29:39] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-11 05:29:39] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-11 05:29:39] [INFO ] Flow matrix only has 71 transitions (discarded 8 similar events)
[2023-03-11 05:29:39] [INFO ] Invariant cache hit.
[2023-03-11 05:29:39] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 47/130 places, 79/255 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 220 ms. Remains : 47/130 places, 79/255 transitions.
[2023-03-11 05:29:39] [INFO ] Flatten gal took : 5 ms
[2023-03-11 05:29:39] [INFO ] Flatten gal took : 5 ms
[2023-03-11 05:29:39] [INFO ] Input system was already deterministic with 79 transitions.
[2023-03-11 05:29:39] [INFO ] Flatten gal took : 5 ms
[2023-03-11 05:29:39] [INFO ] Flatten gal took : 5 ms
[2023-03-11 05:29:39] [INFO ] Time to serialize gal into /tmp/CTLFireability14876765405626764166.gal : 2 ms
[2023-03-11 05:29:39] [INFO ] Time to serialize properties into /tmp/CTLFireability1250654840120415069.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14876765405626764166.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1250654840120415069.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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,350501,0.106928,6812,2,1018,5,14737,6,0,258,16429,0


Converting to forward existential form...Done !
original formula: A(((p55==1)||((p111==1)&&(p153==1))) U ((p79==1) + EF(((EG((p24==1)) * (p126==1)) * (p12==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(((p79==1) + E(TRUE U ((EG((p24==1)) * (p126==1)) * (p12==1)))))))) * !(E(!(((p79==1) + E(TRUE U...321
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t15, t16, t30, t31, t35, t36, t69...260
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,2.24093,66816,1,0,381,375601,187,216,1996,437425,400
FORMULA HealthRecord-PT-09-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 255/255 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 70 transition count 136
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 70 transition count 136
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 128 place count 62 transition count 120
Iterating global reduction 0 with 8 rules applied. Total rules applied 136 place count 62 transition count 120
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 142 place count 62 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 61 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 61 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 145 place count 60 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 146 place count 60 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 148 place count 60 transition count 107
Applied a total of 148 rules in 8 ms. Remains 60 /130 variables (removed 70) and now considering 107/255 (removed 148) transitions.
[2023-03-11 05:29:42] [INFO ] Flow matrix only has 104 transitions (discarded 3 similar events)
// Phase 1: matrix 104 rows 60 cols
[2023-03-11 05:29:42] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 05:29:42] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-11 05:29:42] [INFO ] Flow matrix only has 104 transitions (discarded 3 similar events)
[2023-03-11 05:29:42] [INFO ] Invariant cache hit.
[2023-03-11 05:29:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:29:42] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2023-03-11 05:29:42] [INFO ] Flow matrix only has 104 transitions (discarded 3 similar events)
[2023-03-11 05:29:42] [INFO ] Invariant cache hit.
[2023-03-11 05:29:42] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/130 places, 107/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 230 ms. Remains : 60/130 places, 107/255 transitions.
[2023-03-11 05:29:42] [INFO ] Flatten gal took : 6 ms
[2023-03-11 05:29:42] [INFO ] Flatten gal took : 6 ms
[2023-03-11 05:29:42] [INFO ] Input system was already deterministic with 107 transitions.
[2023-03-11 05:29:42] [INFO ] Flatten gal took : 6 ms
[2023-03-11 05:29:42] [INFO ] Flatten gal took : 6 ms
[2023-03-11 05:29:42] [INFO ] Time to serialize gal into /tmp/CTLFireability1085619648194441633.gal : 2 ms
[2023-03-11 05:29:42] [INFO ] Time to serialize properties into /tmp/CTLFireability15749369794602176421.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1085619648194441633.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15749369794602176421.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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.42204e+06,0.186952,9148,2,1611,5,19745,6,0,343,29102,0


Converting to forward existential form...Done !
original formula: AG((((AG(EF((p113==0))) + AX((p60==1))) + ((p33==0)||(p45==0))) + ((EG((p26==1)) + (((p39==1)&&(p154==1))&&(p88==1))) * (AX((p128==1)) + ...180
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * !(((!(E(TRUE U !(E(TRUE U (p113==0))))) + !(EX(!((p60==1))))) + ((p33==0)||(p45==0))))) *...391
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...378
(forward)formula 0,1,0.842291,25320,1,0,265,115318,247,115,2546,106657,284
FORMULA HealthRecord-PT-09-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 255/255 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 66 transition count 128
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 66 transition count 128
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 138 place count 56 transition count 108
Iterating global reduction 0 with 10 rules applied. Total rules applied 148 place count 56 transition count 108
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 157 place count 56 transition count 99
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 160 place count 53 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 163 place count 53 transition count 90
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 166 place count 50 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 169 place count 50 transition count 84
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 177 place count 50 transition count 76
Applied a total of 177 rules in 5 ms. Remains 50 /130 variables (removed 80) and now considering 76/255 (removed 179) transitions.
[2023-03-11 05:29:43] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
// Phase 1: matrix 73 rows 50 cols
[2023-03-11 05:29:43] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 05:29:43] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-11 05:29:43] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
[2023-03-11 05:29:43] [INFO ] Invariant cache hit.
[2023-03-11 05:29:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:29:43] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2023-03-11 05:29:43] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
[2023-03-11 05:29:43] [INFO ] Invariant cache hit.
[2023-03-11 05:29:43] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/130 places, 76/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 242 ms. Remains : 50/130 places, 76/255 transitions.
[2023-03-11 05:29:43] [INFO ] Flatten gal took : 5 ms
[2023-03-11 05:29:43] [INFO ] Flatten gal took : 4 ms
[2023-03-11 05:29:43] [INFO ] Input system was already deterministic with 76 transitions.
[2023-03-11 05:29:43] [INFO ] Flatten gal took : 5 ms
[2023-03-11 05:29:43] [INFO ] Flatten gal took : 5 ms
[2023-03-11 05:29:43] [INFO ] Time to serialize gal into /tmp/CTLFireability8866679250449977499.gal : 1 ms
[2023-03-11 05:29:43] [INFO ] Time to serialize properties into /tmp/CTLFireability6014801451959564921.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8866679250449977499.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6014801451959564921.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
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,601434,0.18846,9464,2,2003,5,27877,6,0,272,19189,0


Converting to forward existential form...Done !
original formula: EX(EG(AG(((p145==1) + EF((p14==1))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(E(TRUE U !(((p145==1) + E(TRUE U (p14==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, t37, t38, Intersection wi...237
(forward)formula 0,0,1.28847,29812,1,0,145,149422,176,72,1938,109888,182
FORMULA HealthRecord-PT-09-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 255/255 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 77 transition count 150
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 77 transition count 150
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 113 place count 70 transition count 136
Iterating global reduction 0 with 7 rules applied. Total rules applied 120 place count 70 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 69 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 69 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 123 place count 68 transition count 131
Iterating global reduction 0 with 1 rules applied. Total rules applied 124 place count 68 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 127 place count 68 transition count 128
Applied a total of 127 rules in 7 ms. Remains 68 /130 variables (removed 62) and now considering 128/255 (removed 127) transitions.
[2023-03-11 05:29:44] [INFO ] Flow matrix only has 125 transitions (discarded 3 similar events)
// Phase 1: matrix 125 rows 68 cols
[2023-03-11 05:29:44] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 05:29:44] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-11 05:29:44] [INFO ] Flow matrix only has 125 transitions (discarded 3 similar events)
[2023-03-11 05:29:44] [INFO ] Invariant cache hit.
[2023-03-11 05:29:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:29:45] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-11 05:29:45] [INFO ] Flow matrix only has 125 transitions (discarded 3 similar events)
[2023-03-11 05:29:45] [INFO ] Invariant cache hit.
[2023-03-11 05:29:45] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 68/130 places, 128/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 255 ms. Remains : 68/130 places, 128/255 transitions.
[2023-03-11 05:29:45] [INFO ] Flatten gal took : 7 ms
[2023-03-11 05:29:45] [INFO ] Flatten gal took : 7 ms
[2023-03-11 05:29:45] [INFO ] Input system was already deterministic with 128 transitions.
[2023-03-11 05:29:45] [INFO ] Flatten gal took : 7 ms
[2023-03-11 05:29:45] [INFO ] Flatten gal took : 8 ms
[2023-03-11 05:29:45] [INFO ] Time to serialize gal into /tmp/CTLFireability7961347505224781121.gal : 1 ms
[2023-03-11 05:29:45] [INFO ] Time to serialize properties into /tmp/CTLFireability4986810056348938212.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7961347505224781121.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4986810056348938212.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
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.34474e+06,0.378808,14288,2,2035,5,34786,6,0,396,61752,0


Converting to forward existential form...Done !
original formula: EF((((p142==1) * (EG((((p59==1)||(p117==1))&&(p81==0))) + (p151==0))) * (((EG((p59==1)) + AF((p11==1))) + (EX((p48==1)) + ((p36==1)&&(p15...251
=> equivalent forward existential formula: ((([FwdG((FwdU(Init,TRUE) * ((p142==1) * (EG((((p59==1)||(p117==1))&&(p81==0))) + (p151==0)))),(p59==1))] != FAL...711
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...476
Hit Full ! (commute/partial/dont) 125/0/3
(forward)formula 0,1,1.70101,38164,1,0,299,179936,284,119,2965,187658,313
FORMULA HealthRecord-PT-09-CTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 255/255 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 67 transition count 130
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 67 transition count 130
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 136 place count 57 transition count 110
Iterating global reduction 0 with 10 rules applied. Total rules applied 146 place count 57 transition count 110
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 154 place count 57 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 157 place count 54 transition count 93
Iterating global reduction 1 with 3 rules applied. Total rules applied 160 place count 54 transition count 93
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 163 place count 51 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 166 place count 51 transition count 87
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 175 place count 51 transition count 78
Applied a total of 175 rules in 5 ms. Remains 51 /130 variables (removed 79) and now considering 78/255 (removed 177) transitions.
[2023-03-11 05:29:46] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
// Phase 1: matrix 75 rows 51 cols
[2023-03-11 05:29:46] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 05:29:47] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-11 05:29:47] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2023-03-11 05:29:47] [INFO ] Invariant cache hit.
[2023-03-11 05:29:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:29:47] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2023-03-11 05:29:47] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2023-03-11 05:29:47] [INFO ] Invariant cache hit.
[2023-03-11 05:29:47] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/130 places, 78/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 194 ms. Remains : 51/130 places, 78/255 transitions.
[2023-03-11 05:29:47] [INFO ] Flatten gal took : 4 ms
[2023-03-11 05:29:47] [INFO ] Flatten gal took : 5 ms
[2023-03-11 05:29:47] [INFO ] Input system was already deterministic with 78 transitions.
[2023-03-11 05:29:47] [INFO ] Flatten gal took : 5 ms
[2023-03-11 05:29:47] [INFO ] Flatten gal took : 5 ms
[2023-03-11 05:29:47] [INFO ] Time to serialize gal into /tmp/CTLFireability2870737606009791661.gal : 1 ms
[2023-03-11 05:29:47] [INFO ] Time to serialize properties into /tmp/CTLFireability16847838075789750827.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2870737606009791661.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16847838075789750827.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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,799965,0.2086,10000,2,2121,5,31803,6,0,278,21782,0


Converting to forward existential form...Done !
original formula: AG(AF((AF(AX((p86==0))) + AX((p3==0)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((!(EG(!(!(EX(!((p86==0))))))) + !(EX(!((p3==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, t41, t42, Intersection wi...237
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.674953,21720,1,0,163,85661,183,90,2040,79305,202
FORMULA HealthRecord-PT-09-CTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 255/255 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 65 transition count 126
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 65 transition count 126
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 140 place count 55 transition count 106
Iterating global reduction 0 with 10 rules applied. Total rules applied 150 place count 55 transition count 106
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 159 place count 55 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 162 place count 52 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 165 place count 52 transition count 88
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 168 place count 49 transition count 82
Iterating global reduction 1 with 3 rules applied. Total rules applied 171 place count 49 transition count 82
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 180 place count 49 transition count 73
Applied a total of 180 rules in 4 ms. Remains 49 /130 variables (removed 81) and now considering 73/255 (removed 182) transitions.
[2023-03-11 05:29:47] [INFO ] Flow matrix only has 70 transitions (discarded 3 similar events)
// Phase 1: matrix 70 rows 49 cols
[2023-03-11 05:29:47] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 05:29:47] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-11 05:29:47] [INFO ] Flow matrix only has 70 transitions (discarded 3 similar events)
[2023-03-11 05:29:47] [INFO ] Invariant cache hit.
[2023-03-11 05:29:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:29:48] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2023-03-11 05:29:48] [INFO ] Flow matrix only has 70 transitions (discarded 3 similar events)
[2023-03-11 05:29:48] [INFO ] Invariant cache hit.
[2023-03-11 05:29:48] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/130 places, 73/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 203 ms. Remains : 49/130 places, 73/255 transitions.
[2023-03-11 05:29:48] [INFO ] Flatten gal took : 5 ms
[2023-03-11 05:29:48] [INFO ] Flatten gal took : 4 ms
[2023-03-11 05:29:48] [INFO ] Input system was already deterministic with 73 transitions.
[2023-03-11 05:29:48] [INFO ] Flatten gal took : 4 ms
[2023-03-11 05:29:48] [INFO ] Flatten gal took : 4 ms
[2023-03-11 05:29:48] [INFO ] Time to serialize gal into /tmp/CTLFireability17144004489092042621.gal : 2 ms
[2023-03-11 05:29:48] [INFO ] Time to serialize properties into /tmp/CTLFireability2047780348284782670.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17144004489092042621.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2047780348284782670.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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,484794,0.257946,8920,2,2129,5,25928,6,0,265,16460,0


Converting to forward existential form...Done !
original formula: (EF(((p17==1)&&(p154==1))) + AX(FALSE))
=> equivalent forward existential formula: [(EY((Init * !(E(TRUE U ((p17==1)&&(p154==1)))))) * !(FALSE))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, Intersection with reachab...227
(forward)formula 0,1,0.795626,18712,1,0,126,78845,163,64,1884,55163,156
FORMULA HealthRecord-PT-09-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 255/255 transitions.
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 56 place count 74 transition count 144
Iterating global reduction 0 with 56 rules applied. Total rules applied 112 place count 74 transition count 144
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 116 place count 70 transition count 136
Iterating global reduction 0 with 4 rules applied. Total rules applied 120 place count 70 transition count 136
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 123 place count 70 transition count 133
Applied a total of 123 rules in 3 ms. Remains 70 /130 variables (removed 60) and now considering 133/255 (removed 122) transitions.
[2023-03-11 05:29:48] [INFO ] Flow matrix only has 130 transitions (discarded 3 similar events)
// Phase 1: matrix 130 rows 70 cols
[2023-03-11 05:29:48] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 05:29:48] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-11 05:29:48] [INFO ] Flow matrix only has 130 transitions (discarded 3 similar events)
[2023-03-11 05:29:48] [INFO ] Invariant cache hit.
[2023-03-11 05:29:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:29:49] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2023-03-11 05:29:49] [INFO ] Flow matrix only has 130 transitions (discarded 3 similar events)
[2023-03-11 05:29:49] [INFO ] Invariant cache hit.
[2023-03-11 05:29:49] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/130 places, 133/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 241 ms. Remains : 70/130 places, 133/255 transitions.
[2023-03-11 05:29:49] [INFO ] Flatten gal took : 9 ms
[2023-03-11 05:29:49] [INFO ] Flatten gal took : 10 ms
[2023-03-11 05:29:49] [INFO ] Input system was already deterministic with 133 transitions.
[2023-03-11 05:29:49] [INFO ] Flatten gal took : 12 ms
[2023-03-11 05:29:49] [INFO ] Flatten gal took : 9 ms
[2023-03-11 05:29:49] [INFO ] Time to serialize gal into /tmp/CTLFireability17400249448370695881.gal : 3 ms
[2023-03-11 05:29:49] [INFO ] Time to serialize properties into /tmp/CTLFireability16603727832718221294.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17400249448370695881.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16603727832718221294.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
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.09496e+06,0.273378,11192,2,2683,5,28967,6,0,409,37417,0


Converting to forward existential form...Done !
original formula: E(((!(A(((p111==1)&&(p142==1)) U EG(((p111==1)&&(p130==1))))) + !((AG((p82==1)) * ((p67!=1) + A((p79==1) U (p127==1)))))) + (EX(EG((p88==...293
=> equivalent forward existential formula: ([(EY((EY(FwdU(Init,((!(!((E(!(EG(((p111==1)&&(p130==1)))) U (!(((p111==1)&&(p142==1))) * !(EG(((p111==1)&&(p130...864
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...436
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,9.62766,250232,1,0,664,1.55534e+06,331,351,3280,1.41629e+06,747
FORMULA HealthRecord-PT-09-CTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 255/255 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 73 transition count 141
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 73 transition count 141
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 120 place count 67 transition count 129
Iterating global reduction 0 with 6 rules applied. Total rules applied 126 place count 67 transition count 129
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 131 place count 67 transition count 124
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 132 place count 66 transition count 121
Iterating global reduction 1 with 1 rules applied. Total rules applied 133 place count 66 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 134 place count 65 transition count 119
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 65 transition count 119
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 138 place count 65 transition count 116
Applied a total of 138 rules in 4 ms. Remains 65 /130 variables (removed 65) and now considering 116/255 (removed 139) transitions.
[2023-03-11 05:29:58] [INFO ] Flow matrix only has 112 transitions (discarded 4 similar events)
// Phase 1: matrix 112 rows 65 cols
[2023-03-11 05:29:58] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-11 05:29:58] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-11 05:29:58] [INFO ] Flow matrix only has 112 transitions (discarded 4 similar events)
[2023-03-11 05:29:58] [INFO ] Invariant cache hit.
[2023-03-11 05:29:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:29:59] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-11 05:29:59] [INFO ] Flow matrix only has 112 transitions (discarded 4 similar events)
[2023-03-11 05:29:59] [INFO ] Invariant cache hit.
[2023-03-11 05:29:59] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/130 places, 116/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 211 ms. Remains : 65/130 places, 116/255 transitions.
[2023-03-11 05:29:59] [INFO ] Flatten gal took : 8 ms
[2023-03-11 05:29:59] [INFO ] Flatten gal took : 8 ms
[2023-03-11 05:29:59] [INFO ] Input system was already deterministic with 116 transitions.
[2023-03-11 05:29:59] [INFO ] Flatten gal took : 8 ms
[2023-03-11 05:29:59] [INFO ] Flatten gal took : 12 ms
[2023-03-11 05:29:59] [INFO ] Time to serialize gal into /tmp/CTLFireability9541834326750198218.gal : 3 ms
[2023-03-11 05:29:59] [INFO ] Time to serialize properties into /tmp/CTLFireability3848520455578837327.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9541834326750198218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3848520455578837327.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
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.48606e+06,0.263039,10524,2,2286,5,25306,6,0,369,34448,0


Converting to forward existential form...Done !
original formula: E((!(EG((p44==1))) + !((((((((p18==1)&&(p37==1))&&((p56==1)&&(p61==1)))&&(((p66==1)&&(p71==1))&&((p78==1)&&(p85==1))))&&((p111==1)&&(p155...435
=> equivalent forward existential formula: [(FwdU(Init,(!(EG((p44==1))) + !((((((((p18==1)&&(p37==1))&&((p56==1)&&(p61==1)))&&(((p66==1)&&(p71==1))&&((p78=...690
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...415
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,16.7056,350272,1,0,894,1.96327e+06,308,488,2911,2.15136e+06,1056
FORMULA HealthRecord-PT-09-CTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 255/255 transitions.
Discarding 61 places :
Symmetric choice reduction at 0 with 61 rule applications. Total rules 61 place count 69 transition count 134
Iterating global reduction 0 with 61 rules applied. Total rules applied 122 place count 69 transition count 134
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 131 place count 60 transition count 116
Iterating global reduction 0 with 9 rules applied. Total rules applied 140 place count 60 transition count 116
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 146 place count 60 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 148 place count 58 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 150 place count 58 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 151 place count 57 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 152 place count 57 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 154 place count 57 transition count 100
Applied a total of 154 rules in 4 ms. Remains 57 /130 variables (removed 73) and now considering 100/255 (removed 155) transitions.
[2023-03-11 05:30:16] [INFO ] Flow matrix only has 97 transitions (discarded 3 similar events)
// Phase 1: matrix 97 rows 57 cols
[2023-03-11 05:30:16] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 05:30:16] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-11 05:30:16] [INFO ] Flow matrix only has 97 transitions (discarded 3 similar events)
[2023-03-11 05:30:16] [INFO ] Invariant cache hit.
[2023-03-11 05:30:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:30:16] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2023-03-11 05:30:16] [INFO ] Flow matrix only has 97 transitions (discarded 3 similar events)
[2023-03-11 05:30:16] [INFO ] Invariant cache hit.
[2023-03-11 05:30:16] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 57/130 places, 100/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 262 ms. Remains : 57/130 places, 100/255 transitions.
[2023-03-11 05:30:16] [INFO ] Flatten gal took : 6 ms
[2023-03-11 05:30:16] [INFO ] Flatten gal took : 3 ms
[2023-03-11 05:30:16] [INFO ] Input system was already deterministic with 100 transitions.
[2023-03-11 05:30:16] [INFO ] Flatten gal took : 3 ms
[2023-03-11 05:30:16] [INFO ] Flatten gal took : 3 ms
[2023-03-11 05:30:16] [INFO ] Time to serialize gal into /tmp/CTLFireability16917776720003120887.gal : 2 ms
[2023-03-11 05:30:16] [INFO ] Time to serialize properties into /tmp/CTLFireability4044989306305560470.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16917776720003120887.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4044989306305560470.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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.45874e+06,0.154702,8304,2,1969,5,20133,6,0,324,21932,0


Converting to forward existential form...Done !
original formula: !(E(!(EF((AG((p50==1)) * A((p130==1) U (p14==1))))) U (AX(((((p14==1)&&(p25==1))&&(p116!=1))||(p98!=1))) * AX((p129==1)))))
=> equivalent forward existential formula: [((FwdU(Init,!(E(TRUE U (!(E(TRUE U !((p50==1)))) * !((E(!((p14==1)) U (!((p130==1)) * !((p14==1)))) + EG(!((p14...258
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t22, t...348
(forward)formula 0,0,4.29121,121056,1,0,366,695875,235,170,2493,726689,407
FORMULA HealthRecord-PT-09-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 255/255 transitions.
Graph (trivial) has 187 edges and 130 vertex of which 12 / 130 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 59 place count 65 transition count 133
Iterating global reduction 0 with 58 rules applied. Total rules applied 117 place count 65 transition count 133
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 126 place count 56 transition count 115
Iterating global reduction 0 with 9 rules applied. Total rules applied 135 place count 56 transition count 115
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 144 place count 56 transition count 106
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 146 place count 54 transition count 100
Iterating global reduction 1 with 2 rules applied. Total rules applied 148 place count 54 transition count 100
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 150 place count 52 transition count 96
Iterating global reduction 1 with 2 rules applied. Total rules applied 152 place count 52 transition count 96
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 158 place count 52 transition count 90
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 162 place count 52 transition count 86
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 164 place count 51 transition count 85
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 167 place count 48 transition count 82
Applied a total of 167 rules in 22 ms. Remains 48 /130 variables (removed 82) and now considering 82/255 (removed 173) transitions.
[2023-03-11 05:30:20] [INFO ] Flow matrix only has 74 transitions (discarded 8 similar events)
// Phase 1: matrix 74 rows 48 cols
[2023-03-11 05:30:20] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-11 05:30:20] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-11 05:30:20] [INFO ] Flow matrix only has 74 transitions (discarded 8 similar events)
[2023-03-11 05:30:20] [INFO ] Invariant cache hit.
[2023-03-11 05:30:20] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-03-11 05:30:20] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-11 05:30:20] [INFO ] Flow matrix only has 74 transitions (discarded 8 similar events)
[2023-03-11 05:30:20] [INFO ] Invariant cache hit.
[2023-03-11 05:30:20] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 48/130 places, 82/255 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 294 ms. Remains : 48/130 places, 82/255 transitions.
[2023-03-11 05:30:20] [INFO ] Flatten gal took : 3 ms
[2023-03-11 05:30:20] [INFO ] Flatten gal took : 3 ms
[2023-03-11 05:30:20] [INFO ] Input system was already deterministic with 82 transitions.
[2023-03-11 05:30:20] [INFO ] Flatten gal took : 3 ms
[2023-03-11 05:30:20] [INFO ] Flatten gal took : 3 ms
[2023-03-11 05:30:20] [INFO ] Time to serialize gal into /tmp/CTLFireability5745803753567325501.gal : 2 ms
[2023-03-11 05:30:20] [INFO ] Time to serialize properties into /tmp/CTLFireability511644769443466074.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5745803753567325501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability511644769443466074.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
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,282100,0.220032,7628,2,2100,5,17048,6,0,260,18901,0


Converting to forward existential form...Done !
original formula: AF(EG(E((((p24!=1)||(p44!=1))||(p139==1)) U AG(EF((p132==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(E((((p24!=1)||(p44!=1))||(p139==1)) U !(E(TRUE U !(E(TRUE U (p132==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t20, t21...280
(forward)formula 0,0,1.23661,29360,1,0,172,137214,189,79,2018,108952,194
FORMULA HealthRecord-PT-09-CTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 255/255 transitions.
Graph (trivial) has 154 edges and 130 vertex of which 12 / 130 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 55 place count 70 transition count 142
Iterating global reduction 0 with 54 rules applied. Total rules applied 109 place count 70 transition count 142
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 119 place count 60 transition count 122
Iterating global reduction 0 with 10 rules applied. Total rules applied 129 place count 60 transition count 122
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 135 place count 60 transition count 116
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 137 place count 58 transition count 110
Iterating global reduction 1 with 2 rules applied. Total rules applied 139 place count 58 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 141 place count 56 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 143 place count 56 transition count 106
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 149 place count 56 transition count 100
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 153 place count 56 transition count 96
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 159 place count 53 transition count 93
Applied a total of 159 rules in 18 ms. Remains 53 /130 variables (removed 77) and now considering 93/255 (removed 162) transitions.
[2023-03-11 05:30:22] [INFO ] Flow matrix only has 85 transitions (discarded 8 similar events)
// Phase 1: matrix 85 rows 53 cols
[2023-03-11 05:30:22] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 05:30:22] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-11 05:30:22] [INFO ] Flow matrix only has 85 transitions (discarded 8 similar events)
[2023-03-11 05:30:22] [INFO ] Invariant cache hit.
[2023-03-11 05:30:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:30:22] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-11 05:30:22] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-11 05:30:22] [INFO ] Flow matrix only has 85 transitions (discarded 8 similar events)
[2023-03-11 05:30:22] [INFO ] Invariant cache hit.
[2023-03-11 05:30:22] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 53/130 places, 93/255 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 229 ms. Remains : 53/130 places, 93/255 transitions.
[2023-03-11 05:30:22] [INFO ] Flatten gal took : 4 ms
[2023-03-11 05:30:22] [INFO ] Flatten gal took : 7 ms
[2023-03-11 05:30:22] [INFO ] Input system was already deterministic with 93 transitions.
[2023-03-11 05:30:22] [INFO ] Flatten gal took : 3 ms
[2023-03-11 05:30:22] [INFO ] Flatten gal took : 3 ms
[2023-03-11 05:30:22] [INFO ] Time to serialize gal into /tmp/CTLFireability9743045941860330956.gal : 7 ms
[2023-03-11 05:30:22] [INFO ] Time to serialize properties into /tmp/CTLFireability399506927691923854.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9743045941860330956.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability399506927691923854.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
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,967253,0.221805,10340,2,2019,5,27773,6,0,296,33101,0


Converting to forward existential form...Done !
original formula: EF(((A(((p55==1)&&(p154==1)) U (p3==1)) * (p101==1)) * E((AF((p38==1)) + !(((p67==1) + E((p41==1) U (p29==1))))) U A((p54==1) U (p24!=1))...158
=> equivalent forward existential formula: [((FwdU((FwdU(Init,TRUE) * (!((E(!((p3==1)) U (!(((p55==1)&&(p154==1))) * !((p3==1)))) + EG(!((p3==1))))) * (p10...308
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t17, t18, t19, t20, t30...340
(forward)formula 0,1,8.036,208008,1,0,575,1.17031e+06,231,287,2181,1.33982e+06,629
FORMULA HealthRecord-PT-09-CTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 255/255 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 70 transition count 136
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 70 transition count 136
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 128 place count 62 transition count 120
Iterating global reduction 0 with 8 rules applied. Total rules applied 136 place count 62 transition count 120
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 139 place count 62 transition count 117
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 141 place count 60 transition count 111
Iterating global reduction 1 with 2 rules applied. Total rules applied 143 place count 60 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 144 place count 59 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 145 place count 59 transition count 109
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 148 place count 59 transition count 106
Applied a total of 148 rules in 3 ms. Remains 59 /130 variables (removed 71) and now considering 106/255 (removed 149) transitions.
[2023-03-11 05:30:30] [INFO ] Flow matrix only has 103 transitions (discarded 3 similar events)
// Phase 1: matrix 103 rows 59 cols
[2023-03-11 05:30:30] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-11 05:30:30] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-11 05:30:30] [INFO ] Flow matrix only has 103 transitions (discarded 3 similar events)
[2023-03-11 05:30:30] [INFO ] Invariant cache hit.
[2023-03-11 05:30:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:30:30] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2023-03-11 05:30:30] [INFO ] Flow matrix only has 103 transitions (discarded 3 similar events)
[2023-03-11 05:30:30] [INFO ] Invariant cache hit.
[2023-03-11 05:30:30] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 59/130 places, 106/255 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 280 ms. Remains : 59/130 places, 106/255 transitions.
[2023-03-11 05:30:30] [INFO ] Flatten gal took : 4 ms
[2023-03-11 05:30:30] [INFO ] Flatten gal took : 6 ms
[2023-03-11 05:30:30] [INFO ] Input system was already deterministic with 106 transitions.
[2023-03-11 05:30:30] [INFO ] Flatten gal took : 4 ms
[2023-03-11 05:30:30] [INFO ] Flatten gal took : 3 ms
[2023-03-11 05:30:30] [INFO ] Time to serialize gal into /tmp/CTLFireability235314584037079939.gal : 1 ms
[2023-03-11 05:30:30] [INFO ] Time to serialize properties into /tmp/CTLFireability15443007719821334147.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability235314584037079939.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15443007719821334147.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
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.59239e+06,0.187947,9140,2,1521,5,22149,6,0,338,25603,0


Converting to forward existential form...Done !
original formula: EF(!(E(EF(EG((p38==1))) U (((AX((p43==1)) * (((p7!=1)||(p141==1))||(p90==1))) + AF((p138==1))) + (((p17==1)&&(p36==1))&&((p55==1)&&(p150=...164
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(E(TRUE U EG((p38==1))) U (((!(EX(!((p43==1)))) * (((p7!=1)||(p141==1))||(p90==1))) + !(E...234
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...358
(forward)formula 0,1,7.6197,186380,1,0,485,1.13506e+06,248,243,2511,1.103e+06,528
FORMULA HealthRecord-PT-09-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 130/130 places, 255/255 transitions.
Graph (trivial) has 157 edges and 130 vertex of which 12 / 130 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 56 place count 68 transition count 139
Iterating global reduction 0 with 55 rules applied. Total rules applied 111 place count 68 transition count 139
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 121 place count 58 transition count 119
Iterating global reduction 0 with 10 rules applied. Total rules applied 131 place count 58 transition count 119
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 140 place count 58 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 57 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 57 transition count 107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 143 place count 56 transition count 105
Iterating global reduction 1 with 1 rules applied. Total rules applied 144 place count 56 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 146 place count 56 transition count 103
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 150 place count 56 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 152 place count 55 transition count 98
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 155 place count 52 transition count 95
Applied a total of 155 rules in 14 ms. Remains 52 /130 variables (removed 78) and now considering 95/255 (removed 160) transitions.
[2023-03-11 05:30:38] [INFO ] Flow matrix only has 87 transitions (discarded 8 similar events)
// Phase 1: matrix 87 rows 52 cols
[2023-03-11 05:30:38] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 05:30:38] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-11 05:30:38] [INFO ] Flow matrix only has 87 transitions (discarded 8 similar events)
[2023-03-11 05:30:38] [INFO ] Invariant cache hit.
[2023-03-11 05:30:38] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2023-03-11 05:30:38] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-11 05:30:38] [INFO ] Flow matrix only has 87 transitions (discarded 8 similar events)
[2023-03-11 05:30:38] [INFO ] Invariant cache hit.
[2023-03-11 05:30:38] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 52/130 places, 95/255 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 265 ms. Remains : 52/130 places, 95/255 transitions.
[2023-03-11 05:30:38] [INFO ] Flatten gal took : 5 ms
[2023-03-11 05:30:38] [INFO ] Flatten gal took : 5 ms
[2023-03-11 05:30:38] [INFO ] Input system was already deterministic with 95 transitions.
[2023-03-11 05:30:38] [INFO ] Flatten gal took : 5 ms
[2023-03-11 05:30:38] [INFO ] Flatten gal took : 5 ms
[2023-03-11 05:30:38] [INFO ] Time to serialize gal into /tmp/CTLFireability1614927231336779783.gal : 2 ms
[2023-03-11 05:30:38] [INFO ] Time to serialize properties into /tmp/CTLFireability14670262093187544237.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1614927231336779783.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14670262093187544237.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
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,458860,0.196162,9040,2,1497,5,20000,6,0,289,27429,0


Converting to forward existential form...Done !
original formula: EG((EG((p33==1)) + E(E(!(EG((p92==1))) U !(AF((p22==1)))) U A(((EF((p34==1)) + ((p17==1)&&(p154==1))) + (p97==1)) U (p9==1)))))
=> equivalent forward existential formula: [FwdG(Init,(EG((p33==1)) + E(E(!(EG((p92==1))) U !(!(EG(!((p22==1)))))) U !((E(!((p9==1)) U (!(((E(TRUE U (p34==...243
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...390
(forward)formula 0,1,9.62356,248280,1,0,817,1.44618e+06,238,472,2185,1.59073e+06,902
FORMULA HealthRecord-PT-09-CTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2023-03-11 05:30:48] [INFO ] Flatten gal took : 10 ms
[2023-03-11 05:30:48] [INFO ] Flatten gal took : 10 ms
Total runtime 91595 ms.

BK_STOP 1678512649640

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-09"
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-5348"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-09, 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 r197-smll-167840344000298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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