About the Execution of ITS-Tools for HealthRecord-PT-13
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 410.495 | 21521.00 | 40218.00 | 240.00 | FTFTTFFFFFFFFFFF | 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-162124156300357.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-13, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156300357
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.0K May 11 18:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 11 18:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 11 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 52K 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-13-00
FORMULA_NAME HealthRecord-PT-13-01
FORMULA_NAME HealthRecord-PT-13-02
FORMULA_NAME HealthRecord-PT-13-03
FORMULA_NAME HealthRecord-PT-13-04
FORMULA_NAME HealthRecord-PT-13-05
FORMULA_NAME HealthRecord-PT-13-06
FORMULA_NAME HealthRecord-PT-13-07
FORMULA_NAME HealthRecord-PT-13-08
FORMULA_NAME HealthRecord-PT-13-09
FORMULA_NAME HealthRecord-PT-13-10
FORMULA_NAME HealthRecord-PT-13-11
FORMULA_NAME HealthRecord-PT-13-12
FORMULA_NAME HealthRecord-PT-13-13
FORMULA_NAME HealthRecord-PT-13-14
FORMULA_NAME HealthRecord-PT-13-15
=== Now, execution of the tool begins
BK_START 1621282559140
Running Version 0
[2021-05-17 20:16:00] [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:16:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 20:16:01] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2021-05-17 20:16:01] [INFO ] Transformed 161 places.
[2021-05-17 20:16:01] [INFO ] Transformed 341 transitions.
[2021-05-17 20:16:01] [INFO ] Found NUPN structural information;
[2021-05-17 20:16:01] [INFO ] Parsed PT model containing 161 places and 341 transitions in 88 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 20:16:01] [INFO ] Initial state test concluded for 1 properties.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA HealthRecord-PT-13-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 161 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 161/161 places, 313/313 transitions.
Discarding 77 places :
Symmetric choice reduction at 0 with 77 rule applications. Total rules 77 place count 84 transition count 167
Iterating global reduction 0 with 77 rules applied. Total rules applied 154 place count 84 transition count 167
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 158 place count 80 transition count 159
Iterating global reduction 0 with 4 rules applied. Total rules applied 162 place count 80 transition count 159
Applied a total of 162 rules in 24 ms. Remains 80 /161 variables (removed 81) and now considering 159/313 (removed 154) transitions.
[2021-05-17 20:16:01] [INFO ] Flow matrix only has 155 transitions (discarded 4 similar events)
// Phase 1: matrix 155 rows 80 cols
[2021-05-17 20:16:01] [INFO ] Computed 10 place invariants in 7 ms
[2021-05-17 20:16:01] [INFO ] Implicit Places using invariants in 110 ms returned []
[2021-05-17 20:16:01] [INFO ] Flow matrix only has 155 transitions (discarded 4 similar events)
// Phase 1: matrix 155 rows 80 cols
[2021-05-17 20:16:01] [INFO ] Computed 10 place invariants in 7 ms
[2021-05-17 20:16:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:16:01] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2021-05-17 20:16:01] [INFO ] Flow matrix only has 155 transitions (discarded 4 similar events)
// Phase 1: matrix 155 rows 80 cols
[2021-05-17 20:16:01] [INFO ] Computed 10 place invariants in 7 ms
[2021-05-17 20:16:01] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Finished structural reductions, in 1 iterations. Remains : 80/161 places, 159/313 transitions.
[2021-05-17 20:16:01] [INFO ] Flatten gal took : 37 ms
[2021-05-17 20:16:01] [INFO ] Flatten gal took : 16 ms
[2021-05-17 20:16:01] [INFO ] Input system was already deterministic with 159 transitions.
Incomplete random walk after 100000 steps, including 7802 resets, run finished after 375 ms. (steps per millisecond=266 ) properties (out of 32) seen :22
Running SMT prover for 10 properties.
[2021-05-17 20:16:02] [INFO ] Flow matrix only has 155 transitions (discarded 4 similar events)
// Phase 1: matrix 155 rows 80 cols
[2021-05-17 20:16:02] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 20:16:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-17 20:16:02] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:16:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:16:02] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-17 20:16:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:16:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 20:16:02] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-17 20:16:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:16:02] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2021-05-17 20:16:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:16:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:16:02] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 2 ms to minimize.
[2021-05-17 20:16:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2021-05-17 20:16:02] [INFO ] Computed and/alt/rep : 112/382/112 causal constraints (skipped 42 transitions) in 12 ms.
[2021-05-17 20:16:02] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 1 ms to minimize.
[2021-05-17 20:16:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2021-05-17 20:16:02] [INFO ] Added : 51 causal constraints over 11 iterations in 193 ms. Result :sat
[2021-05-17 20:16:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-17 20:16:02] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:16:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:16:02] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-17 20:16:02] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:16:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:16:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-17 20:16:02] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:16:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:16:02] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-17 20:16:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:16:02] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2021-05-17 20:16:02] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 1 ms to minimize.
[2021-05-17 20:16:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
[2021-05-17 20:16:02] [INFO ] Computed and/alt/rep : 112/382/112 causal constraints (skipped 42 transitions) in 11 ms.
[2021-05-17 20:16:02] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
[2021-05-17 20:16:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2021-05-17 20:16:02] [INFO ] Added : 52 causal constraints over 11 iterations in 162 ms. Result :sat
[2021-05-17 20:16:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-17 20:16:02] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:16:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:16:03] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-17 20:16:03] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:16:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:16:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 20:16:03] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:16:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:16:03] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2021-05-17 20:16:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:16:03] [INFO ] Deduced a trap composed of 11 places in 13 ms of which 1 ms to minimize.
[2021-05-17 20:16:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2021-05-17 20:16:03] [INFO ] Computed and/alt/rep : 112/382/112 causal constraints (skipped 42 transitions) in 11 ms.
[2021-05-17 20:16:03] [INFO ] Added : 53 causal constraints over 12 iterations in 140 ms. Result :sat
[2021-05-17 20:16:03] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 20:16:03] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:16:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:16:03] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-17 20:16:03] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:16:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:16:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 20:16:03] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:16:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:16:03] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-17 20:16:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:16:03] [INFO ] Computed and/alt/rep : 112/382/112 causal constraints (skipped 42 transitions) in 11 ms.
[2021-05-17 20:16:03] [INFO ] Added : 48 causal constraints over 10 iterations in 99 ms. Result :sat
[2021-05-17 20:16:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-17 20:16:03] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-17 20:16:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:16:03] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2021-05-17 20:16:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:16:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2021-05-17 20:16:03] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:16:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:16:03] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2021-05-17 20:16:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 20:16:03] [INFO ] Computed and/alt/rep : 112/382/112 causal constraints (skipped 42 transitions) in 13 ms.
[2021-05-17 20:16:03] [INFO ] Added : 50 causal constraints over 11 iterations in 111 ms. Result :sat
[2021-05-17 20:16:03] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2021-05-17 20:16:03] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:16:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:16:03] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-17 20:16:03] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:16:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:16:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 20:16:03] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:16:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:16:03] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2021-05-17 20:16:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:16:03] [INFO ] Computed and/alt/rep : 112/382/112 causal constraints (skipped 42 transitions) in 12 ms.
[2021-05-17 20:16:03] [INFO ] Added : 59 causal constraints over 13 iterations in 136 ms. Result :sat
[2021-05-17 20:16:03] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 20:16:03] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:16:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:16:03] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-17 20:16:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:16:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-17 20:16:04] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:16:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:16:04] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2021-05-17 20:16:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:16:04] [INFO ] Deduced a trap composed of 34 places in 23 ms of which 1 ms to minimize.
[2021-05-17 20:16:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2021-05-17 20:16:04] [INFO ] Computed and/alt/rep : 112/382/112 causal constraints (skipped 42 transitions) in 11 ms.
[2021-05-17 20:16:04] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
[2021-05-17 20:16:04] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 0 ms to minimize.
[2021-05-17 20:16:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 77 ms
[2021-05-17 20:16:04] [INFO ] Added : 46 causal constraints over 11 iterations in 188 ms. Result :sat
[2021-05-17 20:16:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-17 20:16:04] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:16:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:16:04] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-17 20:16:04] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:16:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:16:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 20:16:04] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:16:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:16:04] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2021-05-17 20:16:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:16:04] [INFO ] Deduced a trap composed of 10 places in 15 ms of which 0 ms to minimize.
[2021-05-17 20:16:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2021-05-17 20:16:04] [INFO ] Computed and/alt/rep : 112/382/112 causal constraints (skipped 42 transitions) in 12 ms.
[2021-05-17 20:16:04] [INFO ] Added : 43 causal constraints over 9 iterations in 91 ms. Result :sat
[2021-05-17 20:16:04] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 20:16:04] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:16:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:16:04] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-17 20:16:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:16:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-17 20:16:04] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:16:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:16:04] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-17 20:16:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:16:04] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2021-05-17 20:16:04] [INFO ] Deduced a trap composed of 10 places in 10 ms of which 1 ms to minimize.
[2021-05-17 20:16:04] [INFO ] Deduced a trap composed of 27 places in 21 ms of which 0 ms to minimize.
[2021-05-17 20:16:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 85 ms
[2021-05-17 20:16:04] [INFO ] Computed and/alt/rep : 112/382/112 causal constraints (skipped 42 transitions) in 10 ms.
[2021-05-17 20:16:04] [INFO ] Deduced a trap composed of 11 places in 10 ms of which 0 ms to minimize.
[2021-05-17 20:16:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2021-05-17 20:16:04] [INFO ] Added : 57 causal constraints over 12 iterations in 148 ms. Result :sat
[2021-05-17 20:16:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-17 20:16:04] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-17 20:16:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:16:04] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-17 20:16:04] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 20:16:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:16:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-17 20:16:04] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:16:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:16:04] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2021-05-17 20:16:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:16:04] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2021-05-17 20:16:04] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 0 ms to minimize.
[2021-05-17 20:16:05] [INFO ] Deduced a trap composed of 11 places in 14 ms of which 0 ms to minimize.
[2021-05-17 20:16:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 77 ms
[2021-05-17 20:16:05] [INFO ] Computed and/alt/rep : 112/382/112 causal constraints (skipped 42 transitions) in 11 ms.
[2021-05-17 20:16:05] [INFO ] Added : 55 causal constraints over 11 iterations in 114 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&X(F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 159/159 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 59 transition count 118
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 59 transition count 118
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 54 transition count 106
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 54 transition count 106
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 61 place count 54 transition count 97
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 52 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 52 transition count 93
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 71 place count 52 transition count 87
Applied a total of 71 rules in 6 ms. Remains 52 /80 variables (removed 28) and now considering 87/159 (removed 72) transitions.
[2021-05-17 20:16:05] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
// Phase 1: matrix 84 rows 52 cols
[2021-05-17 20:16:05] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:16:05] [INFO ] Implicit Places using invariants in 21 ms returned []
[2021-05-17 20:16:05] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
// Phase 1: matrix 84 rows 52 cols
[2021-05-17 20:16:05] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:16:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:16:05] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2021-05-17 20:16:05] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
// Phase 1: matrix 84 rows 52 cols
[2021-05-17 20:16:05] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 20:16:05] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 52/80 places, 87/159 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : HealthRecord-PT-13-00 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(NEQ s16 1), p1:(EQ s4 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA HealthRecord-PT-13-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-00 finished in 348 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p0)||(p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 159/159 transitions.
Graph (trivial) has 90 edges and 80 vertex of which 8 / 80 are part of one of the 4 SCC in 3 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 58 transition count 120
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 58 transition count 120
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 42 place count 53 transition count 108
Iterating global reduction 0 with 5 rules applied. Total rules applied 47 place count 53 transition count 108
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 56 place count 53 transition count 99
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 51 transition count 95
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 51 transition count 95
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 66 place count 51 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 49 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 71 place count 49 transition count 86
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 83 place count 43 transition count 119
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 43 transition count 117
Applied a total of 85 rules in 31 ms. Remains 43 /80 variables (removed 37) and now considering 117/159 (removed 42) transitions.
[2021-05-17 20:16:05] [INFO ] Flow matrix only has 101 transitions (discarded 16 similar events)
// Phase 1: matrix 101 rows 43 cols
[2021-05-17 20:16:05] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:16:05] [INFO ] Implicit Places using invariants in 28 ms returned []
[2021-05-17 20:16:05] [INFO ] Flow matrix only has 101 transitions (discarded 16 similar events)
// Phase 1: matrix 101 rows 43 cols
[2021-05-17 20:16:05] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:16:05] [INFO ] State equation strengthened by 19 read => feed constraints.
[2021-05-17 20:16:05] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2021-05-17 20:16:05] [INFO ] Redundant transitions in 11 ms returned []
[2021-05-17 20:16:05] [INFO ] Flow matrix only has 101 transitions (discarded 16 similar events)
// Phase 1: matrix 101 rows 43 cols
[2021-05-17 20:16:05] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 20:16:05] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 43/80 places, 117/159 transitions.
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-13-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p2:(AND (NEQ s7 1) (NEQ s3 1)), p1:(NEQ s3 1), p0:(EQ s28 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 30 reset in 189 ms.
Product exploration explored 100000 steps with 8 reset in 130 ms.
Knowledge obtained : [p2, p1, p0]
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 6 reset in 87 ms.
Product exploration explored 100000 steps with 1 reset in 94 ms.
[2021-05-17 20:16:06] [INFO ] Flatten gal took : 11 ms
[2021-05-17 20:16:06] [INFO ] Flatten gal took : 10 ms
[2021-05-17 20:16:06] [INFO ] Time to serialize gal into /tmp/LTL13956781985085847596.gal : 4 ms
[2021-05-17 20:16:06] [INFO ] Time to serialize properties into /tmp/LTL8092732169186694818.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/LTL13956781985085847596.gal, -t, CGAL, -LTL, /tmp/LTL8092732169186694818.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/LTL13956781985085847596.gal -t CGAL -LTL /tmp/LTL8092732169186694818.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(p117==0)"))||(("(p10!=1)")U(("((p34!=1)&&(p10!=1))")||(G("(p10!=1)"))))))))
Formula 0 simplified : !GF(G"(p117==0)" | ("(p10!=1)" U ("((p34!=1)&&(p10!=1))" | G"(p10!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t8, t9, t13, t14, t15, t23, t24, t25, t29, t30, t32, t33, t38, t73, t74, t82, t83, t94, t110, t136, t109.t88, t109.t89, t135.t88, t135.t89, t108.t79, t108.t80, t134.t79, t134.t80, t92.t62, t92.t63, t93.t60, t93.t61, t91.t56, t91.t57, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/78/39/117
Computing Next relation with stutter on 257 deadlock states
3 unique states visited
0 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
28 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,0.297937,26432,1,0,201,35641,285,69,2724,32441,268
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HealthRecord-PT-13-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property HealthRecord-PT-13-01 finished in 1387 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(X(X(G(p0)))) U (p1&&X(X(X(G(p0))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 159/159 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 60 transition count 119
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 60 transition count 119
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 54 transition count 104
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 54 transition count 104
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 61 place count 54 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 51 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 51 transition count 89
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 76 place count 51 transition count 80
Applied a total of 76 rules in 5 ms. Remains 51 /80 variables (removed 29) and now considering 80/159 (removed 79) transitions.
[2021-05-17 20:16:06] [INFO ] Flow matrix only has 76 transitions (discarded 4 similar events)
// Phase 1: matrix 76 rows 51 cols
[2021-05-17 20:16:06] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 20:16:06] [INFO ] Implicit Places using invariants in 31 ms returned []
[2021-05-17 20:16:06] [INFO ] Flow matrix only has 76 transitions (discarded 4 similar events)
// Phase 1: matrix 76 rows 51 cols
[2021-05-17 20:16:06] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 20:16:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:16:06] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2021-05-17 20:16:06] [INFO ] Flow matrix only has 76 transitions (discarded 4 similar events)
// Phase 1: matrix 76 rows 51 cols
[2021-05-17 20:16:06] [INFO ] Computed 10 place invariants in 17 ms
[2021-05-17 20:16:07] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/80 places, 80/159 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : HealthRecord-PT-13-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s30 1) (EQ s26 1)), p0:(NEQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 11 reset in 188 ms.
Product exploration explored 100000 steps with 4 reset in 109 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 3 reset in 70 ms.
Product exploration explored 100000 steps with 10 reset in 148 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 51 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 51/51 places, 80/80 transitions.
Graph (trivial) has 44 edges and 51 vertex of which 8 / 51 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 46 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 46 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 46 transition count 73
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -49
Deduced a syphon composed of 7 places in 1 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 11 place count 46 transition count 122
Deduced a syphon composed of 7 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 46 transition count 121
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 12 rules in 11 ms. Remains 46 /51 variables (removed 5) and now considering 121/80 (removed -41) transitions.
[2021-05-17 20:16:08] [INFO ] Redundant transitions in 10 ms returned []
[2021-05-17 20:16:08] [INFO ] Flow matrix only has 102 transitions (discarded 19 similar events)
// Phase 1: matrix 102 rows 46 cols
[2021-05-17 20:16:08] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-17 20:16:08] [INFO ] Dead Transitions using invariants and state equation in 87 ms returned []
Finished structural reductions, in 1 iterations. Remains : 46/51 places, 121/80 transitions.
Product exploration explored 100000 steps with 4 reset in 89 ms.
Product exploration explored 100000 steps with 29 reset in 95 ms.
[2021-05-17 20:16:08] [INFO ] Flatten gal took : 5 ms
[2021-05-17 20:16:08] [INFO ] Flatten gal took : 5 ms
[2021-05-17 20:16:08] [INFO ] Time to serialize gal into /tmp/LTL2698405404780072565.gal : 14 ms
[2021-05-17 20:16:08] [INFO ] Time to serialize properties into /tmp/LTL3179431705056049318.ltl : 7 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/LTL2698405404780072565.gal, -t, CGAL, -LTL, /tmp/LTL3179431705056049318.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/LTL2698405404780072565.gal -t CGAL -LTL /tmp/LTL3179431705056049318.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(X(X(G("(p84!=1)")))))U((X(X(X(G("(p84!=1)")))))&&("((p90==1)||(p84==1))")))))
Formula 0 simplified : !X(XXXG"(p84!=1)" U ("((p90==1)||(p84==1))" & XXXG"(p84!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t8, t9, t23, t24, t25, t29, t30, t34, t38, t44, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/65/15/80
Computing Next relation with stutter on 257 deadlock states
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 items max in DFS search stack
69 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,0.700341,42360,1,0,179,111804,187,148,2034,147071,332
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-13-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property HealthRecord-PT-13-02 finished in 2344 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F(p1)&&(G(F(p2)) U p3))))], workingDir=/home/mcc/execution]
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 159/159 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 61 transition count 122
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 61 transition count 122
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 56 transition count 110
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 56 transition count 110
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 57 place count 56 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 54 transition count 97
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 54 transition count 97
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 67 place count 54 transition count 91
Applied a total of 67 rules in 5 ms. Remains 54 /80 variables (removed 26) and now considering 91/159 (removed 68) transitions.
[2021-05-17 20:16:09] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
// Phase 1: matrix 88 rows 54 cols
[2021-05-17 20:16:09] [INFO ] Computed 9 place invariants in 17 ms
[2021-05-17 20:16:09] [INFO ] Implicit Places using invariants in 46 ms returned []
[2021-05-17 20:16:09] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
// Phase 1: matrix 88 rows 54 cols
[2021-05-17 20:16:09] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:16:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:16:09] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2021-05-17 20:16:09] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
// Phase 1: matrix 88 rows 54 cols
[2021-05-17 20:16:09] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:16:09] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/80 places, 91/159 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (OR (NOT p0) (NOT p1) (NOT p3)), true, (NOT p1), (NOT p2), (NOT p2), (NOT p3)]
Running random walk in product with property : HealthRecord-PT-13-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p3)), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(NOT p3), acceptance={0} source=6 dest: 5}, { cond=(NOT p3), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s31 0), p1:(EQ s26 1), p3:(OR (EQ s36 0) (EQ s42 0)), p2:(EQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 266 ms.
Product exploration explored 100000 steps with 50000 reset in 201 ms.
Knowledge obtained : [p0, (NOT p1), p3, (NOT p2)]
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (OR (NOT p0) (NOT p1) (NOT p3)), true, (NOT p1), (NOT p2), (NOT p2), (NOT p3)]
Product exploration explored 100000 steps with 50000 reset in 150 ms.
Product exploration explored 100000 steps with 50000 reset in 160 ms.
Applying partial POR strategy [false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (OR (NOT p0) (NOT p1) (NOT p3)), true, (NOT p1), (NOT p2), (NOT p2), (NOT p3)]
Support contains 4 out of 54 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 54/54 places, 91/91 transitions.
Graph (trivial) has 45 edges and 54 vertex of which 6 / 54 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 89
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 51 transition count 145
Deduced a syphon composed of 8 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 51 transition count 144
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 10 rules in 11 ms. Remains 51 /54 variables (removed 3) and now considering 144/91 (removed -53) transitions.
[2021-05-17 20:16:10] [INFO ] Redundant transitions in 25 ms returned []
[2021-05-17 20:16:10] [INFO ] Flow matrix only has 125 transitions (discarded 19 similar events)
// Phase 1: matrix 125 rows 51 cols
[2021-05-17 20:16:10] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:16:11] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/54 places, 144/91 transitions.
Product exploration explored 100000 steps with 50000 reset in 419 ms.
Product exploration explored 100000 steps with 50000 reset in 409 ms.
[2021-05-17 20:16:11] [INFO ] Flatten gal took : 5 ms
[2021-05-17 20:16:11] [INFO ] Flatten gal took : 5 ms
[2021-05-17 20:16:11] [INFO ] Time to serialize gal into /tmp/LTL2824176864859511910.gal : 1 ms
[2021-05-17 20:16:11] [INFO ] Time to serialize properties into /tmp/LTL13930359965759078678.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/LTL2824176864859511910.gal, -t, CGAL, -LTL, /tmp/LTL13930359965759078678.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/LTL2824176864859511910.gal -t CGAL -LTL /tmp/LTL13930359965759078678.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((("(p109==0)")&&(F("(p83==1)")))&&((G(F("(p109==1)")))U("((p115==0)||(p132==0))")))))
Formula 0 simplified : !X("(p109==0)" & F"(p83==1)" & (GF"(p109==1)" U "((p115==0)||(p132==0))"))
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t8, t9, t19, t20, t21, t22, t23, t24, t25, t29, t30, t34, t36, t38, t44, t147, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/70/21/91
Computing Next relation with stutter on 257 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
23 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,0.246943,26100,1,0,153,37068,215,72,2166,28599,195
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HealthRecord-PT-13-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property HealthRecord-PT-13-03 finished in 2938 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X(X(((p1||F(p2)) U (p2||G((p1||F(p2))))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 159/159 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 61 transition count 122
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 61 transition count 122
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 56 transition count 109
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 56 transition count 109
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 56 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 53 transition count 97
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 53 transition count 97
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 68 place count 53 transition count 89
Applied a total of 68 rules in 6 ms. Remains 53 /80 variables (removed 27) and now considering 89/159 (removed 70) transitions.
[2021-05-17 20:16:12] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
// Phase 1: matrix 86 rows 53 cols
[2021-05-17 20:16:12] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:16:12] [INFO ] Implicit Places using invariants in 20 ms returned []
[2021-05-17 20:16:12] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
// Phase 1: matrix 86 rows 53 cols
[2021-05-17 20:16:12] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:16:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:16:12] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2021-05-17 20:16:12] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
// Phase 1: matrix 86 rows 53 cols
[2021-05-17 20:16:12] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:16:12] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/80 places, 89/159 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-13-04 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p2:(NEQ s8 1), p0:(EQ s15 0), p1:(NEQ s42 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 150 ms.
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Knowledge obtained : [p2, p0, (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 127 ms.
Product exploration explored 100000 steps with 50000 reset in 137 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 108 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 3 out of 53 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 53/53 places, 89/89 transitions.
Graph (trivial) has 44 edges and 53 vertex of which 6 / 53 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 49 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 49 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 49 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 49 transition count 84
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 10 place count 49 transition count 127
Deduced a syphon composed of 6 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 49 transition count 126
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 11 rules in 12 ms. Remains 49 /53 variables (removed 4) and now considering 126/89 (removed -37) transitions.
[2021-05-17 20:16:13] [INFO ] Redundant transitions in 34 ms returned []
[2021-05-17 20:16:13] [INFO ] Flow matrix only has 111 transitions (discarded 15 similar events)
// Phase 1: matrix 111 rows 49 cols
[2021-05-17 20:16:13] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:16:13] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 49/53 places, 126/89 transitions.
Product exploration explored 100000 steps with 50000 reset in 125 ms.
Product exploration explored 100000 steps with 50000 reset in 137 ms.
[2021-05-17 20:16:13] [INFO ] Flatten gal took : 6 ms
[2021-05-17 20:16:13] [INFO ] Flatten gal took : 5 ms
[2021-05-17 20:16:13] [INFO ] Time to serialize gal into /tmp/LTL13863535040918949958.gal : 1 ms
[2021-05-17 20:16:13] [INFO ] Time to serialize properties into /tmp/LTL8361690276117995819.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/LTL13863535040918949958.gal, -t, CGAL, -LTL, /tmp/LTL8361690276117995819.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/LTL13863535040918949958.gal -t CGAL -LTL /tmp/LTL8361690276117995819.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(p59==0)")||(X(X((("(p145!=0)")||(F("(p30!=1)")))U(("(p30!=1)")||(G(("(p145!=0)")||(F("(p30!=1)")))))))))))
Formula 0 simplified : !X("(p59==0)" | XX(("(p145!=0)" | F"(p30!=1)") U ("(p30!=1)" | G("(p145!=0)" | F"(p30!=1)"))))
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t8, t9, t10, t11, t12, t23, t24, t25, t29, t30, t34, t38, t44, t75, t76, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/69/20/89
Computing Next relation with stutter on 257 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
46 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,0.483089,32816,1,0,150,75391,194,68,2148,65711,185
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HealthRecord-PT-13-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property HealthRecord-PT-13-04 finished in 2049 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0&&X((p0 U (G(p0)||(X(p1) U ((X(p1)&&G(p2))||X(G(p1)))))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 159/159 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 60 transition count 120
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 60 transition count 120
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 55 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 55 transition count 107
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 56 place count 55 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 53 transition count 97
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 53 transition count 97
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 66 place count 53 transition count 91
Applied a total of 66 rules in 3 ms. Remains 53 /80 variables (removed 27) and now considering 91/159 (removed 68) transitions.
[2021-05-17 20:16:14] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
// Phase 1: matrix 88 rows 53 cols
[2021-05-17 20:16:14] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:16:14] [INFO ] Implicit Places using invariants in 34 ms returned []
[2021-05-17 20:16:14] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
// Phase 1: matrix 88 rows 53 cols
[2021-05-17 20:16:14] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:16:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:16:14] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2021-05-17 20:16:14] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
// Phase 1: matrix 88 rows 53 cols
[2021-05-17 20:16:14] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:16:14] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/80 places, 91/159 transitions.
Stuttering acceptance computed with spot in 356 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-13-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=1 dest: 1}, { cond=p0, acceptance={0, 1, 2} source=1 dest: 2}], [{ cond=(AND p0 p2), acceptance={0, 2} source=2 dest: 3}, { cond=(AND p0 p2), acceptance={2} source=2 dest: 4}, { cond=(NOT p0), acceptance={0, 1, 2} source=2 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={1, 2} source=2 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={0, 2} source=2 dest: 7}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=2 dest: 8}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={0, 2} source=3 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={2} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=3 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1, 2} source=3 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 2} source=3 dest: 7}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=3 dest: 8}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={2} source=4 dest: 4}, { cond=(AND p0 p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=4 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1, 2} source=4 dest: 6}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=4 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 2} source=4 dest: 7}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=4 dest: 7}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=4 dest: 8}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=4 dest: 8}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1, 2} source=4 dest: 9}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=4 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=5 dest: 2}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={1, 2} source=6 dest: 4}, { cond=(AND p0 p2 p1), acceptance={1} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=6 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1, 2} source=6 dest: 6}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=6 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=6 dest: 7}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=6 dest: 7}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=6 dest: 8}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=6 dest: 8}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1, 2} source=6 dest: 9}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=6 dest: 9}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={0, 2} source=7 dest: 3}, { cond=(AND p0 p2 p1), acceptance={0} source=7 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={2} source=7 dest: 4}, { cond=(AND p0 p2 p1), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=7 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=7 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1, 2} source=7 dest: 6}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=7 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 2} source=7 dest: 7}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=7 dest: 8}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=7 dest: 8}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={0, 1, 2} source=8 dest: 3}, { cond=(AND p0 p2 p1), acceptance={0, 1} source=8 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={1, 2} source=8 dest: 4}, { cond=(AND p0 p2 p1), acceptance={1} source=8 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=8 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=8 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1, 2} source=8 dest: 6}, { cond=(AND (NOT p0) p2 p1), acceptance={1} source=8 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=8 dest: 7}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=8 dest: 8}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=9 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=9 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={1, 2} source=9 dest: 10}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1, 2} source=9 dest: 11}], [{ cond=(AND p0 p2), acceptance={2} source=10 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=10 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={1, 2} source=10 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={0, 2} source=10 dest: 7}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=10 dest: 8}, { cond=(AND (NOT p0) p2), acceptance={1, 2} source=10 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=11 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1, 2} source=11 dest: 2}, { cond=(AND p0 p2), acceptance={1, 2} source=11 dest: 10}, { cond=(AND (NOT p0) p2), acceptance={1, 2} source=11 dest: 11}]], initial=0, aps=[p0:(NEQ s42 1), p2:(NEQ s31 1), p1:(NEQ s23 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8 reset in 136 ms.
Product exploration explored 100000 steps with 3 reset in 139 ms.
Knowledge obtained : [p0, p2, p1]
Stuttering acceptance computed with spot in 347 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 12 reset in 137 ms.
Product exploration explored 100000 steps with 8 reset in 139 ms.
[2021-05-17 20:16:15] [INFO ] Flatten gal took : 6 ms
[2021-05-17 20:16:15] [INFO ] Flatten gal took : 5 ms
[2021-05-17 20:16:15] [INFO ] Time to serialize gal into /tmp/LTL11125430416891836796.gal : 2 ms
[2021-05-17 20:16:15] [INFO ] Time to serialize properties into /tmp/LTL981673975600212504.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/LTL11125430416891836796.gal, -t, CGAL, -LTL, /tmp/LTL981673975600212504.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/LTL11125430416891836796.gal -t CGAL -LTL /tmp/LTL981673975600212504.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p130!=1)")&&(X(("(p130!=1)")U((G("(p130!=1)"))||((X("(p78!=1)"))U(((X("(p78!=1)"))&&(G("(p94!=1)")))||(X(G("(p78!=1)"))))))))))))
Formula 0 simplified : !GF("(p130!=1)" & X("(p130!=1)" U (G"(p130!=1)" | (X"(p78!=1)" U ((X"(p78!=1)" & G"(p94!=1)") | XG"(p78!=1)")))))
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t8, t9, t19, t23, t24, t25, t27, t29, t30, t34, t38, t40, t41, t44, t56, t57, t101, t102, t103, t104, t108, t109, t110, t126, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/62/29/91
Computing Next relation with stutter on 257 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
27 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,0.289966,28796,1,0,181,45470,205,80,2235,46799,218
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-13-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property HealthRecord-PT-13-05 finished in 1966 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(p1)||p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 159/159 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 61 transition count 122
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 61 transition count 122
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 56 transition count 109
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 56 transition count 109
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 56 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 53 transition count 97
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 53 transition count 97
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 69 place count 53 transition count 88
Applied a total of 69 rules in 3 ms. Remains 53 /80 variables (removed 27) and now considering 88/159 (removed 71) transitions.
[2021-05-17 20:16:16] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
// Phase 1: matrix 85 rows 53 cols
[2021-05-17 20:16:16] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:16:16] [INFO ] Implicit Places using invariants in 47 ms returned []
[2021-05-17 20:16:16] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
// Phase 1: matrix 85 rows 53 cols
[2021-05-17 20:16:16] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:16:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:16:16] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2021-05-17 20:16:16] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
// Phase 1: matrix 85 rows 53 cols
[2021-05-17 20:16:16] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:16:16] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/80 places, 88/159 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : HealthRecord-PT-13-06 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s26 1) (EQ s30 1) (AND (EQ s36 1) (EQ s41 1))), p1:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-13-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-06 finished in 202 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((F(!p0)&&(p1 U G(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 159/159 transitions.
Graph (trivial) has 90 edges and 80 vertex of which 8 / 80 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 57 transition count 119
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 57 transition count 119
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 43 place count 51 transition count 104
Iterating global reduction 0 with 6 rules applied. Total rules applied 49 place count 51 transition count 104
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 57 place count 51 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 48 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 48 transition count 90
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 71 place count 48 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 47 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 47 transition count 80
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 80 place count 44 transition count 103
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 86 place count 44 transition count 97
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 43 transition count 96
Applied a total of 87 rules in 15 ms. Remains 43 /80 variables (removed 37) and now considering 96/159 (removed 63) transitions.
[2021-05-17 20:16:16] [INFO ] Flow matrix only has 86 transitions (discarded 10 similar events)
// Phase 1: matrix 86 rows 43 cols
[2021-05-17 20:16:16] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:16:16] [INFO ] Implicit Places using invariants in 20 ms returned []
[2021-05-17 20:16:16] [INFO ] Flow matrix only has 86 transitions (discarded 10 similar events)
// Phase 1: matrix 86 rows 43 cols
[2021-05-17 20:16:16] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:16:16] [INFO ] State equation strengthened by 19 read => feed constraints.
[2021-05-17 20:16:16] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2021-05-17 20:16:16] [INFO ] Redundant transitions in 38 ms returned []
[2021-05-17 20:16:16] [INFO ] Flow matrix only has 86 transitions (discarded 10 similar events)
// Phase 1: matrix 86 rows 43 cols
[2021-05-17 20:16:16] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:16:16] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 43/80 places, 96/159 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p2) p0), p0, (NOT p2), (NOT p2), (AND p0 (NOT p2))]
Running random walk in product with property : HealthRecord-PT-13-07 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 2}, { cond=(AND p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(NEQ s2 1), p1:(EQ s10 1), p0:(NEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-13-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-07 finished in 319 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((!p0 U p1))], workingDir=/home/mcc/execution]
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 159/159 transitions.
Graph (trivial) has 92 edges and 80 vertex of which 8 / 80 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 55 transition count 115
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 55 transition count 115
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 45 place count 51 transition count 105
Iterating global reduction 0 with 4 rules applied. Total rules applied 49 place count 51 transition count 105
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 55 place count 51 transition count 99
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 49 transition count 95
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 49 transition count 95
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 65 place count 49 transition count 89
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 48 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 48 transition count 87
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 72 place count 46 transition count 108
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 75 place count 46 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 45 transition count 104
Applied a total of 76 rules in 22 ms. Remains 45 /80 variables (removed 35) and now considering 104/159 (removed 55) transitions.
[2021-05-17 20:16:16] [INFO ] Flow matrix only has 94 transitions (discarded 10 similar events)
// Phase 1: matrix 94 rows 45 cols
[2021-05-17 20:16:16] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:16:16] [INFO ] Implicit Places using invariants in 19 ms returned []
[2021-05-17 20:16:16] [INFO ] Flow matrix only has 94 transitions (discarded 10 similar events)
// Phase 1: matrix 94 rows 45 cols
[2021-05-17 20:16:16] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:16:16] [INFO ] State equation strengthened by 19 read => feed constraints.
[2021-05-17 20:16:16] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2021-05-17 20:16:16] [INFO ] Redundant transitions in 8 ms returned []
[2021-05-17 20:16:16] [INFO ] Flow matrix only has 94 transitions (discarded 10 similar events)
// Phase 1: matrix 94 rows 45 cols
[2021-05-17 20:16:16] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:16:16] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 45/80 places, 104/159 transitions.
Stuttering acceptance computed with spot in 29 ms :[true, (NOT p1)]
Running random walk in product with property : HealthRecord-PT-13-09 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s33 1), p0:(NEQ s35 0)], 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, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-13-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-09 finished in 200 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 159/159 transitions.
Graph (trivial) has 94 edges and 80 vertex of which 8 / 80 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 54 transition count 113
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 54 transition count 113
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 48 place count 49 transition count 101
Iterating global reduction 0 with 5 rules applied. Total rules applied 53 place count 49 transition count 101
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 62 place count 49 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 47 transition count 88
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 47 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 72 place count 47 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 46 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 46 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 79 place count 44 transition count 99
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 44 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 43 transition count 95
Applied a total of 83 rules in 26 ms. Remains 43 /80 variables (removed 37) and now considering 95/159 (removed 64) transitions.
[2021-05-17 20:16:16] [INFO ] Flow matrix only has 86 transitions (discarded 9 similar events)
// Phase 1: matrix 86 rows 43 cols
[2021-05-17 20:16:16] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:16:16] [INFO ] Implicit Places using invariants in 24 ms returned []
[2021-05-17 20:16:16] [INFO ] Flow matrix only has 86 transitions (discarded 9 similar events)
// Phase 1: matrix 86 rows 43 cols
[2021-05-17 20:16:16] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:16:16] [INFO ] State equation strengthened by 18 read => feed constraints.
[2021-05-17 20:16:17] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2021-05-17 20:16:17] [INFO ] Redundant transitions in 9 ms returned []
[2021-05-17 20:16:17] [INFO ] Flow matrix only has 86 transitions (discarded 9 similar events)
// Phase 1: matrix 86 rows 43 cols
[2021-05-17 20:16:17] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:16:17] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 43/80 places, 95/159 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-13-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 9 reset in 66 ms.
Product exploration explored 100000 steps with 20 reset in 62 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 20 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6 reset in 61 ms.
Product exploration explored 100000 steps with 5 reset in 60 ms.
[2021-05-17 20:16:17] [INFO ] Flatten gal took : 6 ms
[2021-05-17 20:16:17] [INFO ] Flatten gal took : 6 ms
[2021-05-17 20:16:17] [INFO ] Time to serialize gal into /tmp/LTL10685929081097919946.gal : 0 ms
[2021-05-17 20:16:17] [INFO ] Time to serialize properties into /tmp/LTL17449179446016171206.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/LTL10685929081097919946.gal, -t, CGAL, -LTL, /tmp/LTL17449179446016171206.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/LTL10685929081097919946.gal -t CGAL -LTL /tmp/LTL17449179446016171206.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G("(p133!=1)"))))
Formula 0 simplified : !FG"(p133!=1)"
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t8, t9, t19, t20, t22, t23, t24, t25, t29, t30, t38, t44, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/78/17/95
Computing Next relation with stutter on 257 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
45 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,0.452128,33136,1,0,229,85936,213,176,2084,108590,417
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-13-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property HealthRecord-PT-13-10 finished in 998 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 159/159 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 59 transition count 118
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 59 transition count 118
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 54 transition count 106
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 54 transition count 106
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 61 place count 54 transition count 97
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 52 transition count 93
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 52 transition count 93
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 71 place count 52 transition count 87
Applied a total of 71 rules in 3 ms. Remains 52 /80 variables (removed 28) and now considering 87/159 (removed 72) transitions.
[2021-05-17 20:16:17] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
// Phase 1: matrix 84 rows 52 cols
[2021-05-17 20:16:17] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:16:17] [INFO ] Implicit Places using invariants in 34 ms returned []
[2021-05-17 20:16:17] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
// Phase 1: matrix 84 rows 52 cols
[2021-05-17 20:16:17] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:16:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:16:17] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2021-05-17 20:16:17] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
// Phase 1: matrix 84 rows 52 cols
[2021-05-17 20:16:17] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:16:18] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 52/80 places, 87/159 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : HealthRecord-PT-13-11 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(NEQ s12 0), p0:(EQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-13-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-11 finished in 200 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 159/159 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 59 transition count 118
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 59 transition count 118
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 53 transition count 103
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 53 transition count 103
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 63 place count 53 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 50 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 50 transition count 88
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 78 place count 50 transition count 79
Applied a total of 78 rules in 2 ms. Remains 50 /80 variables (removed 30) and now considering 79/159 (removed 80) transitions.
[2021-05-17 20:16:18] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
// Phase 1: matrix 76 rows 50 cols
[2021-05-17 20:16:18] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:16:18] [INFO ] Implicit Places using invariants in 18 ms returned []
[2021-05-17 20:16:18] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
// Phase 1: matrix 76 rows 50 cols
[2021-05-17 20:16:18] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:16:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:16:18] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2021-05-17 20:16:18] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
// Phase 1: matrix 76 rows 50 cols
[2021-05-17 20:16:18] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:16:18] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/80 places, 79/159 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-13-12 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(EQ s23 1), p1:(AND (EQ s12 1) (EQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-13-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-12 finished in 175 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 159/159 transitions.
Graph (trivial) has 94 edges and 80 vertex of which 8 / 80 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 55 transition count 115
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 55 transition count 115
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 47 place count 49 transition count 100
Iterating global reduction 0 with 6 rules applied. Total rules applied 53 place count 49 transition count 100
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 62 place count 49 transition count 91
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 46 transition count 85
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 46 transition count 85
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 77 place count 46 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 79 place count 45 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 45 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 43 transition count 86
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 43 transition count 84
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 42 transition count 83
Applied a total of 87 rules in 13 ms. Remains 42 /80 variables (removed 38) and now considering 83/159 (removed 76) transitions.
[2021-05-17 20:16:18] [INFO ] Flow matrix only has 75 transitions (discarded 8 similar events)
// Phase 1: matrix 75 rows 42 cols
[2021-05-17 20:16:18] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:16:18] [INFO ] Implicit Places using invariants in 18 ms returned []
[2021-05-17 20:16:18] [INFO ] Flow matrix only has 75 transitions (discarded 8 similar events)
// Phase 1: matrix 75 rows 42 cols
[2021-05-17 20:16:18] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:16:18] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-17 20:16:18] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2021-05-17 20:16:18] [INFO ] Redundant transitions in 6 ms returned []
[2021-05-17 20:16:18] [INFO ] Flow matrix only has 75 transitions (discarded 8 similar events)
// Phase 1: matrix 75 rows 42 cols
[2021-05-17 20:16:18] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:16:18] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 42/80 places, 83/159 transitions.
Stuttering acceptance computed with spot in 28 ms :[true, (NOT p0)]
Running random walk in product with property : HealthRecord-PT-13-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(NEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4 reset in 62 ms.
Product exploration explored 100000 steps with 0 reset in 63 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 27 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 6 reset in 61 ms.
Product exploration explored 100000 steps with 4 reset in 63 ms.
[2021-05-17 20:16:18] [INFO ] Flatten gal took : 5 ms
[2021-05-17 20:16:18] [INFO ] Flatten gal took : 5 ms
[2021-05-17 20:16:18] [INFO ] Time to serialize gal into /tmp/LTL5811328782527681556.gal : 0 ms
[2021-05-17 20:16:18] [INFO ] Time to serialize properties into /tmp/LTL11313775773986376073.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/LTL5811328782527681556.gal, -t, CGAL, -LTL, /tmp/LTL11313775773986376073.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/LTL5811328782527681556.gal -t CGAL -LTL /tmp/LTL11313775773986376073.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G("(p25!=1)")))
Formula 0 simplified : !G"(p25!=1)"
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t8, t9, t23, t24, t25, t29, t30, t38, t44, t77, t78, t110, t109.t88, t109.t89, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/64/19/83
Computing Next relation with stutter on 257 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
44 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,0.448397,33064,1,0,195,87273,188,134,1999,92538,328
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-13-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property HealthRecord-PT-13-13 finished in 958 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 159/159 transitions.
Graph (trivial) has 94 edges and 80 vertex of which 8 / 80 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 54 transition count 113
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 54 transition count 113
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 48 place count 49 transition count 101
Iterating global reduction 0 with 5 rules applied. Total rules applied 53 place count 49 transition count 101
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 62 place count 49 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 47 transition count 88
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 47 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 72 place count 47 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 46 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 46 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 79 place count 44 transition count 99
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 82 place count 44 transition count 96
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 43 transition count 95
Applied a total of 83 rules in 12 ms. Remains 43 /80 variables (removed 37) and now considering 95/159 (removed 64) transitions.
[2021-05-17 20:16:19] [INFO ] Flow matrix only has 86 transitions (discarded 9 similar events)
// Phase 1: matrix 86 rows 43 cols
[2021-05-17 20:16:19] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:16:19] [INFO ] Implicit Places using invariants in 20 ms returned []
[2021-05-17 20:16:19] [INFO ] Flow matrix only has 86 transitions (discarded 9 similar events)
// Phase 1: matrix 86 rows 43 cols
[2021-05-17 20:16:19] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:16:19] [INFO ] State equation strengthened by 18 read => feed constraints.
[2021-05-17 20:16:19] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2021-05-17 20:16:19] [INFO ] Redundant transitions in 15 ms returned []
[2021-05-17 20:16:19] [INFO ] Flow matrix only has 86 transitions (discarded 9 similar events)
// Phase 1: matrix 86 rows 43 cols
[2021-05-17 20:16:19] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:16:19] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 43/80 places, 95/159 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-13-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s31 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 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-13-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-14 finished in 166 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(F(p0))||(G((X(p3)&&p2))&&p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 80 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 80/80 places, 159/159 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 59 transition count 118
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 59 transition count 118
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 53 transition count 103
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 53 transition count 103
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 63 place count 53 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 50 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 50 transition count 88
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 78 place count 50 transition count 79
Applied a total of 78 rules in 3 ms. Remains 50 /80 variables (removed 30) and now considering 79/159 (removed 80) transitions.
[2021-05-17 20:16:19] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
// Phase 1: matrix 76 rows 50 cols
[2021-05-17 20:16:19] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:16:19] [INFO ] Implicit Places using invariants in 20 ms returned []
[2021-05-17 20:16:19] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
// Phase 1: matrix 76 rows 50 cols
[2021-05-17 20:16:19] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:16:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:16:19] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2021-05-17 20:16:19] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
// Phase 1: matrix 76 rows 50 cols
[2021-05-17 20:16:19] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:16:19] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/80 places, 79/159 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) p2 (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2) p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : HealthRecord-PT-13-15 automaton TGBA [mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p3)) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(OR (AND p1 p2) (AND p2 p3)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p1 p2) (AND (NOT p0) p2 p3)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={0} source=2 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 p3)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) p2 p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s34 1) (EQ s47 1)), p2:(AND (EQ s4 1) (EQ s48 1)), p0:(AND (EQ s34 1) (EQ s47 1)), p3:(NEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-13-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-13-15 finished in 283 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621282580661
--------------------
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-13"
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-13, 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-162124156300357"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-13.tgz
mv HealthRecord-PT-13 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 '
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 ;