fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r292-tall-162124156400381
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for HealthRecord-PT-16

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
718.092 68780.00 93626.00 251.90 TFFFFFFTFFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r292-tall-162124156400381.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is HealthRecord-PT-16, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156400381
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 14K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 127K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.2K May 11 18:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 11 18:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 11 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 11 15:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 3 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 84K May 12 08:13 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621283450621

Running Version 0
[2021-05-17 20:30:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 20:30:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 20:30:52] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2021-05-17 20:30:52] [INFO ] Transformed 453 places.
[2021-05-17 20:30:52] [INFO ] Transformed 594 transitions.
[2021-05-17 20:30:52] [INFO ] Found NUPN structural information;
[2021-05-17 20:30:52] [INFO ] Parsed PT model containing 453 places and 594 transitions in 107 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 20:30:52] [INFO ] Initial state test concluded for 5 properties.
FORMULA HealthRecord-PT-16-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 453 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 453/453 places, 594/594 transitions.
Discarding 82 places :
Symmetric choice reduction at 0 with 82 rule applications. Total rules 82 place count 371 transition count 498
Iterating global reduction 0 with 82 rules applied. Total rules applied 164 place count 371 transition count 498
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 201 place count 334 transition count 450
Iterating global reduction 0 with 37 rules applied. Total rules applied 238 place count 334 transition count 450
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 243 place count 334 transition count 445
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 259 place count 318 transition count 415
Iterating global reduction 1 with 16 rules applied. Total rules applied 275 place count 318 transition count 415
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 283 place count 310 transition count 401
Iterating global reduction 1 with 8 rules applied. Total rules applied 291 place count 310 transition count 401
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 292 place count 309 transition count 398
Iterating global reduction 1 with 1 rules applied. Total rules applied 293 place count 309 transition count 398
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 294 place count 308 transition count 397
Iterating global reduction 1 with 1 rules applied. Total rules applied 295 place count 308 transition count 397
Applied a total of 295 rules in 125 ms. Remains 308 /453 variables (removed 145) and now considering 397/594 (removed 197) transitions.
// Phase 1: matrix 397 rows 308 cols
[2021-05-17 20:30:52] [INFO ] Computed 14 place invariants in 21 ms
[2021-05-17 20:30:52] [INFO ] Implicit Places using invariants in 217 ms returned []
// Phase 1: matrix 397 rows 308 cols
[2021-05-17 20:30:53] [INFO ] Computed 14 place invariants in 5 ms
[2021-05-17 20:30:53] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
// Phase 1: matrix 397 rows 308 cols
[2021-05-17 20:30:53] [INFO ] Computed 14 place invariants in 3 ms
[2021-05-17 20:30:53] [INFO ] Dead Transitions using invariants and state equation in 203 ms returned []
Finished structural reductions, in 1 iterations. Remains : 308/453 places, 397/594 transitions.
[2021-05-17 20:30:53] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 20:30:53] [INFO ] Flatten gal took : 59 ms
FORMULA HealthRecord-PT-16-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 20:30:53] [INFO ] Flatten gal took : 22 ms
[2021-05-17 20:30:53] [INFO ] Input system was already deterministic with 397 transitions.
Incomplete random walk after 100000 steps, including 70 resets, run finished after 360 ms. (steps per millisecond=277 ) properties (out of 22) seen :11
Running SMT prover for 11 properties.
// Phase 1: matrix 397 rows 308 cols
[2021-05-17 20:30:54] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-17 20:30:54] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-17 20:30:54] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 20:30:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:54] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2021-05-17 20:30:54] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 4 ms to minimize.
[2021-05-17 20:30:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2021-05-17 20:30:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:30:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-17 20:30:54] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 20:30:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:54] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2021-05-17 20:30:54] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 2 ms to minimize.
[2021-05-17 20:30:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2021-05-17 20:30:54] [INFO ] Computed and/alt/rep : 391/610/391 causal constraints (skipped 5 transitions) in 21 ms.
[2021-05-17 20:30:55] [INFO ] Added : 263 causal constraints over 53 iterations in 1190 ms. Result :sat
[2021-05-17 20:30:55] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-17 20:30:55] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 20:30:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:56] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2021-05-17 20:30:56] [INFO ] Computed and/alt/rep : 391/610/391 causal constraints (skipped 5 transitions) in 24 ms.
[2021-05-17 20:30:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:30:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-17 20:30:56] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 20:30:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:56] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2021-05-17 20:30:56] [INFO ] Computed and/alt/rep : 391/610/391 causal constraints (skipped 5 transitions) in 25 ms.
[2021-05-17 20:30:57] [INFO ] Deduced a trap composed of 51 places in 83 ms of which 1 ms to minimize.
[2021-05-17 20:30:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2021-05-17 20:30:57] [INFO ] Added : 291 causal constraints over 60 iterations in 1544 ms. Result :sat
[2021-05-17 20:30:58] [INFO ] [Real]Absence check using 8 positive place invariants in 11 ms returned sat
[2021-05-17 20:30:58] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 20:30:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:58] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2021-05-17 20:30:58] [INFO ] Computed and/alt/rep : 391/610/391 causal constraints (skipped 5 transitions) in 22 ms.
[2021-05-17 20:30:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:30:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-17 20:30:58] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 20:30:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:58] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2021-05-17 20:30:58] [INFO ] Computed and/alt/rep : 391/610/391 causal constraints (skipped 5 transitions) in 38 ms.
[2021-05-17 20:30:59] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 3 ms to minimize.
[2021-05-17 20:30:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2021-05-17 20:30:59] [INFO ] Added : 288 causal constraints over 59 iterations in 1370 ms. Result :sat
[2021-05-17 20:30:59] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-17 20:30:59] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 6 ms returned sat
[2021-05-17 20:30:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:30:59] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2021-05-17 20:30:59] [INFO ] Computed and/alt/rep : 391/610/391 causal constraints (skipped 5 transitions) in 25 ms.
[2021-05-17 20:31:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:31:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2021-05-17 20:31:00] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 20:31:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:31:00] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2021-05-17 20:31:00] [INFO ] Computed and/alt/rep : 391/610/391 causal constraints (skipped 5 transitions) in 21 ms.
[2021-05-17 20:31:01] [INFO ] Added : 286 causal constraints over 58 iterations in 1235 ms. Result :sat
[2021-05-17 20:31:01] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-17 20:31:01] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 20:31:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:31:01] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2021-05-17 20:31:01] [INFO ] Computed and/alt/rep : 391/610/391 causal constraints (skipped 5 transitions) in 22 ms.
[2021-05-17 20:31:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:31:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-17 20:31:01] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-17 20:31:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:31:01] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2021-05-17 20:31:01] [INFO ] Computed and/alt/rep : 391/610/391 causal constraints (skipped 5 transitions) in 25 ms.
[2021-05-17 20:31:03] [INFO ] Added : 294 causal constraints over 59 iterations in 1260 ms. Result :sat
[2021-05-17 20:31:03] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-17 20:31:03] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 20:31:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:31:03] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2021-05-17 20:31:03] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2021-05-17 20:31:03] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 0 ms to minimize.
[2021-05-17 20:31:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2021-05-17 20:31:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:31:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-17 20:31:03] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 3 ms returned sat
[2021-05-17 20:31:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:31:03] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2021-05-17 20:31:03] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 1 ms to minimize.
[2021-05-17 20:31:03] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2021-05-17 20:31:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 148 ms
[2021-05-17 20:31:03] [INFO ] Computed and/alt/rep : 391/610/391 causal constraints (skipped 5 transitions) in 22 ms.
[2021-05-17 20:31:05] [INFO ] Added : 294 causal constraints over 60 iterations in 1256 ms. Result :sat
[2021-05-17 20:31:05] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-17 20:31:05] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 20:31:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:31:05] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2021-05-17 20:31:05] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 0 ms to minimize.
[2021-05-17 20:31:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2021-05-17 20:31:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:31:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-17 20:31:05] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 20:31:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:31:05] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2021-05-17 20:31:05] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 0 ms to minimize.
[2021-05-17 20:31:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2021-05-17 20:31:05] [INFO ] Computed and/alt/rep : 391/610/391 causal constraints (skipped 5 transitions) in 26 ms.
[2021-05-17 20:31:06] [INFO ] Added : 307 causal constraints over 62 iterations in 1404 ms. Result :sat
[2021-05-17 20:31:06] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-17 20:31:06] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 20:31:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:31:07] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2021-05-17 20:31:07] [INFO ] Computed and/alt/rep : 391/610/391 causal constraints (skipped 5 transitions) in 35 ms.
[2021-05-17 20:31:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:31:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-17 20:31:07] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 20:31:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:31:07] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2021-05-17 20:31:07] [INFO ] Computed and/alt/rep : 391/610/391 causal constraints (skipped 5 transitions) in 19 ms.
[2021-05-17 20:31:08] [INFO ] Deduced a trap composed of 59 places in 65 ms of which 0 ms to minimize.
[2021-05-17 20:31:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 107 ms
[2021-05-17 20:31:08] [INFO ] Added : 281 causal constraints over 58 iterations in 1343 ms. Result :sat
[2021-05-17 20:31:08] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2021-05-17 20:31:08] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 20:31:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:31:08] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2021-05-17 20:31:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:31:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-17 20:31:08] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 20:31:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:31:08] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2021-05-17 20:31:08] [INFO ] Computed and/alt/rep : 391/610/391 causal constraints (skipped 5 transitions) in 20 ms.
[2021-05-17 20:31:09] [INFO ] Added : 250 causal constraints over 50 iterations in 970 ms. Result :sat
[2021-05-17 20:31:09] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-17 20:31:09] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 20:31:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:31:10] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2021-05-17 20:31:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:31:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-17 20:31:10] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 20:31:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:31:10] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2021-05-17 20:31:10] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 0 ms to minimize.
[2021-05-17 20:31:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2021-05-17 20:31:10] [INFO ] Computed and/alt/rep : 391/610/391 causal constraints (skipped 5 transitions) in 28 ms.
[2021-05-17 20:31:11] [INFO ] Added : 271 causal constraints over 55 iterations in 1134 ms. Result :sat
[2021-05-17 20:31:11] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-17 20:31:11] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 20:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:31:11] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2021-05-17 20:31:11] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 1 ms to minimize.
[2021-05-17 20:31:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2021-05-17 20:31:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:31:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2021-05-17 20:31:11] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 4 ms returned sat
[2021-05-17 20:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:31:11] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2021-05-17 20:31:11] [INFO ] Deduced a trap composed of 74 places in 64 ms of which 0 ms to minimize.
[2021-05-17 20:31:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2021-05-17 20:31:11] [INFO ] Computed and/alt/rep : 391/610/391 causal constraints (skipped 5 transitions) in 20 ms.
[2021-05-17 20:31:12] [INFO ] Added : 250 causal constraints over 51 iterations in 1021 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F((G(F(p1))&&((p2&&G(F(!p0)))||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 308/308 places, 397/397 transitions.
Graph (trivial) has 339 edges and 308 vertex of which 43 / 308 are part of one of the 17 SCC in 3 ms
Free SCC test removed 26 places
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 119 place count 281 transition count 250
Reduce places removed 118 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 129 rules applied. Total rules applied 248 place count 163 transition count 239
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 255 place count 157 transition count 238
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 3 with 3 rules applied. Total rules applied 258 place count 156 transition count 236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 259 place count 155 transition count 236
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 259 place count 155 transition count 232
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 267 place count 151 transition count 232
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 286 place count 132 transition count 201
Iterating global reduction 5 with 19 rules applied. Total rules applied 305 place count 132 transition count 201
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 4 rules applied. Total rules applied 309 place count 132 transition count 197
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 313 place count 128 transition count 197
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 322 place count 119 transition count 183
Iterating global reduction 7 with 9 rules applied. Total rules applied 331 place count 119 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 333 place count 119 transition count 181
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 335 place count 117 transition count 177
Iterating global reduction 8 with 2 rules applied. Total rules applied 337 place count 117 transition count 177
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 339 place count 115 transition count 174
Iterating global reduction 8 with 2 rules applied. Total rules applied 341 place count 115 transition count 174
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 342 place count 114 transition count 172
Iterating global reduction 8 with 1 rules applied. Total rules applied 343 place count 114 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 344 place count 114 transition count 171
Performed 45 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 9 with 90 rules applied. Total rules applied 434 place count 69 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 435 place count 69 transition count 122
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 438 place count 66 transition count 116
Iterating global reduction 10 with 3 rules applied. Total rules applied 441 place count 66 transition count 116
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 442 place count 65 transition count 112
Iterating global reduction 10 with 1 rules applied. Total rules applied 443 place count 65 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 444 place count 65 transition count 111
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 11 with 12 rules applied. Total rules applied 456 place count 59 transition count 153
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 457 place count 58 transition count 151
Iterating global reduction 11 with 1 rules applied. Total rules applied 458 place count 58 transition count 151
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 11 with 16 rules applied. Total rules applied 474 place count 58 transition count 135
Applied a total of 474 rules in 72 ms. Remains 58 /308 variables (removed 250) and now considering 135/397 (removed 262) transitions.
[2021-05-17 20:31:13] [INFO ] Flow matrix only has 127 transitions (discarded 8 similar events)
// Phase 1: matrix 127 rows 58 cols
[2021-05-17 20:31:13] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-17 20:31:13] [INFO ] Implicit Places using invariants in 33 ms returned []
[2021-05-17 20:31:13] [INFO ] Flow matrix only has 127 transitions (discarded 8 similar events)
// Phase 1: matrix 127 rows 58 cols
[2021-05-17 20:31:13] [INFO ] Computed 7 place invariants in 2 ms
[2021-05-17 20:31:13] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-17 20:31:13] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2021-05-17 20:31:13] [INFO ] Redundant transitions in 3 ms returned []
[2021-05-17 20:31:13] [INFO ] Flow matrix only has 127 transitions (discarded 8 similar events)
// Phase 1: matrix 127 rows 58 cols
[2021-05-17 20:31:13] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 20:31:13] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/308 places, 135/397 transitions.
Stuttering acceptance computed with spot in 364 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0)), false, (AND p0 (NOT p2)), (AND (NOT p2) (NOT p0)), (AND p0 (NOT p2))]
Running random walk in product with property : HealthRecord-PT-16-01 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}, { cond=(AND p0 p2), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 3}, { cond=(AND p0 p2), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 7}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=8 dest: 8}, { cond=(AND p0 p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s10 1), p1:(NEQ s39 1), p2:(NEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 9354 reset in 331 ms.
Product exploration explored 100000 steps with 9294 reset in 220 ms.
Knowledge obtained : [(NOT p0), p1, p2]
Stuttering acceptance computed with spot in 249 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0)), false, (AND p0 (NOT p2)), (AND (NOT p2) (NOT p0)), (AND p0 (NOT p2))]
Stuttering criterion allowed to conclude after 64085 steps with 5993 reset in 112 ms.
FORMULA HealthRecord-PT-16-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-01 finished in 1663 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X((p1||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 308/308 places, 397/397 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 300 transition count 385
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 300 transition count 385
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 295 transition count 377
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 295 transition count 377
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 292 transition count 371
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 292 transition count 371
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 289 transition count 367
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 289 transition count 367
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 287 transition count 364
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 287 transition count 364
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 286 transition count 363
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 286 transition count 363
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 285 transition count 362
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 285 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 285 transition count 361
Applied a total of 47 rules in 46 ms. Remains 285 /308 variables (removed 23) and now considering 361/397 (removed 36) transitions.
// Phase 1: matrix 361 rows 285 cols
[2021-05-17 20:31:14] [INFO ] Computed 14 place invariants in 3 ms
[2021-05-17 20:31:14] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 361 rows 285 cols
[2021-05-17 20:31:14] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-17 20:31:14] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
// Phase 1: matrix 361 rows 285 cols
[2021-05-17 20:31:14] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-17 20:31:15] [INFO ] Dead Transitions using invariants and state equation in 149 ms returned []
Finished structural reductions, in 1 iterations. Remains : 285/308 places, 361/397 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : HealthRecord-PT-16-02 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s282 1) (EQ s209 1)), p1:(EQ s282 1), p2:(EQ s138 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-16-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-02 finished in 546 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F((G(p0)||(p0&&G(F(p1))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 308 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 308/308 places, 397/397 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 300 transition count 385
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 300 transition count 385
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 296 transition count 379
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 296 transition count 379
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 293 transition count 373
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 293 transition count 373
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 290 transition count 369
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 290 transition count 369
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 287 transition count 364
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 287 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 287 transition count 363
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 286 transition count 362
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 286 transition count 362
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 285 transition count 361
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 285 transition count 361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 285 transition count 360
Applied a total of 48 rules in 48 ms. Remains 285 /308 variables (removed 23) and now considering 360/397 (removed 37) transitions.
// Phase 1: matrix 360 rows 285 cols
[2021-05-17 20:31:15] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-17 20:31:15] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 360 rows 285 cols
[2021-05-17 20:31:15] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-17 20:31:15] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
// Phase 1: matrix 360 rows 285 cols
[2021-05-17 20:31:15] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-17 20:31:15] [INFO ] Dead Transitions using invariants and state equation in 144 ms returned []
Finished structural reductions, in 1 iterations. Remains : 285/308 places, 360/397 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-16-05 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p1:(NEQ s209 1), p0:(NEQ s80 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 11 reset in 128 ms.
Product exploration explored 100000 steps with 68 reset in 134 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 58 reset in 123 ms.
Product exploration explored 100000 steps with 142 reset in 126 ms.
Applying partial POR strategy [true, true, true, true, false, false]
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 285 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 285/285 places, 360/360 transitions.
Graph (trivial) has 313 edges and 285 vertex of which 40 / 285 are part of one of the 17 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 112 rules applied. Total rules applied 113 place count 262 transition count 335
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 7 rules applied. Total rules applied 120 place count 262 transition count 329
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 120 place count 262 transition count 329
Deduced a syphon composed of 120 places in 0 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 127 place count 262 transition count 329
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 205 place count 184 transition count 249
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 283 place count 184 transition count 249
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 285 place count 182 transition count 247
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 287 place count 182 transition count 247
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 288 place count 182 transition count 246
Performed 51 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 3 with 51 rules applied. Total rules applied 339 place count 182 transition count 273
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 342 place count 182 transition count 270
Discarding 39 places :
Symmetric choice reduction at 4 with 39 rule applications. Total rules 381 place count 143 transition count 220
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 4 with 39 rules applied. Total rules applied 420 place count 143 transition count 220
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 424 place count 139 transition count 210
Deduced a syphon composed of 65 places in 1 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 428 place count 139 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 429 place count 139 transition count 209
Performed 16 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 5 with 16 rules applied. Total rules applied 445 place count 139 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 446 place count 139 transition count 343
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 465 place count 120 transition count 291
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 6 with 19 rules applied. Total rules applied 484 place count 120 transition count 291
Deduced a syphon composed of 62 places in 0 ms
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 6 with 16 rules applied. Total rules applied 500 place count 120 transition count 275
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 506 place count 114 transition count 257
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 6 with 6 rules applied. Total rules applied 512 place count 114 transition count 257
Deduced a syphon composed of 57 places in 0 ms
Applied a total of 512 rules in 60 ms. Remains 114 /285 variables (removed 171) and now considering 257/360 (removed 103) transitions.
[2021-05-17 20:31:16] [INFO ] Redundant transitions in 10 ms returned []
[2021-05-17 20:31:16] [INFO ] Flow matrix only has 245 transitions (discarded 12 similar events)
// Phase 1: matrix 245 rows 114 cols
[2021-05-17 20:31:16] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 20:31:16] [INFO ] Dead Transitions using invariants and state equation in 110 ms returned []
Finished structural reductions, in 1 iterations. Remains : 114/285 places, 257/360 transitions.
Product exploration explored 100000 steps with 1390 reset in 296 ms.
Product exploration explored 100000 steps with 376 reset in 108 ms.
[2021-05-17 20:31:17] [INFO ] Flatten gal took : 17 ms
[2021-05-17 20:31:17] [INFO ] Flatten gal took : 15 ms
[2021-05-17 20:31:17] [INFO ] Time to serialize gal into /tmp/LTL3068533984498199173.gal : 9 ms
[2021-05-17 20:31:17] [INFO ] Time to serialize properties into /tmp/LTL13280712756793865119.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL3068533984498199173.gal, -t, CGAL, -LTL, /tmp/LTL13280712756793865119.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3068533984498199173.gal -t CGAL -LTL /tmp/LTL13280712756793865119.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("(p133!=1)"))||(("(p133!=1)")&&(G(F("(p303!=1)")))))))))
Formula 0 simplified : !XXF(G"(p133!=1)" | ("(p133!=1)" & GF"(p303!=1)"))
Detected timeout of ITS tools.
[2021-05-17 20:31:32] [INFO ] Flatten gal took : 33 ms
[2021-05-17 20:31:32] [INFO ] Applying decomposition
[2021-05-17 20:31:32] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14800940537674762495.txt, -o, /tmp/graph14800940537674762495.bin, -w, /tmp/graph14800940537674762495.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14800940537674762495.bin, -l, -1, -v, -w, /tmp/graph14800940537674762495.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:31:32] [INFO ] Decomposing Gal with order
[2021-05-17 20:31:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:31:32] [INFO ] Removed a total of 111 redundant transitions.
[2021-05-17 20:31:32] [INFO ] Flatten gal took : 53 ms
[2021-05-17 20:31:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 10 ms.
[2021-05-17 20:31:32] [INFO ] Time to serialize gal into /tmp/LTL9433712649665887486.gal : 7 ms
[2021-05-17 20:31:32] [INFO ] Time to serialize properties into /tmp/LTL2978596189500460501.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9433712649665887486.gal, -t, CGAL, -LTL, /tmp/LTL2978596189500460501.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9433712649665887486.gal -t CGAL -LTL /tmp/LTL2978596189500460501.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("(i5.i0.u31.p133!=1)"))||(("(i5.i0.u31.p133!=1)")&&(G(F("(i17.u83.p303!=1)")))))))))
Formula 0 simplified : !XXF(G"(i5.i0.u31.p133!=1)" | ("(i5.i0.u31.p133!=1)" & GF"(i17.u83.p303!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t13, t183, t217, t337, t338, t339, t340, t341, t353, i2.i0.t288, i2.i0.t292, i2.i0.t304, i2.i0.t306, i2.i0.t308, i2.i0.t326, i2.i0.u4.t293, i2.i0.u4.t300, i2.i0.u4.t301, i2.i0.u4.t333, i2.i0.u8.t302, i2.i0.u8.t303, i2.i0.u8.t305, i2.i0.u8.t307, i2.i0.u11.t327, i2.i0.u12.t331, i5.t266, i5.t262, i5.t250, i5.i3.t258, i5.i3.t267, i5.i3.t274, i5.i3.u24.t259, i5.i3.u30.t273, i7.t234, i7.t230, i7.i1.t225, i7.i1.t235, i7.i1.t242, i7.i1.u39.t226, i7.i1.u43.t241, i8.t207, i8.t200, i8.t199, i8.t195, i8.t191, i8.u50.t192, i8.u56.t206, i10.t167, i10.t153, i10.i0.t159, i10.i0.t162, i10.i0.u61.t166, i10.i0.u67.t158, i10.i2.t174, i10.i2.u68.t150, i15.t144, i15.t143, i15.t137, i15.i0.t129, i15.i0.t132, i15.i0.u74.t128, i15.i0.u75.t136, i15.i3.u80.t120, i17.t107, i17.t105, i17.t104, i17.t99, i17.t90, i17.t85, i17.t83, i17.u83.t100, i17.u89.t82, i21.t61, i21.t58, i21.t40, i21.t34, i21.t28, i21.t25, i21.t23, i21.t21, i21.t18, i21.t15, i21.t14, i21.u99.t33, i21.u101.t51, i21.u109.t30, i21.u109.t31, i21.u109.t35, i21.u109.t36, i21.u109.t39, i21.u109.t46, i21.u109.t47, i21.u109.t59, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/261/93/354
Computing Next relation with stutter on 146429 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
671 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.74422,168828,1,0,306163,911,4815,501904,402,2419,579963
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-16-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property HealthRecord-PT-16-05 finished in 25226 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 308/308 places, 397/397 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 299 transition count 383
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 299 transition count 383
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 294 transition count 375
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 294 transition count 375
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 291 transition count 369
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 291 transition count 369
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 288 transition count 365
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 288 transition count 365
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 285 transition count 360
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 285 transition count 360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 285 transition count 359
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 284 transition count 358
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 284 transition count 358
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 283 transition count 357
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 283 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 283 transition count 356
Applied a total of 52 rules in 44 ms. Remains 283 /308 variables (removed 25) and now considering 356/397 (removed 41) transitions.
// Phase 1: matrix 356 rows 283 cols
[2021-05-17 20:31:40] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:31:40] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 356 rows 283 cols
[2021-05-17 20:31:40] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:31:40] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
// Phase 1: matrix 356 rows 283 cols
[2021-05-17 20:31:40] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:31:40] [INFO ] Dead Transitions using invariants and state equation in 168 ms returned []
Finished structural reductions, in 1 iterations. Remains : 283/308 places, 356/397 transitions.
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-16-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-16-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-06 finished in 519 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(((p0&&X(p1))||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 308 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 308/308 places, 397/397 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 300 transition count 384
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 300 transition count 384
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 296 transition count 378
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 296 transition count 378
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 294 transition count 374
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 294 transition count 374
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 292 transition count 371
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 292 transition count 371
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 290 transition count 368
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 290 transition count 368
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 290 transition count 367
Applied a total of 37 rules in 19 ms. Remains 290 /308 variables (removed 18) and now considering 367/397 (removed 30) transitions.
// Phase 1: matrix 367 rows 290 cols
[2021-05-17 20:31:40] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-17 20:31:41] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 367 rows 290 cols
[2021-05-17 20:31:41] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:31:41] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
// Phase 1: matrix 367 rows 290 cols
[2021-05-17 20:31:41] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-17 20:31:41] [INFO ] Dead Transitions using invariants and state equation in 154 ms returned []
Finished structural reductions, in 1 iterations. Remains : 290/308 places, 367/397 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-16-07 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(NEQ s213 1), p1:(OR (NEQ s213 1) (NEQ s116 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 271 ms.
Product exploration explored 100000 steps with 20000 reset in 226 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 20000 reset in 162 ms.
Product exploration explored 100000 steps with 20000 reset in 173 ms.
[2021-05-17 20:31:42] [INFO ] Flatten gal took : 30 ms
[2021-05-17 20:31:42] [INFO ] Flatten gal took : 11 ms
[2021-05-17 20:31:42] [INFO ] Time to serialize gal into /tmp/LTL2269800108041621793.gal : 2 ms
[2021-05-17 20:31:42] [INFO ] Time to serialize properties into /tmp/LTL5967013585049464968.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2269800108041621793.gal, -t, CGAL, -LTL, /tmp/LTL5967013585049464968.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2269800108041621793.gal -t CGAL -LTL /tmp/LTL5967013585049464968.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F((G("((p287!=1)||(p171!=1))"))||(("(p287!=1)")&&(X("((p287!=1)||(p171!=1))")))))))))
Formula 0 simplified : !XXXF(G"((p287!=1)||(p171!=1))" | ("(p287!=1)" & X"((p287!=1)||(p171!=1))"))
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t40, t46, t47, t51, t57, t58, t59, t61, t82, t83, t85, t90, t101, t103, t104, t107, t120, t128, t129, t132, t136, t137, t143, t144, t150, t158, t159, t162, t166, t167, t173, t174, t183, t191, t192, t195, t199, t200, t206, t207, t217, t225, t226, t230, t234, t235, t241, t242, t250, t258, t259, t262, t266, t267, t273, t274, t288, t292, t293, t299, t300, t301, t302, t303, t304, t305, t306, t308, t326, t327, t331, t333, t337, t338, t339, t340, t341, t353, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/274/93/367
Computing Next relation with stutter on 178173 deadlock states
5 unique states visited
0 strongly connected components in search stack
4 transitions explored
5 items max in DFS search stack
1270 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.7315,314368,1,0,592,860749,769,329,8352,1.17168e+06,765
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HealthRecord-PT-16-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property HealthRecord-PT-16-07 finished in 15330 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 308/308 places, 397/397 transitions.
Graph (trivial) has 345 edges and 308 vertex of which 46 / 308 are part of one of the 17 SCC in 1 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 278 transition count 244
Reduce places removed 120 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 133 rules applied. Total rules applied 254 place count 158 transition count 231
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 261 place count 151 transition count 231
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 261 place count 151 transition count 227
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 269 place count 147 transition count 227
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 289 place count 127 transition count 194
Iterating global reduction 3 with 20 rules applied. Total rules applied 309 place count 127 transition count 194
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 314 place count 127 transition count 189
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 319 place count 122 transition count 189
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 328 place count 113 transition count 174
Iterating global reduction 5 with 9 rules applied. Total rules applied 337 place count 113 transition count 174
Ensure Unique test 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 5 with 3 rules applied. Total rules applied 340 place count 113 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 341 place count 112 transition count 171
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 343 place count 110 transition count 167
Iterating global reduction 7 with 2 rules applied. Total rules applied 345 place count 110 transition count 167
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 346 place count 109 transition count 166
Iterating global reduction 7 with 1 rules applied. Total rules applied 347 place count 109 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 348 place count 109 transition count 165
Performed 44 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 8 with 88 rules applied. Total rules applied 436 place count 65 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 437 place count 65 transition count 117
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 439 place count 63 transition count 113
Iterating global reduction 9 with 2 rules applied. Total rules applied 441 place count 63 transition count 113
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 442 place count 62 transition count 109
Iterating global reduction 9 with 1 rules applied. Total rules applied 443 place count 62 transition count 109
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 451 place count 58 transition count 142
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 453 place count 56 transition count 138
Iterating global reduction 9 with 2 rules applied. Total rules applied 455 place count 56 transition count 138
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 456 place count 55 transition count 134
Iterating global reduction 9 with 1 rules applied. Total rules applied 457 place count 55 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 459 place count 55 transition count 132
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 10 with 15 rules applied. Total rules applied 474 place count 55 transition count 117
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 475 place count 54 transition count 114
Iterating global reduction 10 with 1 rules applied. Total rules applied 476 place count 54 transition count 114
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 477 place count 53 transition count 112
Iterating global reduction 10 with 1 rules applied. Total rules applied 478 place count 53 transition count 112
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 479 place count 53 transition count 111
Applied a total of 479 rules in 36 ms. Remains 53 /308 variables (removed 255) and now considering 111/397 (removed 286) transitions.
[2021-05-17 20:31:56] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
// Phase 1: matrix 103 rows 53 cols
[2021-05-17 20:31:56] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 20:31:56] [INFO ] Implicit Places using invariants in 61 ms returned []
[2021-05-17 20:31:56] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
// Phase 1: matrix 103 rows 53 cols
[2021-05-17 20:31:56] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 20:31:56] [INFO ] State equation strengthened by 12 read => feed constraints.
[2021-05-17 20:31:56] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2021-05-17 20:31:56] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-17 20:31:56] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
// Phase 1: matrix 103 rows 53 cols
[2021-05-17 20:31:56] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 20:31:56] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/308 places, 111/397 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-16-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s42 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-16-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-09 finished in 260 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||(p0&&F(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 308 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 308/308 places, 397/397 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 299 transition count 383
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 299 transition count 383
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 294 transition count 375
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 294 transition count 375
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 291 transition count 369
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 291 transition count 369
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 288 transition count 365
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 288 transition count 365
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 285 transition count 360
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 285 transition count 360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 285 transition count 359
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 284 transition count 358
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 284 transition count 358
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 283 transition count 357
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 283 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 283 transition count 356
Applied a total of 52 rules in 27 ms. Remains 283 /308 variables (removed 25) and now considering 356/397 (removed 41) transitions.
// Phase 1: matrix 356 rows 283 cols
[2021-05-17 20:31:56] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:31:56] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 356 rows 283 cols
[2021-05-17 20:31:56] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:31:56] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
// Phase 1: matrix 356 rows 283 cols
[2021-05-17 20:31:56] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:31:56] [INFO ] Dead Transitions using invariants and state equation in 161 ms returned []
Finished structural reductions, in 1 iterations. Remains : 283/308 places, 356/397 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-16-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s165 1), p1:(NEQ s136 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 8 reset in 118 ms.
Stack based approach found an accepted trace after 9258 steps with 89 reset with depth 96 and stack size 96 in 20 ms.
FORMULA HealthRecord-PT-16-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-10 finished in 663 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 308 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 308/308 places, 397/397 transitions.
Graph (trivial) has 344 edges and 308 vertex of which 46 / 308 are part of one of the 17 SCC in 1 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 278 transition count 245
Reduce places removed 119 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 132 rules applied. Total rules applied 252 place count 159 transition count 232
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 259 place count 152 transition count 232
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 259 place count 152 transition count 228
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 267 place count 148 transition count 228
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 287 place count 128 transition count 195
Iterating global reduction 3 with 20 rules applied. Total rules applied 307 place count 128 transition count 195
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 312 place count 128 transition count 190
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 317 place count 123 transition count 190
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 326 place count 114 transition count 175
Iterating global reduction 5 with 9 rules applied. Total rules applied 335 place count 114 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 5 with 2 rules applied. Total rules applied 337 place count 114 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 338 place count 113 transition count 173
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 341 place count 110 transition count 167
Iterating global reduction 7 with 3 rules applied. Total rules applied 344 place count 110 transition count 167
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 346 place count 108 transition count 164
Iterating global reduction 7 with 2 rules applied. Total rules applied 348 place count 108 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 349 place count 108 transition count 163
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 350 place count 107 transition count 161
Iterating global reduction 8 with 1 rules applied. Total rules applied 351 place count 107 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 352 place count 107 transition count 160
Performed 43 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 9 with 86 rules applied. Total rules applied 438 place count 64 transition count 113
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 440 place count 62 transition count 109
Iterating global reduction 9 with 2 rules applied. Total rules applied 442 place count 62 transition count 109
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 444 place count 60 transition count 101
Iterating global reduction 9 with 2 rules applied. Total rules applied 446 place count 60 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 447 place count 60 transition count 100
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 455 place count 56 transition count 130
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 456 place count 55 transition count 128
Iterating global reduction 10 with 1 rules applied. Total rules applied 457 place count 55 transition count 128
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 10 with 14 rules applied. Total rules applied 471 place count 55 transition count 114
Applied a total of 471 rules in 27 ms. Remains 55 /308 variables (removed 253) and now considering 114/397 (removed 283) transitions.
[2021-05-17 20:31:57] [INFO ] Flow matrix only has 106 transitions (discarded 8 similar events)
// Phase 1: matrix 106 rows 55 cols
[2021-05-17 20:31:57] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 20:31:57] [INFO ] Implicit Places using invariants in 24 ms returned []
[2021-05-17 20:31:57] [INFO ] Flow matrix only has 106 transitions (discarded 8 similar events)
// Phase 1: matrix 106 rows 55 cols
[2021-05-17 20:31:57] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 20:31:57] [INFO ] State equation strengthened by 11 read => feed constraints.
[2021-05-17 20:31:57] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2021-05-17 20:31:57] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-17 20:31:57] [INFO ] Flow matrix only has 106 transitions (discarded 8 similar events)
// Phase 1: matrix 106 rows 55 cols
[2021-05-17 20:31:57] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 20:31:57] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 1 iterations. Remains : 55/308 places, 114/397 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-16-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s38 1) (EQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-16-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-11 finished in 197 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)&&(G(p1)||X(X(((p2 U (p3||G(p2))) U ((!p1&&(p2 U (p3||G(p2))))||G(p4))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 308/308 places, 397/397 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 301 transition count 385
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 301 transition count 385
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 297 transition count 379
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 297 transition count 379
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 295 transition count 375
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 295 transition count 375
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 293 transition count 372
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 293 transition count 372
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 291 transition count 369
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 291 transition count 369
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 291 transition count 368
Applied a total of 35 rules in 18 ms. Remains 291 /308 variables (removed 17) and now considering 368/397 (removed 29) transitions.
// Phase 1: matrix 368 rows 291 cols
[2021-05-17 20:31:57] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-17 20:31:57] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 368 rows 291 cols
[2021-05-17 20:31:57] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:31:57] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
// Phase 1: matrix 368 rows 291 cols
[2021-05-17 20:31:57] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-17 20:31:57] [INFO ] Dead Transitions using invariants and state equation in 164 ms returned []
Finished structural reductions, in 1 iterations. Remains : 291/308 places, 368/397 transitions.
Stuttering acceptance computed with spot in 399 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3) (NOT p4))), (NOT p0), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND p1 (NOT p4))), (AND (NOT p1) (NOT p4) (NOT p3) (NOT p2)), true, (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND p1 (NOT p4))), (NOT p4), (AND (NOT p3) (NOT p2)), (AND (NOT p4) (NOT p3) (NOT p2)), (AND (NOT p4) (NOT p3) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p3) (NOT p2) (NOT p1) p4), (AND (NOT p4) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-16-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}, { cond=p1, acceptance={} source=3 dest: 9}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(OR (AND p1 (NOT p4) p3) (AND p1 (NOT p4) p2)), acceptance={0} source=5 dest: 5}, { cond=(OR (AND p1 p4 p3) (AND p1 p4 p2)), acceptance={} source=5 dest: 5}, { cond=(AND p4 (NOT p3) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p4) (NOT p3) p2), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p1) p4 (NOT p3) p2), acceptance={} source=5 dest: 8}], [{ cond=(NOT p4), acceptance={} source=6 dest: 4}, { cond=p4, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=8 dest: 4}, { cond=(AND p4 (NOT p3) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p4) (NOT p3) p2), acceptance={} source=8 dest: 7}, { cond=(AND p4 (NOT p3) p2), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p1) (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p1) p4 (NOT p3) (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p1) (NOT p4) (NOT p3) p2), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p1) p4 (NOT p3) p2), acceptance={} source=9 dest: 8}, { cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={} source=9 dest: 9}, { cond=(AND p1 (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=9 dest: 10}, { cond=(AND p1 (NOT p4) (NOT p3) p2), acceptance={} source=9 dest: 11}, { cond=(AND p1 p4 (NOT p3) (NOT p2)), acceptance={} source=9 dest: 12}], [{ cond=(NOT p1), acceptance={} source=10 dest: 4}, { cond=p1, acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p1) p4 (NOT p3) (NOT p2)), acceptance={} source=11 dest: 4}, { cond=(AND (NOT p1) p4 (NOT p3) p2), acceptance={} source=11 dest: 7}, { cond=(AND p1 p4 (NOT p3) (NOT p2)), acceptance={} source=11 dest: 10}, { cond=(AND p1 p4 (NOT p3) p2), acceptance={} source=11 dest: 11}], [{ cond=(AND (NOT p1) (NOT p4)), acceptance={} source=12 dest: 4}, { cond=(AND (NOT p1) p4), acceptance={} source=12 dest: 6}, { cond=(AND p1 (NOT p4)), acceptance={} source=12 dest: 10}, { cond=(AND p1 p4), acceptance={} source=12 dest: 12}]], initial=0, aps=[p1:(EQ s123 1), p0:(EQ s215 1), p4:(OR (NEQ s98 0) (AND (NEQ s215 1) (NEQ s98 0))), p3:(AND (NEQ s215 1) (NEQ s98 0)), p2:(NEQ s98 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-16-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-13 finished in 824 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0&&(p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 308 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 308/308 places, 397/397 transitions.
Graph (trivial) has 340 edges and 308 vertex of which 46 / 308 are part of one of the 17 SCC in 1 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 278 transition count 247
Reduce places removed 117 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 130 rules applied. Total rules applied 248 place count 161 transition count 234
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 257 place count 154 transition count 232
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 259 place count 152 transition count 232
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 259 place count 152 transition count 228
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 267 place count 148 transition count 228
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 288 place count 127 transition count 193
Iterating global reduction 4 with 21 rules applied. Total rules applied 309 place count 127 transition count 193
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 5 rules applied. Total rules applied 314 place count 127 transition count 188
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 319 place count 122 transition count 188
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 329 place count 112 transition count 172
Iterating global reduction 6 with 10 rules applied. Total rules applied 339 place count 112 transition count 172
Ensure Unique test 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 6 with 3 rules applied. Total rules applied 342 place count 112 transition count 169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 343 place count 111 transition count 169
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 346 place count 108 transition count 163
Iterating global reduction 8 with 3 rules applied. Total rules applied 349 place count 108 transition count 163
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 351 place count 106 transition count 160
Iterating global reduction 8 with 2 rules applied. Total rules applied 353 place count 106 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 354 place count 106 transition count 159
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 355 place count 105 transition count 157
Iterating global reduction 9 with 1 rules applied. Total rules applied 356 place count 105 transition count 157
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 357 place count 105 transition count 156
Performed 41 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 10 with 82 rules applied. Total rules applied 439 place count 64 transition count 111
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 441 place count 62 transition count 107
Iterating global reduction 10 with 2 rules applied. Total rules applied 443 place count 62 transition count 107
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 445 place count 60 transition count 99
Iterating global reduction 10 with 2 rules applied. Total rules applied 447 place count 60 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 448 place count 60 transition count 98
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 456 place count 56 transition count 126
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 457 place count 55 transition count 124
Iterating global reduction 11 with 1 rules applied. Total rules applied 458 place count 55 transition count 124
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 11 with 15 rules applied. Total rules applied 473 place count 55 transition count 109
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 474 place count 54 transition count 106
Iterating global reduction 11 with 1 rules applied. Total rules applied 475 place count 54 transition count 106
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 476 place count 53 transition count 104
Iterating global reduction 11 with 1 rules applied. Total rules applied 477 place count 53 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 479 place count 52 transition count 110
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 480 place count 52 transition count 109
Applied a total of 480 rules in 33 ms. Remains 52 /308 variables (removed 256) and now considering 109/397 (removed 288) transitions.
[2021-05-17 20:31:58] [INFO ] Flow matrix only has 101 transitions (discarded 8 similar events)
// Phase 1: matrix 101 rows 52 cols
[2021-05-17 20:31:58] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 20:31:58] [INFO ] Implicit Places using invariants in 38 ms returned []
[2021-05-17 20:31:58] [INFO ] Flow matrix only has 101 transitions (discarded 8 similar events)
// Phase 1: matrix 101 rows 52 cols
[2021-05-17 20:31:58] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 20:31:58] [INFO ] State equation strengthened by 11 read => feed constraints.
[2021-05-17 20:31:58] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2021-05-17 20:31:58] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-17 20:31:58] [INFO ] Flow matrix only has 101 transitions (discarded 8 similar events)
// Phase 1: matrix 101 rows 52 cols
[2021-05-17 20:31:58] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-17 20:31:58] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 52/308 places, 109/397 transitions.
Stuttering acceptance computed with spot in 31 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : HealthRecord-PT-16-14 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p2:(AND (OR (NEQ s32 0) (NEQ s32 1)) (NEQ s32 1)), p1:(NEQ s32 1), p0:(NEQ s44 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 30 steps with 2 reset in 0 ms.
FORMULA HealthRecord-PT-16-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-14 finished in 199 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621283519401

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-16"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-16, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r292-tall-162124156400381"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-16.tgz
mv HealthRecord-PT-16 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;