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.r528-tall-171683760400099.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 ltsminxred
Input is ShieldIIPs-PT-020A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683760400099
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-020A-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-020A-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-020A-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-020A-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-020A-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-020A-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-020A-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-020A-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-020A-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-020A-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-020A-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-020A-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-020A-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-020A-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-020A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717225769154

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-020A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:09:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:09:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:09:30] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2024-06-01 07:09:30] [INFO ] Transformed 503 places.
[2024-06-01 07:09:30] [INFO ] Transformed 483 transitions.
[2024-06-01 07:09:30] [INFO ] Found NUPN structural information;
[2024-06-01 07:09:30] [INFO ] Parsed PT model containing 503 places and 483 transitions and 2166 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldIIPs-PT-020A-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020A-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020A-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020A-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020A-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020A-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020A-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-020A-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 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 52 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
// Phase 1: matrix 483 rows 503 cols
[2024-06-01 07:09:30] [INFO ] Computed 181 invariants in 23 ms
[2024-06-01 07:09:31] [INFO ] Implicit Places using invariants in 486 ms returned []
[2024-06-01 07:09:31] [INFO ] Invariant cache hit.
[2024-06-01 07:09:31] [INFO ] Implicit Places using invariants and state equation in 503 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-06-01 07:09:31] [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-06-01 07:09:42] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 8 ms to minimize.
[2024-06-01 07:09:42] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:09:43] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 6 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 10 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:09:44] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:09:45] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:09:48] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 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-06-01 07:09:58] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:09:58] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:09:59] [INFO ] Deduced a trap composed of 9 places in 24 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-06-01 07:10:01] [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 30030 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-06-01 07:10:18] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:10:24] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:10:25] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:10:28] [INFO ] Deduced a trap composed of 11 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 1701 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: 32/32 constraints]
After SMT, in 60262ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60287ms
Finished structural reductions in LTL mode , in 1 iterations and 61386 ms. Remains : 503/503 places, 483/483 transitions.
Support contains 24 out of 503 places after structural reductions.
[2024-06-01 07:10:32] [INFO ] Flatten gal took : 84 ms
[2024-06-01 07:10:32] [INFO ] Flatten gal took : 44 ms
[2024-06-01 07:10:32] [INFO ] Input system was already deterministic with 483 transitions.
Support contains 22 out of 503 places (down from 24) after GAL structural reductions.
RANDOM walk for 5754 steps (2 resets) in 357 ms. (16 steps per ms) remains 0/12 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' '!(X(X(F(p0))))'
Support contains 2 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 13 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
[2024-06-01 07:10:32] [INFO ] Invariant cache hit.
[2024-06-01 07:10:32] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-06-01 07:10:32] [INFO ] Invariant cache hit.
[2024-06-01 07:10:33] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
Running 482 sub problems to find dead transitions.
[2024-06-01 07:10:33] [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-06-01 07:10:43] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 5 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:10:44] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:10:45] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:10:46] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 3 ms to minimize.
[2024-06-01 07:10:49] [INFO ] Deduced a trap composed of 8 places in 26 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-06-01 07:11:01] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:11:01] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:11:02] [INFO ] Deduced a trap composed of 9 places in 22 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
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-06-01 07:11:20] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:11:22] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:11:24] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:11:29] [INFO ] Deduced a trap composed of 9 places in 31 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 60166ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60172ms
Finished structural reductions in LTL mode , in 1 iterations and 60929 ms. Remains : 503/503 places, 483/483 transitions.
Stuttering acceptance computed with spot in 260 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLCardinality-00
Product exploration explored 100000 steps with 175 reset in 679 ms.
Product exploration explored 100000 steps with 176 reset in 659 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 : [p0, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT 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 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 61 ms. Remains 501 /503 variables (removed 2) and now considering 481/483 (removed 2) transitions.
// Phase 1: matrix 481 rows 501 cols
[2024-06-01 07:11:35] [INFO ] Computed 181 invariants in 3 ms
[2024-06-01 07:11:36] [INFO ] Implicit Places using invariants in 232 ms returned [487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 234 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 32 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 328 ms. Remains : 500/503 places, 481/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 : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 9 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 182 reset in 455 ms.
Product exploration explored 100000 steps with 182 reset in 558 ms.
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 17 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
// Phase 1: matrix 481 rows 500 cols
[2024-06-01 07:11:37] [INFO ] Computed 180 invariants in 7 ms
[2024-06-01 07:11:38] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-06-01 07:11:38] [INFO ] Invariant cache hit.
[2024-06-01 07:11:38] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
[2024-06-01 07:11:38] [INFO ] Redundant transitions in 73 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-06-01 07:11:38] [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-06-01 07:11:49] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:11:49] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:11:50] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:11:51] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:11:54] [INFO ] Deduced a trap composed of 8 places in 27 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-06-01 07:12:05] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:12:05] [INFO ] Deduced a trap composed of 18 places in 36 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-06-01 07:12:06] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:12:06] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:12:07] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 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 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: 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-06-01 07:12:29] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:12:29] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:12:35] [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 30021 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 60147ms problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
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 60996 ms. Remains : 500/500 places, 480/481 transitions.
Treatment of property ShieldIIPs-PT-020A-LTLCardinality-00 finished in 126168 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(G((G(X(X(X(X(p0))))) U p1))))'
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 17 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
// Phase 1: matrix 483 rows 503 cols
[2024-06-01 07:12:38] [INFO ] Computed 181 invariants in 5 ms
[2024-06-01 07:12:39] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-06-01 07:12:39] [INFO ] Invariant cache hit.
[2024-06-01 07:12:39] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
Running 482 sub problems to find dead transitions.
[2024-06-01 07:12:39] [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-06-01 07:12:50] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:12:50] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:12:50] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:12:50] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:12:50] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-06-01 07:12:50] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:12:50] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:12:50] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:12:51] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:12:51] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:12:51] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:12:51] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:12:51] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:12:51] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:12:51] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:12:52] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-06-01 07:12:52] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:12:52] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:12:52] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:12:55] [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-06-01 07:13:06] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:13:06] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:13:07] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:13:07] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:13:07] [INFO ] Deduced a trap composed of 9 places in 26 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-06-01 07:13:09] [INFO ] Deduced a trap composed of 9 places in 31 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 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-06-01 07:13:25] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:13:32] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:13:36] [INFO ] Deduced a trap composed of 11 places in 21 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 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: 32/32 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60144ms
Finished structural reductions in LTL mode , in 1 iterations and 60924 ms. Remains : 503/503 places, 483/483 transitions.
Stuttering acceptance computed with spot in 250 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-020A-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020A-LTLCardinality-01 finished in 61199 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)))'
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 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 37 ms. Remains 499 /503 variables (removed 4) and now considering 480/483 (removed 3) transitions.
// Phase 1: matrix 480 rows 499 cols
[2024-06-01 07:13:40] [INFO ] Computed 180 invariants in 2 ms
[2024-06-01 07:13:40] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-06-01 07:13:40] [INFO ] Invariant cache hit.
[2024-06-01 07:13:40] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2024-06-01 07:13:40] [INFO ] Redundant transitions in 49 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-06-01 07:13:40] [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-06-01 07:13:44] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-06-01 07:13:44] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:13:45] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:13:46] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:13:49] [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, 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-06-01 07:14:01] [INFO ] Deduced a trap composed of 10 places in 26 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-06-01 07:14:04] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:14:04] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:14:05] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:14:08] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 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 30014 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-06-01 07:14:21] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:14:21] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:14:22] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:14:23] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:14:25] [INFO ] Deduced a trap composed of 9 places in 24 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
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
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 30019 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 60111ms problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
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 60867 ms. Remains : 499/503 places, 479/483 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLCardinality-03
Product exploration explored 100000 steps with 296 reset in 407 ms.
Product exploration explored 100000 steps with 300 reset in 503 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 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 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1232 steps (0 resets) in 21 ms. (56 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 99 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 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
[2024-06-01 07:14:42] [INFO ] Invariant cache hit.
[2024-06-01 07:14:42] [INFO ] [Real]Absence check using 180 positive place invariants in 52 ms returned sat
[2024-06-01 07:14:43] [INFO ] [Real]Absence check using state equation in 547 ms returned sat
[2024-06-01 07:14:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:14:43] [INFO ] [Nat]Absence check using 180 positive place invariants in 49 ms returned sat
[2024-06-01 07:14:43] [INFO ] [Nat]Absence check using state equation in 363 ms returned sat
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:14:43] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-06-01 07:14:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 405 ms
[2024-06-01 07:14:44] [INFO ] Computed and/alt/rep : 478/1187/478 causal constraints (skipped 0 transitions) in 27 ms.
[2024-06-01 07:14:54] [INFO ] Added : 475 causal constraints over 95 iterations in 10664 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 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 20 ms. Remains 499 /499 variables (removed 0) and now considering 479/479 (removed 0) transitions.
[2024-06-01 07:14:54] [INFO ] Invariant cache hit.
[2024-06-01 07:14:55] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-06-01 07:14:55] [INFO ] Invariant cache hit.
[2024-06-01 07:14:55] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
[2024-06-01 07:14:55] [INFO ] Redundant transitions in 49 ms returned []
Running 478 sub problems to find dead transitions.
[2024-06-01 07:14:55] [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-06-01 07:14:59] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:14:59] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:15:00] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:15:01] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:15:04] [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, 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-06-01 07:15:12] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:15:12] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:15:14] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:15:15] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:15:15] [INFO ] Deduced a trap composed of 8 places in 26 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-06-01 07:15:20] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:15:20] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:15:20] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 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 30019 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-06-01 07:15:34] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:15:35] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:15:37] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:15:38] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:15:46] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:15:50] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 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 30019 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 60109ms problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60925 ms. Remains : 499/499 places, 479/479 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 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)]
RANDOM walk for 1246 steps (0 resets) in 20 ms. (59 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 93 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 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
[2024-06-01 07:15:56] [INFO ] Invariant cache hit.
[2024-06-01 07:15:56] [INFO ] [Real]Absence check using 180 positive place invariants in 52 ms returned sat
[2024-06-01 07:15:57] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2024-06-01 07:15:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:15:57] [INFO ] [Nat]Absence check using 180 positive place invariants in 48 ms returned sat
[2024-06-01 07:15:57] [INFO ] [Nat]Absence check using state equation in 336 ms returned sat
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:15:57] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:15:58] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:15:58] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:15:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 417 ms
[2024-06-01 07:15:58] [INFO ] Computed and/alt/rep : 478/1187/478 causal constraints (skipped 0 transitions) in 27 ms.
[2024-06-01 07:16:08] [INFO ] Added : 475 causal constraints over 95 iterations in 10449 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 303 reset in 416 ms.
Product exploration explored 100000 steps with 303 reset in 491 ms.
Support contains 2 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 34 ms. Remains 499 /499 variables (removed 0) and now considering 479/479 (removed 0) transitions.
[2024-06-01 07:16:09] [INFO ] Invariant cache hit.
[2024-06-01 07:16:09] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-06-01 07:16:09] [INFO ] Invariant cache hit.
[2024-06-01 07:16:10] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
[2024-06-01 07:16:10] [INFO ] Redundant transitions in 50 ms returned []
Running 478 sub problems to find dead transitions.
[2024-06-01 07:16:10] [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-06-01 07:16:14] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:16:14] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:16:15] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:16:16] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:16:19] [INFO ] Deduced a trap composed of 7 places in 22 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-06-01 07:16:26] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:16:27] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:16:28] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:16:29] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:16:30] [INFO ] Deduced a trap composed of 8 places in 16 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-06-01 07:16:34] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:16:34] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 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 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: 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-06-01 07:16:49] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 3 ms to minimize.
[2024-06-01 07:16:49] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:16:51] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:16:52] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:17:00] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:17:03] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 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 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: 38/38 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60900 ms. Remains : 499/499 places, 479/479 transitions.
Treatment of property ShieldIIPs-PT-020A-LTLCardinality-03 finished in 210496 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 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 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-06-01 07:17:10] [INFO ] Computed 180 invariants in 2 ms
[2024-06-01 07:17:10] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-06-01 07:17:10] [INFO ] Invariant cache hit.
[2024-06-01 07:17:11] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 701 ms to find 0 implicit places.
[2024-06-01 07:17:11] [INFO ] Redundant transitions in 52 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-06-01 07:17:11] [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-06-01 07:17:15] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:17:15] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:17:16] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 3 ms to minimize.
[2024-06-01 07:17:17] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:17:19] [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-06-01 07:17:31] [INFO ] Deduced a trap composed of 10 places in 24 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-06-01 07:17:34] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:17:34] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:17:35] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:17:38] [INFO ] Deduced a trap composed of 19 places in 36 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/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 30022 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-06-01 07:17:51] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:17:51] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:17:52] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:17:53] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:17:53] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:17:53] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:17:55] [INFO ] Deduced a trap composed of 9 places in 29 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
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 Int declared 978/978 variables, and 1700 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30022 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 60110ms problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in SI_LTL mode, iteration 1 : 499/503 places, 479/483 transitions.
Applied a total of 0 rules in 11 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 60911 ms. Remains : 499/503 places, 479/483 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLCardinality-04
Product exploration explored 100000 steps with 95 reset in 540 ms.
Product exploration explored 100000 steps with 95 reset in 530 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 8698 steps (5 resets) in 105 ms. (82 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 2 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 20 ms. Remains 499 /499 variables (removed 0) and now considering 479/479 (removed 0) transitions.
[2024-06-01 07:18:12] [INFO ] Invariant cache hit.
[2024-06-01 07:18:13] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-06-01 07:18:13] [INFO ] Invariant cache hit.
[2024-06-01 07:18:13] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
[2024-06-01 07:18:13] [INFO ] Redundant transitions in 45 ms returned []
Running 478 sub problems to find dead transitions.
[2024-06-01 07:18:13] [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-06-01 07:18:17] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:18:17] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 0 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:18:18] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:18:19] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:18:19] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:18:19] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:18:19] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:18:22] [INFO ] Deduced a trap composed of 7 places in 26 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-06-01 07:18:29] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:18:29] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:18:30] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:18:30] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:18:31] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:18:32] [INFO ] Deduced a trap composed of 8 places in 21 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-06-01 07:18:37] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:18:37] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 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 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 1.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 1.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 (/ 1.0 4.0))
(s131 (/ 3.0 4.0))
(s132 0.0)
(s133 1.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 1.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 (/ 1.0 2.0))
(s185 (/ 1.0 2.0))
(s186 1.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.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 1.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 1.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 1.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 (/ 3.0 4.0))
(s220 0.0)
(s221 0.0)
(s222 (/ 1.0 4.0))
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 1.0)
(s235 0.0)
(s236 1.0)
(s237 0.0)
(s238 1.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 1.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 1.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 0.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 1.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 1.0)
(s309 1.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 1.0)
(s334 1.0)
(s335 0.0)
(s336 1.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 1.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 1.0)
(s361 1.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 1.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 1.0)
(s384 1.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 1.0)
(s394 1.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 1.0)
(s402 1.0)
(s403 0.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 1.0)
(s412 0.0)
(s413 1.0)
(s414 0.0)
(s415 0.0)
(s416 timeout
0.0)
(s417 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 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: 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-06-01 07:18:52] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:18:52] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:18:55] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:18:56] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:19:04] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:19:08] [INFO ] Deduced a trap composed of 10 places in 25 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 30026 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 60108ms problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60845 ms. Remains : 499/499 places, 479/479 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 8496 steps (5 resets) in 51 ms. (163 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 95 reset in 460 ms.
Product exploration explored 100000 steps with 95 reset in 535 ms.
Support contains 2 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 9 ms. Remains 499 /499 variables (removed 0) and now considering 479/479 (removed 0) transitions.
[2024-06-01 07:19:15] [INFO ] Invariant cache hit.
[2024-06-01 07:19:15] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-06-01 07:19:15] [INFO ] Invariant cache hit.
[2024-06-01 07:19:15] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
[2024-06-01 07:19:15] [INFO ] Redundant transitions in 54 ms returned []
Running 478 sub problems to find dead transitions.
[2024-06-01 07:19:15] [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-06-01 07:19:19] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:19:19] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:19:19] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:19:19] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:19:20] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:19:20] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:19:20] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:19:20] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:19:20] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:19:20] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:19:20] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:19:20] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:19:21] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:19:21] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:19:21] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:19:21] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:19:21] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:19:21] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:19:22] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:19:24] [INFO ] Deduced a trap composed of 7 places in 24 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-06-01 07:19:32] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:19:32] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:19:34] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:19:35] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:19:35] [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-06-01 07:19:40] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:19:40] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:19:40] [INFO ] Deduced a trap composed of 9 places in 21 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-06-01 07:19:54] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:19:55] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 2 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:19:57] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:19:58] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:20:06] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:20:10] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 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 30014 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 60097ms problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60843 ms. Remains : 499/499 places, 479/479 transitions.
Treatment of property ShieldIIPs-PT-020A-LTLCardinality-04 finished in 185449 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)))) U p2)))'
Support contains 6 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 8 ms. Remains 503 /503 variables (removed 0) and now considering 483/483 (removed 0) transitions.
// Phase 1: matrix 483 rows 503 cols
[2024-06-01 07:20:16] [INFO ] Computed 181 invariants in 2 ms
[2024-06-01 07:20:16] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-06-01 07:20:16] [INFO ] Invariant cache hit.
[2024-06-01 07:20:16] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
Running 482 sub problems to find dead transitions.
[2024-06-01 07:20:16] [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-06-01 07:20:27] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:20:27] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:20:28] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:20:28] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:20:28] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:20:28] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:20:28] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:20:28] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:20:28] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:20:29] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2024-06-01 07:20:29] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:20:29] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-06-01 07:20:32] [INFO ] Deduced a trap composed of 8 places in 24 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-06-01 07:20:43] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:20:43] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:20:43] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:20:43] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:20:43] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:20:43] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:20:44] [INFO ] Deduced a trap composed of 9 places in 22 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-06-01 07:20:45] [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 986/986 variables, and 1215 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: 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-06-01 07:21:02] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:21:09] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:21:10] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:21:13] [INFO ] Deduced a trap composed of 11 places in 25 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 60125ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Finished structural reductions in LTL mode , in 1 iterations and 60856 ms. Remains : 503/503 places, 483/483 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p2), (NOT p2), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLCardinality-07
Product exploration explored 100000 steps with 50000 reset in 1171 ms.
Product exploration explored 100000 steps with 50000 reset in 1197 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 p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 14 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-020A-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-020A-LTLCardinality-07 finished in 63370 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((X(G(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-06-01 07:21:19] [INFO ] Invariant cache hit.
[2024-06-01 07:21:19] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-06-01 07:21:19] [INFO ] Invariant cache hit.
[2024-06-01 07:21:20] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
Running 482 sub problems to find dead transitions.
[2024-06-01 07:21: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-06-01 07:21:30] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:21:30] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:21:30] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:21:30] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:21:30] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:21:31] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:21:32] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:21:35] [INFO ] Deduced a trap composed of 8 places in 22 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-06-01 07:21:46] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:21:46] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:21:47] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:21:47] [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-06-01 07:21:49] [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 986/986 variables, and 1215 constraints, problems are : Problem set: 0 solved, 482 unsolved in 30023 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-06-01 07:22:06] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:22:12] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:22:13] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:22:16] [INFO ] Deduced a trap composed of 11 places in 26 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 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: 32/32 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Finished structural reductions in LTL mode , in 1 iterations and 60868 ms. Remains : 503/503 places, 483/483 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 430 steps with 0 reset in 4 ms.
FORMULA ShieldIIPs-PT-020A-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-020A-LTLCardinality-08 finished in 60970 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)))'
Support contains 1 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 27 ms. Remains 499 /503 variables (removed 4) and now considering 480/483 (removed 3) transitions.
// Phase 1: matrix 480 rows 499 cols
[2024-06-01 07:22:20] [INFO ] Computed 180 invariants in 5 ms
[2024-06-01 07:22:20] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-06-01 07:22:20] [INFO ] Invariant cache hit.
[2024-06-01 07:22:21] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
[2024-06-01 07:22:21] [INFO ] Redundant transitions in 46 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-06-01 07:22:21] [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-06-01 07:22:24] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:22:24] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:22:24] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:22:25] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:22:25] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:22:25] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:22:25] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:22:25] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:22:25] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-06-01 07:22:25] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:22:25] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:22:26] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:22:27] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:22:27] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:22:29] [INFO ] Deduced a trap composed of 7 places in 24 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-06-01 07:22: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-06-01 07:22:44] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:22:44] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:22:45] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:22:46] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:22:49] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:22:49] [INFO ] Deduced a trap composed of 19 places in 42 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 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: 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-06-01 07:23:01] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:23:01] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:23:02] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:23:02] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:23:03] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:23:03] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:23:03] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:23:05] [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 30026 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 10 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 60874 ms. Remains : 499/503 places, 479/483 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLCardinality-13
Product exploration explored 100000 steps with 1289 reset in 395 ms.
Product exploration explored 100000 steps with 1282 reset in 465 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 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 93 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 410 steps (0 resets) in 7 ms. (51 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 100 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2024-06-01 07:23:22] [INFO ] Invariant cache hit.
[2024-06-01 07:23:22] [INFO ] [Real]Absence check using 180 positive place invariants in 51 ms returned sat
[2024-06-01 07:23:23] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2024-06-01 07:23:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:23:23] [INFO ] [Nat]Absence check using 180 positive place invariants in 45 ms returned sat
[2024-06-01 07:23:24] [INFO ] [Nat]Absence check using state equation in 629 ms returned sat
[2024-06-01 07:23:24] [INFO ] Computed and/alt/rep : 478/1187/478 causal constraints (skipped 0 transitions) in 26 ms.
[2024-06-01 07:23:33] [INFO ] Added : 470 causal constraints over 94 iterations in 9230 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 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 23 ms. Remains 499 /499 variables (removed 0) and now considering 479/479 (removed 0) transitions.
[2024-06-01 07:23:33] [INFO ] Invariant cache hit.
[2024-06-01 07:23:33] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-06-01 07:23:33] [INFO ] Invariant cache hit.
[2024-06-01 07:23:34] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
[2024-06-01 07:23:34] [INFO ] Redundant transitions in 42 ms returned []
Running 478 sub problems to find dead transitions.
[2024-06-01 07:23:34] [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-06-01 07:23:37] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:23:38] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:23:39] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:23:40] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 2 ms to minimize.
[2024-06-01 07:23:42] [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, 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-06-01 07:23:50] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:23:51] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 11 ms to minimize.
[2024-06-01 07:23:51] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:23:51] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:23:51] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:23:52] [INFO ] Deduced a trap composed of 9 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:23:53] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:23:54] [INFO ] Deduced a trap composed of 8 places in 24 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-06-01 07:23:58] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:23:58] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:23:58] [INFO ] Deduced a trap composed of 9 places in 22 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 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: 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-06-01 07:24:13] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:24:13] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:24:16] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:24:16] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:24:17] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:24:25] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:24:28] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 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 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: 38/38 constraints]
After SMT, in 60104ms 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 60876 ms. Remains : 499/499 places, 479/479 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 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 59 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 268 steps (0 resets) in 4 ms. (53 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 92 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 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2024-06-01 07:24:34] [INFO ] Invariant cache hit.
[2024-06-01 07:24:35] [INFO ] [Real]Absence check using 180 positive place invariants in 51 ms returned sat
[2024-06-01 07:24:35] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2024-06-01 07:24:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:24:35] [INFO ] [Nat]Absence check using 180 positive place invariants in 46 ms returned sat
[2024-06-01 07:24:36] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2024-06-01 07:24:36] [INFO ] Computed and/alt/rep : 478/1187/478 causal constraints (skipped 0 transitions) in 41 ms.
[2024-06-01 07:24:45] [INFO ] Added : 470 causal constraints over 94 iterations in 9323 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1287 reset in 359 ms.
Product exploration explored 100000 steps with 1284 reset in 424 ms.
Support contains 1 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 7 ms. Remains 499 /499 variables (removed 0) and now considering 479/479 (removed 0) transitions.
[2024-06-01 07:24:46] [INFO ] Invariant cache hit.
[2024-06-01 07:24:47] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-06-01 07:24:47] [INFO ] Invariant cache hit.
[2024-06-01 07:24:47] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
[2024-06-01 07:24:47] [INFO ] Redundant transitions in 43 ms returned []
Running 478 sub problems to find dead transitions.
[2024-06-01 07:24:47] [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-06-01 07:24:51] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:24:51] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:24:52] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:24:52] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:24:52] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:24:52] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:24:52] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:24:52] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:24:52] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:24:53] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:24:53] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:24:53] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:24:53] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:24:56] [INFO ] Deduced a trap composed of 7 places in 22 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-06-01 07:25:03] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:25:04] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:25:04] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:25:04] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:25:04] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:25:05] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:25:06] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:25:07] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/978 variables, 8/1206 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-06-01 07:25:12] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:25:12] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:25:12] [INFO ] Deduced a trap composed of 9 places in 23 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 1.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 0.0)
(s67 1.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 1.0)
(s184 1.0)
(s185 0.0)
(s186 (/ 3.0 8.0))
(s187 (/ 5.0 8.0))
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 1.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 1.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)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 1.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 1.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 1.0)
(s286 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30019 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-06-01 07:25:26] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:25:26] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:25:29] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:25:29] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:25:30] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:25:38] [INFO ] Deduced a trap composed of 10 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:25:42] [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 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: 38/38 constraints]
After SMT, in 60104ms 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 60831 ms. Remains : 499/499 places, 479/479 transitions.
Treatment of property ShieldIIPs-PT-020A-LTLCardinality-13 finished in 207306 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(p0)))'
Support contains 2 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-06-01 07:25:47] [INFO ] Computed 181 invariants in 2 ms
[2024-06-01 07:25:47] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-06-01 07:25:47] [INFO ] Invariant cache hit.
[2024-06-01 07:25:48] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
Running 482 sub problems to find dead transitions.
[2024-06-01 07:25:48] [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-06-01 07:25:58] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:25:58] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:25:58] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 2 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:25:59] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:26:00] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:26:00] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:26:00] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:26:00] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:26:00] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2024-06-01 07:26:00] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2024-06-01 07:26:01] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:26:03] [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-06-01 07:26:14] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:26:14] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:26:14] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:26:15] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:26:15] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:26:15] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:26:15] [INFO ] Deduced a trap composed of 9 places in 24 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-06-01 07:26:17] [INFO ] Deduced a trap composed of 9 places in 32 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 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: 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-06-01 07:26:34] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:26:41] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:26:41] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:26:44] [INFO ] Deduced a trap composed of 11 places in 26 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 60125ms problems are : Problem set: 0 solved, 482 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Finished structural reductions in LTL mode , in 1 iterations and 60836 ms. Remains : 503/503 places, 483/483 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-020A-LTLCardinality-15
Product exploration explored 100000 steps with 33333 reset in 893 ms.
Product exploration explored 100000 steps with 33333 reset in 933 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-020A-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-020A-LTLCardinality-15 finished in 62831 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(F(p0))))'
Found a Shortening insensitive property : ShieldIIPs-PT-020A-LTLCardinality-00
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 503 places. Attempting structural reductions.
Starting structural reductions in LI_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 27 ms. Remains 501 /503 variables (removed 2) and now considering 481/483 (removed 2) transitions.
// Phase 1: matrix 481 rows 501 cols
[2024-06-01 07:26:50] [INFO ] Computed 181 invariants in 2 ms
[2024-06-01 07:26:51] [INFO ] Implicit Places using invariants in 241 ms returned [487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 242 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 500/503 places, 481/483 transitions.
Applied a total of 0 rules in 8 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 278 ms. Remains : 500/503 places, 481/483 transitions.
Running random walk in product with property : ShieldIIPs-PT-020A-LTLCardinality-00
Product exploration explored 100000 steps with 180 reset in 432 ms.
Product exploration explored 100000 steps with 184 reset in 506 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 : [p0, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (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 12 ms. Remains 500 /500 variables (removed 0) and now considering 481/481 (removed 0) transitions.
// Phase 1: matrix 481 rows 500 cols
[2024-06-01 07:26:52] [INFO ] Computed 180 invariants in 3 ms
[2024-06-01 07:26:52] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-06-01 07:26:52] [INFO ] Invariant cache hit.
[2024-06-01 07:26:53] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
[2024-06-01 07:26:53] [INFO ] Redundant transitions in 44 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-06-01 07:26:53] [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-06-01 07:27:03] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:27:03] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:27:03] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:27:03] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:27:03] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:27:04] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:27:04] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:27:04] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:27:04] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:27:04] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:27:04] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:27:04] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:27:04] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:27:05] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:27:05] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:27:05] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:27:05] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:27:05] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:27:05] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:27:08] [INFO ] Deduced a trap composed of 8 places in 24 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-06-01 07:27:19] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:27:19] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 07:27:19] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:27:19] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:27:19] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:27:20] [INFO ] Deduced a trap composed of 18 places in 33 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-06-01 07:27:21] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:27:21] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:27:21] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:27:21] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:27:21] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:27:22] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 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 30012 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-06-01 07:27:43] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:27:43] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:27:49] [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 Int declared 980/980 variables, and 1694 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30026 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 60143ms problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in SI_LTL mode, iteration 1 : 500/500 places, 480/481 transitions.
Applied a total of 0 rules in 9 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 60902 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 : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 183 reset in 437 ms.
Product exploration explored 100000 steps with 184 reset in 511 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 8 ms. Remains 500 /500 variables (removed 0) and now considering 480/480 (removed 0) transitions.
[2024-06-01 07:27:55] [INFO ] Invariant cache hit.
[2024-06-01 07:27:55] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-06-01 07:27:55] [INFO ] Invariant cache hit.
[2024-06-01 07:27:55] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
[2024-06-01 07:27:55] [INFO ] Redundant transitions in 45 ms returned []
Running 479 sub problems to find dead transitions.
[2024-06-01 07:27:55] [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-06-01 07:28:06] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2024-06-01 07:28:06] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:28:07] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:28:08] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:28:08] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:28:08] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:28:08] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-06-01 07:28:11] [INFO ] Deduced a trap composed of 8 places in 24 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-06-01 07:28:21] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:28:21] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:28:21] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:28:21] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:28:21] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:28:21] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:28:21] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:28:22] [INFO ] Deduced a trap composed of 9 places in 24 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-06-01 07:28:23] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:28:23] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:28:23] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:28:23] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:28:24] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:28:24] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:28:24] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:28:24] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:28:25] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-06-01 07:28:25] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:28:25] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 980/980 variables, and 1219 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: 39/39 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, 39/719 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:28:30] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/500 variables, 1/720 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/500 variables, 0/720 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 7 (OVERLAPS) 480/980 variables, 500/1220 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/980 variables, 479/1699 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:28:55] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:28:56] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
SMT process timed out in 60120ms, After SMT, problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60923 ms. Remains : 500/500 places, 480/480 transitions.
Treatment of property ShieldIIPs-PT-020A-LTLCardinality-00 finished in 125657 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' '!(F(G(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' '!(G(F(p0)))'
[2024-06-01 07:28:56] [INFO ] Flatten gal took : 41 ms
[2024-06-01 07:28:56] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 07:28:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 503 places, 483 transitions and 2166 arcs took 4 ms.
Total runtime 1166213 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ShieldIIPs-PT-020A-LTLCardinality-00 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldIIPs-PT-020A-LTLCardinality-03
Could not compute solution for formula : ShieldIIPs-PT-020A-LTLCardinality-04
Could not compute solution for formula : ShieldIIPs-PT-020A-LTLCardinality-13

BK_STOP 1717227879305

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldIIPs-PT-020A-LTLCardinality-00
ltl formula formula --ltl=/tmp/3564/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 503 places, 483 transitions and 2166 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.010 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3564/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3564/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3564/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3564/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 505 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 504, there are 489 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~754 levels ~10000 states ~38272 transitions
pnml2lts-mc( 0/ 4): ~754 levels ~20000 states ~64568 transitions
pnml2lts-mc( 0/ 4): ~754 levels ~40000 states ~118568 transitions
pnml2lts-mc( 0/ 4): ~754 levels ~80000 states ~249676 transitions
pnml2lts-mc( 0/ 4): ~768 levels ~160000 states ~466988 transitions
pnml2lts-mc( 0/ 4): ~768 levels ~320000 states ~938664 transitions
pnml2lts-mc( 0/ 4): ~768 levels ~640000 states ~2074848 transitions
pnml2lts-mc( 0/ 4): ~768 levels ~1280000 states ~4342680 transitions
pnml2lts-mc( 0/ 4): ~769 levels ~2560000 states ~9032204 transitions
pnml2lts-mc( 2/ 4): ~752 levels ~5120000 states ~19559396 transitions
pnml2lts-mc( 2/ 4): ~752 levels ~10240000 states ~40926620 transitions
pnml2lts-mc( 2/ 4): ~752 levels ~20480000 states ~85831276 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33530191
pnml2lts-mc( 0/ 4): unique states count: 33533076
pnml2lts-mc( 0/ 4): unique transitions count: 144040222
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 110485802
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33533094
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2982
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33533094 states 144040258 transitions, fanout: 4.295
pnml2lts-mc( 0/ 4): Total exploration time 384.860 sec (384.860 sec minimum, 384.860 sec on average)
pnml2lts-mc( 0/ 4): States per second: 87131, Transitions per second: 374267
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 299.9MB, 9.4 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/68.0%
pnml2lts-mc( 0/ 4): Stored 495 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 299.9MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-020A-LTLCardinality-03
ltl formula formula --ltl=/tmp/3564/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 503 places, 483 transitions and 2166 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.030 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3564/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3564/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3564/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3564/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 505 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 504, there are 488 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~458 levels ~10000 states ~30380 transitions
pnml2lts-mc( 1/ 4): ~462 levels ~20000 states ~53544 transitions
pnml2lts-mc( 1/ 4): ~462 levels ~40000 states ~109804 transitions
pnml2lts-mc( 1/ 4): ~462 levels ~80000 states ~228424 transitions
pnml2lts-mc( 1/ 4): ~462 levels ~160000 states ~495848 transitions
pnml2lts-mc( 1/ 4): ~463 levels ~320000 states ~1012940 transitions
pnml2lts-mc( 1/ 4): ~463 levels ~640000 states ~2107964 transitions
pnml2lts-mc( 1/ 4): ~463 levels ~1280000 states ~4580016 transitions
pnml2lts-mc( 1/ 4): ~463 levels ~2560000 states ~9487224 transitions
pnml2lts-mc( 2/ 4): ~520 levels ~5120000 states ~21370972 transitions
pnml2lts-mc( 0/ 4): ~425 levels ~10240000 states ~42953448 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 15809468
pnml2lts-mc( 0/ 4): unique states count: 15811366
pnml2lts-mc( 0/ 4): unique transitions count: 69620004
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 53797484
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 15811382
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1993
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 15811382 states 69620038 transitions, fanout: 4.403
pnml2lts-mc( 0/ 4): Total exploration time 156.450 sec (156.440 sec minimum, 156.445 sec on average)
pnml2lts-mc( 0/ 4): States per second: 101063, Transitions per second: 444999
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 184.7MB, 12.2 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 47.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 495 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 184.7MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-020A-LTLCardinality-04
ltl formula formula --ltl=/tmp/3564/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 503 places, 483 transitions and 2166 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3564/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3564/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3564/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3564/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 504 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 504, there are 495 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~944 levels ~10000 states ~95200 transitions
pnml2lts-mc( 1/ 4): ~944 levels ~20000 states ~193328 transitions
pnml2lts-mc( 1/ 4): ~944 levels ~40000 states ~389504 transitions
pnml2lts-mc( 3/ 4): ~1053 levels ~80000 states ~717532 transitions
pnml2lts-mc( 3/ 4): ~1053 levels ~160000 states ~1686372 transitions
pnml2lts-mc( 3/ 4): ~1053 levels ~320000 states ~3740884 transitions
pnml2lts-mc( 1/ 4): ~944 levels ~640000 states ~6509424 transitions
pnml2lts-mc( 1/ 4): ~944 levels ~1280000 states ~14024816 transitions
pnml2lts-mc( 1/ 4): ~944 levels ~2560000 states ~29715516 transitions
pnml2lts-mc( 0/ 4): ~1032 levels ~5120000 states ~69263380 transitions
pnml2lts-mc( 1/ 4): ~944 levels ~10240000 states ~122234740 transitions
pnml2lts-mc( 1/ 4): ~944 levels ~20480000 states ~264781120 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 30013477
pnml2lts-mc( 0/ 4): unique states count: 30017530
pnml2lts-mc( 0/ 4): unique transitions count: 457428714
pnml2lts-mc( 0/ 4): - self-loop count: 1392
pnml2lts-mc( 0/ 4): - claim dead count: 427368131
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 30017546
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4149
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 30017546 states 457428746 transitions, fanout: 15.239
pnml2lts-mc( 0/ 4): Total exploration time 350.660 sec (350.650 sec minimum, 350.658 sec on average)
pnml2lts-mc( 0/ 4): States per second: 85603, Transitions per second: 1304479
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 293.3MB, 10.2 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 89.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 495 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 293.3MB (~256.0MB paged-in)
ltl formula name ShieldIIPs-PT-020A-LTLCardinality-13
ltl formula formula --ltl=/tmp/3564/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 503 places, 483 transitions and 2166 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3564/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3564/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3564/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3564/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 505 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 504, there are 488 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~154 levels ~10000 states ~20372 transitions
pnml2lts-mc( 0/ 4): ~155 levels ~20000 states ~39040 transitions
pnml2lts-mc( 0/ 4): ~155 levels ~40000 states ~81624 transitions
pnml2lts-mc( 0/ 4): ~158 levels ~80000 states ~165692 transitions
pnml2lts-mc( 0/ 4): ~164 levels ~160000 states ~333648 transitions
pnml2lts-mc( 0/ 4): ~165 levels ~320000 states ~703716 transitions
pnml2lts-mc( 0/ 4): ~165 levels ~640000 states ~1447340 transitions
pnml2lts-mc( 0/ 4): ~165 levels ~1280000 states ~2973708 transitions
pnml2lts-mc( 3/ 4): ~257 levels ~2560000 states ~6138908 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 5028424
pnml2lts-mc( 0/ 4): unique states count: 5029121
pnml2lts-mc( 0/ 4): unique transitions count: 12834946
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 7802159
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 5029136
pnml2lts-mc( 0/ 4): - cum. max stack depth: 796
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5029136 states 12834974 transitions, fanout: 2.552
pnml2lts-mc( 0/ 4): Total exploration time 48.440 sec (48.420 sec minimum, 48.427 sec on average)
pnml2lts-mc( 0/ 4): States per second: 103822, Transitions per second: 264966
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 102.4MB, 21.3 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 14.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 495 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 102.4MB (~256.0MB paged-in)

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="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldIIPs-PT-020A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683760400099"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;