Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 22:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 22:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 12 22:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 212K 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 ShieldIIPt-PT-040A-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-040A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716939558127

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-040A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 23:39:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 23:39:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 23:39:19] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2024-05-28 23:39:19] [INFO ] Transformed 763 places.
[2024-05-28 23:39:19] [INFO ] Transformed 563 transitions.
[2024-05-28 23:39:19] [INFO ] Found NUPN structural information;
[2024-05-28 23:39:19] [INFO ] Parsed PT model containing 763 places and 563 transitions and 2406 arcs in 234 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 2 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-040A-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 65 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2024-05-28 23:39:19] [INFO ] Computed 361 invariants in 26 ms
[2024-05-28 23:39:20] [INFO ] Implicit Places using invariants in 645 ms returned []
[2024-05-28 23:39:20] [INFO ] Invariant cache hit.
[2024-05-28 23:39:21] [INFO ] Implicit Places using invariants and state equation in 773 ms returned []
Implicit Place search using SMT with State Equation took 1452 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-28 23:39:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 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 Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30056 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30037 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60356ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60376ms
Finished structural reductions in LTL mode , in 1 iterations and 61920 ms. Remains : 763/763 places, 562/562 transitions.
Support contains 36 out of 763 places after structural reductions.
[2024-05-28 23:40:22] [INFO ] Flatten gal took : 182 ms
[2024-05-28 23:40:22] [INFO ] Flatten gal took : 67 ms
[2024-05-28 23:40:22] [INFO ] Input system was already deterministic with 562 transitions.
RANDOM walk for 40000 steps (8 resets) in 2312 ms. (17 steps per ms) remains 10/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 567 ms. (70 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 892 ms. (44 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 617 ms. (64 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 719 ms. (55 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 375 ms. (106 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 409 ms. (97 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 381 ms. (104 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 423 ms. (94 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 428 ms. (93 steps per ms) remains 10/10 properties
[2024-05-28 23:40:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 20/38 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 725/763 variables, 344/399 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 725/1124 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 0/1887 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/1325 variables, 0/1887 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2490 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 20/38 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 20/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 725/763 variables, 344/399 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 725/1124 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 10/1897 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1325 variables, 0/1897 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 0/1325 variables, 0/1897 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 1897 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2402 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 4925ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Finished Parikh walk after 154921 steps, including 538 resets, run visited all 3 properties in 1724 ms. (steps per millisecond=89 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 14296 ms.
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(G(p0)))'
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 68 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2024-05-28 23:40:44] [INFO ] Invariant cache hit.
[2024-05-28 23:40:45] [INFO ] Implicit Places using invariants in 484 ms returned []
[2024-05-28 23:40:45] [INFO ] Invariant cache hit.
[2024-05-28 23:40:45] [INFO ] Implicit Places using invariants and state equation in 710 ms returned []
Implicit Place search using SMT with State Equation took 1210 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-28 23:40:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30015 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30035 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60297ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60302ms
Finished structural reductions in LTL mode , in 1 iterations and 61585 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 228 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-01 finished in 61907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))&&F(p1)))))'
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 10 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2024-05-28 23:41:46] [INFO ] Invariant cache hit.
[2024-05-28 23:41:46] [INFO ] Implicit Places using invariants in 509 ms returned []
[2024-05-28 23:41:46] [INFO ] Invariant cache hit.
[2024-05-28 23:41:47] [INFO ] Implicit Places using invariants and state equation in 817 ms returned []
Implicit Place search using SMT with State Equation took 1352 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-28 23:41:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30034 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 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 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30022 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60260ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60265ms
Finished structural reductions in LTL mode , in 1 iterations and 61628 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 670 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 2 ms.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-03 finished in 62645 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(p0)||G(p1)))'
Support contains 4 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 562/562 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 763 transition count 561
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 762 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 761 transition count 560
Applied a total of 4 rules in 150 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
// Phase 1: matrix 560 rows 761 cols
[2024-05-28 23:42:49] [INFO ] Computed 361 invariants in 3 ms
[2024-05-28 23:42:49] [INFO ] Implicit Places using invariants in 491 ms returned [753, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 493 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 759/763 places, 560/562 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 759 transition count 559
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 758 transition count 559
Applied a total of 2 rules in 44 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2024-05-28 23:42:49] [INFO ] Computed 359 invariants in 3 ms
[2024-05-28 23:42:50] [INFO ] Implicit Places using invariants in 455 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 485 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 757/763 places, 559/562 transitions.
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 2 place count 756 transition count 558
Applied a total of 2 rules in 45 ms. Remains 756 /757 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 756 cols
[2024-05-28 23:42:50] [INFO ] Computed 358 invariants in 3 ms
[2024-05-28 23:42:50] [INFO ] Implicit Places using invariants in 594 ms returned []
[2024-05-28 23:42:50] [INFO ] Invariant cache hit.
[2024-05-28 23:42:51] [INFO ] Implicit Places using invariants and state equation in 768 ms returned []
Implicit Place search using SMT with State Equation took 1378 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 756/763 places, 558/562 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2604 ms. Remains : 756/763 places, 558/562 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 726 ms.
Product exploration explored 100000 steps with 0 reset in 831 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 114 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 641 ms. (62 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 504 ms. (79 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 29471 steps, run visited all 1 properties in 268 ms. (steps per millisecond=109 )
Probabilistic random walk after 29471 steps, saw 28768 distinct states, run finished after 272 ms. (steps per millisecond=108 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 13 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040A-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-04 finished in 5349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1))||(F(p2)&&G(F(p0)))))'
Support contains 6 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 562/562 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 763 transition count 561
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 762 transition count 561
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 4 place count 761 transition count 560
Applied a total of 4 rules in 43 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
// Phase 1: matrix 560 rows 761 cols
[2024-05-28 23:42:54] [INFO ] Computed 361 invariants in 3 ms
[2024-05-28 23:42:54] [INFO ] Implicit Places using invariants in 530 ms returned [753, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 537 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 759/763 places, 560/562 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 759 transition count 559
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 758 transition count 559
Applied a total of 2 rules in 50 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2024-05-28 23:42:54] [INFO ] Computed 359 invariants in 3 ms
[2024-05-28 23:42:55] [INFO ] Implicit Places using invariants in 427 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 429 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 757/763 places, 559/562 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 756 transition count 558
Applied a total of 2 rules in 38 ms. Remains 756 /757 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 756 cols
[2024-05-28 23:42:55] [INFO ] Computed 358 invariants in 23 ms
[2024-05-28 23:42:55] [INFO ] Implicit Places using invariants in 553 ms returned []
[2024-05-28 23:42:55] [INFO ] Invariant cache hit.
[2024-05-28 23:42:56] [INFO ] Implicit Places using invariants and state equation in 645 ms returned []
Implicit Place search using SMT with State Equation took 1213 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 756/763 places, 558/562 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 2326 ms. Remains : 756/763 places, 558/562 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 667 ms.
Product exploration explored 100000 steps with 0 reset in 861 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT p2)), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 124 ms. Reduced automaton from 8 states, 24 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 519 ms. (76 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 341 ms. (116 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 463 ms. (86 steps per ms) remains 3/3 properties
[2024-05-28 23:42:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 5/9 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 747/756 variables, 354/367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 747/1114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 558/1314 variables, 756/1870 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1314 variables, 0/1870 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1314 variables, 0/1870 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 1870 constraints, problems are : Problem set: 0 solved, 3 unsolved in 453 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 756/756 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 5/9 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 747/756 variables, 354/367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 747/1114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 558/1314 variables, 756/1870 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1314 variables, 3/1873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1314 variables, 0/1873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1314 variables, 0/1873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 1873 constraints, problems are : Problem set: 0 solved, 3 unsolved in 722 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 756/756 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1206ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 113074 steps, including 926 resets, run visited all 3 properties in 1475 ms. (steps per millisecond=76 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 1475 ms.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT p2)), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 23 factoid took 208 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 756 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 15 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
[2024-05-28 23:43:02] [INFO ] Invariant cache hit.
[2024-05-28 23:43:02] [INFO ] Implicit Places using invariants in 405 ms returned []
[2024-05-28 23:43:02] [INFO ] Invariant cache hit.
[2024-05-28 23:43:03] [INFO ] Implicit Places using invariants and state equation in 766 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
[2024-05-28 23:43:03] [INFO ] Redundant transitions in 26 ms returned []
Running 557 sub problems to find dead transitions.
[2024-05-28 23:43:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/755 variables, 755/755 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/755 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 2 (OVERLAPS) 1/756 variables, 358/1113 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/756 variables, 1/1114 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/756 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 5 (OVERLAPS) 558/1314 variables, 756/1870 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 1870 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30021 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 756/756 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 557 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/755 variables, 755/755 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/755 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 2 (OVERLAPS) 1/756 variables, 358/1113 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/756 variables, 1/1114 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/756 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 5 (OVERLAPS) 558/1314 variables, 756/1870 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1314 variables, 557/2427 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 1)
(s10 1)
(s11 0)
(s12 1)
(s13 0)
(s14 1)
(s15 0)
(s16 1)
(s17 0)
(s18 1)
(s19 0)
(s20 1)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 1)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 1)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 1)
(s48 1)
(s49 0)
(s50 1)
(s51 0)
(s52 1)
(s53 0)
(s54 1)
(s55 0)
(s56 1)
(s57 0)
(s58 1)
(s59 0)
(s60 1)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 1)
(s67 1)
(s68 0)
(s69 1)
(s70 0)
(s71 1)
(s72 0)
(s73 1)
(s74 0)
(s75 1)
(s76 0)
(s77 1)
(s78 0)
(s79 1)
(s80 0)
(s81 0)
(s82 0)
(s83 1)
(s84 1)
(s85 0)
(s86 1)
(s87 0)
(s88 1)
(s89 0)
(s90 1)
(s91 0)
(s92 1)
(s93 0)
(s94 1)
(s95 0)
(s96 1)
(s97 0)
(s98 1)
(s99 0)
(s100 0)
(s101 0)
(s102 1)
(s103 0)
(s104 1)
(s105 1)
(s106 0)
(s107 1)
(s108 0)
(s109 1)
(s110 0)
(s111 1)
(s112 0)
(s113 1)
(s114 0)
(s115 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 2427 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30014 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 756/756 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 0/0 constraints]
After SMT, in 60338ms problems are : Problem set: 0 solved, 557 unsolved
Search for dead transitions found 0 dead transitions in 60343ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61596 ms. Remains : 756/756 places, 558/558 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 95 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 532 ms. (75 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 323 ms. (123 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 323 ms. (123 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 286 ms. (139 steps per ms) remains 3/3 properties
[2024-05-28 23:44:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 5/9 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 747/756 variables, 354/367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 747/1114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 558/1314 variables, 756/1870 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1314 variables, 0/1870 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1314 variables, 0/1870 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 1870 constraints, problems are : Problem set: 0 solved, 3 unsolved in 632 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 756/756 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 5/9 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 747/756 variables, 354/367 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 747/1114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 558/1314 variables, 756/1870 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1314 variables, 3/1873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1314 variables, 0/1873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1314 variables, 0/1873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 1873 constraints, problems are : Problem set: 0 solved, 3 unsolved in 735 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 756/756 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1404ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 145865 steps, including 997 resets, run visited all 3 properties in 1735 ms. (steps per millisecond=84 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 1734 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 225 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 644 ms.
Product exploration explored 100000 steps with 0 reset in 839 ms.
Support contains 4 out of 756 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 756/756 places, 558/558 transitions.
Applied a total of 0 rules in 14 ms. Remains 756 /756 variables (removed 0) and now considering 558/558 (removed 0) transitions.
[2024-05-28 23:44:10] [INFO ] Invariant cache hit.
[2024-05-28 23:44:10] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-28 23:44:10] [INFO ] Invariant cache hit.
[2024-05-28 23:44:11] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 996 ms to find 0 implicit places.
[2024-05-28 23:44:11] [INFO ] Redundant transitions in 12 ms returned []
Running 557 sub problems to find dead transitions.
[2024-05-28 23:44:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/755 variables, 755/755 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/755 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 2 (OVERLAPS) 1/756 variables, 358/1113 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/756 variables, 1/1114 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/756 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 5 (OVERLAPS) 558/1314 variables, 756/1870 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 1870 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30015 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 756/756 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 557 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/755 variables, 755/755 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/755 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 2 (OVERLAPS) 1/756 variables, 358/1113 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/756 variables, 1/1114 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/756 variables, 0/1114 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 5 (OVERLAPS) 558/1314 variables, 756/1870 constraints. Problems are: Problem set: 0 solved, 557 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1314 variables, 557/2427 constraints. Problems are: Problem set: 0 solved, 557 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 2427 constraints, problems are : Problem set: 0 solved, 557 unsolved in 30026 ms.
Refiners :[Domain max(s): 756/756 constraints, Positive P Invariants (semi-flows): 358/358 constraints, State Equation: 756/756 constraints, PredecessorRefiner: 557/557 constraints, Known Traps: 0/0 constraints]
After SMT, in 60181ms problems are : Problem set: 0 solved, 557 unsolved
Search for dead transitions found 0 dead transitions in 60187ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61218 ms. Remains : 756/756 places, 558/558 transitions.
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-07 finished in 137133 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))))'
Support contains 2 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 8 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
// Phase 1: matrix 562 rows 763 cols
[2024-05-28 23:45:11] [INFO ] Computed 361 invariants in 2 ms
[2024-05-28 23:45:11] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-05-28 23:45:11] [INFO ] Invariant cache hit.
[2024-05-28 23:45:12] [INFO ] Implicit Places using invariants and state equation in 722 ms returned []
Implicit Place search using SMT with State Equation took 1152 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-28 23:45:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 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 Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30019 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30024 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60145ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Finished structural reductions in LTL mode , in 1 iterations and 61311 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-08
Product exploration explored 100000 steps with 33333 reset in 1518 ms.
Product exploration explored 100000 steps with 33333 reset in 1584 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 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040A-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-08 finished in 64593 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(p1)||p0))&&F(p2))))'
Support contains 5 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 13 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2024-05-28 23:46:16] [INFO ] Invariant cache hit.
[2024-05-28 23:46:16] [INFO ] Implicit Places using invariants in 403 ms returned []
[2024-05-28 23:46:16] [INFO ] Invariant cache hit.
[2024-05-28 23:46:17] [INFO ] Implicit Places using invariants and state equation in 725 ms returned []
Implicit Place search using SMT with State Equation took 1129 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-28 23:46:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30017 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30025 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Finished structural reductions in LTL mode , in 1 iterations and 61310 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-12
Product exploration explored 100000 steps with 0 reset in 658 ms.
Product exploration explored 100000 steps with 0 reset in 875 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 p2))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p2))), (X (X (AND p1 p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 112 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 413 ms. (96 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 323 ms. (123 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 3/3 properties
[2024-05-28 23:47:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/7 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 756/763 variables, 358/368 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 756/1124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 0/1887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1325 variables, 0/1887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 3 unsolved in 451 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/7 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 756/763 variables, 358/368 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 756/1124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 3/1890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1325 variables, 0/1890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1325 variables, 0/1890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 1890 constraints, problems are : Problem set: 0 solved, 3 unsolved in 538 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1006ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 943 ms.
Support contains 3 out of 763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 763/763 places, 562/562 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 763 transition count 561
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 762 transition count 561
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 4 place count 761 transition count 560
Partial Free-agglomeration rule applied 80 times.
Drop transitions (Partial Free agglomeration) removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 84 place count 761 transition count 560
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 85 place count 760 transition count 559
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 87 place count 758 transition count 559
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 87 place count 758 transition count 558
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 89 place count 757 transition count 558
Applied a total of 89 rules in 310 ms. Remains 757 /763 variables (removed 6) and now considering 558/562 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 310 ms. Remains : 757/763 places, 558/562 transitions.
RANDOM walk for 40000 steps (8 resets) in 1159 ms. (34 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 314 ms. (126 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 299 ms. (133 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 7418 steps, run visited all 3 properties in 122 ms. (steps per millisecond=60 )
Probabilistic random walk after 7418 steps, saw 7159 distinct states, run finished after 122 ms. (steps per millisecond=60 ) properties seen :3
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 p2))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p2))), (X (X (AND p1 p2))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 20 factoid took 252 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040A-LTLCardinality-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-12 finished in 67049 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(!p0))))'
Support contains 2 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 15 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2024-05-28 23:47:23] [INFO ] Invariant cache hit.
[2024-05-28 23:47:23] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-05-28 23:47:23] [INFO ] Invariant cache hit.
[2024-05-28 23:47:24] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-28 23:47:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30017 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30014 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Finished structural reductions in LTL mode , in 1 iterations and 61275 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 102 ms :[true, p0, true]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-13 finished in 61398 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((p0||G((p1 U p2)))))'
Support contains 5 out of 763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 763/763 places, 562/562 transitions.
Applied a total of 0 rules in 10 ms. Remains 763 /763 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2024-05-28 23:48:24] [INFO ] Invariant cache hit.
[2024-05-28 23:48:24] [INFO ] Implicit Places using invariants in 395 ms returned []
[2024-05-28 23:48:24] [INFO ] Invariant cache hit.
[2024-05-28 23:48:25] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
Running 561 sub problems to find dead transitions.
[2024-05-28 23:48:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 1887 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30015 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/762 variables, 762/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/762 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (OVERLAPS) 1/763 variables, 361/1123 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/763 variables, 1/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/1124 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 562/1325 variables, 763/1887 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1325 variables, 561/2448 constraints. Problems are: Problem set: 0 solved, 561 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 1325/1325 variables, and 2448 constraints, problems are : Problem set: 0 solved, 561 unsolved in 30019 ms.
Refiners :[Domain max(s): 763/763 constraints, Positive P Invariants (semi-flows): 361/361 constraints, State Equation: 763/763 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60164ms problems are : Problem set: 0 solved, 561 unsolved
Search for dead transitions found 0 dead transitions in 60169ms
Finished structural reductions in LTL mode , in 1 iterations and 61343 ms. Remains : 763/763 places, 562/562 transitions.
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 1975 ms.
Product exploration explored 100000 steps with 50000 reset in 2031 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR p2 p1))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 23 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040A-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-14 finished in 65660 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((F(p0)&&F(p1)))||F(p2))))'
Support contains 5 out of 763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 763/763 places, 562/562 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 763 transition count 561
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 762 transition count 561
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 4 place count 761 transition count 560
Applied a total of 4 rules in 35 ms. Remains 761 /763 variables (removed 2) and now considering 560/562 (removed 2) transitions.
// Phase 1: matrix 560 rows 761 cols
[2024-05-28 23:49:30] [INFO ] Computed 361 invariants in 6 ms
[2024-05-28 23:49:30] [INFO ] Implicit Places using invariants in 427 ms returned [753, 754]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 428 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 759/763 places, 560/562 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 759 transition count 559
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 758 transition count 559
Applied a total of 2 rules in 19 ms. Remains 758 /759 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 758 cols
[2024-05-28 23:49:30] [INFO ] Computed 359 invariants in 4 ms
[2024-05-28 23:49:31] [INFO ] Implicit Places using invariants in 395 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 396 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 757/763 places, 559/562 transitions.
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 2 place count 756 transition count 558
Applied a total of 2 rules in 23 ms. Remains 756 /757 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 756 cols
[2024-05-28 23:49:31] [INFO ] Computed 358 invariants in 3 ms
[2024-05-28 23:49:31] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-05-28 23:49:31] [INFO ] Invariant cache hit.
[2024-05-28 23:49:32] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 1081 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 756/763 places, 558/562 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1983 ms. Remains : 756/763 places, 558/562 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-040A-LTLCardinality-15
Product exploration explored 100000 steps with 3 reset in 659 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 1 ms.
FORMULA ShieldIIPt-PT-040A-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040A-LTLCardinality-15 finished in 2825 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U G(p1))||(F(p2)&&G(F(p0)))))'
[2024-05-28 23:49:33] [INFO ] Flatten gal took : 45 ms
[2024-05-28 23:49:33] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-28 23:49:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 763 places, 562 transitions and 2404 arcs took 8 ms.
Total runtime 613953 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldIIPt-PT-040A

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/404/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 763
TRANSITIONS: 562
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.012s, Sys 0.001s]


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


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

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

Process ID: 1174
MODEL NAME: /home/mcc/execution/404/model
763 places, 562 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ShieldIIPt-PT-040A-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716940605934

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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

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="ShieldIIPt-PT-040A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldIIPt-PT-040A, 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 r355-tall-171683758500307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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