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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
356.195 16559.00 30467.00 290.90 FFFFFFF????F?FF? 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-162124156300309.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-07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156300309
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 11K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 130K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 12 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 12 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.1K May 11 18:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 11 18:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 11 15:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 11 15:47 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 48K 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-07-00
FORMULA_NAME HealthRecord-PT-07-01
FORMULA_NAME HealthRecord-PT-07-02
FORMULA_NAME HealthRecord-PT-07-03
FORMULA_NAME HealthRecord-PT-07-04
FORMULA_NAME HealthRecord-PT-07-05
FORMULA_NAME HealthRecord-PT-07-06
FORMULA_NAME HealthRecord-PT-07-07
FORMULA_NAME HealthRecord-PT-07-08
FORMULA_NAME HealthRecord-PT-07-09
FORMULA_NAME HealthRecord-PT-07-10
FORMULA_NAME HealthRecord-PT-07-11
FORMULA_NAME HealthRecord-PT-07-12
FORMULA_NAME HealthRecord-PT-07-13
FORMULA_NAME HealthRecord-PT-07-14
FORMULA_NAME HealthRecord-PT-07-15

=== Now, execution of the tool begins

BK_START 1621281434607

Running Version 0
[2021-05-17 19:57:16] [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 19:57:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 19:57:16] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2021-05-17 19:57:16] [INFO ] Transformed 155 places.
[2021-05-17 19:57:16] [INFO ] Transformed 320 transitions.
[2021-05-17 19:57:16] [INFO ] Found NUPN structural information;
[2021-05-17 19:57:16] [INFO ] Parsed PT model containing 155 places and 320 transitions in 91 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 19:57:16] [INFO ] Initial state test concluded for 2 properties.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
FORMULA HealthRecord-PT-07-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 155 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 155/155 places, 295/295 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 83 transition count 159
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 83 transition count 159
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 149 place count 78 transition count 149
Iterating global reduction 0 with 5 rules applied. Total rules applied 154 place count 78 transition count 149
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 160 place count 78 transition count 143
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 161 place count 77 transition count 140
Iterating global reduction 1 with 1 rules applied. Total rules applied 162 place count 77 transition count 140
Applied a total of 162 rules in 28 ms. Remains 77 /155 variables (removed 78) and now considering 140/295 (removed 155) transitions.
[2021-05-17 19:57:16] [INFO ] Flow matrix only has 136 transitions (discarded 4 similar events)
// Phase 1: matrix 136 rows 77 cols
[2021-05-17 19:57:16] [INFO ] Computed 10 place invariants in 10 ms
[2021-05-17 19:57:16] [INFO ] Implicit Places using invariants in 110 ms returned []
[2021-05-17 19:57:16] [INFO ] Flow matrix only has 136 transitions (discarded 4 similar events)
// Phase 1: matrix 136 rows 77 cols
[2021-05-17 19:57:16] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-17 19:57:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 19:57:16] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2021-05-17 19:57:16] [INFO ] Flow matrix only has 136 transitions (discarded 4 similar events)
// Phase 1: matrix 136 rows 77 cols
[2021-05-17 19:57:16] [INFO ] Computed 10 place invariants in 5 ms
[2021-05-17 19:57:16] [INFO ] Dead Transitions using invariants and state equation in 94 ms returned []
Finished structural reductions, in 1 iterations. Remains : 77/155 places, 140/295 transitions.
[2021-05-17 19:57:16] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 19:57:16] [INFO ] Flatten gal took : 47 ms
FORMULA HealthRecord-PT-07-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-07-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 19:57:16] [INFO ] Flatten gal took : 14 ms
[2021-05-17 19:57:16] [INFO ] Input system was already deterministic with 140 transitions.
Incomplete random walk after 100000 steps, including 5316 resets, run finished after 368 ms. (steps per millisecond=271 ) properties (out of 33) seen :22
Running SMT prover for 11 properties.
[2021-05-17 19:57:17] [INFO ] Flow matrix only has 136 transitions (discarded 4 similar events)
// Phase 1: matrix 136 rows 77 cols
[2021-05-17 19:57:17] [INFO ] Computed 10 place invariants in 6 ms
[2021-05-17 19:57:17] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 19:57:17] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 19:57:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:17] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-17 19:57:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 19:57:17] [INFO ] [Real]Added 1 Read/Feed constraints in 6 ms returned sat
[2021-05-17 19:57:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:57:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 19:57:17] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 19:57:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:17] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2021-05-17 19:57:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 19:57:17] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 2 ms to minimize.
[2021-05-17 19:57:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2021-05-17 19:57:17] [INFO ] Computed and/alt/rep : 104/307/104 causal constraints (skipped 31 transitions) in 10 ms.
[2021-05-17 19:57:17] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 2 ms to minimize.
[2021-05-17 19:57:17] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2021-05-17 19:57:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2021-05-17 19:57:17] [INFO ] Added : 55 causal constraints over 12 iterations in 248 ms. Result :sat
[2021-05-17 19:57:17] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 19:57:17] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 19:57:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:17] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-17 19:57:17] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-17 19:57:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:57:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 19:57:17] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 19:57:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:17] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2021-05-17 19:57:17] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 19:57:17] [INFO ] Computed and/alt/rep : 104/307/104 causal constraints (skipped 31 transitions) in 12 ms.
[2021-05-17 19:57:18] [INFO ] Added : 59 causal constraints over 12 iterations in 120 ms. Result :sat
[2021-05-17 19:57:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:18] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-17 19:57:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:57:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:18] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:57:18] [INFO ] Computed and/alt/rep : 104/307/104 causal constraints (skipped 31 transitions) in 7 ms.
[2021-05-17 19:57:18] [INFO ] Added : 51 causal constraints over 11 iterations in 105 ms. Result :sat
[2021-05-17 19:57:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:18] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:57:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:57:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:18] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 19:57:18] [INFO ] Computed and/alt/rep : 104/307/104 causal constraints (skipped 31 transitions) in 12 ms.
[2021-05-17 19:57:18] [INFO ] Added : 51 causal constraints over 11 iterations in 108 ms. Result :sat
[2021-05-17 19:57:18] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:18] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:57:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:57:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:18] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:57:18] [INFO ] Computed and/alt/rep : 104/307/104 causal constraints (skipped 31 transitions) in 23 ms.
[2021-05-17 19:57:18] [INFO ] Added : 57 causal constraints over 12 iterations in 124 ms. Result :sat
[2021-05-17 19:57:18] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:18] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:57:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:57:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:18] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:57:18] [INFO ] Computed and/alt/rep : 104/307/104 causal constraints (skipped 31 transitions) in 10 ms.
[2021-05-17 19:57:18] [INFO ] Added : 47 causal constraints over 10 iterations in 98 ms. Result :sat
[2021-05-17 19:57:18] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:18] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:57:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:57:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 19:57:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:19] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2021-05-17 19:57:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:57:19] [INFO ] Computed and/alt/rep : 104/307/104 causal constraints (skipped 31 transitions) in 9 ms.
[2021-05-17 19:57:19] [INFO ] Deduced a trap composed of 31 places in 22 ms of which 1 ms to minimize.
[2021-05-17 19:57:19] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 0 ms to minimize.
[2021-05-17 19:57:19] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 1 ms to minimize.
[2021-05-17 19:57:19] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 97 ms
[2021-05-17 19:57:19] [INFO ] Added : 49 causal constraints over 11 iterations in 210 ms. Result :sat
[2021-05-17 19:57:19] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 19:57:19] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 19:57:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:19] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-17 19:57:19] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:57:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:57:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 19:57:19] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-17 19:57:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:19] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-17 19:57:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:57:19] [INFO ] Deduced a trap composed of 30 places in 21 ms of which 1 ms to minimize.
[2021-05-17 19:57:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2021-05-17 19:57:19] [INFO ] Computed and/alt/rep : 104/307/104 causal constraints (skipped 31 transitions) in 8 ms.
[2021-05-17 19:57:19] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2021-05-17 19:57:19] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 0 ms to minimize.
[2021-05-17 19:57:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
[2021-05-17 19:57:19] [INFO ] Added : 49 causal constraints over 11 iterations in 169 ms. Result :sat
[2021-05-17 19:57:19] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-17 19:57:19] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-17 19:57:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:19] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-17 19:57:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:57:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2021-05-17 19:57:19] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-17 19:57:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:19] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2021-05-17 19:57:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 19:57:19] [INFO ] Deduced a trap composed of 32 places in 20 ms of which 0 ms to minimize.
[2021-05-17 19:57:19] [INFO ] Deduced a trap composed of 24 places in 18 ms of which 0 ms to minimize.
[2021-05-17 19:57:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 50 ms
[2021-05-17 19:57:19] [INFO ] Computed and/alt/rep : 104/307/104 causal constraints (skipped 31 transitions) in 8 ms.
[2021-05-17 19:57:19] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 0 ms to minimize.
[2021-05-17 19:57:19] [INFO ] Deduced a trap composed of 26 places in 19 ms of which 0 ms to minimize.
[2021-05-17 19:57:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 61 ms
[2021-05-17 19:57:19] [INFO ] Added : 49 causal constraints over 11 iterations in 164 ms. Result :sat
[2021-05-17 19:57:19] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 19:57:19] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 19:57:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:19] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-17 19:57:19] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:57:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:57:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 19:57:19] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 19:57:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:19] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2021-05-17 19:57:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:57:19] [INFO ] Computed and/alt/rep : 104/307/104 causal constraints (skipped 31 transitions) in 9 ms.
[2021-05-17 19:57:20] [INFO ] Added : 51 causal constraints over 11 iterations in 106 ms. Result :sat
[2021-05-17 19:57:20] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 19:57:20] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 19:57:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:20] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-17 19:57:20] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:57:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 19:57:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 19:57:20] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 19:57:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 19:57:20] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2021-05-17 19:57:20] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 19:57:20] [INFO ] Computed and/alt/rep : 104/307/104 causal constraints (skipped 31 transitions) in 10 ms.
[2021-05-17 19:57:20] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2021-05-17 19:57:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2021-05-17 19:57:20] [INFO ] Added : 53 causal constraints over 12 iterations in 156 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 77/77 places, 140/140 transitions.
Graph (trivial) has 91 edges and 77 vertex of which 14 / 77 are part of one of the 7 SCC in 2 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 51 transition count 97
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 51 transition count 97
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 41 place count 47 transition count 88
Iterating global reduction 0 with 4 rules applied. Total rules applied 45 place count 47 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 51 place count 47 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 46 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 46 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 56 place count 46 transition count 77
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 60 place count 44 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 61 place count 44 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 65 place count 42 transition count 93
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 67 place count 42 transition count 91
Applied a total of 67 rules in 27 ms. Remains 42 /77 variables (removed 35) and now considering 91/140 (removed 49) transitions.
[2021-05-17 19:57:20] [INFO ] Flow matrix only has 79 transitions (discarded 12 similar events)
// Phase 1: matrix 79 rows 42 cols
[2021-05-17 19:57:20] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 19:57:20] [INFO ] Implicit Places using invariants in 21 ms returned []
[2021-05-17 19:57:20] [INFO ] Flow matrix only has 79 transitions (discarded 12 similar events)
// Phase 1: matrix 79 rows 42 cols
[2021-05-17 19:57:20] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 19:57:20] [INFO ] State equation strengthened by 19 read => feed constraints.
[2021-05-17 19:57:20] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2021-05-17 19:57:20] [INFO ] Redundant transitions in 10 ms returned []
[2021-05-17 19:57:20] [INFO ] Flow matrix only has 79 transitions (discarded 12 similar events)
// Phase 1: matrix 79 rows 42 cols
[2021-05-17 19:57:20] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 19:57:20] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 1 iterations. Remains : 42/77 places, 91/140 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-07-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s29 1) (EQ s9 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 1 ms.
FORMULA HealthRecord-PT-07-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-07-00 finished in 385 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||F((G(p1)||(p2&&X((p3||G(p1))))||G(p3)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 77/77 places, 140/140 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 61 transition count 109
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 61 transition count 109
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 57 transition count 100
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 57 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 57 transition count 97
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 55 transition count 92
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 55 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 55 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 54 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 54 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 55 place count 54 transition count 84
Applied a total of 55 rules in 6 ms. Remains 54 /77 variables (removed 23) and now considering 84/140 (removed 56) transitions.
[2021-05-17 19:57:20] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
// Phase 1: matrix 81 rows 54 cols
[2021-05-17 19:57:20] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 19:57:20] [INFO ] Implicit Places using invariants in 32 ms returned []
[2021-05-17 19:57:20] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
// Phase 1: matrix 81 rows 54 cols
[2021-05-17 19:57:20] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 19:57:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 19:57:20] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2021-05-17 19:57:20] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
// Phase 1: matrix 81 rows 54 cols
[2021-05-17 19:57:20] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 19:57:20] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/77 places, 84/140 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : HealthRecord-PT-07-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND (NOT p1) p2 p3), acceptance={0} source=2 dest: 3}, { cond=(AND p1 p2 (NOT p3)), acceptance={1} source=2 dest: 3}, { cond=(AND p1 p2 p3), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p3)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s51 1), p2:(NEQ s45 1), p1:(NEQ s31 1), p3:(NEQ s14 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 24848 reset in 316 ms.
Product exploration explored 100000 steps with 24752 reset in 193 ms.
Knowledge obtained : [(NOT p0), p2, p1, p3]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 24765 reset in 152 ms.
Product exploration explored 100000 steps with 24776 reset in 168 ms.
[2021-05-17 19:57:22] [INFO ] Flatten gal took : 7 ms
[2021-05-17 19:57:22] [INFO ] Flatten gal took : 6 ms
[2021-05-17 19:57:22] [INFO ] Time to serialize gal into /tmp/LTL14294825257634298714.gal : 2 ms
[2021-05-17 19:57:22] [INFO ] Time to serialize properties into /tmp/LTL17743059012535980490.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/LTL14294825257634298714.gal, -t, CGAL, -LTL, /tmp/LTL17743059012535980490.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/LTL14294825257634298714.gal -t CGAL -LTL /tmp/LTL17743059012535980490.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G(("(p151==1)")||(F(((G("(p94!=1)"))||(("(p144!=1)")&&(X(("(p57!=1)")||(G("(p94!=1)"))))))||(G("(p57!=1)"))))))))
Formula 0 simplified : !XG("(p151==1)" | F(G"(p94!=1)" | ("(p144!=1)" & X("(p57!=1)" | G"(p94!=1)")) | G"(p57!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t8, t10, t11, t17, t23, t24, t25, t30, t31, t32, t35, t37, t43, t44, t47, t59, t69, t91, t92, t130, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/58/26/84
Computing Next relation with stutter on 33 deadlock states
6 unique states visited
4 strongly connected components in search stack
8 transitions explored
4 items max in DFS search stack
151 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,1.52646,63004,1,0,178,207926,238,96,2174,196517,287
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-07-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property HealthRecord-PT-07-01 finished in 3224 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F(p0))&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 77/77 places, 140/140 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 58 transition count 103
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 58 transition count 103
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 53 transition count 92
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 53 transition count 92
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 53 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 52 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 52 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 59 place count 52 transition count 81
Applied a total of 59 rules in 6 ms. Remains 52 /77 variables (removed 25) and now considering 81/140 (removed 59) transitions.
[2021-05-17 19:57:24] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
// Phase 1: matrix 78 rows 52 cols
[2021-05-17 19:57:24] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 19:57:24] [INFO ] Implicit Places using invariants in 31 ms returned []
[2021-05-17 19:57:24] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
// Phase 1: matrix 78 rows 52 cols
[2021-05-17 19:57:24] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 19:57:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 19:57:24] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2021-05-17 19:57:24] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
// Phase 1: matrix 78 rows 52 cols
[2021-05-17 19:57:24] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 19:57:24] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 52/77 places, 81/140 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : HealthRecord-PT-07-02 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(NEQ s12 1), p0:(NEQ s41 1)], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 174 ms.
Product exploration explored 100000 steps with 1 reset in 187 ms.
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 1 reset in 59 ms.
Product exploration explored 100000 steps with 1 reset in 61 ms.
Applying partial POR strategy [true, true, false, false, true]
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Support contains 2 out of 52 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 52/52 places, 81/81 transitions.
Graph (trivial) has 48 edges and 52 vertex of which 14 / 52 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 44 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 44 transition count 72
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 44 transition count 71
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 44 transition count 115
Deduced a syphon composed of 5 places in 1 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 44 transition count 113
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 11 rules in 11 ms. Remains 44 /52 variables (removed 8) and now considering 113/81 (removed -32) transitions.
[2021-05-17 19:57:25] [INFO ] Redundant transitions in 39 ms returned []
[2021-05-17 19:57:25] [INFO ] Flow matrix only has 100 transitions (discarded 13 similar events)
// Phase 1: matrix 100 rows 44 cols
[2021-05-17 19:57:25] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 19:57:25] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 1 iterations. Remains : 44/52 places, 113/81 transitions.
Product exploration explored 100000 steps with 8 reset in 70 ms.
Product exploration explored 100000 steps with 11 reset in 67 ms.
[2021-05-17 19:57:25] [INFO ] Flatten gal took : 5 ms
[2021-05-17 19:57:25] [INFO ] Flatten gal took : 5 ms
[2021-05-17 19:57:25] [INFO ] Time to serialize gal into /tmp/LTL12815347416976512197.gal : 2 ms
[2021-05-17 19:57:25] [INFO ] Time to serialize properties into /tmp/LTL3043483553101769391.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12815347416976512197.gal, -t, CGAL, -LTL, /tmp/LTL3043483553101769391.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/LTL12815347416976512197.gal -t CGAL -LTL /tmp/LTL3043483553101769391.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X(F("(p127!=1)")))&&(G("(p51!=1)")))))
Formula 0 simplified : !X(XF"(p127!=1)" & G"(p51!=1)")
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t8, t10, t11, t17, t18, t22, t23, t24, t25, t30, t31, t35, t37, t47, t60, t61, t66, t67, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/59/22/81
Computing Next relation with stutter on 33 deadlock states
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
150 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,1.51154,64368,1,0,205,194614,195,159,2103,228457,356
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-07-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property HealthRecord-PT-07-02 finished in 3009 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(G(p0)) U G(((p1 U p2)&&X(p3))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 77/77 places, 140/140 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 59 transition count 105
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 59 transition count 105
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 54 transition count 94
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 54 transition count 94
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 54 transition count 89
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 52 transition count 84
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 52 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 58 place count 52 transition count 81
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 51 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 51 transition count 79
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 63 place count 51 transition count 76
Applied a total of 63 rules in 5 ms. Remains 51 /77 variables (removed 26) and now considering 76/140 (removed 64) transitions.
[2021-05-17 19:57:27] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
// Phase 1: matrix 73 rows 51 cols
[2021-05-17 19:57:27] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 19:57:27] [INFO ] Implicit Places using invariants in 20 ms returned []
[2021-05-17 19:57:27] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
// Phase 1: matrix 73 rows 51 cols
[2021-05-17 19:57:27] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 19:57:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 19:57:27] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2021-05-17 19:57:27] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
// Phase 1: matrix 73 rows 51 cols
[2021-05-17 19:57:27] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 19:57:27] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/77 places, 76/140 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p0), (NOT p3), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (NOT p2)]
Running random walk in product with property : HealthRecord-PT-07-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(OR p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR p2 p1), acceptance={0} source=1 dest: 3}, { cond=(OR p2 p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=3 dest: 5}], [{ cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=4 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s31 1), p1:(AND (EQ s9 1) (EQ s49 1)), p0:(OR (EQ s31 1) (AND (EQ s9 1) (EQ s49 1))), p3:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-07-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-07-03 finished in 314 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U (p1 U (p2||G(p1)))) U X(p3)))], workingDir=/home/mcc/execution]
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 77/77 places, 140/140 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 59 transition count 105
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 59 transition count 105
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 54 transition count 94
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 54 transition count 94
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 54 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 53 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 53 transition count 85
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 52 transition count 83
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 52 transition count 83
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 59 place count 52 transition count 80
Applied a total of 59 rules in 5 ms. Remains 52 /77 variables (removed 25) and now considering 80/140 (removed 60) transitions.
[2021-05-17 19:57:27] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
// Phase 1: matrix 77 rows 52 cols
[2021-05-17 19:57:27] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 19:57:27] [INFO ] Implicit Places using invariants in 19 ms returned []
[2021-05-17 19:57:27] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
// Phase 1: matrix 77 rows 52 cols
[2021-05-17 19:57:27] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 19:57:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 19:57:27] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2021-05-17 19:57:27] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
// Phase 1: matrix 77 rows 52 cols
[2021-05-17 19:57:27] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 19:57:27] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 52/77 places, 80/140 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p3)), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-07-04 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p2 p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p3), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0) (NOT p3)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(AND (NEQ s9 1) (OR (NEQ s36 1) (NEQ s42 1))), p1:(NEQ s9 1), p0:(OR (EQ s36 0) (EQ s42 0)), p3:(EQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-07-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-07-04 finished in 313 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 77/77 places, 140/140 transitions.
Graph (trivial) has 92 edges and 77 vertex of which 14 / 77 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 51 transition count 97
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 51 transition count 97
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 42 place count 46 transition count 86
Iterating global reduction 0 with 5 rules applied. Total rules applied 47 place count 46 transition count 86
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 53 place count 46 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 44 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 44 transition count 75
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 60 place count 44 transition count 72
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 64 place count 42 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 42 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
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 69 place count 40 transition count 85
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 72 place count 40 transition count 82
Applied a total of 72 rules in 14 ms. Remains 40 /77 variables (removed 37) and now considering 82/140 (removed 58) transitions.
[2021-05-17 19:57:27] [INFO ] Flow matrix only has 70 transitions (discarded 12 similar events)
// Phase 1: matrix 70 rows 40 cols
[2021-05-17 19:57:27] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 19:57:27] [INFO ] Implicit Places using invariants in 27 ms returned []
[2021-05-17 19:57:27] [INFO ] Flow matrix only has 70 transitions (discarded 12 similar events)
// Phase 1: matrix 70 rows 40 cols
[2021-05-17 19:57:27] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 19:57:27] [INFO ] State equation strengthened by 15 read => feed constraints.
[2021-05-17 19:57:27] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2021-05-17 19:57:27] [INFO ] Redundant transitions in 10 ms returned []
[2021-05-17 19:57:27] [INFO ] Flow matrix only has 70 transitions (discarded 12 similar events)
// Phase 1: matrix 70 rows 40 cols
[2021-05-17 19:57:27] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 19:57:27] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 40/77 places, 82/140 transitions.
Stuttering acceptance computed with spot in 31 ms :[true, (NOT p0)]
Running random walk in product with property : HealthRecord-PT-07-05 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 s23 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 1 reset in 109 ms.
Product exploration explored 100000 steps with 0 reset in 87 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 28 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 4 reset in 77 ms.
Product exploration explored 100000 steps with 0 reset in 86 ms.
[2021-05-17 19:57:28] [INFO ] Flatten gal took : 5 ms
[2021-05-17 19:57:28] [INFO ] Flatten gal took : 5 ms
[2021-05-17 19:57:28] [INFO ] Time to serialize gal into /tmp/LTL2812386564932995132.gal : 1 ms
[2021-05-17 19:57:28] [INFO ] Time to serialize properties into /tmp/LTL17014554597047061815.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/LTL2812386564932995132.gal, -t, CGAL, -LTL, /tmp/LTL17014554597047061815.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/LTL2812386564932995132.gal -t CGAL -LTL /tmp/LTL17014554597047061815.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G("(p95!=1)")))
Formula 0 simplified : !G"(p95!=1)"
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t8, t10, t11, t17, t23, t24, t25, t30, t31, t32, t37, t41, t42, t47, t93, t92.t82, t92.t83, t91.t76, t91.t77, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/59/23/82
Computing Next relation with stutter on 33 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
18 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.199365,23036,1,0,198,30266,183,134,1861,34667,323
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-07-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property HealthRecord-PT-07-05 finished in 821 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X(X(X(F((p0&&F(p1))))))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 77/77 places, 140/140 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 58 transition count 102
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 58 transition count 102
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 53 transition count 91
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 53 transition count 91
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 53 transition count 85
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 51 transition count 80
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 51 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 61 place count 51 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 50 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 50 transition count 75
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 66 place count 50 transition count 72
Applied a total of 66 rules in 5 ms. Remains 50 /77 variables (removed 27) and now considering 72/140 (removed 68) transitions.
[2021-05-17 19:57:28] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
// Phase 1: matrix 68 rows 50 cols
[2021-05-17 19:57:28] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 19:57:28] [INFO ] Implicit Places using invariants in 27 ms returned []
[2021-05-17 19:57:28] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
// Phase 1: matrix 68 rows 50 cols
[2021-05-17 19:57:28] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 19:57:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 19:57:28] [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 19:57:28] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
// Phase 1: matrix 68 rows 50 cols
[2021-05-17 19:57:28] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 19:57:28] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/77 places, 72/140 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-07-06 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}]], initial=7, aps=[p1:(NEQ s29 1), p0:(NEQ s29 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, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-07-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-07-06 finished in 357 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&(G(F(p1))||(p2 U (p3||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 77 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 77/77 places, 140/140 transitions.
Graph (trivial) has 84 edges and 77 vertex of which 12 / 77 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 53 transition count 100
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 53 transition count 100
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 38 place count 50 transition count 93
Iterating global reduction 0 with 3 rules applied. Total rules applied 41 place count 50 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 44 place count 50 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 48 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 48 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 51 place count 48 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 47 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 47 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 56 place count 47 transition count 77
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 3 with 4 rules applied. Total rules applied 60 place count 45 transition count 75
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 64 place count 43 transition count 91
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 43 transition count 90
Applied a total of 65 rules in 13 ms. Remains 43 /77 variables (removed 34) and now considering 90/140 (removed 50) transitions.
[2021-05-17 19:57:28] [INFO ] Flow matrix only has 78 transitions (discarded 12 similar events)
// Phase 1: matrix 78 rows 43 cols
[2021-05-17 19:57:28] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 19:57:28] [INFO ] Implicit Places using invariants in 35 ms returned []
[2021-05-17 19:57:28] [INFO ] Flow matrix only has 78 transitions (discarded 12 similar events)
// Phase 1: matrix 78 rows 43 cols
[2021-05-17 19:57:28] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 19:57:28] [INFO ] State equation strengthened by 16 read => feed constraints.
[2021-05-17 19:57:28] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2021-05-17 19:57:28] [INFO ] Redundant transitions in 6 ms returned []
[2021-05-17 19:57:28] [INFO ] Flow matrix only has 78 transitions (discarded 12 similar events)
// Phase 1: matrix 78 rows 43 cols
[2021-05-17 19:57:28] [INFO ] Computed 9 place invariants in 3 ms
[2021-05-17 19:57:28] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 43/77 places, 90/140 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), true, (NOT p0), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-07-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(NEQ s25 1), p1:(EQ s23 1), p3:(AND (NEQ s25 1) (OR (NEQ s27 1) (NEQ s31 1))), p2:(OR (NEQ s27 1) (NEQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 3 reset in 57 ms.
Product exploration explored 100000 steps with 1 reset in 62 ms.
Knowledge obtained : [p0, (NOT p1), p3, p2]
Adopting property with smaller alphabet thanks to knowledge :p3
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0), (AND (NOT p0) p3)]
Support contains 3 out of 43 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 43/43 places, 90/90 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 42 transition count 88
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 42 transition count 88
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 41 transition count 86
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 41 transition count 86
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 41 transition count 85
Applied a total of 5 rules in 6 ms. Remains 41 /43 variables (removed 2) and now considering 85/90 (removed 5) transitions.
[2021-05-17 19:57:29] [INFO ] Flow matrix only has 73 transitions (discarded 12 similar events)
// Phase 1: matrix 73 rows 41 cols
[2021-05-17 19:57:29] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 19:57:29] [INFO ] Implicit Places using invariants in 48 ms returned []
[2021-05-17 19:57:29] [INFO ] Flow matrix only has 73 transitions (discarded 12 similar events)
// Phase 1: matrix 73 rows 41 cols
[2021-05-17 19:57:29] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 19:57:29] [INFO ] State equation strengthened by 15 read => feed constraints.
[2021-05-17 19:57:29] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2021-05-17 19:57:29] [INFO ] Redundant transitions in 9 ms returned []
[2021-05-17 19:57:29] [INFO ] Flow matrix only has 73 transitions (discarded 12 similar events)
// Phase 1: matrix 73 rows 41 cols
[2021-05-17 19:57:29] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 19:57:29] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/43 places, 85/90 transitions.
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0), (AND (NOT p0) p3)]
Product exploration explored 100000 steps with 5 reset in 59 ms.
Product exploration explored 100000 steps with 2 reset in 63 ms.
Starting structural reductions, iteration 0 : 43/43 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2021-05-17 19:57:29] [INFO ] Flow matrix only has 78 transitions (discarded 12 similar events)
// Phase 1: matrix 78 rows 43 cols
[2021-05-17 19:57:29] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 19:57:29] [INFO ] Implicit Places using invariants in 31 ms returned []
[2021-05-17 19:57:29] [INFO ] Flow matrix only has 78 transitions (discarded 12 similar events)
// Phase 1: matrix 78 rows 43 cols
[2021-05-17 19:57:29] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 19:57:29] [INFO ] State equation strengthened by 16 read => feed constraints.
[2021-05-17 19:57:29] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2021-05-17 19:57:29] [INFO ] Redundant transitions in 7 ms returned []
[2021-05-17 19:57:29] [INFO ] Flow matrix only has 78 transitions (discarded 12 similar events)
// Phase 1: matrix 78 rows 43 cols
[2021-05-17 19:57:29] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 19:57:29] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 43/43 places, 90/90 transitions.
Application raised an uncaught exception null
java.lang.UnsupportedOperationException
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:879)
at fr.lip6.move.gal.application.MccTranslator.lambda$3(MccTranslator.java:862)
at fr.lip6.move.gal.structural.expr.NaryOp.forEachChild(NaryOp.java:153)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:862)
at fr.lip6.move.gal.application.MccTranslator.toGal(MccTranslator.java:760)
at fr.lip6.move.gal.application.MccTranslator.rebuildSpecification(MccTranslator.java:729)
at fr.lip6.move.gal.application.GlobalPropertySolver.verifyWithSDD(GlobalPropertySolver.java:585)
at fr.lip6.move.gal.application.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:269)
at fr.lip6.move.gal.application.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:60)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:470)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)

BK_STOP 1621281451166

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

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-07.tgz
mv HealthRecord-PT-07 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;