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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 14K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 140K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.8K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 12 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 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.3K May 11 18:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 11 18:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 11 15:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K 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 49K 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-09-00
FORMULA_NAME HealthRecord-PT-09-01
FORMULA_NAME HealthRecord-PT-09-02
FORMULA_NAME HealthRecord-PT-09-03
FORMULA_NAME HealthRecord-PT-09-04
FORMULA_NAME HealthRecord-PT-09-05
FORMULA_NAME HealthRecord-PT-09-06
FORMULA_NAME HealthRecord-PT-09-07
FORMULA_NAME HealthRecord-PT-09-08
FORMULA_NAME HealthRecord-PT-09-09
FORMULA_NAME HealthRecord-PT-09-10
FORMULA_NAME HealthRecord-PT-09-11
FORMULA_NAME HealthRecord-PT-09-12
FORMULA_NAME HealthRecord-PT-09-13
FORMULA_NAME HealthRecord-PT-09-14
FORMULA_NAME HealthRecord-PT-09-15

=== Now, execution of the tool begins

BK_START 1621281708103

Running Version 0
[2021-05-17 20:01:49] [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:01:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 20:01:49] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2021-05-17 20:01:49] [INFO ] Transformed 157 places.
[2021-05-17 20:01:49] [INFO ] Transformed 327 transitions.
[2021-05-17 20:01:49] [INFO ] Found NUPN structural information;
[2021-05-17 20:01:49] [INFO ] Parsed PT model containing 157 places and 327 transitions in 92 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 20:01:49] [INFO ] Initial state test concluded for 2 properties.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
Support contains 40 out of 157 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 157/157 places, 301/301 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 86 transition count 167
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 86 transition count 167
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 149 place count 79 transition count 153
Iterating global reduction 0 with 7 rules applied. Total rules applied 156 place count 79 transition count 153
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 161 place count 79 transition count 148
Applied a total of 161 rules in 25 ms. Remains 79 /157 variables (removed 78) and now considering 148/301 (removed 153) transitions.
[2021-05-17 20:01:49] [INFO ] Flow matrix only has 144 transitions (discarded 4 similar events)
// Phase 1: matrix 144 rows 79 cols
[2021-05-17 20:01:49] [INFO ] Computed 10 place invariants in 13 ms
[2021-05-17 20:01:50] [INFO ] Implicit Places using invariants in 101 ms returned []
[2021-05-17 20:01:50] [INFO ] Flow matrix only has 144 transitions (discarded 4 similar events)
// Phase 1: matrix 144 rows 79 cols
[2021-05-17 20:01:50] [INFO ] Computed 10 place invariants in 10 ms
[2021-05-17 20:01:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:01:50] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2021-05-17 20:01:50] [INFO ] Flow matrix only has 144 transitions (discarded 4 similar events)
// Phase 1: matrix 144 rows 79 cols
[2021-05-17 20:01:50] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-17 20:01:50] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Finished structural reductions, in 1 iterations. Remains : 79/157 places, 148/301 transitions.
[2021-05-17 20:01:50] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 20:01:50] [INFO ] Flatten gal took : 39 ms
FORMULA HealthRecord-PT-09-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 20:01:50] [INFO ] Flatten gal took : 15 ms
[2021-05-17 20:01:50] [INFO ] Input system was already deterministic with 148 transitions.
Incomplete random walk after 100000 steps, including 5908 resets, run finished after 335 ms. (steps per millisecond=298 ) properties (out of 31) seen :21
Running SMT prover for 10 properties.
[2021-05-17 20:01:50] [INFO ] Flow matrix only has 144 transitions (discarded 4 similar events)
// Phase 1: matrix 144 rows 79 cols
[2021-05-17 20:01:50] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 20:01:50] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2021-05-17 20:01:50] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:01:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:50] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2021-05-17 20:01:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:01:50] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:01:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:01:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 20:01:50] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:01:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:51] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2021-05-17 20:01:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:01:51] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 2 ms to minimize.
[2021-05-17 20:01:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2021-05-17 20:01:51] [INFO ] Computed and/alt/rep : 105/279/105 causal constraints (skipped 38 transitions) in 12 ms.
[2021-05-17 20:01:51] [INFO ] Deduced a trap composed of 11 places in 16 ms of which 2 ms to minimize.
[2021-05-17 20:01:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2021-05-17 20:01:51] [INFO ] Added : 45 causal constraints over 10 iterations in 163 ms. Result :sat
[2021-05-17 20:01:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 20:01:51] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:01:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:51] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-17 20:01:51] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 20:01:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:01:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 20:01:51] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 3 ms returned sat
[2021-05-17 20:01:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:51] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2021-05-17 20:01:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 20:01:51] [INFO ] Deduced a trap composed of 13 places in 12 ms of which 1 ms to minimize.
[2021-05-17 20:01:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2021-05-17 20:01:51] [INFO ] Computed and/alt/rep : 105/279/105 causal constraints (skipped 38 transitions) in 11 ms.
[2021-05-17 20:01:51] [INFO ] Deduced a trap composed of 11 places in 13 ms of which 2 ms to minimize.
[2021-05-17 20:01:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2021-05-17 20:01:51] [INFO ] Added : 46 causal constraints over 10 iterations in 135 ms. Result :sat
[2021-05-17 20:01:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 20:01:51] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:01:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:51] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-17 20:01:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:01:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-17 20:01:51] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-17 20:01:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:51] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2021-05-17 20:01:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:01:51] [INFO ] Computed and/alt/rep : 105/279/105 causal constraints (skipped 38 transitions) in 10 ms.
[2021-05-17 20:01:51] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2021-05-17 20:01:51] [INFO ] Deduced a trap composed of 11 places in 13 ms of which 0 ms to minimize.
[2021-05-17 20:01:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
[2021-05-17 20:01:51] [INFO ] Added : 43 causal constraints over 10 iterations in 172 ms. Result :sat
[2021-05-17 20:01:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 20:01:51] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 4 ms returned sat
[2021-05-17 20:01:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:51] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-17 20:01:51] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:01:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:01:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2021-05-17 20:01:51] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:01:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:51] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2021-05-17 20:01:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:01:51] [INFO ] Deduced a trap composed of 13 places in 14 ms of which 0 ms to minimize.
[2021-05-17 20:01:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2021-05-17 20:01:51] [INFO ] Computed and/alt/rep : 105/279/105 causal constraints (skipped 38 transitions) in 10 ms.
[2021-05-17 20:01:52] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
[2021-05-17 20:01:52] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2021-05-17 20:01:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 66 ms
[2021-05-17 20:01:52] [INFO ] Added : 49 causal constraints over 12 iterations in 184 ms. Result :sat
[2021-05-17 20:01:52] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 20:01:52] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:01:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:52] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-17 20:01:52] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 20:01:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:01:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-05-17 20:01:52] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:01:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:52] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2021-05-17 20:01:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:01:52] [INFO ] Computed and/alt/rep : 105/279/105 causal constraints (skipped 38 transitions) in 18 ms.
[2021-05-17 20:01:52] [INFO ] Added : 45 causal constraints over 10 iterations in 105 ms. Result :sat
[2021-05-17 20:01:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-17 20:01:52] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:01:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:52] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2021-05-17 20:01:52] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:01:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:01:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 20:01:52] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:01:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:52] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2021-05-17 20:01:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:01:52] [INFO ] Computed and/alt/rep : 105/279/105 causal constraints (skipped 38 transitions) in 11 ms.
[2021-05-17 20:01:52] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2021-05-17 20:01:52] [INFO ] Deduced a trap composed of 14 places in 14 ms of which 1 ms to minimize.
[2021-05-17 20:01:52] [INFO ] Deduced a trap composed of 11 places in 15 ms of which 1 ms to minimize.
[2021-05-17 20:01:52] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2021-05-17 20:01:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 118 ms
[2021-05-17 20:01:52] [INFO ] Added : 45 causal constraints over 10 iterations in 222 ms. Result :sat
[2021-05-17 20:01:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-17 20:01:52] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:01:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:52] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2021-05-17 20:01:52] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:01:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:01:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-17 20:01:52] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-17 20:01:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:52] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2021-05-17 20:01:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:01:52] [INFO ] Deduced a trap composed of 23 places in 18 ms of which 1 ms to minimize.
[2021-05-17 20:01:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2021-05-17 20:01:52] [INFO ] Computed and/alt/rep : 105/279/105 causal constraints (skipped 38 transitions) in 12 ms.
[2021-05-17 20:01:52] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2021-05-17 20:01:52] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2021-05-17 20:01:53] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2021-05-17 20:01:53] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 0 ms to minimize.
[2021-05-17 20:01:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 164 ms
[2021-05-17 20:01:53] [INFO ] Added : 40 causal constraints over 8 iterations in 263 ms. Result :sat
[2021-05-17 20:01:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 20:01:53] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:01:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:53] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-17 20:01:53] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:01:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:01:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 20:01:53] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-17 20:01:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:53] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-17 20:01:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:01:53] [INFO ] Computed and/alt/rep : 105/279/105 causal constraints (skipped 38 transitions) in 11 ms.
[2021-05-17 20:01:53] [INFO ] Added : 59 causal constraints over 13 iterations in 119 ms. Result :sat
[2021-05-17 20:01:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-17 20:01:53] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-17 20:01:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:53] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2021-05-17 20:01:53] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:01:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:01:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 20:01:53] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:01:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:53] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2021-05-17 20:01:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:01:53] [INFO ] Computed and/alt/rep : 105/279/105 causal constraints (skipped 38 transitions) in 10 ms.
[2021-05-17 20:01:53] [INFO ] Added : 55 causal constraints over 11 iterations in 105 ms. Result :sat
[2021-05-17 20:01:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-17 20:01:53] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:01:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:53] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2021-05-17 20:01:53] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:01:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:01:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-17 20:01:53] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-17 20:01:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:01:53] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2021-05-17 20:01:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 20:01:53] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2021-05-17 20:01:53] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2021-05-17 20:01:53] [INFO ] Deduced a trap composed of 11 places in 15 ms of which 1 ms to minimize.
[2021-05-17 20:01:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 86 ms
[2021-05-17 20:01:53] [INFO ] Computed and/alt/rep : 105/279/105 causal constraints (skipped 38 transitions) in 7 ms.
[2021-05-17 20:01:53] [INFO ] Added : 49 causal constraints over 10 iterations in 90 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&(G(p1) U p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 148/148 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 60 transition count 111
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 60 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 60 transition count 110
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 56 transition count 101
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 56 transition count 101
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 56 transition count 98
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 54 transition count 93
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 54 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 57 place count 54 transition count 90
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 53 transition count 88
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 53 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 61 place count 53 transition count 86
Applied a total of 61 rules in 8 ms. Remains 53 /79 variables (removed 26) and now considering 86/148 (removed 62) transitions.
[2021-05-17 20:01:53] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
// Phase 1: matrix 83 rows 53 cols
[2021-05-17 20:01:53] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:01:53] [INFO ] Implicit Places using invariants in 23 ms returned []
[2021-05-17 20:01:53] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
// Phase 1: matrix 83 rows 53 cols
[2021-05-17 20:01:53] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:01:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:01:53] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2021-05-17 20:01:53] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
// Phase 1: matrix 83 rows 53 cols
[2021-05-17 20:01:53] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:01:54] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/79 places, 86/148 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : HealthRecord-PT-09-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s12 1) (EQ s51 1)), p1:(NEQ s4 0), p0:(EQ s9 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA HealthRecord-PT-09-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-00 finished in 469 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 148/148 transitions.
Graph (trivial) has 95 edges and 79 vertex of which 12 / 79 are part of one of the 6 SCC in 3 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 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 54 transition count 106
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 54 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 38 place count 54 transition count 105
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 50 transition count 96
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 50 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 49 place count 50 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 49 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 49 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 49 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 48 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 48 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 61 place count 46 transition count 106
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 64 place count 46 transition count 103
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 65 place count 45 transition count 102
Applied a total of 65 rules in 36 ms. Remains 45 /79 variables (removed 34) and now considering 102/148 (removed 46) transitions.
[2021-05-17 20:01:54] [INFO ] Flow matrix only has 90 transitions (discarded 12 similar events)
// Phase 1: matrix 90 rows 45 cols
[2021-05-17 20:01:54] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:01:54] [INFO ] Implicit Places using invariants in 24 ms returned []
[2021-05-17 20:01:54] [INFO ] Flow matrix only has 90 transitions (discarded 12 similar events)
// Phase 1: matrix 90 rows 45 cols
[2021-05-17 20:01:54] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 20:01:54] [INFO ] State equation strengthened by 18 read => feed constraints.
[2021-05-17 20:01:54] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2021-05-17 20:01:54] [INFO ] Redundant transitions in 16 ms returned []
[2021-05-17 20:01:54] [INFO ] Flow matrix only has 90 transitions (discarded 12 similar events)
// Phase 1: matrix 90 rows 45 cols
[2021-05-17 20:01:54] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:01:54] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 1 iterations. Remains : 45/79 places, 102/148 transitions.
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-09-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s2 0), p0:(NEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1 reset in 191 ms.
Product exploration explored 100000 steps with 3 reset in 105 ms.
Knowledge obtained : [(NOT p1), p0]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 7 reset in 65 ms.
Product exploration explored 100000 steps with 0 reset in 125 ms.
[2021-05-17 20:01:55] [INFO ] Flatten gal took : 12 ms
[2021-05-17 20:01:55] [INFO ] Flatten gal took : 9 ms
[2021-05-17 20:01:55] [INFO ] Time to serialize gal into /tmp/LTL3824351342824164303.gal : 4 ms
[2021-05-17 20:01:55] [INFO ] Time to serialize properties into /tmp/LTL15336059178630477311.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/LTL3824351342824164303.gal, -t, CGAL, -LTL, /tmp/LTL15336059178630477311.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/LTL3824351342824164303.gal -t CGAL -LTL /tmp/LTL15336059178630477311.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p9!=1)")||(G("(p7!=0)"))))))
Formula 0 simplified : !GF("(p9!=1)" | G"(p7!=0)")
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t8, t9, t14, t15, t16, t17, t18, t22, t23, t24, t25, t26, t27, t35, t43, t85, t86, t87, t88, t105, t103.t78, t103.t79, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/75/27/102
Computing Next relation with stutter on 65 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
14 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.158225,21872,1,0,167,24067,235,65,2286,19110,225
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-09-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property HealthRecord-PT-09-01 finished in 1331 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0)||(p1 U X(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 148/148 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 62 transition count 115
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 62 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 62 transition count 114
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 58 transition count 105
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 58 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 46 place count 58 transition count 102
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 56 transition count 97
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 56 transition count 97
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 53 place count 56 transition count 94
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 55 transition count 92
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 55 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 58 place count 55 transition count 89
Applied a total of 58 rules in 6 ms. Remains 55 /79 variables (removed 24) and now considering 89/148 (removed 59) transitions.
[2021-05-17 20:01:55] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
// Phase 1: matrix 86 rows 55 cols
[2021-05-17 20:01:55] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:01:55] [INFO ] Implicit Places using invariants in 26 ms returned []
[2021-05-17 20:01:55] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
// Phase 1: matrix 86 rows 55 cols
[2021-05-17 20:01:55] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:01:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:01:55] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2021-05-17 20:01:55] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
// Phase 1: matrix 86 rows 55 cols
[2021-05-17 20:01:55] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:01:55] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 55/79 places, 89/148 transitions.
Stuttering acceptance computed with spot in 210 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-09-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}], [{ cond=true, acceptance={} source=7 dest: 8}], [{ cond=true, acceptance={} source=8 dest: 1}]], initial=7, aps=[p0:(AND (EQ s39 1) (EQ s8 1)), p1:(EQ s34 1), p2:(EQ s30 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-09-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-02 finished in 340 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 148/148 transitions.
Graph (trivial) has 98 edges and 79 vertex of which 12 / 79 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 52 transition count 102
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 52 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 42 place count 52 transition count 101
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 47 transition count 89
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 47 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 55 place count 47 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 44 transition count 79
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 44 transition count 79
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 67 place count 44 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 43 transition count 71
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 43 transition count 71
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 72 place count 43 transition count 68
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 4 with 2 rules applied. Total rules applied 74 place count 42 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 75 place count 42 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 79 place count 40 transition count 80
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 82 place count 40 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 83 place count 39 transition count 76
Applied a total of 83 rules in 21 ms. Remains 39 /79 variables (removed 40) and now considering 76/148 (removed 72) transitions.
[2021-05-17 20:01:56] [INFO ] Flow matrix only has 66 transitions (discarded 10 similar events)
// Phase 1: matrix 66 rows 39 cols
[2021-05-17 20:01:56] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:01:56] [INFO ] Implicit Places using invariants in 20 ms returned []
[2021-05-17 20:01:56] [INFO ] Flow matrix only has 66 transitions (discarded 10 similar events)
// Phase 1: matrix 66 rows 39 cols
[2021-05-17 20:01:56] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:01:56] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-17 20:01:56] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2021-05-17 20:01:56] [INFO ] Redundant transitions in 10 ms returned []
[2021-05-17 20:01:56] [INFO ] Flow matrix only has 66 transitions (discarded 10 similar events)
// Phase 1: matrix 66 rows 39 cols
[2021-05-17 20:01:56] [INFO ] Computed 9 place invariants in 10 ms
[2021-05-17 20:01:56] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/79 places, 76/148 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-09-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s31 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9 reset in 99 ms.
Product exploration explored 100000 steps with 12 reset in 87 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5 reset in 57 ms.
Product exploration explored 100000 steps with 0 reset in 96 ms.
[2021-05-17 20:01:56] [INFO ] Flatten gal took : 6 ms
[2021-05-17 20:01:56] [INFO ] Flatten gal took : 5 ms
[2021-05-17 20:01:56] [INFO ] Time to serialize gal into /tmp/LTL12520239177666432451.gal : 8 ms
[2021-05-17 20:01:56] [INFO ] Time to serialize properties into /tmp/LTL9650667599063668691.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/LTL12520239177666432451.gal, -t, CGAL, -LTL, /tmp/LTL9650667599063668691.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/LTL12520239177666432451.gal -t CGAL -LTL /tmp/LTL9650667599063668691.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(p144==0)"))))
Formula 0 simplified : !GF"(p144==0)"
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t8, t9, t23, t24, t25, t26, t27, t35, t43, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/62/14/76
Computing Next relation with stutter on 65 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
8 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.107083,19716,1,0,124,14883,173,53,1757,11219,169
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-09-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property HealthRecord-PT-09-03 finished in 779 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||(G(p1) U p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 148/148 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 60 transition count 111
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 60 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 60 transition count 110
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 56 transition count 101
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 56 transition count 101
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 56 transition count 98
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 54 transition count 93
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 54 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 57 place count 54 transition count 90
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 53 transition count 88
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 53 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 62 place count 53 transition count 85
Applied a total of 62 rules in 8 ms. Remains 53 /79 variables (removed 26) and now considering 85/148 (removed 63) transitions.
[2021-05-17 20:01:56] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
// Phase 1: matrix 82 rows 53 cols
[2021-05-17 20:01:56] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:01:56] [INFO ] Implicit Places using invariants in 28 ms returned []
[2021-05-17 20:01:56] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
// Phase 1: matrix 82 rows 53 cols
[2021-05-17 20:01:56] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:01:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:01:56] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2021-05-17 20:01:56] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
// Phase 1: matrix 82 rows 53 cols
[2021-05-17 20:01:56] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:01:56] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 53/79 places, 85/148 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p1)), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-09-04 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(AND (EQ s13 1) (EQ s51 1)), p0:(AND (EQ s31 1) (EQ s4 1)), p2:(EQ s31 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-09-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-04 finished in 254 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 148/148 transitions.
Graph (trivial) has 95 edges and 79 vertex of which 12 / 79 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 54 transition count 105
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 54 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 40 place count 54 transition count 104
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 50 transition count 94
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 50 transition count 94
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 50 transition count 91
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 48 transition count 87
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 48 transition count 87
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 61 place count 48 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 63 place count 47 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 47 transition count 79
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 76 place count 41 transition count 123
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 79 place count 41 transition count 120
Applied a total of 79 rules in 17 ms. Remains 41 /79 variables (removed 38) and now considering 120/148 (removed 28) transitions.
[2021-05-17 20:01:57] [INFO ] Flow matrix only has 105 transitions (discarded 15 similar events)
// Phase 1: matrix 105 rows 41 cols
[2021-05-17 20:01:57] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:01:57] [INFO ] Implicit Places using invariants in 39 ms returned []
[2021-05-17 20:01:57] [INFO ] Flow matrix only has 105 transitions (discarded 15 similar events)
// Phase 1: matrix 105 rows 41 cols
[2021-05-17 20:01:57] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:01:57] [INFO ] State equation strengthened by 29 read => feed constraints.
[2021-05-17 20:01:57] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2021-05-17 20:01:57] [INFO ] Redundant transitions in 16 ms returned []
[2021-05-17 20:01:57] [INFO ] Flow matrix only has 105 transitions (discarded 15 similar events)
// Phase 1: matrix 105 rows 41 cols
[2021-05-17 20:01:57] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:01:57] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 41/79 places, 120/148 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-09-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s29 1), p1:(EQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-09-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-05 finished in 237 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 10 out of 79 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 79/79 places, 148/148 transitions.
Graph (trivial) has 52 edges and 79 vertex of which 12 / 79 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 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 52 transition count 102
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 52 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 42 place count 52 transition count 101
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 47 transition count 89
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 47 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 55 place count 47 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 44 transition count 79
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 44 transition count 79
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 67 place count 44 transition count 73
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 43 transition count 71
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 43 transition count 71
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 72 place count 43 transition count 68
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 4 with 2 rules applied. Total rules applied 74 place count 42 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 75 place count 42 transition count 66
Applied a total of 75 rules in 11 ms. Remains 42 /79 variables (removed 37) and now considering 66/148 (removed 82) transitions.
[2021-05-17 20:01:57] [INFO ] Flow matrix only has 58 transitions (discarded 8 similar events)
// Phase 1: matrix 58 rows 42 cols
[2021-05-17 20:01:57] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 20:01:57] [INFO ] Implicit Places using invariants in 15 ms returned []
[2021-05-17 20:01:57] [INFO ] Flow matrix only has 58 transitions (discarded 8 similar events)
// Phase 1: matrix 58 rows 42 cols
[2021-05-17 20:01:57] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:01:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 20:01:57] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2021-05-17 20:01:57] [INFO ] Redundant transitions in 4 ms returned []
[2021-05-17 20:01:57] [INFO ] Flow matrix only has 58 transitions (discarded 8 similar events)
// Phase 1: matrix 58 rows 42 cols
[2021-05-17 20:01:57] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:01:57] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 42/79 places, 66/148 transitions.
Stuttering acceptance computed with spot in 31 ms :[true, (NOT p0)]
Running random walk in product with property : HealthRecord-PT-09-06 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:(OR (NEQ s4 1) (NEQ s8 1) (NEQ s12 1) (NEQ s14 1) (NEQ s17 1) (NEQ s19 1) (NEQ s22 1) (NEQ s25 1) (NEQ s28 1) (NEQ s41 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 8 reset in 81 ms.
Product exploration explored 100000 steps with 0 reset in 111 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 30 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 64 ms.
Product exploration explored 100000 steps with 2 reset in 101 ms.
[2021-05-17 20:01:57] [INFO ] Flatten gal took : 5 ms
[2021-05-17 20:01:57] [INFO ] Flatten gal took : 4 ms
[2021-05-17 20:01:57] [INFO ] Time to serialize gal into /tmp/LTL702072036468855469.gal : 1 ms
[2021-05-17 20:01:57] [INFO ] Time to serialize properties into /tmp/LTL13788083798584989422.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/LTL702072036468855469.gal, -t, CGAL, -LTL, /tmp/LTL13788083798584989422.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/LTL702072036468855469.gal -t CGAL -LTL /tmp/LTL13788083798584989422.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G("((((((((((p18!=1)||(p37!=1))||(p56!=1))||(p61!=1))||(p66!=1))||(p71!=1))||(p78!=1))||(p85!=1))||(p111!=1))||(p155!=1))")))
Formula 0 simplified : !G"((((((((((p18!=1)||(p37!=1))||(p56!=1))||(p61!=1))||(p66!=1))||(p71!=1))||(p78!=1))||(p85!=1))||(p111!=1))||(p155!=1))"
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t4, t5, t6, t8, t9, t23, t24, t25, t26, t27, t35, t43, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/52/14/66
Computing Next relation with stutter on 65 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
32 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.324576,28120,1,0,164,55092,152,145,1672,69302,309
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-09-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property HealthRecord-PT-09-06 finished in 931 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0&&(p0 U (p1||G(p0)))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 79 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 79/79 places, 148/148 transitions.
Graph (trivial) has 98 edges and 79 vertex of which 12 / 79 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 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 53 transition count 103
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 53 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 40 place count 53 transition count 102
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 45 place count 48 transition count 90
Iterating global reduction 1 with 5 rules applied. Total rules applied 50 place count 48 transition count 90
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 53 place count 48 transition count 87
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 45 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 45 transition count 80
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 65 place count 45 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 44 transition count 72
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 44 transition count 72
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 70 place count 44 transition count 69
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 4 with 2 rules applied. Total rules applied 72 place count 43 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 43 transition count 67
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 77 place count 41 transition count 81
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 79 place count 41 transition count 79
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 80 place count 40 transition count 78
Applied a total of 80 rules in 17 ms. Remains 40 /79 variables (removed 39) and now considering 78/148 (removed 70) transitions.
[2021-05-17 20:01:58] [INFO ] Flow matrix only has 67 transitions (discarded 11 similar events)
// Phase 1: matrix 67 rows 40 cols
[2021-05-17 20:01:58] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 20:01:58] [INFO ] Implicit Places using invariants in 21 ms returned []
[2021-05-17 20:01:58] [INFO ] Flow matrix only has 67 transitions (discarded 11 similar events)
// Phase 1: matrix 67 rows 40 cols
[2021-05-17 20:01:58] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 20:01:58] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-17 20:01:58] [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 20:01:58] [INFO ] Redundant transitions in 10 ms returned []
[2021-05-17 20:01:58] [INFO ] Flow matrix only has 67 transitions (discarded 11 similar events)
// Phase 1: matrix 67 rows 40 cols
[2021-05-17 20:01:58] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 20:01:58] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 40/79 places, 78/148 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-09-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s15 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 20 reset in 59 ms.
Product exploration explored 100000 steps with 4 reset in 65 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8 reset in 61 ms.
Product exploration explored 100000 steps with 7 reset in 65 ms.
Starting structural reductions, iteration 0 : 40/40 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 39 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 77
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 39 transition count 76
Applied a total of 3 rules in 5 ms. Remains 39 /40 variables (removed 1) and now considering 76/78 (removed 2) transitions.
[2021-05-17 20:01:58] [INFO ] Flow matrix only has 66 transitions (discarded 10 similar events)
// Phase 1: matrix 66 rows 39 cols
[2021-05-17 20:01:58] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:01:58] [INFO ] Implicit Places using invariants in 18 ms returned []
[2021-05-17 20:01:58] [INFO ] Flow matrix only has 66 transitions (discarded 10 similar events)
// Phase 1: matrix 66 rows 39 cols
[2021-05-17 20:01:58] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:01:58] [INFO ] State equation strengthened by 14 read => feed constraints.
[2021-05-17 20:01:58] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2021-05-17 20:01:58] [INFO ] Redundant transitions in 8 ms returned []
[2021-05-17 20:01:58] [INFO ] Flow matrix only has 66 transitions (discarded 10 similar events)
// Phase 1: matrix 66 rows 39 cols
[2021-05-17 20:01:58] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:01:58] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/40 places, 76/78 transitions.
[2021-05-17 20:01:58] [INFO ] Flatten gal took : 8 ms
[2021-05-17 20:01:58] [INFO ] Flatten gal took : 8 ms
[2021-05-17 20:01:58] [INFO ] Time to serialize gal into /tmp/LTL8732678921033308200.gal : 2 ms
[2021-05-17 20:01:58] [INFO ] Time to serialize properties into /tmp/LTL69463238149512586.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/LTL8732678921033308200.gal, -t, CGAL, -LTL, /tmp/LTL69463238149512586.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/LTL8732678921033308200.gal -t CGAL -LTL /tmp/LTL69463238149512586.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 8 LTL properties
Checking formula 0 : !((F(G(("(p68!=1)")&&(("(p68!=1)")U(("(p59==1)")||(G("(p68!=1)"))))))))
Formula 0 simplified : !FG("(p68!=1)" & ("(p68!=1)" U ("(p59==1)" | G"(p68!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t33, t35, t37, t38, t39, t40, t41, t42, t43, t44, t45, t46, t47, t48, t49, t50, t51, t52, t53, t54, t55, t56, t65, t66, t70, t71, t72, t73, t74, t75, t78, t79, t81, t82, t83, t84, t85, t86, t87, t88, t89, t90, t92, t99, t103, t104, t105, t109, t113, t121, t123, t125, t126, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/65/83/148
Computing Next relation with stutter on 65 deadlock states
Detected timeout of ITS tools.
[2021-05-17 20:02:13] [INFO ] Flatten gal took : 11 ms
[2021-05-17 20:02:13] [INFO ] Applying decomposition
[2021-05-17 20:02:13] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11546055012689392964.txt, -o, /tmp/graph11546055012689392964.bin, -w, /tmp/graph11546055012689392964.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11546055012689392964.bin, -l, -1, -v, -w, /tmp/graph11546055012689392964.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:02:13] [INFO ] Decomposing Gal with order
[2021-05-17 20:02:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:02:13] [INFO ] Removed a total of 102 redundant transitions.
[2021-05-17 20:02:13] [INFO ] Flatten gal took : 38 ms
[2021-05-17 20:02:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 6 ms.
[2021-05-17 20:02:13] [INFO ] Time to serialize gal into /tmp/LTL1911011130205008876.gal : 3 ms
[2021-05-17 20:02:14] [INFO ] Time to serialize properties into /tmp/LTL12808099703364608425.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/LTL1911011130205008876.gal, -t, CGAL, -LTL, /tmp/LTL12808099703364608425.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1911011130205008876.gal -t CGAL -LTL /tmp/LTL12808099703364608425.ltl -c -stutter-deadlock
Read 8 LTL properties
Checking formula 0 : !((F(G(("(i3.u4.p68!=1)")&&(("(i3.u4.p68!=1)")U(("(i3.u3.p59==1)")||(G("(i3.u4.p68!=1)"))))))))
Formula 0 simplified : !FG("(i3.u4.p68!=1)" & ("(i3.u4.p68!=1)" U ("(i3.u3.p59==1)" | G"(i3.u4.p68!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t6, t92, t99, t104, t105, t109, t113, t121, t123, t124, t125, t126, u0.t81, u0.t82, u0.t83, u0.t84, u0.t85, u0.t86, u0.t87, u0.t88, u0.t89, u0.t90, u1.t70, u1.t71, u1.t72, u1.t73, u1.t74, u1.t75, u1.t78, u1.t79, u2.t65, u2.t66, u7.t51, u7.t52, u7.t53, u7.t54, u7.t55, u7.t56, u8.t45, u8.t46, u8.t47, u8.t48, u8.t49, u8.t50, i8.t33, i8.t31, i8.u9.t29, i8.u9.t30, i8.u9.t37, i8.u9.t38, i8.u9.t39, i8.u9.t40, i8.u9.t41, i8.u9.t42, i8.u9.t43, i8.u9.t44, i10.t26, i10.t24, i10.t21, i10.t13, i10.t4, i10.u13.t5, i10.u13.t16, i10.u13.t25, i10.u14.t1, i10.u14.t2, i10.u14.t3, i10.u14.t8, i10.u14.t9, i10.u14.t10, i10.u14.t11, i10.u14.t12, i10.u14.t17, i10.u14.t18, i10.u14.t19, i10.u14.t20, i10.u14.t27, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/55/77/132
Computing Next relation with stutter on 65 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
51 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.525996,30984,1,0,26653,3218,1698,49056,762,10466,58155
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA HealthRecord-PT-09-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(G(("((u0.p9!=1)&&(u0.p16!=1))")&&(F("(u0.p16!=1)")))))))
Formula 1 simplified : !XXG("((u0.p9!=1)&&(u0.p16!=1))" & F"(u0.p16!=1)")
Computing Next relation with stutter on 65 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
20 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.734484,40304,1,0,44488,3682,1776,82663,774,15009,86951
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA HealthRecord-PT-09-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(F("(u1.p22==1)"))))
Formula 2 simplified : !XF"(u1.p22==1)"
Computing Next relation with stutter on 65 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
24 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.970992,47960,1,0,59447,3721,1837,109683,776,15576,108885
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA HealthRecord-PT-09-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(("(((i3.u4.p62==1)&&(u1.p36==1))&&(i10.u13.p154==1))")U(X(G("((u0.p17==1)&&(i10.u13.p154==1))"))))))
Formula 3 simplified : !X("(((i3.u4.p62==1)&&(u1.p36==1))&&(i10.u13.p154==1))" U XG"((u0.p17==1)&&(i10.u13.p154==1))")
Computing Next relation with stutter on 65 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
42 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.38842,68840,1,0,104442,3780,1921,184692,777,17849,162892
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA HealthRecord-PT-09-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((("(u7.p74==1)")U(("(i8.u9.p104!=1)")&&(X(F("(i8.u9.p104!=1)"))))))
Formula 4 simplified : !("(u7.p74==1)" U ("(i8.u9.p104!=1)" & XF"(i8.u9.p104!=1)"))
Computing Next relation with stutter on 65 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 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.38993,69080,1,0,104442,3780,1949,184692,777,17849,162926
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA HealthRecord-PT-09-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(X(F(("(u7.p75==1)")&&(F(("(u2.p46==1)")||(("(u8.p83==1)")U("(u2.p55==1)")))))))))
Formula 5 simplified : !XXF("(u7.p75==1)" & F("(u2.p46==1)" | ("(u8.p83==1)" U "(u2.p55==1)")))
Computing Next relation with stutter on 65 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
16 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.54635,73236,1,0,112501,3817,2050,200938,781,18022,174214
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA HealthRecord-PT-09-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F((G("(i8.u9.p100==1)"))&&(("(u8.p83==1)")||(X(("(i8.u9.p104==1)")U("((i8.u9.p104==1)&&(u8.p83==1))")))))))
Formula 6 simplified : !F(G"(i8.u9.p100==1)" & ("(u8.p83==1)" | X("(i8.u9.p104==1)" U "((i8.u9.p104==1)&&(u8.p83==1))")))
Computing Next relation with stutter on 65 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
19 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.73568,78752,1,0,121600,3960,2109,219713,783,18711,187215
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA HealthRecord-PT-09-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(F("(i10.u14.p130!=1)"))))
Formula 7 simplified : !GF"(i10.u14.p130!=1)"
Computing Next relation with stutter on 65 deadlock states
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
1 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.74622,79016,1,0,121827,3960,2128,220120,783,18733,188052
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA HealthRecord-PT-09-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property HealthRecord-PT-09-07 finished in 17922 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621281737790

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

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