MCC'2024- Execution of r355-tall-171683758000100

About the Execution of GreatSPN+red for ShieldIIPs-PT-020A

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
11127.892	3600000.00	9068354.00	6504.90	?TFFFFFF?FTFT?F?	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r355-tall-171683758000100.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ShieldIIPs-PT-020A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683758000100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 14:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 11 14:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 14:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Apr 11 14:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 169K May 18 16:43 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 ShieldIIPs-PT-020A-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-020A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716894498117

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-020A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 11:08:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 11:08:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 11:08:19] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-05-28 11:08:19] [INFO ] Transformed 503 places.
[2024-05-28 11:08:19] [INFO ] Transformed 483 transitions.
[2024-05-28 11:08:19] [INFO ] Found NUPN structural information;
[2024-05-28 11:08:19] [INFO ] Parsed PT model containing 503 places and 483 transitions and 2166 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldIIPs-PT-020A-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020A-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020A-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020A-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 55 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
// Phase 1: matrix 483 rows 503 cols
[2024-05-28 11:08:19] [INFO ] Computed 181 invariants in 24 ms
[2024-05-28 11:08:20] [INFO ] Implicit Places using invariants in 469 ms returned []
[2024-05-28 11:08:20] [INFO ] Invariant cache hit.
[2024-05-28 11:08:20] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 1018 ms to find 0 implicit places.
Running 482 sub problems to find dead transitions.
[2024-05-28 11:08:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 181/683 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:08:31] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 9 ms to minimize.
[2024-05-28 11:08:32] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 2 ms to minimize.
[2024-05-28 11:08:32] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:08:32] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-28 11:08:32] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:08:32] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:08:32] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:08:32] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:08:32] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:08:33] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-28 11:08:33] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-28 11:08:33] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-05-28 11:08:33] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-28 11:08:33] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 2 ms to minimize.
[2024-05-28 11:08:33] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-28 11:08:34] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-28 11:08:34] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-28 11:08:34] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2024-05-28 11:08:34] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 3 ms to minimize.
[2024-05-28 11:08:37] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/704 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (OVERLAPS) 483/986 variables, 503/1207 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:08:48] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:08:48] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:08:48] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:08:49] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:08:49] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:08:49] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:08:49] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 986/986 variables, and 1214 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30043 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 482 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 181/683 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 27/711 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (OVERLAPS) 483/986 variables, 503/1214 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/986 variables, 482/1696 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:09:08] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:09:10] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:09:11] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:09:11] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:09:12] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:09:18] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 986/986 variables, and 1702 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30025 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 33/33 constraints]
After SMT, in 60294ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60314ms
Finished structural reductions in LTL mode , in 1 iterations and 61407 ms. Remains : 503/503 places, 483/483 transitions.
Support contains 41 out of 503 places after structural reductions.
[2024-05-28 11:09:21] [INFO ] Flatten gal took : 89 ms
[2024-05-28 11:09:21] [INFO ] Flatten gal took : 44 ms
[2024-05-28 11:09:21] [INFO ] Input system was already deterministic with 483 transitions.
RANDOM walk for 27048 steps (23 resets) in 1132 ms. (23 steps per ms) remains 0/19 properties
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 503 transition count 482
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 482
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 481
Applied a total of 4 rules in 65 ms. Remains 501 /503 variables (removed 2) and now considering 481/483 (removed 2) transitions.
// Phase 1: matrix 481 rows 501 cols
[2024-05-28 11:09:22] [INFO ] Computed 181 invariants in 4 ms
[2024-05-28 11:09:22] [INFO ] Implicit Places using invariants in 258 ms returned [487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 261 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/503 places, 481/483 transitions.
Applied a total of 0 rules in 25 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 353 ms. Remains : 500/503 places, 481/483 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLFireability-00
Product exploration explored 100000 steps with 141 reset in 603 ms.
Product exploration explored 100000 steps with 142 reset in 596 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2760 steps (0 resets) in 31 ms. (86 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 481 rows 500 cols
[2024-05-28 11:09:24] [INFO ] Computed 180 invariants in 3 ms
[2024-05-28 11:09:24] [INFO ] [Real]Absence check using 180 positive place invariants in 71 ms returned sat
[2024-05-28 11:09:25] [INFO ] [Real]Absence check using state equation in 809 ms returned sat
[2024-05-28 11:09:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 11:09:25] [INFO ] [Nat]Absence check using 180 positive place invariants in 68 ms returned sat
[2024-05-28 11:09:26] [INFO ] [Nat]Absence check using state equation in 792 ms returned sat
[2024-05-28 11:09:26] [INFO ] Computed and/alt/rep : 442/1541/442 causal constraints (skipped 38 transitions) in 60 ms.
[2024-05-28 11:09:31] [INFO ] Added : 371 causal constraints over 75 iterations in 4691 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 481/481 transitions.
Applied a total of 0 rules in 25 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2024-05-28 11:09:31] [INFO ] Invariant cache hit.
[2024-05-28 11:09:31] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-28 11:09:31] [INFO ] Invariant cache hit.
[2024-05-28 11:09:32] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
[2024-05-28 11:09:32] [INFO ] Redundant transitions in 78 ms returned [475]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 479 sub problems to find dead transitions.
// Phase 1: matrix 480 rows 500 cols
[2024-05-28 11:09:32] [INFO ] Computed 180 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (OVERLAPS) 1/500 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 1/680 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:09:42] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:09:42] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:09:42] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-28 11:09:42] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-28 11:09:43] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:09:43] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:09:43] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:09:43] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-28 11:09:43] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:09:43] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-05-28 11:09:43] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-28 11:09:43] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-05-28 11:09:44] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-28 11:09:44] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-28 11:09:44] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-28 11:09:44] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 11:09:44] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-05-28 11:09:45] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 3 ms to minimize.
[2024-05-28 11:09:45] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-28 11:09:47] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 20/700 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 6 (OVERLAPS) 480/980 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:09:59] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 3 ms to minimize.
[2024-05-28 11:09:59] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:09:59] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:09:59] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:09:59] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:09:59] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/980 variables, 6/1206 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:10:00] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:10:00] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:10:01] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:10:01] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:10:01] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:10:01] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 1.0)
(s210 1.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 1.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 1.0)
(s254 0.0)
(s255 (/ 1.0 2.0))
(s256 0.0)
(s257 (/ 1.0 2.0))
(s258 (/ 1.0 2.0))
(s259 0.0)
(s260 0.0)
(s261 1.0)
(s262 0.0)
(s263 1.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 (/ 1.0 2.0))
(s279 (/ 1.0 2.0))
(s280 (/ 1.0 2.0))
(s281 0.0)
(s282 (/ 1.0 2.0))
(s283 0.0)
(s284 (/ 1.0 2.0))
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 1.0)
(s310 1.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 980/980 variables, and 1212 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30024 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 479 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (OVERLAPS) 1/500 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 1/680 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 32/712 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 6 (OVERLAPS) 480/980 variables, 500/1212 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/980 variables, 479/1691 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:10:23] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:10:23] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 11:10:29] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 1694 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30020 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 35/35 constraints]
After SMT, in 60170ms problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 60175ms
Starting structural reductions in SI_LTL mode, iteration 1 : 500/500 places, 480/481 transitions.
Applied a total of 0 rules in 20 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61008 ms. Remains : 500/500 places, 480/481 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2933 steps (0 resets) in 40 ms. (71 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
[2024-05-28 11:10:32] [INFO ] Invariant cache hit.
[2024-05-28 11:10:33] [INFO ] [Real]Absence check using 180 positive place invariants in 70 ms returned sat
[2024-05-28 11:10:34] [INFO ] [Real]Absence check using state equation in 743 ms returned sat
[2024-05-28 11:10:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 11:10:34] [INFO ] [Nat]Absence check using 180 positive place invariants in 60 ms returned sat
[2024-05-28 11:10:34] [INFO ] [Nat]Absence check using state equation in 595 ms returned sat
[2024-05-28 11:10:34] [INFO ] Computed and/alt/rep : 442/1546/442 causal constraints (skipped 37 transitions) in 28 ms.
[2024-05-28 11:10:39] [INFO ] Added : 395 causal constraints over 79 iterations in 4273 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 139 reset in 483 ms.
Product exploration explored 100000 steps with 142 reset in 553 ms.
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 480/480 transitions.
Applied a total of 0 rules in 12 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2024-05-28 11:10:40] [INFO ] Invariant cache hit.
[2024-05-28 11:10:40] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-28 11:10:40] [INFO ] Invariant cache hit.
[2024-05-28 11:10:41] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
[2024-05-28 11:10:41] [INFO ] Redundant transitions in 46 ms returned []
Running 479 sub problems to find dead transitions.
[2024-05-28 11:10:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (OVERLAPS) 1/500 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 1/680 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:10:51] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:10:51] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:10:51] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:10:51] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:10:51] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 0 ms to minimize.
[2024-05-28 11:10:52] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:10:52] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:10:52] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:10:52] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:10:52] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-28 11:10:52] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-28 11:10:52] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2024-05-28 11:10:53] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2024-05-28 11:10:53] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-05-28 11:10:53] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-28 11:10:53] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-28 11:10:53] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-05-28 11:10:54] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-28 11:10:54] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-28 11:10:56] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 20/700 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 6 (OVERLAPS) 480/980 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:11:07] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:11:07] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-28 11:11:07] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:11:07] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:11:07] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:11:07] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:11:07] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-28 11:11:08] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/980 variables, 8/1208 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:11:09] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:11:09] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 11:11:09] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:11:09] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:11:10] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:11:10] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:11:10] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:11:10] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:11:11] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 980/980 variables, and 1217 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30014 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 479 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (OVERLAPS) 1/500 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 1/680 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 37/717 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:11:15] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 1/718 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 7 (OVERLAPS) 480/980 variables, 500/1218 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/980 variables, 479/1697 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 1697 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30019 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 38/38 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 60161ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60957 ms. Remains : 500/500 places, 480/480 transitions.
Treatment of property ShieldIIPs-PT-020A-LTLFireability-00 finished in 139309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(!p0))))'
Support contains 2 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 502 transition count 481
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 500 transition count 481
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 499 transition count 480
Applied a total of 5 rules in 39 ms. Remains 499 /503 variables (removed 4) and now considering 480/483 (removed 3) transitions.
// Phase 1: matrix 480 rows 499 cols
[2024-05-28 11:11:41] [INFO ] Computed 180 invariants in 2 ms
[2024-05-28 11:11:42] [INFO ] Implicit Places using invariants in 711 ms returned []
[2024-05-28 11:11:42] [INFO ] Invariant cache hit.
[2024-05-28 11:11:42] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 1193 ms to find 0 implicit places.
[2024-05-28 11:11:42] [INFO ] Redundant transitions in 88 ms returned [474]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 478 sub problems to find dead transitions.
// Phase 1: matrix 479 rows 499 cols
[2024-05-28 11:11:42] [INFO ] Computed 180 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:11:46] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:11:47] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 1 ms to minimize.
[2024-05-28 11:11:47] [INFO ] Deduced a trap composed of 14 places in 106 ms of which 0 ms to minimize.
[2024-05-28 11:11:47] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-28 11:11:47] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:11:47] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-05-28 11:11:47] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:11:47] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-05-28 11:11:48] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-28 11:11:48] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-28 11:11:48] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:11:48] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-28 11:11:48] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-28 11:11:48] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-28 11:11:49] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-05-28 11:11:49] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
[2024-05-28 11:11:49] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 5 ms to minimize.
[2024-05-28 11:11:49] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 1 ms to minimize.
[2024-05-28 11:11:49] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 2 ms to minimize.
[2024-05-28 11:11:52] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 20/699 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 4 (OVERLAPS) 479/978 variables, 499/1198 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:12:04] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/978 variables, 1/1199 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:12:06] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2024-05-28 11:12:07] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:12:07] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:12:07] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:12:07] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2024-05-28 11:12:07] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:12:07] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:12:07] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:12:07] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:12:07] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:12:07] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:12:08] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:12:08] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:12:12] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:12:12] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/978 variables, 15/1214 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 978/978 variables, and 1214 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30021 ms.
Refiners :[Domain max(s): 499/499 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 478 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 36/715 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 4 (OVERLAPS) 479/978 variables, 499/1214 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/978 variables, 478/1692 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:12:23] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2024-05-28 11:12:23] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:12:24] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:12:24] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:12:24] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:12:25] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-05-28 11:12:25] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:12:27] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/978 variables, 8/1700 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 978/978 variables, and 1700 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30011 ms.
Refiners :[Domain max(s): 499/499 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 44/44 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Starting structural reductions in SI_LTL mode, iteration 1 : 499/503 places, 479/483 transitions.
Applied a total of 0 rules in 13 ms. Remains 499 /499 variables (removed 0) and now considering 479/479 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61492 ms. Remains : 499/503 places, 479/483 transitions.
Stuttering acceptance computed with spot in 77 ms :[p0, true, p0]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLFireability-02
Entered a terminal (fully accepting) state of product in 791 steps with 0 reset in 5 ms.
FORMULA ShieldIIPs-PT-020A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020A-LTLFireability-02 finished in 61616 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 4 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
// Phase 1: matrix 483 rows 503 cols
[2024-05-28 11:12:43] [INFO ] Computed 181 invariants in 3 ms
[2024-05-28 11:12:43] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-28 11:12:43] [INFO ] Invariant cache hit.
[2024-05-28 11:12:43] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 815 ms to find 0 implicit places.
Running 482 sub problems to find dead transitions.
[2024-05-28 11:12:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 181/683 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:12:54] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:12:54] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-28 11:12:54] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-28 11:12:54] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:12:54] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:12:54] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2024-05-28 11:12:54] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:12:54] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:12:55] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:12:55] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-28 11:12:55] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:12:55] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-05-28 11:12:55] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-28 11:12:55] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-28 11:12:56] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-28 11:12:56] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-28 11:12:56] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
[2024-05-28 11:12:56] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-05-28 11:12:56] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-05-28 11:12:59] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/704 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (OVERLAPS) 483/986 variables, 503/1207 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:13:10] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:13:10] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:13:10] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:13:11] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:13:11] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-05-28 11:13:11] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:13:11] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/986 variables, 7/1214 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:13:13] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 986/986 variables, and 1215 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30013 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 482 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 181/683 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 28/712 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (OVERLAPS) 483/986 variables, 503/1215 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/986 variables, 482/1697 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:13:30] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:13:37] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:13:37] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:13:40] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 986/986 variables, and 1701 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30019 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 32/32 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Finished structural reductions in LTL mode , in 1 iterations and 60946 ms. Remains : 503/503 places, 483/483 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLFireability-04
Entered a terminal (fully accepting) state of product in 30 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-020A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020A-LTLFireability-04 finished in 61065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 502 transition count 481
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 500 transition count 481
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 499 transition count 480
Applied a total of 5 rules in 29 ms. Remains 499 /503 variables (removed 4) and now considering 480/483 (removed 3) transitions.
// Phase 1: matrix 480 rows 499 cols
[2024-05-28 11:13:44] [INFO ] Computed 180 invariants in 2 ms
[2024-05-28 11:13:44] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-28 11:13:44] [INFO ] Invariant cache hit.
[2024-05-28 11:13:44] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
[2024-05-28 11:13:45] [INFO ] Redundant transitions in 778 ms returned [474]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 478 sub problems to find dead transitions.
// Phase 1: matrix 479 rows 499 cols
[2024-05-28 11:13:45] [INFO ] Computed 180 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:13:49] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 5 ms to minimize.
[2024-05-28 11:13:49] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:13:49] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-28 11:13:49] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:13:49] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:13:49] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:13:50] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-05-28 11:13:50] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:13:50] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:13:50] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:13:50] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-28 11:13:50] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-28 11:13:51] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2024-05-28 11:13:51] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-28 11:13:51] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-28 11:13:51] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2024-05-28 11:13:51] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 2 ms to minimize.
[2024-05-28 11:13:51] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 2 ms to minimize.
[2024-05-28 11:13:52] [INFO ] Deduced a trap composed of 14 places in 127 ms of which 2 ms to minimize.
[2024-05-28 11:13:54] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 20/699 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 4 (OVERLAPS) 479/978 variables, 499/1198 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:14:06] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/978 variables, 1/1199 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:14:09] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:14:09] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:14:09] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:14:09] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:14:09] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:14:09] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:14:10] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:14:10] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-28 11:14:10] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:14:10] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:14:10] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:14:10] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:14:10] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:14:14] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-28 11:14:14] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/978 variables, 15/1214 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 978/978 variables, and 1214 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30018 ms.
Refiners :[Domain max(s): 499/499 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 478 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 36/715 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 4 (OVERLAPS) 479/978 variables, 499/1214 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/978 variables, 478/1692 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:14:26] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:14:26] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:14:27] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:14:27] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 11:14:28] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:14:28] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:14:28] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:14:30] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/978 variables, 8/1700 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 978/978 variables, and 1700 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30017 ms.
Refiners :[Domain max(s): 499/499 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 44/44 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Starting structural reductions in SI_LTL mode, iteration 1 : 499/503 places, 479/483 transitions.
Applied a total of 0 rules in 12 ms. Remains 499 /499 variables (removed 0) and now considering 479/479 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61735 ms. Remains : 499/503 places, 479/483 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLFireability-05
Stuttering criterion allowed to conclude after 1016 steps with 0 reset in 11 ms.
FORMULA ShieldIIPs-PT-020A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020A-LTLFireability-05 finished in 61801 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p1)||p0)))))'
Support contains 4 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 5 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
// Phase 1: matrix 483 rows 503 cols
[2024-05-28 11:14:45] [INFO ] Computed 181 invariants in 3 ms
[2024-05-28 11:14:46] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-28 11:14:46] [INFO ] Invariant cache hit.
[2024-05-28 11:14:46] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 877 ms to find 0 implicit places.
Running 482 sub problems to find dead transitions.
[2024-05-28 11:14:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 181/683 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:14:57] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:14:57] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:14:57] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:14:57] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2024-05-28 11:14:57] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:14:57] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-05-28 11:14:58] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:14:58] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2024-05-28 11:14:58] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:14:58] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:14:58] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-28 11:14:58] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-05-28 11:14:58] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2024-05-28 11:14:59] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-28 11:14:59] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-28 11:14:59] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 2 ms to minimize.
[2024-05-28 11:14:59] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-28 11:14:59] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-28 11:15:00] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-28 11:15:02] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/704 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (OVERLAPS) 483/986 variables, 503/1207 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:15:13] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:15:13] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-28 11:15:13] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 7 ms to minimize.
[2024-05-28 11:15:14] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:15:14] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:15:14] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:15:14] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/986 variables, 7/1214 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:15:16] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 986/986 variables, and 1215 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30033 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 482 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 181/683 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 28/712 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (OVERLAPS) 483/986 variables, 503/1215 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/986 variables, 482/1697 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:15:33] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 3 ms to minimize.
[2024-05-28 11:15:40] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 9 ms to minimize.
[2024-05-28 11:15:40] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:15:44] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 986/986 variables, and 1701 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30024 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 32/32 constraints]
After SMT, in 60184ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Finished structural reductions in LTL mode , in 1 iterations and 61072 ms. Remains : 503/503 places, 483/483 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLFireability-06
Product exploration explored 100000 steps with 95 reset in 511 ms.
Product exploration explored 100000 steps with 94 reset in 591 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 8092 steps (5 resets) in 69 ms. (115 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 2 factoid took 173 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 11 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
[2024-05-28 11:15:49] [INFO ] Invariant cache hit.
[2024-05-28 11:15:49] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-28 11:15:49] [INFO ] Invariant cache hit.
[2024-05-28 11:15:49] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
Running 482 sub problems to find dead transitions.
[2024-05-28 11:15:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 181/683 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:16:00] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:16:00] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:16:00] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-28 11:16:00] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:16:00] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:16:01] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-28 11:16:01] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:16:01] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:16:01] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:16:01] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-28 11:16:01] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-28 11:16:01] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2024-05-28 11:16:02] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-28 11:16:02] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-05-28 11:16:02] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2024-05-28 11:16:02] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-28 11:16:02] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-28 11:16:02] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-28 11:16:03] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-28 11:16:05] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/704 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (OVERLAPS) 483/986 variables, 503/1207 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:16:16] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:16:16] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:16:16] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:16:17] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-28 11:16:17] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:16:17] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:16:17] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/986 variables, 7/1214 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:16:19] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 986/986 variables, and 1215 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30017 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 482 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 181/683 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 28/712 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (OVERLAPS) 483/986 variables, 503/1215 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/986 variables, 482/1697 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:16:37] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:16:44] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:16:45] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:16:49] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 986/986 variables, and 1701 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30022 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 32/32 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Finished structural reductions in LTL mode , in 1 iterations and 60916 ms. Remains : 503/503 places, 483/483 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 8691 steps (6 resets) in 135 ms. (63 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 2 factoid took 179 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 94 reset in 480 ms.
Product exploration explored 100000 steps with 94 reset in 556 ms.
Support contains 4 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 11 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
[2024-05-28 11:16:52] [INFO ] Invariant cache hit.
[2024-05-28 11:16:52] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-28 11:16:52] [INFO ] Invariant cache hit.
[2024-05-28 11:16:53] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
Running 482 sub problems to find dead transitions.
[2024-05-28 11:16:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 181/683 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:17:04] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-28 11:17:04] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:17:04] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:17:04] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-28 11:17:04] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:17:04] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2024-05-28 11:17:04] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:17:04] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:17:05] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:17:05] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:17:05] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-28 11:17:05] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2024-05-28 11:17:05] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-05-28 11:17:05] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-28 11:17:06] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-28 11:17:06] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-05-28 11:17:06] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-28 11:17:06] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 2 ms to minimize.
[2024-05-28 11:17:06] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-28 11:17:09] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/704 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (OVERLAPS) 483/986 variables, 503/1207 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:17:20] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:17:20] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:17:21] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:17:21] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:17:21] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:17:21] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:17:21] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/986 variables, 7/1214 constraints. Problems are: Problem set: 0 solved, 482 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 986/986 variables, and 1214 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30019 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 482 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 181/683 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 27/711 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (OVERLAPS) 483/986 variables, 503/1214 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/986 variables, 482/1696 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:17:41] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:17:43] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:17:43] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:17:43] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:17:45] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:17:51] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 986/986 variables, and 1702 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30018 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 33/33 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Finished structural reductions in LTL mode , in 1 iterations and 60952 ms. Remains : 503/503 places, 483/483 transitions.
Treatment of property ShieldIIPs-PT-020A-LTLFireability-06 finished in 187436 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((G(p1) U p2)&&p0))))'
Support contains 8 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 503 transition count 482
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 482
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 481
Applied a total of 4 rules in 24 ms. Remains 501 /503 variables (removed 2) and now considering 481/483 (removed 2) transitions.
// Phase 1: matrix 481 rows 501 cols
[2024-05-28 11:17:53] [INFO ] Computed 181 invariants in 7 ms
[2024-05-28 11:17:53] [INFO ] Implicit Places using invariants in 268 ms returned [487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 269 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/503 places, 481/483 transitions.
Applied a total of 0 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 305 ms. Remains : 500/503 places, 481/483 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLFireability-07
Stuttering criterion allowed to conclude after 924 steps with 0 reset in 4 ms.
FORMULA ShieldIIPs-PT-020A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020A-LTLFireability-07 finished in 527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||F(p1)))))'
Support contains 4 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 503 transition count 482
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 482
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 481
Applied a total of 4 rules in 28 ms. Remains 501 /503 variables (removed 2) and now considering 481/483 (removed 2) transitions.
[2024-05-28 11:17:53] [INFO ] Invariant cache hit.
[2024-05-28 11:17:54] [INFO ] Implicit Places using invariants in 337 ms returned [487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 338 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/503 places, 481/483 transitions.
Applied a total of 0 rules in 9 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 378 ms. Remains : 500/503 places, 481/483 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLFireability-08
Product exploration explored 100000 steps with 12320 reset in 555 ms.
Product exploration explored 100000 steps with 12357 reset in 619 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 103 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 2819 steps (1 resets) in 34 ms. (80 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 262 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 481 rows 500 cols
[2024-05-28 11:17:56] [INFO ] Computed 180 invariants in 9 ms
[2024-05-28 11:17:56] [INFO ] [Real]Absence check using 180 positive place invariants in 60 ms returned sat
[2024-05-28 11:17:57] [INFO ] [Real]Absence check using state equation in 440 ms returned sat
[2024-05-28 11:17:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 11:17:57] [INFO ] [Nat]Absence check using 180 positive place invariants in 63 ms returned sat
[2024-05-28 11:17:57] [INFO ] [Nat]Absence check using state equation in 541 ms returned sat
[2024-05-28 11:17:57] [INFO ] Computed and/alt/rep : 442/1541/442 causal constraints (skipped 38 transitions) in 32 ms.
[2024-05-28 11:18:01] [INFO ] Added : 365 causal constraints over 73 iterations in 3891 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 481/481 transitions.
Applied a total of 0 rules in 14 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2024-05-28 11:18:01] [INFO ] Invariant cache hit.
[2024-05-28 11:18:02] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-28 11:18:02] [INFO ] Invariant cache hit.
[2024-05-28 11:18:02] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
[2024-05-28 11:18:02] [INFO ] Redundant transitions in 54 ms returned [475]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 479 sub problems to find dead transitions.
// Phase 1: matrix 480 rows 500 cols
[2024-05-28 11:18:02] [INFO ] Computed 180 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (OVERLAPS) 1/500 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 1/680 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:18:13] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:18:13] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:18:13] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-28 11:18:13] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:18:13] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:18:13] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:18:13] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:18:14] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:18:14] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-05-28 11:18:14] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 11:18:14] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-28 11:18:14] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:18:14] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-28 11:18:14] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-28 11:18:15] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-28 11:18:15] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-05-28 11:18:15] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 2 ms to minimize.
[2024-05-28 11:18:15] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-28 11:18:15] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-28 11:18:18] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 20/700 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 6 (OVERLAPS) 480/980 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:18:30] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:18:30] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:18:30] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:18:30] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:18:30] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-28 11:18:30] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/980 variables, 6/1206 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:18:31] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:18:31] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:18:31] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:18:32] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:18:32] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-28 11:18:32] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 980/980 variables, and 1212 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30025 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 479 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (OVERLAPS) 1/500 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 1/680 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 32/712 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 6 (OVERLAPS) 480/980 variables, 500/1212 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/980 variables, 479/1691 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:18:53] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:18:54] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:19:00] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 1694 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30018 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 35/35 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Starting structural reductions in SI_LTL mode, iteration 1 : 500/500 places, 480/481 transitions.
Applied a total of 0 rules in 17 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60951 ms. Remains : 500/500 places, 480/481 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 108 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 2894 steps (1 resets) in 46 ms. (61 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 223 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 11:19:03] [INFO ] Invariant cache hit.
[2024-05-28 11:19:03] [INFO ] [Real]Absence check using 180 positive place invariants in 70 ms returned sat
[2024-05-28 11:19:04] [INFO ] [Real]Absence check using state equation in 667 ms returned sat
[2024-05-28 11:19:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 11:19:04] [INFO ] [Nat]Absence check using 180 positive place invariants in 58 ms returned sat
[2024-05-28 11:19:05] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2024-05-28 11:19:05] [INFO ] Computed and/alt/rep : 442/1546/442 causal constraints (skipped 37 transitions) in 30 ms.
[2024-05-28 11:19:10] [INFO ] Added : 375 causal constraints over 77 iterations in 4901 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 12463 reset in 568 ms.
Product exploration explored 100000 steps with 12334 reset in 630 ms.
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 480/480 transitions.
Applied a total of 0 rules in 8 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2024-05-28 11:19:11] [INFO ] Invariant cache hit.
[2024-05-28 11:19:11] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-28 11:19:11] [INFO ] Invariant cache hit.
[2024-05-28 11:19:12] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
[2024-05-28 11:19:12] [INFO ] Redundant transitions in 51 ms returned []
Running 479 sub problems to find dead transitions.
[2024-05-28 11:19:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (OVERLAPS) 1/500 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 1/680 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:19:22] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-05-28 11:19:22] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-28 11:19:22] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-28 11:19:22] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:19:23] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:19:23] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:19:23] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:19:23] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:19:23] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-28 11:19:23] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 11:19:23] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-05-28 11:19:24] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-05-28 11:19:24] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-28 11:19:24] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2024-05-28 11:19:24] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-28 11:19:24] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-28 11:19:24] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-05-28 11:19:25] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-28 11:19:25] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-28 11:19:28] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 20/700 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 6 (OVERLAPS) 480/980 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:19:38] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-28 11:19:38] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:19:38] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:19:38] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:19:38] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:19:39] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:19:39] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:19:40] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/980 variables, 8/1208 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:19:40] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-28 11:19:40] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-05-28 11:19:41] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-28 11:19:41] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:19:41] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-28 11:19:41] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:19:41] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:19:42] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:19:42] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 980/980 variables, and 1217 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30017 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 479 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (OVERLAPS) 1/500 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 1/680 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 37/717 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:19:46] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 1/718 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 7 (OVERLAPS) 480/980 variables, 500/1218 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/980 variables, 479/1697 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 1697 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30016 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 38/38 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60930 ms. Remains : 500/500 places, 480/480 transitions.
Treatment of property ShieldIIPs-PT-020A-LTLFireability-08 finished in 138622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 3 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
// Phase 1: matrix 483 rows 503 cols
[2024-05-28 11:20:12] [INFO ] Computed 181 invariants in 4 ms
[2024-05-28 11:20:12] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-28 11:20:12] [INFO ] Invariant cache hit.
[2024-05-28 11:20:13] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 802 ms to find 0 implicit places.
Running 482 sub problems to find dead transitions.
[2024-05-28 11:20:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 181/683 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:20:24] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:20:24] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:20:24] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-28 11:20:24] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:20:24] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:20:24] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:20:24] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:20:25] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:20:25] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:20:25] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-28 11:20:25] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 2 ms to minimize.
[2024-05-28 11:20:25] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:20:25] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:20:25] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-28 11:20:26] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-05-28 11:20:26] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-28 11:20:26] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-28 11:20:26] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 3 ms to minimize.
[2024-05-28 11:20:26] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-28 11:20:29] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/704 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (OVERLAPS) 483/986 variables, 503/1207 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:20:41] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:20:41] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:20:41] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:20:41] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:20:41] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:20:41] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:20:42] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 986/986 variables, and 1214 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30016 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 482 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 181/683 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 27/711 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (OVERLAPS) 483/986 variables, 503/1214 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/986 variables, 482/1696 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:21:01] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:21:03] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 11:21:03] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 11:21:03] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-28 11:21:05] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:21:11] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 986/986 variables, and 1702 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30018 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 33/33 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Finished structural reductions in LTL mode , in 1 iterations and 60966 ms. Remains : 503/503 places, 483/483 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLFireability-11
Stuttering criterion allowed to conclude after 2098 steps with 1 reset in 15 ms.
FORMULA ShieldIIPs-PT-020A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020A-LTLFireability-11 finished in 61081 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)||p0)))'
Support contains 4 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 5 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
[2024-05-28 11:21:13] [INFO ] Invariant cache hit.
[2024-05-28 11:21:13] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-28 11:21:13] [INFO ] Invariant cache hit.
[2024-05-28 11:21:14] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 797 ms to find 0 implicit places.
Running 482 sub problems to find dead transitions.
[2024-05-28 11:21:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 181/683 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:21:24] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:21:25] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:21:25] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-28 11:21:25] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-28 11:21:25] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:21:25] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-28 11:21:25] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2024-05-28 11:21:25] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-28 11:21:25] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-05-28 11:21:26] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-05-28 11:21:26] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-05-28 11:21:26] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-05-28 11:21:26] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-28 11:21:26] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-28 11:21:26] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-28 11:21:27] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 4 ms to minimize.
[2024-05-28 11:21:27] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2024-05-28 11:21:27] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2024-05-28 11:21:27] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-28 11:21:30] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/704 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (OVERLAPS) 483/986 variables, 503/1207 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:21:42] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:21:42] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-28 11:21:42] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:21:42] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:21:42] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:21:42] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:21:43] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 986/986 variables, and 1214 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30015 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 482 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 181/683 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 27/711 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (OVERLAPS) 483/986 variables, 503/1214 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/986 variables, 482/1696 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:22:01] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:22:04] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:22:04] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-28 11:22:04] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:22:06] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:22:11] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 986/986 variables, and 1702 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30020 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 33/33 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Finished structural reductions in LTL mode , in 1 iterations and 60928 ms. Remains : 503/503 places, 483/483 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 1045 ms.
Product exploration explored 100000 steps with 50000 reset in 1074 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 33 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-020A-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-020A-LTLFireability-12 finished in 63196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0 U (p1||G(!p0))))))'
Support contains 5 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Applied a total of 0 rules in 4 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
[2024-05-28 11:22:16] [INFO ] Invariant cache hit.
[2024-05-28 11:22:17] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-05-28 11:22:17] [INFO ] Invariant cache hit.
[2024-05-28 11:22:17] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 951 ms to find 0 implicit places.
Running 482 sub problems to find dead transitions.
[2024-05-28 11:22:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 181/683 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:22:28] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:22:28] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:22:28] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-05-28 11:22:28] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:22:28] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-05-28 11:22:28] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 0 ms to minimize.
[2024-05-28 11:22:28] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-28 11:22:28] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:22:28] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:22:29] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:22:29] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 3 ms to minimize.
[2024-05-28 11:22:29] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-05-28 11:22:29] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 2 ms to minimize.
[2024-05-28 11:22:29] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-28 11:22:29] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-28 11:22:29] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-05-28 11:22:30] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-05-28 11:22:30] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-05-28 11:22:30] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
[2024-05-28 11:22:33] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/704 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (OVERLAPS) 483/986 variables, 503/1207 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:22:44] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:22:44] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:22:44] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:22:44] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-28 11:22:44] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:22:44] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-05-28 11:22:45] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/986 variables, 7/1214 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:22:47] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 986/986 variables, and 1215 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30016 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 482 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 502/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 181/683 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/684 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 28/712 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 6 (OVERLAPS) 483/986 variables, 503/1215 constraints. Problems are: Problem set: 0 solved, 482 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/986 variables, 482/1697 constraints. Problems are: Problem set: 0 solved, 482 unsolved
[2024-05-28 11:23:04] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:23:11] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:23:11] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:23:15] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 986/986 variables, and 1701 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30019 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 482/482 constraints, Known Traps: 32/32 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Finished structural reductions in LTL mode , in 1 iterations and 61105 ms. Remains : 503/503 places, 483/483 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLFireability-13
Product exploration explored 100000 steps with 221 reset in 526 ms.
Product exploration explored 100000 steps with 224 reset in 593 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (36 resets) in 304 ms. (131 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 443 ms. (90 steps per ms) remains 1/1 properties
[2024-05-28 11:23:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 9/14 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 489/503 variables, 177/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 489/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 483/986 variables, 503/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/986 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/986 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 986/986 variables, and 1187 constraints, problems are : Problem set: 0 solved, 1 unsolved in 296 ms.
Refiners :[Domain max(s): 503/503 constraints, Positive P Invariants (semi-flows): 181/181 constraints, State Equation: 503/503 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 5/986 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 16 ms.
Refiners :[Domain max(s): 5/503 constraints, Positive P Invariants (semi-flows): 0/181 constraints, State Equation: 0/503 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 338ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 246 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[p0, p0, false]
Stuttering acceptance computed with spot in 109 ms :[p0, p0, false]
Support contains 5 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 502 transition count 481
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 500 transition count 481
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 499 transition count 480
Applied a total of 5 rules in 24 ms. Remains 499 /503 variables (removed 4) and now considering 480/483 (removed 3) transitions.
// Phase 1: matrix 480 rows 499 cols
[2024-05-28 11:23:20] [INFO ] Computed 180 invariants in 5 ms
[2024-05-28 11:23:20] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-28 11:23:20] [INFO ] Invariant cache hit.
[2024-05-28 11:23:21] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
[2024-05-28 11:23:21] [INFO ] Redundant transitions in 50 ms returned [474]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 478 sub problems to find dead transitions.
// Phase 1: matrix 479 rows 499 cols
[2024-05-28 11:23:21] [INFO ] Computed 180 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:23:25] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:23:25] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-28 11:23:25] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-28 11:23:25] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:23:25] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:23:25] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:23:25] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:23:25] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:23:26] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:23:26] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:23:26] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-28 11:23:26] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-28 11:23:26] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-05-28 11:23:26] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-05-28 11:23:26] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-28 11:23:27] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-28 11:23:27] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-05-28 11:23:27] [INFO ] Deduced a trap composed of 22 places in 104 ms of which 2 ms to minimize.
[2024-05-28 11:23:27] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-28 11:23:30] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 20/699 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 4 (OVERLAPS) 479/978 variables, 499/1198 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:23:42] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/978 variables, 1/1199 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:23:45] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 1 ms to minimize.
[2024-05-28 11:23:45] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:23:45] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:23:45] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:23:45] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-28 11:23:45] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:23:45] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:23:45] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:23:45] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:23:45] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 11:23:45] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-28 11:23:46] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-28 11:23:46] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:23:50] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:23:50] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/978 variables, 15/1214 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 978/978 variables, and 1214 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30023 ms.
Refiners :[Domain max(s): 499/499 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 478 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 36/715 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 4 (OVERLAPS) 479/978 variables, 499/1214 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/978 variables, 478/1692 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:24:01] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:24:02] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:24:03] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:24:03] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:24:03] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:24:04] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-05-28 11:24:04] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2024-05-28 11:24:06] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/978 variables, 8/1700 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 978/978 variables, and 1700 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30013 ms.
Refiners :[Domain max(s): 499/499 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 44/44 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Starting structural reductions in SI_LTL mode, iteration 1 : 499/503 places, 479/483 transitions.
Applied a total of 0 rules in 12 ms. Remains 499 /499 variables (removed 0) and now considering 479/479 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60944 ms. Remains : 499/503 places, 479/483 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 141 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[p0, p0, false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 1782 steps (0 resets) in 25 ms. (68 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 203 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[p0, p0, false]
Stuttering acceptance computed with spot in 118 ms :[p0, p0, false]
Stuttering acceptance computed with spot in 105 ms :[p0, p0, false]
Product exploration explored 100000 steps with 226 reset in 496 ms.
Product exploration explored 100000 steps with 229 reset in 559 ms.
Support contains 5 out of 499 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 499/499 places, 479/479 transitions.
Applied a total of 0 rules in 8 ms. Remains 499 /499 variables (removed 0) and now considering 479/479 (removed 0) transitions.
[2024-05-28 11:24:23] [INFO ] Invariant cache hit.
[2024-05-28 11:24:23] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-28 11:24:23] [INFO ] Invariant cache hit.
[2024-05-28 11:24:24] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
[2024-05-28 11:24:24] [INFO ] Redundant transitions in 45 ms returned []
Running 478 sub problems to find dead transitions.
[2024-05-28 11:24:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:24:28] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-28 11:24:28] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:24:28] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:24:28] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:24:28] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-28 11:24:28] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-05-28 11:24:28] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:24:28] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:24:28] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:24:29] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:24:29] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-05-28 11:24:29] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-05-28 11:24:29] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-28 11:24:29] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-28 11:24:29] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-05-28 11:24:29] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-28 11:24:30] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-28 11:24:30] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-05-28 11:24:30] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-28 11:24:33] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 20/699 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 4 (OVERLAPS) 479/978 variables, 499/1198 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:24:41] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:24:41] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:24:41] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:24:41] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:24:41] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:24:43] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:24:44] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:24:44] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/978 variables, 8/1206 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:24:49] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:24:49] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:24:49] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/978 variables, 3/1209 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 978/978 variables, and 1209 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30017 ms.
Refiners :[Domain max(s): 499/499 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 478 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 31/710 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 4 (OVERLAPS) 479/978 variables, 499/1209 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/978 variables, 478/1687 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:25:03] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:25:03] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:25:06] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-05-28 11:25:06] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:25:07] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:25:16] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:25:20] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/978 variables, 7/1694 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 978/978 variables, and 1694 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30020 ms.
Refiners :[Domain max(s): 499/499 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 38/38 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 60108ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60864 ms. Remains : 499/499 places, 479/479 transitions.
Treatment of property ShieldIIPs-PT-020A-LTLFireability-13 finished in 187447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 502 transition count 481
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 500 transition count 481
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 499 transition count 480
Applied a total of 5 rules in 24 ms. Remains 499 /503 variables (removed 4) and now considering 480/483 (removed 3) transitions.
// Phase 1: matrix 480 rows 499 cols
[2024-05-28 11:25:24] [INFO ] Computed 180 invariants in 2 ms
[2024-05-28 11:25:24] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-28 11:25:24] [INFO ] Invariant cache hit.
[2024-05-28 11:25:25] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
[2024-05-28 11:25:25] [INFO ] Redundant transitions in 51 ms returned [474]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 478 sub problems to find dead transitions.
// Phase 1: matrix 479 rows 499 cols
[2024-05-28 11:25:25] [INFO ] Computed 180 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:25:28] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:25:29] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:25:29] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-28 11:25:29] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:25:29] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-28 11:25:29] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:25:29] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:25:29] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:25:29] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:25:30] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-28 11:25:30] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-28 11:25:30] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-28 11:25:30] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-05-28 11:25:30] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2024-05-28 11:25:30] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-28 11:25:31] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-05-28 11:25:31] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-05-28 11:25:31] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
[2024-05-28 11:25:31] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
[2024-05-28 11:25:34] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 20/699 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 4 (OVERLAPS) 479/978 variables, 499/1198 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:25:46] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/978 variables, 1/1199 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:25:49] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:25:49] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2024-05-28 11:25:50] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-28 11:25:50] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:25:50] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:25:50] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:25:50] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 0 ms to minimize.
[2024-05-28 11:25:50] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:25:50] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:25:50] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-28 11:25:50] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:25:50] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:25:50] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:25:54] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:25:54] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 978/978 variables, and 1214 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30016 ms.
Refiners :[Domain max(s): 499/499 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 478 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 36/715 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 4 (OVERLAPS) 479/978 variables, 499/1214 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/978 variables, 478/1692 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:26:05] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:26:06] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:26:07] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:26:07] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-28 11:26:07] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:26:08] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:26:08] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:26:10] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/978 variables, 8/1700 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 978/978 variables, and 1700 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30015 ms.
Refiners :[Domain max(s): 499/499 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 44/44 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Starting structural reductions in SI_LTL mode, iteration 1 : 499/503 places, 479/483 transitions.
Applied a total of 0 rules in 13 ms. Remains 499 /499 variables (removed 0) and now considering 479/479 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60966 ms. Remains : 499/503 places, 479/483 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLFireability-14
Stuttering criterion allowed to conclude after 1084 steps with 0 reset in 5 ms.
FORMULA ShieldIIPs-PT-020A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020A-LTLFireability-14 finished in 61024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 3 out of 503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 503 transition count 482
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 482
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 481
Applied a total of 4 rules in 16 ms. Remains 501 /503 variables (removed 2) and now considering 481/483 (removed 2) transitions.
// Phase 1: matrix 481 rows 501 cols
[2024-05-28 11:26:25] [INFO ] Computed 181 invariants in 2 ms
[2024-05-28 11:26:25] [INFO ] Implicit Places using invariants in 368 ms returned [487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 379 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 500/503 places, 481/483 transitions.
Applied a total of 0 rules in 7 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 402 ms. Remains : 500/503 places, 481/483 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLFireability-15
Product exploration explored 100000 steps with 404 reset in 464 ms.
Product exploration explored 100000 steps with 405 reset in 530 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 3513 steps (0 resets) in 43 ms. (79 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 9 factoid took 241 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 481/481 transitions.
Applied a total of 0 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
// Phase 1: matrix 481 rows 500 cols
[2024-05-28 11:26:27] [INFO ] Computed 180 invariants in 4 ms
[2024-05-28 11:26:27] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-28 11:26:27] [INFO ] Invariant cache hit.
[2024-05-28 11:26:28] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 859 ms to find 0 implicit places.
[2024-05-28 11:26:28] [INFO ] Redundant transitions in 53 ms returned [475]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 479 sub problems to find dead transitions.
// Phase 1: matrix 480 rows 500 cols
[2024-05-28 11:26:28] [INFO ] Computed 180 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (OVERLAPS) 1/500 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 1/680 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:26:38] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-28 11:26:38] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:26:39] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:26:39] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:26:39] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 11:26:39] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:26:39] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:26:39] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-28 11:26:39] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-05-28 11:26:39] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-05-28 11:26:40] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-05-28 11:26:40] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2024-05-28 11:26:40] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-28 11:26:40] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2024-05-28 11:26:40] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2024-05-28 11:26:40] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 1 ms to minimize.
[2024-05-28 11:26:41] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2024-05-28 11:26:41] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 1 ms to minimize.
[2024-05-28 11:26:41] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-28 11:26:44] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 20/700 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 6 (OVERLAPS) 480/980 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:26:56] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:26:56] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-28 11:26:56] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-05-28 11:26:56] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:26:56] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:26:56] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/980 variables, 6/1206 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:26:57] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:26:57] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:26:58] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 980/980 variables, and 1209 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30018 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 479 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (OVERLAPS) 1/500 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 1/680 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 29/709 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 6 (OVERLAPS) 480/980 variables, 500/1209 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/980 variables, 479/1688 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:27:22] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:27:25] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:27:25] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-05-28 11:27:25] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:27:26] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:27:27] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 5 ms to minimize.
[2024-05-28 11:27:28] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-05-28 11:27:28] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 1696 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30032 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 37/37 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 60141ms
Starting structural reductions in SI_LTL mode, iteration 1 : 500/500 places, 480/481 transitions.
Applied a total of 0 rules in 12 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61111 ms. Remains : 500/500 places, 480/481 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 6475 steps (3 resets) in 65 ms. (98 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 9 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 395 reset in 489 ms.
Product exploration explored 100000 steps with 396 reset in 545 ms.
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 480/480 transitions.
Applied a total of 0 rules in 7 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2024-05-28 11:27:30] [INFO ] Invariant cache hit.
[2024-05-28 11:27:30] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-28 11:27:30] [INFO ] Invariant cache hit.
[2024-05-28 11:27:31] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 889 ms to find 0 implicit places.
[2024-05-28 11:27:31] [INFO ] Redundant transitions in 72 ms returned []
Running 479 sub problems to find dead transitions.
[2024-05-28 11:27:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (OVERLAPS) 1/500 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 1/680 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:27:41] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-28 11:27:41] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:27:41] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:27:41] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-28 11:27:42] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:27:42] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2024-05-28 11:27:42] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:27:42] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-28 11:27:42] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:27:42] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-28 11:27:42] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2024-05-28 11:27:43] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-28 11:27:43] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-28 11:27:43] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-28 11:27:43] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2024-05-28 11:27:43] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-28 11:27:43] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-28 11:27:44] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2024-05-28 11:27:44] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-28 11:27:46] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 20/700 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 6 (OVERLAPS) 480/980 variables, 500/1200 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:27:57] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:27:57] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:27:57] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-28 11:27:57] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-28 11:27:57] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-28 11:27:57] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-28 11:27:57] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:27:58] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/980 variables, 8/1208 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:27:59] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-28 11:27:59] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-05-28 11:27:59] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-05-28 11:27:59] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-05-28 11:28:00] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:28:00] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-28 11:28:00] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-28 11:28:00] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 1 ms to minimize.
[2024-05-28 11:28:01] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 980/980 variables, and 1217 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30013 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 479 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (OVERLAPS) 1/500 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/500 variables, 1/680 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/500 variables, 37/717 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:28:05] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 1/718 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/718 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 7 (OVERLAPS) 480/980 variables, 500/1218 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/980 variables, 479/1697 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 980/980 variables, and 1697 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30028 ms.
Refiners :[Domain max(s): 500/500 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 38/38 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61132 ms. Remains : 500/500 places, 480/480 transitions.
Treatment of property ShieldIIPs-PT-020A-LTLFireability-15 finished in 126031 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p1)||p0)))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-020A-LTLFireability-06
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 503 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 502 transition count 481
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 500 transition count 481
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 499 transition count 480
Applied a total of 5 rules in 24 ms. Remains 499 /503 variables (removed 4) and now considering 480/483 (removed 3) transitions.
// Phase 1: matrix 480 rows 499 cols
[2024-05-28 11:28:31] [INFO ] Computed 180 invariants in 4 ms
[2024-05-28 11:28:32] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-28 11:28:32] [INFO ] Invariant cache hit.
[2024-05-28 11:28:32] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
Running 479 sub problems to find dead transitions.
[2024-05-28 11:28:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:28:36] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:28:36] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:28:36] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:28:36] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:28:36] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-28 11:28:36] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 11:28:37] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-28 11:28:37] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-05-28 11:28:37] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:28:37] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-28 11:28:37] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-28 11:28:37] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-28 11:28:37] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-05-28 11:28:38] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-28 11:28:38] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 3 ms to minimize.
[2024-05-28 11:28:38] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-05-28 11:28:38] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 1 ms to minimize.
[2024-05-28 11:28:38] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-05-28 11:28:38] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
[2024-05-28 11:28:41] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 20/699 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 4 (OVERLAPS) 480/979 variables, 499/1198 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:28:49] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:28:49] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:28:49] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-28 11:28:50] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:28:50] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-05-28 11:28:50] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:28:50] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:28:50] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:28:50] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:28:50] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:28:50] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:28:51] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:28:51] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:28:51] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/979 variables, 14/1212 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:28:57] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-28 11:29:01] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/979 variables, 2/1214 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 979/979 variables, and 1214 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30023 ms.
Refiners :[Domain max(s): 499/499 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 479 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 36/715 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 4 (OVERLAPS) 480/979 variables, 499/1214 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/979 variables, 479/1693 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:29:16] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:29:18] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:29:19] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:29:19] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-28 11:29:19] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:29:20] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:29:20] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 979/979 variables, and 1700 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30025 ms.
Refiners :[Domain max(s): 499/499 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 43/43 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in LI_LTL mode, iteration 1 : 499/503 places, 480/483 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 60885 ms. Remains : 499/503 places, 480/483 transitions.
Running random walk in product with property : ShieldIIPs-PT-020A-LTLFireability-06
Entered a terminal (fully accepting) state of product in 99699 steps with 96 reset in 483 ms.
Treatment of property ShieldIIPs-PT-020A-LTLFireability-06 finished in 61685 ms.
FORMULA ShieldIIPs-PT-020A-LTLFireability-06 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(p0)||F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!p0 U (p1||G(!p0))))))'
Found a Shortening insensitive property : ShieldIIPs-PT-020A-LTLFireability-13
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Support contains 5 out of 503 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 503/503 places, 483/483 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 502 transition count 481
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 500 transition count 481
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 499 transition count 480
Applied a total of 5 rules in 20 ms. Remains 499 /503 variables (removed 4) and now considering 480/483 (removed 3) transitions.
[2024-05-28 11:29:33] [INFO ] Invariant cache hit.
[2024-05-28 11:29:33] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-28 11:29:33] [INFO ] Invariant cache hit.
[2024-05-28 11:29:34] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
Running 479 sub problems to find dead transitions.
[2024-05-28 11:29:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:29:37] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-28 11:29:37] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:29:38] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:29:38] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:29:38] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-28 11:29:38] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-28 11:29:38] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-28 11:29:38] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-28 11:29:38] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-28 11:29:38] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-28 11:29:39] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-28 11:29:39] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:29:39] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-28 11:29:39] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-05-28 11:29:39] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-05-28 11:29:39] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-05-28 11:29:40] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 2 ms to minimize.
[2024-05-28 11:29:40] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2024-05-28 11:29:40] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-28 11:29:43] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 20/699 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 4 (OVERLAPS) 480/979 variables, 499/1198 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:29:50] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:29:50] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:29:51] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:29:51] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:29:51] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:29:51] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:29:51] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:29:51] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:29:52] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:29:52] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-28 11:29:52] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2024-05-28 11:29:52] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:29:52] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:29:53] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/979 variables, 14/1212 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:29:59] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:30:02] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 1.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 1.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 1.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 1.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 979/979 variables, and 1214 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30017 ms.
Refiners :[Domain max(s): 499/499 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 479 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 36/715 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 4 (OVERLAPS) 480/979 variables, 499/1214 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/979 variables, 479/1693 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-28 11:30:18] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:30:20] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-28 11:30:21] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:30:21] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-28 11:30:21] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2024-05-28 11:30:22] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-28 11:30:22] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 979/979 variables, and 1700 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30016 ms.
Refiners :[Domain max(s): 499/499 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 43/43 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Starting structural reductions in LI_LTL mode, iteration 1 : 499/503 places, 480/483 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 60866 ms. Remains : 499/503 places, 480/483 transitions.
Running random walk in product with property : ShieldIIPs-PT-020A-LTLFireability-13
Product exploration explored 100000 steps with 227 reset in 526 ms.
Product exploration explored 100000 steps with 225 reset in 591 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (36 resets) in 497 ms. (80 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
[2024-05-28 11:30:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/12 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/35 variables, 12/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 51/86 variables, 26/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 26/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 9/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/86 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 58/144 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/144 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/144 variables, 5/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/144 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/151 variables, 5/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/151 variables, 7/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/151 variables, 7/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/151 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 69/220 variables, 36/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/220 variables, 36/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/220 variables, 9/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/220 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 3/223 variables, 3/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/223 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/223 variables, 3/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/223 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 6/229 variables, 3/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/229 variables, 6/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/229 variables, 6/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/229 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 63/292 variables, 24/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/292 variables, 24/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/292 variables, 9/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/292 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 6/298 variables, 3/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/298 variables, 6/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/298 variables, 6/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/298 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 69/367 variables, 36/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/367 variables, 36/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/367 variables, 9/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/367 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 3/370 variables, 3/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/370 variables, 3/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/370 variables, 3/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/370 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 6/376 variables, 3/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/376 variables, 6/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/376 variables, 6/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/376 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 63/439 variables, 24/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/439 variables, 24/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/439 variables, 9/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/439 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 6/445 variables, 3/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/445 variables, 6/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/445 variables, 6/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/445 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 69/514 variables, 36/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/514 variables, 36/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/514 variables, 9/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/514 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 3/517 variables, 3/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/517 variables, 3/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/517 variables, 3/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/517 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 6/523 variables, 3/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/523 variables, 6/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/523 variables, 6/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/523 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 63/586 variables, 24/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/586 variables, 24/660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/586 variables, 9/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/586 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 6/592 variables, 3/672 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/592 variables, 6/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/592 variables, 6/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/592 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 69/661 variables, 36/720 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/661 variables, 36/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/661 variables, 9/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/661 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 3/664 variables, 3/768 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/664 variables, 3/771 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/664 variables, 3/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/664 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 6/670 variables, 3/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/670 variables, 6/783 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/670 variables, 6/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/670 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 63/733 variables, 24/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/733 variables, 24/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/733 variables, 9/846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/733 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 6/739 variables, 3/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/739 variables, 6/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/739 variables, 6/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/739 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 69/808 variables, 36/897 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/808 variables, 36/933 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/808 variables, 9/942 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/808 variables, 0/942 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (OVERLAPS) 3/811 variables, 3/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/811 variables, 3/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/811 variables, 3/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/811 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (OVERLAPS) 6/817 variables, 3/954 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/817 variables, 6/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/817 variables, 6/966 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/817 variables, 0/966 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (OVERLAPS) 55/872 variables, 24/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/872 variables, 24/1014 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/872 variables, 9/1023 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/872 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (OVERLAPS) 6/878 variables, 3/1026 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/878 variables, 6/1032 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/878 variables, 6/1038 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/878 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (OVERLAPS) 36/914 variables, 20/1058 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/914 variables, 20/1078 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/914 variables, 4/1082 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/914 variables, 0/1082 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (OVERLAPS) 2/916 variables, 3/1085 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 124 (INCLUDED_ONLY) 0/916 variables, 2/1087 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 125 (INCLUDED_ONLY) 0/916 variables, 2/1089 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 126 (INCLUDED_ONLY) 0/916 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 127 (OVERLAPS) 2/918 variables, 1/1090 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 128 (INCLUDED_ONLY) 0/918 variables, 2/1092 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 129 (INCLUDED_ONLY) 0/918 variables, 2/1094 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 130 (INCLUDED_ONLY) 0/918 variables, 0/1094 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 131 (OVERLAPS) 26/944 variables, 12/1106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 132 (INCLUDED_ONLY) 0/944 variables, 12/1118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 133 (INCLUDED_ONLY) 0/944 variables, 5/1123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 134 (INCLUDED_ONLY) 0/944 variables, 0/1123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 135 (OVERLAPS) 2/946 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 136 (INCLUDED_ONLY) 0/946 variables, 2/1126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 137 (INCLUDED_ONLY) 0/946 variables, 2/1128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 138 (INCLUDED_ONLY) 0/946 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 139 (OVERLAPS) 23/969 variables, 12/1140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 140 (INCLUDED_ONLY) 0/969 variables, 12/1152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 141 (INCLUDED_ONLY) 0/969 variables, 3/1155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 142 (INCLUDED_ONLY) 0/969 variables, 0/1155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 143 (OVERLAPS) 1/970 variables, 1/1156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 144 (INCLUDED_ONLY) 0/970 variables, 1/1157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 145 (INCLUDED_ONLY) 0/970 variables, 1/1158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 146 (INCLUDED_ONLY) 0/970 variables, 0/1158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 147 (OVERLAPS) 2/972 variables, 1/1159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 148 (INCLUDED_ONLY) 0/972 variables, 2/1161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 149 (INCLUDED_ONLY) 0/972 variables, 2/1163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 150 (INCLUDED_ONLY) 0/972 variables, 0/1163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 151 (OVERLAPS) 7/979 variables, 6/1169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 152 (INCLUDED_ONLY) 0/979 variables, 6/1175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 153 (INCLUDED_ONLY) 0/979 variables, 3/1178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 154 (INCLUDED_ONLY) 0/979 variables, 0/1178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 155 (OVERLAPS) 0/979 variables, 0/1178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 979/979 variables, and 1178 constraints, problems are : Problem set: 0 solved, 1 unsolved in 710 ms.
Refiners :[Domain max(s): 499/499 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 5/979 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 13 ms.
Refiners :[Domain max(s): 5/499 constraints, Positive P Invariants (semi-flows): 0/180 constraints, State Equation: 0/499 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 740ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 241 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[p0, p0, false]
Stuttering acceptance computed with spot in 110 ms :[p0, p0, false]
Support contains 5 out of 499 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 499/499 places, 480/480 transitions.
Applied a total of 0 rules in 10 ms. Remains 499 /499 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2024-05-28 11:30:37] [INFO ] Invariant cache hit.
[2024-05-28 11:30:37] [INFO ] Implicit Places using invariants in 242 ms returned []
[2024-05-28 11:30:37] [INFO ] Invariant cache hit.
[2024-05-28 11:30:37] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 734 ms to find 0 implicit places.
[2024-05-28 11:30:37] [INFO ] Redundant transitions in 59 ms returned [474]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 478 sub problems to find dead transitions.
// Phase 1: matrix 479 rows 499 cols
[2024-05-28 11:30:37] [INFO ] Computed 180 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:30:41] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:30:41] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:30:41] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-28 11:30:41] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:30:41] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-28 11:30:42] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-28 11:30:42] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:30:42] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:30:42] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-28 11:30:42] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-05-28 11:30:42] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 2 ms to minimize.
[2024-05-28 11:30:42] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-28 11:30:43] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-05-28 11:30:43] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-28 11:30:43] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-05-28 11:30:43] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-05-28 11:30:43] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-28 11:30:43] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 1 ms to minimize.
[2024-05-28 11:30:44] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
[2024-05-28 11:30:46] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 20/699 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 4 (OVERLAPS) 479/978 variables, 499/1198 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:30:58] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/978 variables, 1/1199 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:31:01] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-28 11:31:01] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:31:01] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:31:01] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:31:01] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 11:31:02] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:31:02] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-05-28 11:31:02] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:31:02] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-28 11:31:02] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:31:02] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-28 11:31:02] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-28 11:31:02] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-28 11:31:06] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-28 11:31:06] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 6 (INCLUDED_ONLY) 0/978 variables, 15/1214 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 978/978 variables, and 1214 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30020 ms.
Refiners :[Domain max(s): 499/499 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 478 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 36/715 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 4 (OVERLAPS) 479/978 variables, 499/1214 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/978 variables, 478/1692 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:31:18] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:31:19] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-28 11:31:20] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-28 11:31:20] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
[2024-05-28 11:31:20] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-28 11:31:21] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:31:21] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:31:23] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/978 variables, 8/1700 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 978/978 variables, and 1700 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30020 ms.
Refiners :[Domain max(s): 499/499 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 44/44 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Starting structural reductions in SI_LTL mode, iteration 1 : 499/499 places, 479/480 transitions.
Applied a total of 0 rules in 7 ms. Remains 499 /499 variables (removed 0) and now considering 479/479 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60950 ms. Remains : 499/499 places, 479/480 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 87 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[p0, p0, false]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 1780 steps (0 resets) in 18 ms. (93 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 179 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[p0, p0, false]
Stuttering acceptance computed with spot in 142 ms :[p0, p0, false]
Stuttering acceptance computed with spot in 119 ms :[p0, p0, false]
Product exploration explored 100000 steps with 223 reset in 491 ms.
Product exploration explored 100000 steps with 227 reset in 577 ms.
Support contains 5 out of 499 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 499/499 places, 479/479 transitions.
Applied a total of 0 rules in 6 ms. Remains 499 /499 variables (removed 0) and now considering 479/479 (removed 0) transitions.
[2024-05-28 11:31:39] [INFO ] Invariant cache hit.
[2024-05-28 11:31:40] [INFO ] Implicit Places using invariants in 272 ms returned []
[2024-05-28 11:31:40] [INFO ] Invariant cache hit.
[2024-05-28 11:31:40] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
[2024-05-28 11:31:40] [INFO ] Redundant transitions in 54 ms returned []
Running 478 sub problems to find dead transitions.
[2024-05-28 11:31:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:31:44] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:31:44] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:31:44] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-05-28 11:31:44] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-28 11:31:45] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-28 11:31:45] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-28 11:31:45] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-28 11:31:45] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-28 11:31:45] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 2 ms to minimize.
[2024-05-28 11:31:45] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-28 11:31:45] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-28 11:31:45] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-28 11:31:46] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-28 11:31:46] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 1 ms to minimize.
[2024-05-28 11:31:46] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-05-28 11:31:46] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-05-28 11:31:46] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 1 ms to minimize.
[2024-05-28 11:31:47] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 1 ms to minimize.
[2024-05-28 11:31:47] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 ms to minimize.
[2024-05-28 11:31:49] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 20/699 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 4 (OVERLAPS) 479/978 variables, 499/1198 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:31:58] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-28 11:31:58] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2024-05-28 11:31:58] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:31:58] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-28 11:31:58] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-28 11:32:00] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-28 11:32:01] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2024-05-28 11:32:01] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/978 variables, 8/1206 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:32:06] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:32:06] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 11:32:06] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 978/978 variables, and 1209 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30042 ms.
Refiners :[Domain max(s): 499/499 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 478 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/499 variables, 499/499 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/499 variables, 180/679 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/499 variables, 31/710 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/499 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 4 (OVERLAPS) 479/978 variables, 499/1209 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/978 variables, 478/1687 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-28 11:32:20] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-28 11:32:20] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-05-28 11:32:23] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-05-28 11:32:23] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-28 11:32:24] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-05-28 11:32:33] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-28 11:32:37] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/978 variables, 7/1694 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 978/978 variables, and 1694 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30021 ms.
Refiners :[Domain max(s): 499/499 constraints, Positive P Invariants (semi-flows): 180/180 constraints, State Equation: 499/499 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 38/38 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 60144ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60970 ms. Remains : 499/499 places, 479/479 transitions.
Treatment of property ShieldIIPs-PT-020A-LTLFireability-13 finished in 187690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
[2024-05-28 11:32:41] [INFO ] Flatten gal took : 39 ms
[2024-05-28 11:32:41] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-28 11:32:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 503 places, 483 transitions and 2166 arcs took 7 ms.
Total runtime 1461833 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldIIPs-PT-020A

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 503
TRANSITIONS: 483
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.010s, Sys 0.002s]

SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]

----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 4571
MODEL NAME: /home/mcc/execution/412/model
503 places, 483 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

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="ShieldIIPs-PT-020A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldIIPs-PT-020A, 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 r355-tall-171683758000100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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