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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K 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.2K May 11 18:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 11 18:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 11 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 11 15:49 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 119K 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-17-00
FORMULA_NAME HealthRecord-PT-17-01
FORMULA_NAME HealthRecord-PT-17-02
FORMULA_NAME HealthRecord-PT-17-03
FORMULA_NAME HealthRecord-PT-17-04
FORMULA_NAME HealthRecord-PT-17-05
FORMULA_NAME HealthRecord-PT-17-06
FORMULA_NAME HealthRecord-PT-17-07
FORMULA_NAME HealthRecord-PT-17-08
FORMULA_NAME HealthRecord-PT-17-09
FORMULA_NAME HealthRecord-PT-17-10
FORMULA_NAME HealthRecord-PT-17-11
FORMULA_NAME HealthRecord-PT-17-12
FORMULA_NAME HealthRecord-PT-17-13
FORMULA_NAME HealthRecord-PT-17-14
FORMULA_NAME HealthRecord-PT-17-15

=== Now, execution of the tool begins

BK_START 1621283871170

Running Version 0
[2021-05-17 20:37:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 20:37:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 20:37:53] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2021-05-17 20:37:53] [INFO ] Transformed 624 places.
[2021-05-17 20:37:53] [INFO ] Transformed 828 transitions.
[2021-05-17 20:37:53] [INFO ] Found NUPN structural information;
[2021-05-17 20:37:53] [INFO ] Parsed PT model containing 624 places and 828 transitions in 116 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 20:37:53] [INFO ] Initial state test concluded for 2 properties.
FORMULA HealthRecord-PT-17-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 624 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 624/624 places, 828/828 transitions.
Discarding 125 places :
Symmetric choice reduction at 0 with 125 rule applications. Total rules 125 place count 499 transition count 681
Iterating global reduction 0 with 125 rules applied. Total rules applied 250 place count 499 transition count 681
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 304 place count 445 transition count 616
Iterating global reduction 0 with 54 rules applied. Total rules applied 358 place count 445 transition count 616
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 365 place count 445 transition count 609
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 390 place count 420 transition count 565
Iterating global reduction 1 with 25 rules applied. Total rules applied 415 place count 420 transition count 565
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 428 place count 407 transition count 544
Iterating global reduction 1 with 13 rules applied. Total rules applied 441 place count 407 transition count 544
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 446 place count 402 transition count 535
Iterating global reduction 1 with 5 rules applied. Total rules applied 451 place count 402 transition count 535
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 453 place count 400 transition count 531
Iterating global reduction 1 with 2 rules applied. Total rules applied 455 place count 400 transition count 531
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 457 place count 398 transition count 529
Iterating global reduction 1 with 2 rules applied. Total rules applied 459 place count 398 transition count 529
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 461 place count 396 transition count 527
Iterating global reduction 1 with 2 rules applied. Total rules applied 463 place count 396 transition count 527
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 464 place count 396 transition count 526
Applied a total of 464 rules in 191 ms. Remains 396 /624 variables (removed 228) and now considering 526/828 (removed 302) transitions.
// Phase 1: matrix 526 rows 396 cols
[2021-05-17 20:37:53] [INFO ] Computed 18 place invariants in 24 ms
[2021-05-17 20:37:53] [INFO ] Implicit Places using invariants in 221 ms returned []
// Phase 1: matrix 526 rows 396 cols
[2021-05-17 20:37:53] [INFO ] Computed 18 place invariants in 4 ms
[2021-05-17 20:37:53] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
// Phase 1: matrix 526 rows 396 cols
[2021-05-17 20:37:53] [INFO ] Computed 18 place invariants in 13 ms
[2021-05-17 20:37:54] [INFO ] Dead Transitions using invariants and state equation in 258 ms returned []
Finished structural reductions, in 1 iterations. Remains : 396/624 places, 526/828 transitions.
[2021-05-17 20:37:54] [INFO ] Flatten gal took : 63 ms
[2021-05-17 20:37:54] [INFO ] Flatten gal took : 27 ms
[2021-05-17 20:37:54] [INFO ] Input system was already deterministic with 526 transitions.
Incomplete random walk after 100000 steps, including 873 resets, run finished after 412 ms. (steps per millisecond=242 ) properties (out of 32) seen :13
Running SMT prover for 19 properties.
// Phase 1: matrix 526 rows 396 cols
[2021-05-17 20:37:54] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 20:37:54] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-17 20:37:54] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2021-05-17 20:37:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:37:55] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2021-05-17 20:37:55] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 30 ms.
[2021-05-17 20:37:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:37:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2021-05-17 20:37:55] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 14 ms returned sat
[2021-05-17 20:37:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:37:55] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2021-05-17 20:37:55] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 36 ms.
[2021-05-17 20:37:57] [INFO ] Added : 391 causal constraints over 79 iterations in 2256 ms. Result :sat
[2021-05-17 20:37:57] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2021-05-17 20:37:57] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2021-05-17 20:37:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:37:58] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2021-05-17 20:37:58] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 3 ms to minimize.
[2021-05-17 20:37:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2021-05-17 20:37:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:37:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2021-05-17 20:37:58] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-17 20:37:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:37:58] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2021-05-17 20:37:58] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 1 ms to minimize.
[2021-05-17 20:37:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2021-05-17 20:37:58] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 29 ms.
[2021-05-17 20:38:00] [INFO ] Added : 382 causal constraints over 77 iterations in 1998 ms. Result :sat
[2021-05-17 20:38:00] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-17 20:38:00] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-17 20:38:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:00] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2021-05-17 20:38:00] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2021-05-17 20:38:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2021-05-17 20:38:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:38:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2021-05-17 20:38:00] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-17 20:38:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:01] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2021-05-17 20:38:01] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2021-05-17 20:38:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2021-05-17 20:38:01] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 30 ms.
[2021-05-17 20:38:02] [INFO ] Added : 333 causal constraints over 67 iterations in 1746 ms. Result :sat
[2021-05-17 20:38:02] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2021-05-17 20:38:02] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2021-05-17 20:38:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:03] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2021-05-17 20:38:03] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 32 ms.
[2021-05-17 20:38:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:38:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 11 ms returned sat
[2021-05-17 20:38:03] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 18 ms returned sat
[2021-05-17 20:38:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:03] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2021-05-17 20:38:03] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 27 ms.
[2021-05-17 20:38:05] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 1 ms to minimize.
[2021-05-17 20:38:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2021-05-17 20:38:05] [INFO ] Added : 349 causal constraints over 71 iterations in 1926 ms. Result :sat
[2021-05-17 20:38:05] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-17 20:38:05] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-17 20:38:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:05] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-17 20:38:05] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 1 ms to minimize.
[2021-05-17 20:38:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 166 ms
[2021-05-17 20:38:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:38:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2021-05-17 20:38:05] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2021-05-17 20:38:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:06] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2021-05-17 20:38:06] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2021-05-17 20:38:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2021-05-17 20:38:06] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 33 ms.
[2021-05-17 20:38:08] [INFO ] Added : 383 causal constraints over 78 iterations in 2157 ms. Result :sat
[2021-05-17 20:38:08] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2021-05-17 20:38:08] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-17 20:38:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:08] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2021-05-17 20:38:08] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 25 ms.
[2021-05-17 20:38:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:38:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2021-05-17 20:38:08] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-17 20:38:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:08] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2021-05-17 20:38:08] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 33 ms.
[2021-05-17 20:38:10] [INFO ] Added : 381 causal constraints over 77 iterations in 1968 ms. Result :sat
[2021-05-17 20:38:10] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2021-05-17 20:38:10] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-17 20:38:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:11] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2021-05-17 20:38:11] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 31 ms.
[2021-05-17 20:38:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:38:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2021-05-17 20:38:11] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-17 20:38:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:11] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2021-05-17 20:38:11] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 28 ms.
[2021-05-17 20:38:13] [INFO ] Added : 386 causal constraints over 78 iterations in 2062 ms. Result :sat
[2021-05-17 20:38:13] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-17 20:38:13] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-17 20:38:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:13] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2021-05-17 20:38:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:38:13] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-17 20:38:13] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-17 20:38:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:13] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2021-05-17 20:38:13] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 26 ms.
[2021-05-17 20:38:15] [INFO ] Added : 338 causal constraints over 68 iterations in 1760 ms. Result :sat
[2021-05-17 20:38:15] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-17 20:38:15] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-17 20:38:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:15] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2021-05-17 20:38:15] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 27 ms.
[2021-05-17 20:38:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:38:15] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2021-05-17 20:38:15] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-17 20:38:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:16] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2021-05-17 20:38:16] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 27 ms.
[2021-05-17 20:38:17] [INFO ] Added : 321 causal constraints over 65 iterations in 1610 ms. Result :sat
[2021-05-17 20:38:17] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-17 20:38:17] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-17 20:38:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:17] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2021-05-17 20:38:18] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 9 ms to minimize.
[2021-05-17 20:38:18] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 1 ms to minimize.
[2021-05-17 20:38:18] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 1 ms to minimize.
[2021-05-17 20:38:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 340 ms
[2021-05-17 20:38:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:38:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2021-05-17 20:38:18] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-17 20:38:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:18] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2021-05-17 20:38:18] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 1 ms to minimize.
[2021-05-17 20:38:18] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 0 ms to minimize.
[2021-05-17 20:38:18] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 0 ms to minimize.
[2021-05-17 20:38:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 361 ms
[2021-05-17 20:38:18] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 26 ms.
[2021-05-17 20:38:20] [INFO ] Added : 377 causal constraints over 76 iterations in 2003 ms. Result :sat
[2021-05-17 20:38:20] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-17 20:38:20] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2021-05-17 20:38:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:21] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2021-05-17 20:38:21] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 1 ms to minimize.
[2021-05-17 20:38:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2021-05-17 20:38:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:38:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2021-05-17 20:38:21] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2021-05-17 20:38:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:21] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2021-05-17 20:38:21] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2021-05-17 20:38:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2021-05-17 20:38:21] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 26 ms.
[2021-05-17 20:38:23] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 1 ms to minimize.
[2021-05-17 20:38:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2021-05-17 20:38:23] [INFO ] Added : 364 causal constraints over 74 iterations in 2041 ms. Result :sat
[2021-05-17 20:38:23] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-17 20:38:23] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-17 20:38:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:23] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2021-05-17 20:38:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:38:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2021-05-17 20:38:23] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2021-05-17 20:38:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:23] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2021-05-17 20:38:24] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 0 ms to minimize.
[2021-05-17 20:38:24] [INFO ] Deduced a trap composed of 76 places in 75 ms of which 0 ms to minimize.
[2021-05-17 20:38:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 213 ms
[2021-05-17 20:38:24] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 31 ms.
[2021-05-17 20:38:26] [INFO ] Added : 394 causal constraints over 80 iterations in 2121 ms. Result :sat
[2021-05-17 20:38:26] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-17 20:38:26] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-17 20:38:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:26] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2021-05-17 20:38:26] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 25 ms.
[2021-05-17 20:38:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:38:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-17 20:38:26] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-17 20:38:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:26] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2021-05-17 20:38:26] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 27 ms.
[2021-05-17 20:38:28] [INFO ] Added : 386 causal constraints over 78 iterations in 2086 ms. Result :sat
[2021-05-17 20:38:28] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-17 20:38:28] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-17 20:38:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:29] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2021-05-17 20:38:29] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 29 ms.
[2021-05-17 20:38:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:38:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 28 ms returned sat
[2021-05-17 20:38:29] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 34 ms returned sat
[2021-05-17 20:38:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:29] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2021-05-17 20:38:29] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 25 ms.
[2021-05-17 20:38:31] [INFO ] Deduced a trap composed of 79 places in 69 ms of which 1 ms to minimize.
[2021-05-17 20:38:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2021-05-17 20:38:31] [INFO ] Added : 348 causal constraints over 71 iterations in 1988 ms. Result :sat
[2021-05-17 20:38:31] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-17 20:38:31] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-17 20:38:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:31] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2021-05-17 20:38:31] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 35 ms.
[2021-05-17 20:38:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:38:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-17 20:38:31] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-17 20:38:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:32] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2021-05-17 20:38:32] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 28 ms.
[2021-05-17 20:38:34] [INFO ] Added : 400 causal constraints over 81 iterations in 2209 ms. Result :sat
[2021-05-17 20:38:34] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-17 20:38:34] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-17 20:38:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:34] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2021-05-17 20:38:34] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 26 ms.
[2021-05-17 20:38:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:38:34] [INFO ] [Nat]Absence check using 10 positive place invariants in 20 ms returned sat
[2021-05-17 20:38:34] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 31 ms returned sat
[2021-05-17 20:38:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:34] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2021-05-17 20:38:34] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 28 ms.
[2021-05-17 20:38:36] [INFO ] Added : 388 causal constraints over 79 iterations in 2080 ms. Result :sat
[2021-05-17 20:38:36] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-17 20:38:36] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-17 20:38:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:37] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2021-05-17 20:38:37] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 0 ms to minimize.
[2021-05-17 20:38:37] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 1 ms to minimize.
[2021-05-17 20:38:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 230 ms
[2021-05-17 20:38:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:38:37] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2021-05-17 20:38:37] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2021-05-17 20:38:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:37] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2021-05-17 20:38:37] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 1 ms to minimize.
[2021-05-17 20:38:37] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 0 ms to minimize.
[2021-05-17 20:38:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 234 ms
[2021-05-17 20:38:37] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 35 ms.
[2021-05-17 20:38:39] [INFO ] Added : 382 causal constraints over 77 iterations in 2040 ms. Result :sat
[2021-05-17 20:38:39] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-17 20:38:39] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2021-05-17 20:38:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:39] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2021-05-17 20:38:40] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 8 ms to minimize.
[2021-05-17 20:38:40] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 1 ms to minimize.
[2021-05-17 20:38:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 223 ms
[2021-05-17 20:38:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:38:40] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2021-05-17 20:38:40] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-17 20:38:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:40] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2021-05-17 20:38:40] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 1 ms to minimize.
[2021-05-17 20:38:40] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 0 ms to minimize.
[2021-05-17 20:38:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2021-05-17 20:38:40] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 35 ms.
[2021-05-17 20:38:42] [INFO ] Added : 389 causal constraints over 79 iterations in 2085 ms. Result :sat
[2021-05-17 20:38:42] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-17 20:38:42] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-17 20:38:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:42] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2021-05-17 20:38:42] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 30 ms.
[2021-05-17 20:38:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 20:38:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2021-05-17 20:38:43] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2021-05-17 20:38:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 20:38:43] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2021-05-17 20:38:43] [INFO ] Computed and/alt/rep : 511/909/511 causal constraints (skipped 14 transitions) in 26 ms.
[2021-05-17 20:38:45] [INFO ] Added : 385 causal constraints over 78 iterations in 2102 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0&&(p1||X(p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 396 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 396/396 places, 526/526 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 383 transition count 504
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 383 transition count 504
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 375 transition count 492
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 375 transition count 492
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 371 transition count 486
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 371 transition count 486
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 371 transition count 485
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 369 transition count 483
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 369 transition count 483
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 367 transition count 481
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 367 transition count 481
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 367 transition count 480
Applied a total of 60 rules in 59 ms. Remains 367 /396 variables (removed 29) and now considering 480/526 (removed 46) transitions.
// Phase 1: matrix 480 rows 367 cols
[2021-05-17 20:38:45] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 20:38:45] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 480 rows 367 cols
[2021-05-17 20:38:45] [INFO ] Computed 18 place invariants in 4 ms
[2021-05-17 20:38:45] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
// Phase 1: matrix 480 rows 367 cols
[2021-05-17 20:38:45] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 20:38:45] [INFO ] Dead Transitions using invariants and state equation in 223 ms returned []
Finished structural reductions, in 1 iterations. Remains : 367/396 places, 480/526 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : HealthRecord-PT-17-00 automaton TGBA [mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p1 (NOT p2)) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s74 1), p0:(OR (EQ s304 1) (EQ s91 1)), p2:(NEQ s334 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 105 steps with 0 reset in 3 ms.
FORMULA HealthRecord-PT-17-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-00 finished in 831 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(p1)&&F(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 396 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 396/396 places, 526/526 transitions.
Graph (trivial) has 453 edges and 396 vertex of which 72 / 396 are part of one of the 21 SCC in 4 ms
Free SCC test removed 51 places
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 144 place count 344 transition count 322
Reduce places removed 143 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 154 rules applied. Total rules applied 298 place count 201 transition count 311
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 305 place count 195 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 306 place count 194 transition count 310
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 306 place count 194 transition count 305
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 316 place count 189 transition count 305
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 344 place count 161 transition count 255
Iterating global reduction 4 with 28 rules applied. Total rules applied 372 place count 161 transition count 255
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 5 rules applied. Total rules applied 377 place count 161 transition count 250
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 382 place count 156 transition count 250
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 397 place count 141 transition count 228
Iterating global reduction 6 with 15 rules applied. Total rules applied 412 place count 141 transition count 228
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 418 place count 141 transition count 222
Performed 52 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 7 with 104 rules applied. Total rules applied 522 place count 89 transition count 166
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 527 place count 89 transition count 161
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 534 place count 82 transition count 147
Iterating global reduction 8 with 7 rules applied. Total rules applied 541 place count 82 transition count 147
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 543 place count 80 transition count 144
Iterating global reduction 8 with 2 rules applied. Total rules applied 545 place count 80 transition count 144
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 553 place count 76 transition count 191
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 8 with 18 rules applied. Total rules applied 571 place count 76 transition count 173
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 573 place count 75 transition count 182
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 574 place count 74 transition count 179
Iterating global reduction 8 with 1 rules applied. Total rules applied 575 place count 74 transition count 179
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 583 place count 74 transition count 171
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 588 place count 74 transition count 171
Applied a total of 588 rules in 116 ms. Remains 74 /396 variables (removed 322) and now considering 171/526 (removed 355) transitions.
[2021-05-17 20:38:46] [INFO ] Flow matrix only has 159 transitions (discarded 12 similar events)
// Phase 1: matrix 159 rows 74 cols
[2021-05-17 20:38:46] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:38:46] [INFO ] Implicit Places using invariants in 34 ms returned []
[2021-05-17 20:38:46] [INFO ] Flow matrix only has 159 transitions (discarded 12 similar events)
// Phase 1: matrix 159 rows 74 cols
[2021-05-17 20:38:46] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-17 20:38:46] [INFO ] State equation strengthened by 17 read => feed constraints.
[2021-05-17 20:38:46] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2021-05-17 20:38:46] [INFO ] Redundant transitions in 9 ms returned []
[2021-05-17 20:38:46] [INFO ] Flow matrix only has 159 transitions (discarded 12 similar events)
// Phase 1: matrix 159 rows 74 cols
[2021-05-17 20:38:46] [INFO ] Computed 9 place invariants in 4 ms
[2021-05-17 20:38:46] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
Finished structural reductions, in 1 iterations. Remains : 74/396 places, 171/526 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : HealthRecord-PT-17-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s63 1), p1:(EQ s46 1), p2:(EQ s59 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-17-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-01 finished in 462 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G((p0||X(p1))))&&F(!p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 396 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 396/396 places, 526/526 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 380 transition count 499
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 380 transition count 499
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 371 transition count 486
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 371 transition count 486
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 365 transition count 476
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 365 transition count 476
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 365 transition count 475
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 67 place count 361 transition count 470
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 361 transition count 470
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 75 place count 357 transition count 465
Iterating global reduction 1 with 4 rules applied. Total rules applied 79 place count 357 transition count 465
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 83 place count 357 transition count 461
Applied a total of 83 rules in 67 ms. Remains 357 /396 variables (removed 39) and now considering 461/526 (removed 65) transitions.
// Phase 1: matrix 461 rows 357 cols
[2021-05-17 20:38:46] [INFO ] Computed 18 place invariants in 4 ms
[2021-05-17 20:38:46] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 461 rows 357 cols
[2021-05-17 20:38:46] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 20:38:46] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
// Phase 1: matrix 461 rows 357 cols
[2021-05-17 20:38:46] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 20:38:47] [INFO ] Dead Transitions using invariants and state equation in 212 ms returned []
Finished structural reductions, in 1 iterations. Remains : 357/396 places, 461/526 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), p0, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-17-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s246 1), p1:(EQ s263 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-17-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-03 finished in 694 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F((p0||X(p0)))||X((G(p1) U p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 396 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 396/396 places, 526/526 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 381 transition count 501
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 381 transition count 501
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 373 transition count 490
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 373 transition count 490
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 367 transition count 480
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 367 transition count 480
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 367 transition count 479
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 63 place count 363 transition count 474
Iterating global reduction 1 with 4 rules applied. Total rules applied 67 place count 363 transition count 474
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 71 place count 359 transition count 469
Iterating global reduction 1 with 4 rules applied. Total rules applied 75 place count 359 transition count 469
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 79 place count 359 transition count 465
Applied a total of 79 rules in 37 ms. Remains 359 /396 variables (removed 37) and now considering 465/526 (removed 61) transitions.
// Phase 1: matrix 465 rows 359 cols
[2021-05-17 20:38:47] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-17 20:38:47] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 465 rows 359 cols
[2021-05-17 20:38:47] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 20:38:47] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
// Phase 1: matrix 465 rows 359 cols
[2021-05-17 20:38:47] [INFO ] Computed 18 place invariants in 8 ms
[2021-05-17 20:38:47] [INFO ] Dead Transitions using invariants and state equation in 235 ms returned []
Finished structural reductions, in 1 iterations. Remains : 359/396 places, 465/526 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s350 1), p2:(AND (EQ s203 1) (EQ s352 1)), p1:(EQ s339 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 97 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-17-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-04 finished in 694 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 396 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 396/396 places, 526/526 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 381 transition count 501
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 381 transition count 501
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 373 transition count 489
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 373 transition count 489
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 368 transition count 481
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 368 transition count 481
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 368 transition count 480
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 365 transition count 476
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 365 transition count 476
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 362 transition count 472
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 362 transition count 472
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 73 place count 362 transition count 468
Applied a total of 73 rules in 30 ms. Remains 362 /396 variables (removed 34) and now considering 468/526 (removed 58) transitions.
// Phase 1: matrix 468 rows 362 cols
[2021-05-17 20:38:48] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 20:38:48] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 468 rows 362 cols
[2021-05-17 20:38:48] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 20:38:48] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
// Phase 1: matrix 468 rows 362 cols
[2021-05-17 20:38:48] [INFO ] Computed 18 place invariants in 4 ms
[2021-05-17 20:38:48] [INFO ] Dead Transitions using invariants and state equation in 221 ms returned []
Finished structural reductions, in 1 iterations. Remains : 362/396 places, 468/526 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-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}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s56 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 874 reset in 220 ms.
Product exploration explored 100000 steps with 869 reset in 207 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 873 reset in 136 ms.
Product exploration explored 100000 steps with 875 reset in 208 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 362 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 362/362 places, 468/468 transitions.
Graph (trivial) has 409 edges and 362 vertex of which 63 / 362 are part of one of the 21 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 135 rules applied. Total rules applied 136 place count 320 transition count 420
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 7 rules applied. Total rules applied 143 place count 320 transition count 414
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 143 place count 320 transition count 414
Deduced a syphon composed of 141 places in 1 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 148 place count 320 transition count 414
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 244 place count 224 transition count 313
Deduced a syphon composed of 59 places in 1 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 340 place count 224 transition count 313
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 344 place count 220 transition count 309
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 348 place count 220 transition count 309
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 351 place count 220 transition count 306
Performed 61 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 120 places in 0 ms
Iterating global reduction 3 with 61 rules applied. Total rules applied 412 place count 220 transition count 333
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 421 place count 220 transition count 324
Discarding 53 places :
Symmetric choice reduction at 4 with 53 rule applications. Total rules 474 place count 167 transition count 254
Deduced a syphon composed of 77 places in 1 ms
Iterating global reduction 4 with 53 rules applied. Total rules applied 527 place count 167 transition count 254
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 532 place count 162 transition count 247
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 4 with 5 rules applied. Total rules applied 537 place count 162 transition count 247
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 543 place count 156 transition count 229
Deduced a syphon composed of 73 places in 1 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 549 place count 156 transition count 229
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 552 place count 156 transition count 226
Performed 16 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 5 with 16 rules applied. Total rules applied 568 place count 156 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 569 place count 156 transition count 363
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 586 place count 139 transition count 316
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 6 with 17 rules applied. Total rules applied 603 place count 139 transition count 316
Deduced a syphon composed of 72 places in 1 ms
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 6 with 28 rules applied. Total rules applied 631 place count 139 transition count 288
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 637 place count 133 transition count 269
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 6 with 6 rules applied. Total rules applied 643 place count 133 transition count 269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 67 places in 1 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 644 place count 133 transition count 284
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 647 place count 130 transition count 277
Deduced a syphon composed of 65 places in 1 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 650 place count 130 transition count 277
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 653 place count 127 transition count 272
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 656 place count 127 transition count 272
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 657 place count 126 transition count 271
Deduced a syphon composed of 64 places in 1 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 658 place count 126 transition count 271
Deduced a syphon composed of 64 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 661 place count 126 transition count 268
Deduced a syphon composed of 64 places in 0 ms
Applied a total of 661 rules in 93 ms. Remains 126 /362 variables (removed 236) and now considering 268/468 (removed 200) transitions.
[2021-05-17 20:38:49] [INFO ] Redundant transitions in 19 ms returned []
[2021-05-17 20:38:49] [INFO ] Flow matrix only has 252 transitions (discarded 16 similar events)
// Phase 1: matrix 252 rows 126 cols
[2021-05-17 20:38:49] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:38:49] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Finished structural reductions, in 1 iterations. Remains : 126/362 places, 268/468 transitions.
Product exploration explored 100000 steps with 6949 reset in 372 ms.
Entered a terminal (fully accepting) state of product in 65399 steps with 4551 reset in 191 ms.
FORMULA HealthRecord-PT-17-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-05 finished in 2471 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X(F((p0&&F(p1)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 396 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 396/396 places, 526/526 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 381 transition count 501
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 381 transition count 501
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 373 transition count 490
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 373 transition count 490
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 368 transition count 481
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 368 transition count 481
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 57 place count 368 transition count 480
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 61 place count 364 transition count 475
Iterating global reduction 1 with 4 rules applied. Total rules applied 65 place count 364 transition count 475
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 360 transition count 470
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 360 transition count 470
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 77 place count 360 transition count 466
Applied a total of 77 rules in 39 ms. Remains 360 /396 variables (removed 36) and now considering 466/526 (removed 60) transitions.
// Phase 1: matrix 466 rows 360 cols
[2021-05-17 20:38:50] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 20:38:50] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 466 rows 360 cols
[2021-05-17 20:38:50] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 20:38:50] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
// Phase 1: matrix 466 rows 360 cols
[2021-05-17 20:38:50] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 20:38:50] [INFO ] Dead Transitions using invariants and state equation in 189 ms returned []
Finished structural reductions, in 1 iterations. Remains : 360/396 places, 466/526 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-17-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s283 0), p1:(EQ s116 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 417 ms.
Product exploration explored 100000 steps with 50000 reset in 364 ms.
Knowledge obtained : [p0, (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 297 ms.
Product exploration explored 100000 steps with 50000 reset in 304 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 2 out of 360 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 360/360 places, 466/466 transitions.
Graph (trivial) has 404 edges and 360 vertex of which 60 / 360 are part of one of the 21 SCC in 1 ms
Free SCC test removed 39 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 133 rules applied. Total rules applied 134 place count 321 transition count 421
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 7 rules applied. Total rules applied 141 place count 321 transition count 415
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 141 place count 321 transition count 415
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 146 place count 321 transition count 415
Discarding 93 places :
Symmetric choice reduction at 2 with 93 rule applications. Total rules 239 place count 228 transition count 318
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 2 with 93 rules applied. Total rules applied 332 place count 228 transition count 318
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 336 place count 224 transition count 314
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 340 place count 224 transition count 314
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 343 place count 224 transition count 311
Performed 60 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 119 places in 0 ms
Iterating global reduction 3 with 60 rules applied. Total rules applied 403 place count 224 transition count 337
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 412 place count 224 transition count 328
Discarding 54 places :
Symmetric choice reduction at 4 with 54 rule applications. Total rules 466 place count 170 transition count 256
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 4 with 54 rules applied. Total rules applied 520 place count 170 transition count 256
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 523 place count 167 transition count 252
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 526 place count 167 transition count 252
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 529 place count 164 transition count 243
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 532 place count 164 transition count 243
Performed 16 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 4 with 16 rules applied. Total rules applied 548 place count 164 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 549 place count 164 transition count 377
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 565 place count 148 transition count 332
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 5 with 16 rules applied. Total rules applied 581 place count 148 transition count 332
Deduced a syphon composed of 75 places in 0 ms
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 597 place count 148 transition count 316
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 601 place count 144 transition count 300
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 5 with 4 rules applied. Total rules applied 605 place count 144 transition count 300
Deduced a syphon composed of 71 places in 0 ms
Applied a total of 605 rules in 49 ms. Remains 144 /360 variables (removed 216) and now considering 300/466 (removed 166) transitions.
[2021-05-17 20:38:52] [INFO ] Redundant transitions in 7 ms returned []
[2021-05-17 20:38:52] [INFO ] Flow matrix only has 284 transitions (discarded 16 similar events)
// Phase 1: matrix 284 rows 144 cols
[2021-05-17 20:38:52] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:38:52] [INFO ] Dead Transitions using invariants and state equation in 112 ms returned []
Finished structural reductions, in 1 iterations. Remains : 144/360 places, 300/466 transitions.
Product exploration explored 100000 steps with 50000 reset in 845 ms.
Product exploration explored 100000 steps with 50000 reset in 855 ms.
[2021-05-17 20:38:54] [INFO ] Flatten gal took : 21 ms
[2021-05-17 20:38:54] [INFO ] Flatten gal took : 20 ms
[2021-05-17 20:38:54] [INFO ] Time to serialize gal into /tmp/LTL14614257057699677303.gal : 13 ms
[2021-05-17 20:38:54] [INFO ] Time to serialize properties into /tmp/LTL1151876037018594532.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/LTL14614257057699677303.gal, -t, CGAL, -LTL, /tmp/LTL1151876037018594532.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/LTL14614257057699677303.gal -t CGAL -LTL /tmp/LTL1151876037018594532.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(p477==0)")||(X(F(("(p477==0)")&&(F("(p262==1)"))))))))
Formula 0 simplified : !X("(p477==0)" | XF("(p477==0)" & F"(p262==1)"))
Detected timeout of ITS tools.
[2021-05-17 20:39:09] [INFO ] Flatten gal took : 19 ms
[2021-05-17 20:39:09] [INFO ] Applying decomposition
[2021-05-17 20:39:09] [INFO ] Flatten gal took : 18 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/graph3350865699960192122.txt, -o, /tmp/graph3350865699960192122.bin, -w, /tmp/graph3350865699960192122.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/graph3350865699960192122.bin, -l, -1, -v, -w, /tmp/graph3350865699960192122.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:39:09] [INFO ] Decomposing Gal with order
[2021-05-17 20:39:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:39:10] [INFO ] Removed a total of 173 redundant transitions.
[2021-05-17 20:39:10] [INFO ] Flatten gal took : 68 ms
[2021-05-17 20:39:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 20 ms.
[2021-05-17 20:39:10] [INFO ] Time to serialize gal into /tmp/LTL8474292202976308341.gal : 9 ms
[2021-05-17 20:39:10] [INFO ] Time to serialize properties into /tmp/LTL15598270431566559558.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/LTL8474292202976308341.gal, -t, CGAL, -LTL, /tmp/LTL15598270431566559558.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/LTL8474292202976308341.gal -t CGAL -LTL /tmp/LTL15598270431566559558.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("(i20.i0.u107.p477==0)")||(X(F(("(i20.i0.u107.p477==0)")&&(F("(i7.i2.u38.p262==1)"))))))))
Formula 0 simplified : !X("(i20.i0.u107.p477==0)" | XF("(i20.i0.u107.p477==0)" & F"(i7.i2.u38.p262==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3580795763747159503
[2021-05-17 20:39:25] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3580795763747159503
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3580795763747159503]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3580795763747159503] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3580795763747159503] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property HealthRecord-PT-17-06 finished in 35741 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 396 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 396/396 places, 526/526 transitions.
Graph (trivial) has 456 edges and 396 vertex of which 69 / 396 are part of one of the 21 SCC in 2 ms
Free SCC test removed 48 places
Ensure Unique test removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 146 rules applied. Total rules applied 147 place count 347 transition count 324
Reduce places removed 146 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 159 rules applied. Total rules applied 306 place count 201 transition count 311
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 313 place count 194 transition count 311
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 313 place count 194 transition count 306
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 323 place count 189 transition count 306
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 352 place count 160 transition count 254
Iterating global reduction 3 with 29 rules applied. Total rules applied 381 place count 160 transition count 254
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 6 rules applied. Total rules applied 387 place count 160 transition count 248
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 393 place count 154 transition count 248
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 409 place count 138 transition count 224
Iterating global reduction 5 with 16 rules applied. Total rules applied 425 place count 138 transition count 224
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 431 place count 138 transition count 218
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 432 place count 137 transition count 216
Iterating global reduction 6 with 1 rules applied. Total rules applied 433 place count 137 transition count 216
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 434 place count 136 transition count 214
Iterating global reduction 6 with 1 rules applied. Total rules applied 435 place count 136 transition count 214
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 436 place count 135 transition count 212
Iterating global reduction 6 with 1 rules applied. Total rules applied 437 place count 135 transition count 212
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 440 place count 135 transition count 209
Performed 50 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 7 with 100 rules applied. Total rules applied 540 place count 85 transition count 155
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 545 place count 85 transition count 150
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 552 place count 78 transition count 136
Iterating global reduction 8 with 7 rules applied. Total rules applied 559 place count 78 transition count 136
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 561 place count 76 transition count 133
Iterating global reduction 8 with 2 rules applied. Total rules applied 563 place count 76 transition count 133
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 569 place count 73 transition count 171
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 585 place count 73 transition count 155
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 587 place count 72 transition count 164
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 588 place count 71 transition count 161
Iterating global reduction 8 with 1 rules applied. Total rules applied 589 place count 71 transition count 161
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 597 place count 71 transition count 153
Applied a total of 597 rules in 44 ms. Remains 71 /396 variables (removed 325) and now considering 153/526 (removed 373) transitions.
[2021-05-17 20:39:26] [INFO ] Flow matrix only has 143 transitions (discarded 10 similar events)
// Phase 1: matrix 143 rows 71 cols
[2021-05-17 20:39:26] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:39:26] [INFO ] Implicit Places using invariants in 64 ms returned []
[2021-05-17 20:39:26] [INFO ] Flow matrix only has 143 transitions (discarded 10 similar events)
// Phase 1: matrix 143 rows 71 cols
[2021-05-17 20:39:26] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:39:26] [INFO ] State equation strengthened by 17 read => feed constraints.
[2021-05-17 20:39:26] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2021-05-17 20:39:26] [INFO ] Redundant transitions in 22 ms returned []
[2021-05-17 20:39:26] [INFO ] Flow matrix only has 143 transitions (discarded 10 similar events)
// Phase 1: matrix 143 rows 71 cols
[2021-05-17 20:39:26] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:39:26] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 1 iterations. Remains : 71/396 places, 153/526 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-07 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:(NEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 335 steps with 24 reset in 1 ms.
FORMULA HealthRecord-PT-17-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-07 finished in 397 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)&&(((p1 U (p2||G(p1)))&&F(p3))||G(p4))))], workingDir=/home/mcc/execution]
Support contains 3 out of 396 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 396/396 places, 526/526 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 382 transition count 501
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 382 transition count 501
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 374 transition count 489
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 374 transition count 489
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 369 transition count 481
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 369 transition count 481
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 369 transition count 480
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 366 transition count 477
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 366 transition count 477
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 363 transition count 474
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 363 transition count 474
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 363 transition count 473
Applied a total of 68 rules in 43 ms. Remains 363 /396 variables (removed 33) and now considering 473/526 (removed 53) transitions.
// Phase 1: matrix 473 rows 363 cols
[2021-05-17 20:39:26] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 20:39:26] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 473 rows 363 cols
[2021-05-17 20:39:26] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 20:39:26] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
// Phase 1: matrix 473 rows 363 cols
[2021-05-17 20:39:26] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 20:39:27] [INFO ] Dead Transitions using invariants and state equation in 187 ms returned []
Finished structural reductions, in 1 iterations. Remains : 363/396 places, 473/526 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p3) (NOT p4))), true, (NOT p0), (NOT p3), (NOT p4), (AND (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p4)), (AND (NOT p4) (NOT p2) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-17-08 automaton TGBA [mat=[[{ cond=(AND (NOT p4) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p4 p2 p1), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p4) (NOT p3) p2) (AND (NOT p4) (NOT p3) p1)), acceptance={} source=0 dest: 3}, { cond=(AND p4 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p4) (NOT p2) p1), acceptance={} source=0 dest: 5}, { cond=(OR (AND p4 (NOT p3) p2) (AND p4 (NOT p3) p1)), acceptance={} source=0 dest: 6}, { cond=(AND p4 (NOT p2) p1), acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p4), acceptance={} source=4 dest: 1}, { cond=p4, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND p4 (NOT p3)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p4) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND p4 (NOT p2) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p4) (NOT p2) p1), acceptance={} source=7 dest: 5}, { cond=(AND p4 (NOT p2) p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p4:(OR (NEQ s247 1) (AND (NEQ s326 1) (NEQ s247 1))), p2:(AND (NEQ s326 1) (NEQ s247 1)), p1:(NEQ s247 1), p3:(NEQ s30 1), p0:(NEQ s326 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 380 ms.
Product exploration explored 100000 steps with 50000 reset in 373 ms.
Knowledge obtained : [p4, p2, p1, p3, p0]
Adopting property with smaller alphabet thanks to knowledge :p2
Adopting property with smaller alphabet thanks to knowledge :p3
Stuttering acceptance computed with spot in 57 ms :[true, (AND p3 p2 (NOT p0)), (NOT p0)]
Support contains 3 out of 363 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 363/363 places, 473/473 transitions.
Applied a total of 0 rules in 4 ms. Remains 363 /363 variables (removed 0) and now considering 473/473 (removed 0) transitions.
// Phase 1: matrix 473 rows 363 cols
[2021-05-17 20:39:28] [INFO ] Computed 18 place invariants in 3 ms
[2021-05-17 20:39:28] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 473 rows 363 cols
[2021-05-17 20:39:28] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 20:39:28] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
// Phase 1: matrix 473 rows 363 cols
[2021-05-17 20:39:28] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 20:39:28] [INFO ] Dead Transitions using invariants and state equation in 224 ms returned []
Finished structural reductions, in 1 iterations. Remains : 363/363 places, 473/473 transitions.
Stuttering acceptance computed with spot in 58 ms :[true, (AND p3 p2 (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 311 ms.
Product exploration explored 100000 steps with 50000 reset in 319 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 53 ms :[true, (AND p3 p2 (NOT p0)), (NOT p0)]
Support contains 3 out of 363 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 363/363 places, 473/473 transitions.
Graph (trivial) has 407 edges and 363 vertex of which 60 / 363 are part of one of the 21 SCC in 0 ms
Free SCC test removed 39 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Performed 134 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 134 rules applied. Total rules applied 135 place count 324 transition count 428
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 7 rules applied. Total rules applied 142 place count 324 transition count 422
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 142 place count 324 transition count 422
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 148 place count 324 transition count 422
Discarding 94 places :
Symmetric choice reduction at 2 with 94 rule applications. Total rules 242 place count 230 transition count 323
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 2 with 94 rules applied. Total rules applied 336 place count 230 transition count 323
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 340 place count 226 transition count 319
Deduced a syphon composed of 61 places in 1 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 344 place count 226 transition count 319
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 347 place count 226 transition count 316
Performed 60 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 121 places in 0 ms
Iterating global reduction 3 with 60 rules applied. Total rules applied 407 place count 226 transition count 345
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 415 place count 226 transition count 337
Discarding 51 places :
Symmetric choice reduction at 4 with 51 rule applications. Total rules 466 place count 175 transition count 270
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 4 with 51 rules applied. Total rules applied 517 place count 175 transition count 270
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 521 place count 171 transition count 265
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 4 with 4 rules applied. Total rules applied 525 place count 171 transition count 265
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 528 place count 168 transition count 256
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 531 place count 168 transition count 256
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 534 place count 168 transition count 253
Performed 15 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 5 with 15 rules applied. Total rules applied 549 place count 168 transition count 367
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 550 place count 168 transition count 366
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 567 place count 151 transition count 321
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 6 with 17 rules applied. Total rules applied 584 place count 151 transition count 321
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 585 place count 151 transition count 342
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 586 place count 150 transition count 338
Deduced a syphon composed of 76 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 587 place count 150 transition count 338
Deduced a syphon composed of 76 places in 0 ms
Drop transitions removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 6 with 29 rules applied. Total rules applied 616 place count 150 transition count 309
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 622 place count 144 transition count 290
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 6 with 6 rules applied. Total rules applied 628 place count 144 transition count 290
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 629 place count 144 transition count 303
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 632 place count 141 transition count 296
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 635 place count 141 transition count 296
Deduced a syphon composed of 69 places in 0 ms
Applied a total of 635 rules in 44 ms. Remains 141 /363 variables (removed 222) and now considering 296/473 (removed 177) transitions.
[2021-05-17 20:39:29] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-17 20:39:29] [INFO ] Flow matrix only has 280 transitions (discarded 16 similar events)
// Phase 1: matrix 280 rows 141 cols
[2021-05-17 20:39:29] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:39:29] [INFO ] Dead Transitions using invariants and state equation in 117 ms returned []
Finished structural reductions, in 1 iterations. Remains : 141/363 places, 296/473 transitions.
Product exploration explored 100000 steps with 50000 reset in 918 ms.
Product exploration explored 100000 steps with 50000 reset in 878 ms.
[2021-05-17 20:39:31] [INFO ] Flatten gal took : 17 ms
[2021-05-17 20:39:31] [INFO ] Flatten gal took : 15 ms
[2021-05-17 20:39:31] [INFO ] Time to serialize gal into /tmp/LTL6653331297878497940.gal : 2 ms
[2021-05-17 20:39:31] [INFO ] Time to serialize properties into /tmp/LTL2719030212849034592.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/LTL6653331297878497940.gal, -t, CGAL, -LTL, /tmp/LTL2719030212849034592.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/LTL6653331297878497940.gal -t CGAL -LTL /tmp/LTL2719030212849034592.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X("(p557!=1)"))&&((G("((p413!=1)||((p557!=1)&&(p413!=1)))"))||((("(p413!=1)")U(("((p557!=1)&&(p413!=1))")||(G("(p413!=1)"))))&&(F("(p53!=1)"))))))
Formula 0 simplified : !(X"(p557!=1)" & (G"((p413!=1)||((p557!=1)&&(p413!=1)))" | (("(p413!=1)" U ("((p557!=1)&&(p413!=1))" | G"(p413!=1)")) & F"(p53!=1)")))
Detected timeout of ITS tools.
[2021-05-17 20:39:46] [INFO ] Flatten gal took : 14 ms
[2021-05-17 20:39:46] [INFO ] Applying decomposition
[2021-05-17 20:39:46] [INFO ] Flatten gal took : 13 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/graph16550121423482207458.txt, -o, /tmp/graph16550121423482207458.bin, -w, /tmp/graph16550121423482207458.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/graph16550121423482207458.bin, -l, -1, -v, -w, /tmp/graph16550121423482207458.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:39:46] [INFO ] Decomposing Gal with order
[2021-05-17 20:39:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:39:46] [INFO ] Removed a total of 173 redundant transitions.
[2021-05-17 20:39:46] [INFO ] Flatten gal took : 29 ms
[2021-05-17 20:39:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 6 ms.
[2021-05-17 20:39:46] [INFO ] Time to serialize gal into /tmp/LTL13740029018643737368.gal : 4 ms
[2021-05-17 20:39:46] [INFO ] Time to serialize properties into /tmp/LTL12319867448956573455.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/LTL13740029018643737368.gal, -t, CGAL, -LTL, /tmp/LTL12319867448956573455.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/LTL13740029018643737368.gal -t CGAL -LTL /tmp/LTL12319867448956573455.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X("(i3.u131.p557!=1)"))&&((G("((i16.i0.u99.p413!=1)||((i3.u131.p557!=1)&&(i16.i0.u99.p413!=1)))"))||((("(i16.i0.u99.p413!=1)")U(("((i3.u131.p557!=1)&&(i16.i0.u99.p413!=1))")||(G("(i16.i0.u99.p413!=1)"))))&&(F("(i2.i0.u11.p53!=1)"))))))
Formula 0 simplified : !(X"(i3.u131.p557!=1)" & (G"((i16.i0.u99.p413!=1)||((i3.u131.p557!=1)&&(i16.i0.u99.p413!=1)))" | (("(i16.i0.u99.p413!=1)" U ("((i3.u131.p557!=1)&&(i16.i0.u99.p413!=1))" | G"(i16.i0.u99.p413!=1)")) & F"(i2.i0.u11.p53!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t13, t98, t179, t328, t389, t436, t466, t471, i0.i0.t446, i2.i0.t405, i2.i0.t408, i2.i0.t416, i2.i0.t419, i2.i0.t422, i2.i0.t423, i2.i0.t424, i2.i0.t425, i2.i0.t427, i2.i0.t442, i2.i0.u6.t417, i2.i0.u6.t418, i2.i0.u6.t443, i2.i0.u15.t407, i2.i0.u16.t441, i3.t63, i3.t61, i3.t60, i3.t55, i3.t48, i3.t43, i3.t38, i3.t31, i3.t28, i3.t26, i3.t24, i3.t21, i3.t18, i3.t17, i3.u129.t36, i3.u140.t33, i3.u140.t34, i3.u140.t39, i3.u140.t40, i3.u140.t44, i3.u140.t45, i3.u140.t50, i3.u140.t51, i5.i0.t344, i5.i0.t359, i5.i0.t364, i5.i0.t366, i5.i0.t368, i5.i0.t394, i5.i0.u22.t349, i5.i0.u22.t360, i5.i0.u22.t361, i5.i0.u22.t395, i5.i0.u23.t362, i5.i0.u23.t363, i5.i0.u23.t365, i5.i0.u23.t367, i5.i0.u29.t393, i7.i0.t283, i7.i0.t287, i7.i0.t302, i7.i0.t304, i7.i0.t306, i7.i0.t334, i7.i0.u34.t288, i7.i0.u34.t298, i7.i0.u34.t299, i7.i0.u34.t335, i7.i0.u38.t300, i7.i0.u38.t301, i7.i0.u38.t303, i7.i0.u38.t305, i7.i0.u41.t333, i9.t260, i9.t256, i9.t244, i9.i1.t252, i9.i1.t261, i9.i1.t268, i9.i1.u55.t253, i9.i1.u59.t267, i12.t235, i12.t229, i12.i0.t221, i12.i0.t224, i12.i0.u65.t228, i12.i0.u68.t220, i12.i2.t236, i12.i2.u72.t212, i14.t203, i14.t196, i14.t195, i14.t191, i14.t187, i14.u81.t188, i14.u85.t202, i16.t162, i16.t157, i16.t145, i16.i2.t153, i16.i2.t163, i16.i2.t170, i16.i2.u92.t154, i16.i2.u98.t169, i18.i0.t114, i18.i0.t122, i18.i0.t126, i18.i0.t131, i18.i0.t132, i18.i0.t139, i18.i0.u103.t123, i18.i0.u110.t138, i20.t85, i20.i0.t101, i20.i1.t87, i20.i1.t92, i20.i1.u119.t84, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/335/121/456
Computing Next relation with stutter on 3.70995e+06 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
661 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.65614,113896,1,0,178697,3688,5424,474384,438,18476,610046
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA HealthRecord-PT-17-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property HealthRecord-PT-17-08 finished in 27392 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||(X(p2)&&p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 396 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 396/396 places, 526/526 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 380 transition count 499
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 380 transition count 499
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 40 place count 372 transition count 487
Iterating global reduction 0 with 8 rules applied. Total rules applied 48 place count 372 transition count 487
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 53 place count 367 transition count 479
Iterating global reduction 0 with 5 rules applied. Total rules applied 58 place count 367 transition count 479
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 59 place count 367 transition count 478
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 364 transition count 474
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 364 transition count 474
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 68 place count 361 transition count 470
Iterating global reduction 1 with 3 rules applied. Total rules applied 71 place count 361 transition count 470
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 75 place count 361 transition count 466
Applied a total of 75 rules in 26 ms. Remains 361 /396 variables (removed 35) and now considering 466/526 (removed 60) transitions.
// Phase 1: matrix 466 rows 361 cols
[2021-05-17 20:39:54] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-17 20:39:54] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 466 rows 361 cols
[2021-05-17 20:39:54] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 20:39:54] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
// Phase 1: matrix 466 rows 361 cols
[2021-05-17 20:39:54] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 20:39:54] [INFO ] Dead Transitions using invariants and state equation in 260 ms returned []
Finished structural reductions, in 1 iterations. Remains : 361/396 places, 466/526 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-17-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s91 1) (EQ s354 1) (EQ s11 1)), p1:(AND (EQ s48 1) (EQ s354 1)), p2:(AND (EQ s48 1) (EQ s354 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 97 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-17-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-09 finished in 751 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 396 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 396/396 places, 526/526 transitions.
Graph (trivial) has 457 edges and 396 vertex of which 72 / 396 are part of one of the 21 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 145 transitions
Trivial Post-agglo rules discarded 145 transitions
Performed 145 trivial Post agglomeration. Transition count delta: 145
Iterating post reduction 0 with 145 rules applied. Total rules applied 146 place count 344 transition count 320
Reduce places removed 145 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 158 rules applied. Total rules applied 304 place count 199 transition count 307
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 311 place count 192 transition count 307
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 311 place count 192 transition count 302
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 321 place count 187 transition count 302
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 349 place count 159 transition count 252
Iterating global reduction 3 with 28 rules applied. Total rules applied 377 place count 159 transition count 252
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 382 place count 159 transition count 247
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 387 place count 154 transition count 247
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 402 place count 139 transition count 225
Iterating global reduction 5 with 15 rules applied. Total rules applied 417 place count 139 transition count 225
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 423 place count 139 transition count 219
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 424 place count 138 transition count 217
Iterating global reduction 6 with 1 rules applied. Total rules applied 425 place count 138 transition count 217
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 426 place count 137 transition count 215
Iterating global reduction 6 with 1 rules applied. Total rules applied 427 place count 137 transition count 215
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 428 place count 136 transition count 213
Iterating global reduction 6 with 1 rules applied. Total rules applied 429 place count 136 transition count 213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 432 place count 136 transition count 210
Performed 51 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 7 with 102 rules applied. Total rules applied 534 place count 85 transition count 155
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 539 place count 85 transition count 150
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 546 place count 78 transition count 136
Iterating global reduction 8 with 7 rules applied. Total rules applied 553 place count 78 transition count 136
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 555 place count 76 transition count 133
Iterating global reduction 8 with 2 rules applied. Total rules applied 557 place count 76 transition count 133
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 565 place count 72 transition count 176
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 8 with 17 rules applied. Total rules applied 582 place count 72 transition count 159
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 584 place count 71 transition count 168
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 585 place count 70 transition count 165
Iterating global reduction 8 with 1 rules applied. Total rules applied 586 place count 70 transition count 165
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 594 place count 70 transition count 157
Applied a total of 594 rules in 36 ms. Remains 70 /396 variables (removed 326) and now considering 157/526 (removed 369) transitions.
[2021-05-17 20:39:54] [INFO ] Flow matrix only has 146 transitions (discarded 11 similar events)
// Phase 1: matrix 146 rows 70 cols
[2021-05-17 20:39:54] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:39:54] [INFO ] Implicit Places using invariants in 30 ms returned []
[2021-05-17 20:39:54] [INFO ] Flow matrix only has 146 transitions (discarded 11 similar events)
// Phase 1: matrix 146 rows 70 cols
[2021-05-17 20:39:54] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:39:54] [INFO ] State equation strengthened by 17 read => feed constraints.
[2021-05-17 20:39:54] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2021-05-17 20:39:54] [INFO ] Redundant transitions in 5 ms returned []
[2021-05-17 20:39:54] [INFO ] Flow matrix only has 146 transitions (discarded 11 similar events)
// Phase 1: matrix 146 rows 70 cols
[2021-05-17 20:39:54] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:39:54] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 1 iterations. Remains : 70/396 places, 157/526 transitions.
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-17-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s47 0), p1:(EQ s47 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-17-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-10 finished in 295 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0) U ((p1&&X(p0))||X(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 396 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 396/396 places, 526/526 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 382 transition count 502
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 382 transition count 502
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 374 transition count 492
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 374 transition count 492
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 369 transition count 483
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 369 transition count 483
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 369 transition count 482
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 59 place count 365 transition count 477
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 365 transition count 477
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 67 place count 361 transition count 472
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 361 transition count 472
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 75 place count 361 transition count 468
Applied a total of 75 rules in 27 ms. Remains 361 /396 variables (removed 35) and now considering 468/526 (removed 58) transitions.
// Phase 1: matrix 468 rows 361 cols
[2021-05-17 20:39:55] [INFO ] Computed 18 place invariants in 3 ms
[2021-05-17 20:39:55] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 468 rows 361 cols
[2021-05-17 20:39:55] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 20:39:55] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
// Phase 1: matrix 468 rows 361 cols
[2021-05-17 20:39:55] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 20:39:55] [INFO ] Dead Transitions using invariants and state equation in 208 ms returned []
Finished structural reductions, in 1 iterations. Remains : 361/396 places, 468/526 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : HealthRecord-PT-17-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s68 0), p1:(NEQ s110 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-17-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-11 finished in 595 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 396 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 396/396 places, 526/526 transitions.
Graph (trivial) has 457 edges and 396 vertex of which 72 / 396 are part of one of the 21 SCC in 0 ms
Free SCC test removed 51 places
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 143 rules applied. Total rules applied 144 place count 344 transition count 322
Reduce places removed 143 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 154 rules applied. Total rules applied 298 place count 201 transition count 311
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 304 place count 195 transition count 311
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 304 place count 195 transition count 306
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 314 place count 190 transition count 306
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 342 place count 162 transition count 256
Iterating global reduction 3 with 28 rules applied. Total rules applied 370 place count 162 transition count 256
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 375 place count 162 transition count 251
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 380 place count 157 transition count 251
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 395 place count 142 transition count 229
Iterating global reduction 5 with 15 rules applied. Total rules applied 410 place count 142 transition count 229
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 416 place count 142 transition count 223
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 417 place count 141 transition count 221
Iterating global reduction 6 with 1 rules applied. Total rules applied 418 place count 141 transition count 221
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 419 place count 140 transition count 219
Iterating global reduction 6 with 1 rules applied. Total rules applied 420 place count 140 transition count 219
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 421 place count 139 transition count 217
Iterating global reduction 6 with 1 rules applied. Total rules applied 422 place count 139 transition count 217
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 425 place count 139 transition count 214
Performed 53 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 7 with 106 rules applied. Total rules applied 531 place count 86 transition count 157
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 536 place count 86 transition count 152
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 543 place count 79 transition count 138
Iterating global reduction 8 with 7 rules applied. Total rules applied 550 place count 79 transition count 138
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 552 place count 77 transition count 135
Iterating global reduction 8 with 2 rules applied. Total rules applied 554 place count 77 transition count 135
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 562 place count 73 transition count 181
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 8 with 18 rules applied. Total rules applied 580 place count 73 transition count 163
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 582 place count 72 transition count 172
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 583 place count 71 transition count 169
Iterating global reduction 8 with 1 rules applied. Total rules applied 584 place count 71 transition count 169
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 592 place count 71 transition count 161
Applied a total of 592 rules in 38 ms. Remains 71 /396 variables (removed 325) and now considering 161/526 (removed 365) transitions.
[2021-05-17 20:39:55] [INFO ] Flow matrix only has 149 transitions (discarded 12 similar events)
// Phase 1: matrix 149 rows 71 cols
[2021-05-17 20:39:55] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:39:55] [INFO ] Implicit Places using invariants in 38 ms returned []
[2021-05-17 20:39:55] [INFO ] Flow matrix only has 149 transitions (discarded 12 similar events)
// Phase 1: matrix 149 rows 71 cols
[2021-05-17 20:39:55] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:39:55] [INFO ] State equation strengthened by 17 read => feed constraints.
[2021-05-17 20:39:55] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2021-05-17 20:39:55] [INFO ] Redundant transitions in 4 ms returned []
[2021-05-17 20:39:55] [INFO ] Flow matrix only has 149 transitions (discarded 12 similar events)
// Phase 1: matrix 149 rows 71 cols
[2021-05-17 20:39:55] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:39:55] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 1 iterations. Remains : 71/396 places, 161/526 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s40 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-17-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-12 finished in 261 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(G((p0&&X((p0 U (p1||G(p0))))))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 396 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 396/396 places, 526/526 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 380 transition count 499
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 380 transition count 499
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 371 transition count 486
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 371 transition count 486
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 365 transition count 476
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 365 transition count 476
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 365 transition count 475
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 67 place count 361 transition count 470
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 361 transition count 470
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 75 place count 357 transition count 465
Iterating global reduction 1 with 4 rules applied. Total rules applied 79 place count 357 transition count 465
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 83 place count 357 transition count 461
Applied a total of 83 rules in 27 ms. Remains 357 /396 variables (removed 39) and now considering 461/526 (removed 65) transitions.
// Phase 1: matrix 461 rows 357 cols
[2021-05-17 20:39:55] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 20:39:56] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 461 rows 357 cols
[2021-05-17 20:39:56] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 20:39:56] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
// Phase 1: matrix 461 rows 357 cols
[2021-05-17 20:39:56] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-17 20:39:56] [INFO ] Dead Transitions using invariants and state equation in 214 ms returned []
Finished structural reductions, in 1 iterations. Remains : 357/396 places, 461/526 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(NEQ s250 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 881 reset in 140 ms.
Product exploration explored 100000 steps with 876 reset in 149 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 872 reset in 136 ms.
Product exploration explored 100000 steps with 874 reset in 150 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 357 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 357/357 places, 461/461 transitions.
Graph (trivial) has 403 edges and 357 vertex of which 58 / 357 are part of one of the 20 SCC in 0 ms
Free SCC test removed 38 places
Ensure Unique test removed 44 transitions
Reduce isomorphic transitions removed 44 transitions.
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 135 rules applied. Total rules applied 136 place count 319 transition count 417
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 7 rules applied. Total rules applied 143 place count 319 transition count 411
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 143 place count 319 transition count 411
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 148 place count 319 transition count 411
Discarding 95 places :
Symmetric choice reduction at 2 with 95 rule applications. Total rules 243 place count 224 transition count 311
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 338 place count 224 transition count 311
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 342 place count 220 transition count 307
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 346 place count 220 transition count 307
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 349 place count 220 transition count 304
Performed 61 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 120 places in 0 ms
Iterating global reduction 3 with 61 rules applied. Total rules applied 410 place count 220 transition count 331
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 419 place count 220 transition count 322
Discarding 53 places :
Symmetric choice reduction at 4 with 53 rule applications. Total rules 472 place count 167 transition count 252
Deduced a syphon composed of 77 places in 1 ms
Iterating global reduction 4 with 53 rules applied. Total rules applied 525 place count 167 transition count 252
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 530 place count 162 transition count 245
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 4 with 5 rules applied. Total rules applied 535 place count 162 transition count 245
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 541 place count 156 transition count 227
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 547 place count 156 transition count 227
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 550 place count 156 transition count 224
Performed 16 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 5 with 16 rules applied. Total rules applied 566 place count 156 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 567 place count 156 transition count 361
Discarding 17 places :
Symmetric choice reduction at 6 with 17 rule applications. Total rules 584 place count 139 transition count 314
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 6 with 17 rules applied. Total rules applied 601 place count 139 transition count 314
Deduced a syphon composed of 72 places in 0 ms
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 6 with 28 rules applied. Total rules applied 629 place count 139 transition count 286
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 635 place count 133 transition count 267
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 6 with 6 rules applied. Total rules applied 641 place count 133 transition count 267
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 642 place count 133 transition count 282
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 645 place count 130 transition count 275
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 648 place count 130 transition count 275
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 651 place count 127 transition count 270
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 6 with 3 rules applied. Total rules applied 654 place count 127 transition count 270
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 655 place count 126 transition count 269
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 656 place count 126 transition count 269
Deduced a syphon composed of 64 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 659 place count 126 transition count 266
Deduced a syphon composed of 64 places in 0 ms
Applied a total of 659 rules in 37 ms. Remains 126 /357 variables (removed 231) and now considering 266/461 (removed 195) transitions.
[2021-05-17 20:39:57] [INFO ] Redundant transitions in 9 ms returned []
[2021-05-17 20:39:57] [INFO ] Flow matrix only has 250 transitions (discarded 16 similar events)
// Phase 1: matrix 250 rows 126 cols
[2021-05-17 20:39:57] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 20:39:57] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Finished structural reductions, in 1 iterations. Remains : 126/357 places, 266/461 transitions.
Product exploration explored 100000 steps with 6511 reset in 235 ms.
Product exploration explored 100000 steps with 6509 reset in 244 ms.
Starting structural reductions, iteration 0 : 357/357 places, 461/461 transitions.
Applied a total of 0 rules in 5 ms. Remains 357 /357 variables (removed 0) and now considering 461/461 (removed 0) transitions.
// Phase 1: matrix 461 rows 357 cols
[2021-05-17 20:39:58] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 20:39:58] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 461 rows 357 cols
[2021-05-17 20:39:58] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-17 20:39:58] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
// Phase 1: matrix 461 rows 357 cols
[2021-05-17 20:39:58] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 20:39:58] [INFO ] Dead Transitions using invariants and state equation in 180 ms returned []
Finished structural reductions, in 1 iterations. Remains : 357/357 places, 461/461 transitions.
[2021-05-17 20:39:58] [INFO ] Flatten gal took : 14 ms
[2021-05-17 20:39:58] [INFO ] Flatten gal took : 14 ms
[2021-05-17 20:39:58] [INFO ] Time to serialize gal into /tmp/LTL10450108624900725660.gal : 2 ms
[2021-05-17 20:39:58] [INFO ] Time to serialize properties into /tmp/LTL5465061581512097038.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/LTL10450108624900725660.gal, -t, CGAL, -LTL, /tmp/LTL5465061581512097038.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/LTL10450108624900725660.gal -t CGAL -LTL /tmp/LTL5465061581512097038.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 4 LTL properties
Checking formula 0 : !((X(("(p477==0)")||(X(F(("(p477==0)")&&(F("(p262==1)"))))))))
Formula 0 simplified : !X("(p477==0)" | XF("(p477==0)" & F"(p262==1)"))
Detected timeout of ITS tools.
[2021-05-17 20:40:13] [INFO ] Flatten gal took : 16 ms
[2021-05-17 20:40:13] [INFO ] Applying decomposition
[2021-05-17 20:40:13] [INFO ] Flatten gal took : 43 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/graph3452941990586039105.txt, -o, /tmp/graph3452941990586039105.bin, -w, /tmp/graph3452941990586039105.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/graph3452941990586039105.bin, -l, -1, -v, -w, /tmp/graph3452941990586039105.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:40:13] [INFO ] Decomposing Gal with order
[2021-05-17 20:40:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:40:13] [INFO ] Removed a total of 203 redundant transitions.
[2021-05-17 20:40:13] [INFO ] Flatten gal took : 112 ms
[2021-05-17 20:40:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 12 ms.
[2021-05-17 20:40:13] [INFO ] Time to serialize gal into /tmp/LTL4526013709580513657.gal : 6 ms
[2021-05-17 20:40:13] [INFO ] Time to serialize properties into /tmp/LTL15562672876598750630.ltl : 2 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/LTL4526013709580513657.gal, -t, CGAL, -LTL, /tmp/LTL15562672876598750630.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/LTL4526013709580513657.gal -t CGAL -LTL /tmp/LTL15562672876598750630.ltl -c -stutter-deadlock
Read 4 LTL properties
Checking formula 0 : !((X(("(i19.i1.u120.p477==0)")||(X(F(("(i19.i1.u120.p477==0)")&&(F("(i6.i4.u48.p262==1)"))))))))
Formula 0 simplified : !X("(i19.i1.u120.p477==0)" | XF("(i19.i1.u120.p477==0)" & F"(i6.i4.u48.p262==1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3574834709808516766
[2021-05-17 20:40:28] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3574834709808516766
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3574834709808516766]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3574834709808516766] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin3574834709808516766] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property HealthRecord-PT-17-13 finished in 33983 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(G(p0))&&(p1||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 396 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 396/396 places, 526/526 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 381 transition count 502
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 381 transition count 502
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 37 place count 374 transition count 493
Iterating global reduction 0 with 7 rules applied. Total rules applied 44 place count 374 transition count 493
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 370 transition count 486
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 370 transition count 486
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 370 transition count 485
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 367 transition count 482
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 367 transition count 482
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 364 transition count 479
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 364 transition count 479
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 364 transition count 478
Applied a total of 66 rules in 27 ms. Remains 364 /396 variables (removed 32) and now considering 478/526 (removed 48) transitions.
// Phase 1: matrix 478 rows 364 cols
[2021-05-17 20:40:29] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 20:40:30] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 478 rows 364 cols
[2021-05-17 20:40:30] [INFO ] Computed 18 place invariants in 1 ms
[2021-05-17 20:40:30] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
// Phase 1: matrix 478 rows 364 cols
[2021-05-17 20:40:30] [INFO ] Computed 18 place invariants in 2 ms
[2021-05-17 20:40:30] [INFO ] Dead Transitions using invariants and state equation in 189 ms returned []
Finished structural reductions, in 1 iterations. Remains : 364/396 places, 478/526 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : HealthRecord-PT-17-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(OR p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s65 1), p2:(EQ s49 1), p0:(EQ s103 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-17-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-14 finished in 683 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 396 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 396/396 places, 526/526 transitions.
Graph (trivial) has 457 edges and 396 vertex of which 72 / 396 are part of one of the 21 SCC in 0 ms
Free SCC test removed 51 places
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 145 transitions
Trivial Post-agglo rules discarded 145 transitions
Performed 145 trivial Post agglomeration. Transition count delta: 145
Iterating post reduction 0 with 145 rules applied. Total rules applied 146 place count 344 transition count 320
Reduce places removed 145 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 158 rules applied. Total rules applied 304 place count 199 transition count 307
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 311 place count 192 transition count 307
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 311 place count 192 transition count 302
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 321 place count 187 transition count 302
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 349 place count 159 transition count 252
Iterating global reduction 3 with 28 rules applied. Total rules applied 377 place count 159 transition count 252
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 6 rules applied. Total rules applied 383 place count 159 transition count 246
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 389 place count 153 transition count 246
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 405 place count 137 transition count 222
Iterating global reduction 5 with 16 rules applied. Total rules applied 421 place count 137 transition count 222
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 427 place count 137 transition count 216
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 428 place count 136 transition count 214
Iterating global reduction 6 with 1 rules applied. Total rules applied 429 place count 136 transition count 214
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 430 place count 135 transition count 212
Iterating global reduction 6 with 1 rules applied. Total rules applied 431 place count 135 transition count 212
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 432 place count 134 transition count 210
Iterating global reduction 6 with 1 rules applied. Total rules applied 433 place count 134 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 435 place count 134 transition count 208
Performed 50 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 7 with 100 rules applied. Total rules applied 535 place count 84 transition count 154
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 540 place count 84 transition count 149
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 547 place count 77 transition count 135
Iterating global reduction 8 with 7 rules applied. Total rules applied 554 place count 77 transition count 135
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 556 place count 75 transition count 132
Iterating global reduction 8 with 2 rules applied. Total rules applied 558 place count 75 transition count 132
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 564 place count 72 transition count 170
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 580 place count 72 transition count 154
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 582 place count 71 transition count 163
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 583 place count 70 transition count 160
Iterating global reduction 8 with 1 rules applied. Total rules applied 584 place count 70 transition count 160
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 592 place count 70 transition count 152
Applied a total of 592 rules in 25 ms. Remains 70 /396 variables (removed 326) and now considering 152/526 (removed 374) transitions.
[2021-05-17 20:40:30] [INFO ] Flow matrix only has 142 transitions (discarded 10 similar events)
// Phase 1: matrix 142 rows 70 cols
[2021-05-17 20:40:30] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-17 20:40:30] [INFO ] Implicit Places using invariants in 46 ms returned []
[2021-05-17 20:40:30] [INFO ] Flow matrix only has 142 transitions (discarded 10 similar events)
// Phase 1: matrix 142 rows 70 cols
[2021-05-17 20:40:30] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:40:30] [INFO ] State equation strengthened by 17 read => feed constraints.
[2021-05-17 20:40:30] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2021-05-17 20:40:30] [INFO ] Redundant transitions in 14 ms returned []
[2021-05-17 20:40:30] [INFO ] Flow matrix only has 142 transitions (discarded 10 similar events)
// Phase 1: matrix 142 rows 70 cols
[2021-05-17 20:40:30] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 20:40:30] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Finished structural reductions, in 1 iterations. Remains : 70/396 places, 152/526 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-17-15 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 s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-17-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-17-15 finished in 302 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-17 20:40:30] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin1116937426162676426
[2021-05-17 20:40:30] [INFO ] Computing symmetric may disable matrix : 526 transitions.
[2021-05-17 20:40:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 20:40:30] [INFO ] Computing symmetric may enable matrix : 526 transitions.
[2021-05-17 20:40:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 20:40:30] [INFO ] Flatten gal took : 24 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/graph9648598514736435682.txt, -o, /tmp/graph9648598514736435682.bin, -w, /tmp/graph9648598514736435682.weights], workingDir=null]
[2021-05-17 20:40:30] [INFO ] Computing Do-Not-Accords matrix : 526 transitions.
[2021-05-17 20:40:30] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9648598514736435682.bin, -l, -1, -v, -w, /tmp/graph9648598514736435682.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 20:40:30] [INFO ] Decomposing Gal with order
[2021-05-17 20:40:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 20:40:30] [INFO ] Built C files in 109ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1116937426162676426
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1116937426162676426]
[2021-05-17 20:40:31] [INFO ] Removed a total of 203 redundant transitions.
[2021-05-17 20:40:31] [INFO ] Flatten gal took : 40 ms
[2021-05-17 20:40:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 5 ms.
[2021-05-17 20:40:31] [INFO ] Time to serialize gal into /tmp/LTLFireability14781207281361846661.gal : 3 ms
[2021-05-17 20:40:31] [INFO ] Time to serialize properties into /tmp/LTLFireability2324841555510571697.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/LTLFireability14781207281361846661.gal, -t, CGAL, -LTL, /tmp/LTLFireability2324841555510571697.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/LTLFireability14781207281361846661.gal -t CGAL -LTL /tmp/LTLFireability2324841555510571697.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !((X(("(i21.u118.p477==0)")||(X(F(("(i21.u118.p477==0)")&&(F("(i9.u49.p262==1)"))))))))
Formula 0 simplified : !X("(i21.u118.p477==0)" | XF("(i21.u118.p477==0)" & F"(i9.u49.p262==1)"))
Compilation finished in 3070 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin1116937426162676426]
Link finished in 58 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(((LTLAPp0==true)||X(<>(((LTLAPp0==true)&&<>((LTLAPp1==true))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin1116937426162676426]
LTSmin run took 368 ms.
FORMULA HealthRecord-PT-17-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(X([](((LTLAPp2==true)&&X(((LTLAPp2==true) U ((LTLAPp3==true)||[]((LTLAPp2==true)))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin1116937426162676426]
Reverse transition relation is NOT exact ! Due to transitions t209, t608, t609, t757, t762, i2.t732, i2.t694, i2.t691, i2.t688, i2.t685, i2.t679, i2.t649, i2.t639, i2.u5.t680, i2.u5.t683, i2.u5.t733, i2.u6.t698, i2.u6.t731, i2.u11.t648, i2.u11.t662, i2.u11.t663, i2.u11.t693, i2.u11.t725, i2.u11.t726, i3.t737, i5.t626, i5.t619, i5.t592, i5.t588, i5.t587, i5.t585, i5.t579, i5.t573, i5.t562, i5.t560, i5.t558, i5.t540, i5.t533, i5.u20.t574, i5.u20.t577, i5.u20.t627, i5.u21.t580, i5.u21.t591, i5.u31.t620, i5.u32.t539, i5.u32.t542, i5.u33.t625, i8.u38.t429, i8.u38.t435, i8.u38.t436, i8.u38.t438, i8.u38.t439, i8.u38.t463, i8.u38.t464, i8.u38.t467, i8.u38.t469, i8.u38.t470, i8.u38.t473, i8.u38.t475, i8.u38.t476, i8.u38.t481, i8.u38.t483, i8.u38.t484, i8.u38.t487, i8.u38.t488, i8.u38.t496, i8.u38.t497, i8.u38.t504, i8.u38.t505, i8.u38.t515, i8.u38.t516, i8.u38.t521, i8.u38.t522, i8.u38.t523, i11.t412, i11.t405, i11.t404, i11.t399, i11.t394, i11.t384, i11.u56.t411, i11.u59.t395, i12.t372, i12.t365, i12.t364, i12.t359, i12.t354, i12.t344, i12.u71.t355, i12.u77.t371, i13.t331, i13.t324, i13.t323, i13.t318, i13.t313, i13.t303, i13.u83.t314, i13.u89.t330, i15.t290, i15.t289, i15.t283, i15.t277, i15.t273, i15.u95.t282, i15.u101.t272, i15.u102.t262, i18.t252, i18.t251, i18.t245, i18.t239, i18.t235, i18.u106.t244, i18.u110.t234, i18.u114.t224, i21.t211, i21.t180, i21.t140, i21.t133, i21.t129, i21.u118.t181, i21.u124.t128, i25.t107, i25.t106, i25.t104, i25.t87, i25.t77, i25.t66, i25.t56, i25.t35, i25.t32, i25.t30, i25.t25, i25.t22, i25.t19, i25.t18, i25.t15, i25.t14, i25.t13, i25.t12, i25.u145.t16, i25.u148.t48, i25.u148.t49, i25.u148.t52, i25.u148.t58, i25.u148.t59, i25.u148.t68, i25.u148.t69, i25.u148.t78, i25.u148.t79, i25.u148.t105, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/368/150/518
Computing Next relation with stutter on 8.00153e+06 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
2435 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,24.3973,283700,1,0,414794,8836,5287,1.4121e+06,796,49532,1371310
no accepting run found
Formula 0 is TRUE no accepting run found.
Checking formula 1 : !((X(X(X(G(("(u104.p421!=1)")&&(X(("(u104.p421!=1)")U(("(i8.u38.p199==1)")||(G("(u104.p421!=1)")))))))))))
Formula 1 simplified : !XXXG("(u104.p421!=1)" & X("(u104.p421!=1)" U ("(i8.u38.p199==1)" | G"(u104.p421!=1)")))
Computing Next relation with stutter on 8.00153e+06 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
2161 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,46.0078,512232,1,0,801370,14811,6308,2.21563e+06,870,74874,2178113
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA HealthRecord-PT-17-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1621284138144

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

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