fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r496-tall-171640602700107
Last Updated
July 7, 2024

About the Execution of LTSMin+red for FlexibleBarrier-PT-16b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2974.243 3478800.00 11469041.00 1751.70 FFFTFFFTFFTFTFTT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 13 08:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K Apr 13 08:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 08:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 13 08:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 945K May 18 16:42 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 FlexibleBarrier-PT-16b-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-16b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717183153222

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-16b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:19:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 19:19:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:19:14] [INFO ] Load time of PNML (sax parser for PT used): 187 ms
[2024-05-31 19:19:14] [INFO ] Transformed 3472 places.
[2024-05-31 19:19:14] [INFO ] Transformed 4001 transitions.
[2024-05-31 19:19:14] [INFO ] Found NUPN structural information;
[2024-05-31 19:19:14] [INFO ] Parsed PT model containing 3472 places and 4001 transitions and 10043 arcs in 303 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 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 3472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3472/3472 places, 4001/4001 transitions.
Discarding 1426 places :
Symmetric choice reduction at 0 with 1426 rule applications. Total rules 1426 place count 2046 transition count 2575
Iterating global reduction 0 with 1426 rules applied. Total rules applied 2852 place count 2046 transition count 2575
Discarding 665 places :
Symmetric choice reduction at 0 with 665 rule applications. Total rules 3517 place count 1381 transition count 1910
Iterating global reduction 0 with 665 rules applied. Total rules applied 4182 place count 1381 transition count 1910
Discarding 426 places :
Symmetric choice reduction at 0 with 426 rule applications. Total rules 4608 place count 955 transition count 1484
Iterating global reduction 0 with 426 rules applied. Total rules applied 5034 place count 955 transition count 1484
Ensure Unique test removed 205 transitions
Reduce isomorphic transitions removed 205 transitions.
Iterating post reduction 0 with 205 rules applied. Total rules applied 5239 place count 955 transition count 1279
Applied a total of 5239 rules in 986 ms. Remains 955 /3472 variables (removed 2517) and now considering 1279/4001 (removed 2722) transitions.
// Phase 1: matrix 1279 rows 955 cols
[2024-05-31 19:19:16] [INFO ] Computed 18 invariants in 47 ms
[2024-05-31 19:19:16] [INFO ] Implicit Places using invariants in 650 ms returned []
[2024-05-31 19:19:16] [INFO ] Invariant cache hit.
[2024-05-31 19:19:17] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 1478 ms to find 0 implicit places.
Running 1278 sub problems to find dead transitions.
[2024-05-31 19:19:17] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/954 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1278 unsolved
SMT process timed out in 31362ms, After SMT, problems are : Problem set: 0 solved, 1278 unsolved
Search for dead transitions found 0 dead transitions in 31388ms
Starting structural reductions in LTL mode, iteration 1 : 955/3472 places, 1279/4001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33879 ms. Remains : 955/3472 places, 1279/4001 transitions.
Support contains 31 out of 955 places after structural reductions.
[2024-05-31 19:19:49] [INFO ] Flatten gal took : 107 ms
[2024-05-31 19:19:49] [INFO ] Flatten gal took : 64 ms
[2024-05-31 19:19:49] [INFO ] Input system was already deterministic with 1279 transitions.
Support contains 29 out of 955 places (down from 31) after GAL structural reductions.
RANDOM walk for 40000 steps (353 resets) in 1750 ms. (22 steps per ms) remains 12/16 properties
BEST_FIRST walk for 40004 steps (32 resets) in 171 ms. (232 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (33 resets) in 99 ms. (400 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (30 resets) in 74 ms. (533 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (32 resets) in 63 ms. (625 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (33 resets) in 71 ms. (555 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (31 resets) in 44 ms. (888 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (30 resets) in 51 ms. (769 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (35 resets) in 52 ms. (754 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (33 resets) in 74 ms. (533 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (32 resets) in 78 ms. (506 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (32 resets) in 82 ms. (481 steps per ms) remains 11/11 properties
[2024-05-31 19:19:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 638/659 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/659 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 296/955 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/955 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1279/2234 variables, 955/973 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2234 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/2234 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2234/2234 variables, and 973 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1244 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 955/955 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 638/659 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-31 19:19:51] [INFO ] Deduced a trap composed of 276 places in 254 ms of which 34 ms to minimize.
[2024-05-31 19:19:52] [INFO ] Deduced a trap composed of 278 places in 232 ms of which 5 ms to minimize.
[2024-05-31 19:19:52] [INFO ] Deduced a trap composed of 315 places in 207 ms of which 4 ms to minimize.
[2024-05-31 19:19:52] [INFO ] Deduced a trap composed of 278 places in 189 ms of which 4 ms to minimize.
[2024-05-31 19:19:52] [INFO ] Deduced a trap composed of 279 places in 198 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/659 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/659 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 296/955 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-31 19:19:53] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/955 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/955 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1279/2234 variables, 955/979 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2234 variables, 11/990 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2234 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/2234 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2234/2234 variables, and 990 constraints, problems are : Problem set: 0 solved, 11 unsolved in 3518 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 955/955 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 6/6 constraints]
After SMT, in 4787ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
Finished Parikh walk after 29352 steps, including 273 resets, run visited all 5 properties in 111 ms. (steps per millisecond=264 )
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 )
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 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 11 properties in 1650 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p1&&G(p2)))||p0)))'
Support contains 9 out of 955 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 955/955 places, 1279/1279 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 938 transition count 1262
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 938 transition count 1262
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 938 transition count 1260
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 49 place count 925 transition count 1247
Iterating global reduction 1 with 13 rules applied. Total rules applied 62 place count 925 transition count 1247
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 69 place count 925 transition count 1240
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 922 transition count 1237
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 922 transition count 1237
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 78 place count 922 transition count 1234
Applied a total of 78 rules in 92 ms. Remains 922 /955 variables (removed 33) and now considering 1234/1279 (removed 45) transitions.
// Phase 1: matrix 1234 rows 922 cols
[2024-05-31 19:19:56] [INFO ] Computed 18 invariants in 24 ms
[2024-05-31 19:19:57] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-05-31 19:19:57] [INFO ] Invariant cache hit.
[2024-05-31 19:19:58] [INFO ] Implicit Places using invariants and state equation in 737 ms returned []
Implicit Place search using SMT with State Equation took 1083 ms to find 0 implicit places.
Running 1233 sub problems to find dead transitions.
[2024-05-31 19:19:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/921 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
At refinement iteration 1 (OVERLAPS) 1/922 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 922/2156 variables, and 18 constraints, problems are : Problem set: 0 solved, 1233 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/922 constraints, PredecessorRefiner: 1233/1233 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/921 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
At refinement iteration 1 (OVERLAPS) 1/922 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 922/2156 variables, and 18 constraints, problems are : Problem set: 0 solved, 1233 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/922 constraints, PredecessorRefiner: 0/1233 constraints, Known Traps: 0/0 constraints]
After SMT, in 61244ms problems are : Problem set: 0 solved, 1233 unsolved
Search for dead transitions found 0 dead transitions in 61257ms
Starting structural reductions in LTL mode, iteration 1 : 922/955 places, 1234/1279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62438 ms. Remains : 922/955 places, 1234/1279 transitions.
Stuttering acceptance computed with spot in 282 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLCardinality-00
Product exploration explored 100000 steps with 886 reset in 339 ms.
Product exploration explored 100000 steps with 888 reset in 277 ms.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 87 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (353 resets) in 256 ms. (155 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (33 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 560728 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 1
Probabilistic random walk after 560728 steps, saw 198037 distinct states, run finished after 3003 ms. (steps per millisecond=186 ) properties seen :0
[2024-05-31 19:21:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 281/285 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 637/922 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/922 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1234/2156 variables, 922/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2156 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2156 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2156/2156 variables, and 940 constraints, problems are : Problem set: 0 solved, 1 unsolved in 380 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 922/922 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 281/285 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 637/922 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/922 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1234/2156 variables, 922/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2156 variables, 1/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2156 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2156 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2156/2156 variables, and 941 constraints, problems are : Problem set: 0 solved, 1 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 922/922 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 818ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 99 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=99 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) p2 p1), (X (NOT p0)), (X (X p2)), (X (X (AND p1 p2))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 6 factoid took 118 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 4 out of 922 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 922/922 places, 1234/1234 transitions.
Applied a total of 0 rules in 28 ms. Remains 922 /922 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
[2024-05-31 19:21:04] [INFO ] Invariant cache hit.
[2024-05-31 19:21:05] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-31 19:21:05] [INFO ] Invariant cache hit.
[2024-05-31 19:21:05] [INFO ] Implicit Places using invariants and state equation in 709 ms returned []
Implicit Place search using SMT with State Equation took 1007 ms to find 0 implicit places.
Running 1233 sub problems to find dead transitions.
[2024-05-31 19:21:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/921 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
At refinement iteration 1 (OVERLAPS) 1/922 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 922/2156 variables, and 18 constraints, problems are : Problem set: 0 solved, 1233 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/922 constraints, PredecessorRefiner: 1233/1233 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/921 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
At refinement iteration 1 (OVERLAPS) 1/922 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1233 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 922/2156 variables, and 18 constraints, problems are : Problem set: 0 solved, 1233 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/922 constraints, PredecessorRefiner: 0/1233 constraints, Known Traps: 0/0 constraints]
After SMT, in 61191ms problems are : Problem set: 0 solved, 1233 unsolved
Search for dead transitions found 0 dead transitions in 61206ms
Finished structural reductions in LTL mode , in 1 iterations and 62246 ms. Remains : 922/922 places, 1234/1234 transitions.
Computed a total of 18 stabilizing places and 18 stable transitions
Computed a total of 18 stabilizing places and 18 stable transitions
Knowledge obtained : [p2]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 151 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (351 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (32 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 558353 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 1
Probabilistic random walk after 558353 steps, saw 197127 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :0
[2024-05-31 19:22:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 281/285 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 637/922 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/922 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1234/2156 variables, 922/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2156 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2156 variables, 0/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2156/2156 variables, and 940 constraints, problems are : Problem set: 0 solved, 1 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 922/922 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 281/285 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 637/922 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/922 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1234/2156 variables, 922/940 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2156 variables, 1/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2156 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2156 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2156/2156 variables, and 941 constraints, problems are : Problem set: 0 solved, 1 unsolved in 420 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 922/922 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 798ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 103 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=51 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p2]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Entered a terminal (fully accepting) state of product in 32044 steps with 282 reset in 76 ms.
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-00 finished in 135172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 955 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 955/955 places, 1279/1279 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 930 transition count 1254
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 930 transition count 1254
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 930 transition count 1251
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 73 place count 910 transition count 1231
Iterating global reduction 1 with 20 rules applied. Total rules applied 93 place count 910 transition count 1231
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 106 place count 910 transition count 1218
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 109 place count 907 transition count 1215
Iterating global reduction 2 with 3 rules applied. Total rules applied 112 place count 907 transition count 1215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 115 place count 907 transition count 1212
Applied a total of 115 rules in 110 ms. Remains 907 /955 variables (removed 48) and now considering 1212/1279 (removed 67) transitions.
// Phase 1: matrix 1212 rows 907 cols
[2024-05-31 19:22:12] [INFO ] Computed 18 invariants in 21 ms
[2024-05-31 19:22:12] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-31 19:22:12] [INFO ] Invariant cache hit.
[2024-05-31 19:22:13] [INFO ] Implicit Places using invariants and state equation in 722 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
Running 1211 sub problems to find dead transitions.
[2024-05-31 19:22:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/906 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1211 unsolved
At refinement iteration 1 (OVERLAPS) 1/907 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 907/2119 variables, and 18 constraints, problems are : Problem set: 0 solved, 1211 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/907 constraints, PredecessorRefiner: 1211/1211 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/906 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1211 unsolved
At refinement iteration 1 (OVERLAPS) 1/907 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1211 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 1)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 1)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 1)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 1)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 1)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 1)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 1)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 1)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 1)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 0)
(s627 0)
(s628 0)
(s629 0)
(s630 1)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 1)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 0)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 0)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 0)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 1)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 0)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 timeout
0)
(s831 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 907/2119 variables, and 18 constraints, problems are : Problem set: 0 solved, 1211 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/907 constraints, PredecessorRefiner: 0/1211 constraints, Known Traps: 0/0 constraints]
After SMT, in 61229ms problems are : Problem set: 0 solved, 1211 unsolved
Search for dead transitions found 0 dead transitions in 61243ms
Starting structural reductions in LTL mode, iteration 1 : 907/955 places, 1212/1279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62381 ms. Remains : 907/955 places, 1212/1279 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLCardinality-01
Stuttering criterion allowed to conclude after 117 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-01 finished in 62497 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(p0)))'
Support contains 2 out of 955 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 955/955 places, 1279/1279 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 930 transition count 1254
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 930 transition count 1254
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 930 transition count 1251
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 73 place count 910 transition count 1231
Iterating global reduction 1 with 20 rules applied. Total rules applied 93 place count 910 transition count 1231
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 107 place count 910 transition count 1217
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 110 place count 907 transition count 1214
Iterating global reduction 2 with 3 rules applied. Total rules applied 113 place count 907 transition count 1214
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 116 place count 907 transition count 1211
Applied a total of 116 rules in 86 ms. Remains 907 /955 variables (removed 48) and now considering 1211/1279 (removed 68) transitions.
// Phase 1: matrix 1211 rows 907 cols
[2024-05-31 19:23:14] [INFO ] Computed 18 invariants in 17 ms
[2024-05-31 19:23:14] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-31 19:23:14] [INFO ] Invariant cache hit.
[2024-05-31 19:23:15] [INFO ] Implicit Places using invariants and state equation in 749 ms returned []
Implicit Place search using SMT with State Equation took 1081 ms to find 0 implicit places.
Running 1210 sub problems to find dead transitions.
[2024-05-31 19:23:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/906 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 1 (OVERLAPS) 1/907 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 907/2118 variables, and 18 constraints, problems are : Problem set: 0 solved, 1210 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/907 constraints, PredecessorRefiner: 1210/1210 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1210 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/906 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1210 unsolved
At refinement iteration 1 (OVERLAPS) 1/907 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1210 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 907/2118 variables, and 18 constraints, problems are : Problem set: 0 solved, 1210 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/907 constraints, PredecessorRefiner: 0/1210 constraints, Known Traps: 0/0 constraints]
After SMT, in 61079ms problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 61092ms
Starting structural reductions in LTL mode, iteration 1 : 907/955 places, 1211/1279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62263 ms. Remains : 907/955 places, 1211/1279 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 17939 steps with 159 reset in 39 ms.
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-02 finished in 62427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 955 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 955/955 places, 1279/1279 transitions.
Graph (trivial) has 901 edges and 955 vertex of which 97 / 955 are part of one of the 16 SCC in 7 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 873 transition count 1121
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 151 place count 798 transition count 1121
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 151 place count 798 transition count 1078
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 237 place count 755 transition count 1078
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 290 place count 702 transition count 1025
Iterating global reduction 2 with 53 rules applied. Total rules applied 343 place count 702 transition count 1025
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 346 place count 702 transition count 1022
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 360 place count 688 transition count 1008
Iterating global reduction 3 with 14 rules applied. Total rules applied 374 place count 688 transition count 1008
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 387 place count 688 transition count 995
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 583 place count 590 transition count 897
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 585 place count 588 transition count 895
Iterating global reduction 4 with 2 rules applied. Total rules applied 587 place count 588 transition count 895
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 589 place count 588 transition count 893
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 605 place count 588 transition count 877
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 607 place count 586 transition count 875
Applied a total of 607 rules in 497 ms. Remains 586 /955 variables (removed 369) and now considering 875/1279 (removed 404) transitions.
[2024-05-31 19:24:17] [INFO ] Flow matrix only has 844 transitions (discarded 31 similar events)
// Phase 1: matrix 844 rows 586 cols
[2024-05-31 19:24:17] [INFO ] Computed 18 invariants in 20 ms
[2024-05-31 19:24:17] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-31 19:24:17] [INFO ] Flow matrix only has 844 transitions (discarded 31 similar events)
[2024-05-31 19:24:17] [INFO ] Invariant cache hit.
[2024-05-31 19:24:18] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
[2024-05-31 19:24:18] [INFO ] Redundant transitions in 44 ms returned []
Running 375 sub problems to find dead transitions.
[2024-05-31 19:24:18] [INFO ] Flow matrix only has 844 transitions (discarded 31 similar events)
[2024-05-31 19:24:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 16/586 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 843/1429 variables, 586/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1429 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (OVERLAPS) 0/1429 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1429/1430 variables, and 604 constraints, problems are : Problem set: 0 solved, 375 unsolved in 29859 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 16/586 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 843/1429 variables, 586/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1429 variables, 375/979 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1429 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 375 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 1429/1430 variables, and 979 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 0/0 constraints]
After SMT, in 60189ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 60192ms
Starting structural reductions in SI_LTL mode, iteration 1 : 586/955 places, 875/1279 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61503 ms. Remains : 586/955 places, 875/1279 transitions.
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-06 finished in 61573 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 955 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 955/955 places, 1279/1279 transitions.
Graph (trivial) has 902 edges and 955 vertex of which 97 / 955 are part of one of the 16 SCC in 1 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 77 place count 873 transition count 1120
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 153 place count 797 transition count 1120
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 153 place count 797 transition count 1077
Deduced a syphon composed of 43 places in 2 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 239 place count 754 transition count 1077
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 293 place count 700 transition count 1023
Iterating global reduction 2 with 54 rules applied. Total rules applied 347 place count 700 transition count 1023
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 350 place count 700 transition count 1020
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 363 place count 687 transition count 1007
Iterating global reduction 3 with 13 rules applied. Total rules applied 376 place count 687 transition count 1007
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 389 place count 687 transition count 994
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 585 place count 589 transition count 896
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 588 place count 586 transition count 893
Iterating global reduction 4 with 3 rules applied. Total rules applied 591 place count 586 transition count 893
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 594 place count 586 transition count 890
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 610 place count 586 transition count 874
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 612 place count 584 transition count 872
Applied a total of 612 rules in 257 ms. Remains 584 /955 variables (removed 371) and now considering 872/1279 (removed 407) transitions.
[2024-05-31 19:25:18] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
// Phase 1: matrix 841 rows 584 cols
[2024-05-31 19:25:18] [INFO ] Computed 18 invariants in 21 ms
[2024-05-31 19:25:19] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-31 19:25:19] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-31 19:25:19] [INFO ] Invariant cache hit.
[2024-05-31 19:25:19] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 788 ms to find 0 implicit places.
[2024-05-31 19:25:19] [INFO ] Redundant transitions in 46 ms returned []
Running 373 sub problems to find dead transitions.
[2024-05-31 19:25:19] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-31 19:25:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 16/584 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (OVERLAPS) 840/1424 variables, 584/602 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1424 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 0/1424 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 373 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1424/1425 variables, and 602 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 16/584 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (OVERLAPS) 840/1424 variables, 584/602 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1424 variables, 373/975 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1424 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1424/1425 variables, and 975 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints]
After SMT, in 60348ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 60352ms
Starting structural reductions in SI_LTL mode, iteration 1 : 584/955 places, 872/1279 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61449 ms. Remains : 584/955 places, 872/1279 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLCardinality-07
Product exploration explored 100000 steps with 4446 reset in 855 ms.
Product exploration explored 100000 steps with 4464 reset in 855 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 123 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1810 resets) in 1594 ms. (25 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 143 ms. (277 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (11 resets) in 147 ms. (270 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 65 ms. (606 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 51 ms. (769 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 374599 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :0 out of 6
Probabilistic random walk after 374599 steps, saw 90598 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
[2024-05-31 19:26:25] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-31 19:26:25] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 227/229 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 454/683 variables, 229/230 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/683 variables, 0/230 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 546/1229 variables, 257/487 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1229 variables, 0/487 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 96/1325 variables, 16/503 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1325 variables, 0/503 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 96/1421 variables, 96/599 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1421 variables, 0/599 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 3/1424 variables, 2/601 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1424 variables, 1/602 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1424 variables, 0/602 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/1424 variables, 0/602 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1424/1425 variables, and 602 constraints, problems are : Problem set: 1 solved, 5 unsolved in 978 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 227/229 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 454/683 variables, 229/230 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/683 variables, 0/230 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 546/1229 variables, 257/487 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1229 variables, 4/491 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1229 variables, 0/491 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 96/1325 variables, 16/507 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-31 19:26:27] [INFO ] Deduced a trap composed of 247 places in 162 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 1/508 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1325 variables, 0/508 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 96/1421 variables, 96/604 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1421 variables, 0/604 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 3/1424 variables, 2/606 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1424 variables, 1/607 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1424 variables, 0/607 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/1424 variables, 0/607 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1424/1425 variables, and 607 constraints, problems are : Problem set: 2 solved, 4 unsolved in 928 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 1914ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 92 steps, including 3 resets, run visited all 4 properties in 3 ms. (steps per millisecond=30 )
Parikh walk visited 4 properties in 3 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 15 factoid took 265 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[false]
Stuttering acceptance computed with spot in 35 ms :[false]
Support contains 2 out of 584 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 584/584 places, 872/872 transitions.
Applied a total of 0 rules in 46 ms. Remains 584 /584 variables (removed 0) and now considering 872/872 (removed 0) transitions.
[2024-05-31 19:26:27] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-31 19:26:27] [INFO ] Invariant cache hit.
[2024-05-31 19:26:28] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-31 19:26:28] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-31 19:26:28] [INFO ] Invariant cache hit.
[2024-05-31 19:26:28] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
[2024-05-31 19:26:28] [INFO ] Redundant transitions in 6 ms returned []
Running 373 sub problems to find dead transitions.
[2024-05-31 19:26:28] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-31 19:26:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 16/584 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (OVERLAPS) 840/1424 variables, 584/602 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1424 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (OVERLAPS) 0/1424 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 373 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1424/1425 variables, and 602 constraints, problems are : Problem set: 0 solved, 373 unsolved in 29813 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 16/584 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (OVERLAPS) 840/1424 variables, 584/602 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1424 variables, 373/975 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1424 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 1)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1424/1425 variables, and 975 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60965 ms. Remains : 584/584 places, 872/872 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[false]
RANDOM walk for 40000 steps (1814 resets) in 365 ms. (109 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (12 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 706642 steps, run timeout after 3001 ms. (steps per millisecond=235 ) properties seen :0 out of 1
Probabilistic random walk after 706642 steps, saw 168223 distinct states, run finished after 3001 ms. (steps per millisecond=235 ) properties seen :0
[2024-05-31 19:27:32] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-31 19:27:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 227/229 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 454/683 variables, 229/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/683 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 546/1229 variables, 257/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1229 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 96/1325 variables, 16/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1325 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 96/1421 variables, 96/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1421 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/1424 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1424 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1424 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1424 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1424/1425 variables, and 602 constraints, problems are : Problem set: 0 solved, 1 unsolved in 391 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 227/229 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 454/683 variables, 229/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/683 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 546/1229 variables, 257/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1229 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1229 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 96/1325 variables, 16/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1325 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 96/1421 variables, 96/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1421 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/1424 variables, 2/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1424 variables, 1/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1424 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1424 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1424/1425 variables, and 603 constraints, problems are : Problem set: 0 solved, 1 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 747ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 137 steps, including 6 resets, run visited all 1 properties in 2 ms. (steps per millisecond=68 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[false]
Stuttering acceptance computed with spot in 27 ms :[false]
Stuttering acceptance computed with spot in 42 ms :[false]
Product exploration explored 100000 steps with 4435 reset in 745 ms.
Product exploration explored 100000 steps with 4467 reset in 766 ms.
Support contains 2 out of 584 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 584/584 places, 872/872 transitions.
Applied a total of 0 rules in 46 ms. Remains 584 /584 variables (removed 0) and now considering 872/872 (removed 0) transitions.
[2024-05-31 19:27:34] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-31 19:27:34] [INFO ] Invariant cache hit.
[2024-05-31 19:27:35] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-31 19:27:35] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-31 19:27:35] [INFO ] Invariant cache hit.
[2024-05-31 19:27:35] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 765 ms to find 0 implicit places.
[2024-05-31 19:27:35] [INFO ] Redundant transitions in 6 ms returned []
Running 373 sub problems to find dead transitions.
[2024-05-31 19:27:35] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-31 19:27:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 16/584 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (OVERLAPS) 840/1424 variables, 584/602 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1424 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (OVERLAPS) 0/1424 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 373 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1424/1425 variables, and 602 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 373 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/568 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/568 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 2 (OVERLAPS) 16/584 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 4 (OVERLAPS) 840/1424 variables, 584/602 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1424 variables, 373/975 constraints. Problems are: Problem set: 0 solved, 373 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1424 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 373 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1424/1425 variables, and 975 constraints, problems are : Problem set: 0 solved, 373 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 373/373 constraints, Known Traps: 0/0 constraints]
After SMT, in 60322ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 60326ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61148 ms. Remains : 584/584 places, 872/872 transitions.
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-07 finished in 197522 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))'
Support contains 1 out of 955 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 955/955 places, 1279/1279 transitions.
Graph (trivial) has 904 edges and 955 vertex of which 97 / 955 are part of one of the 16 SCC in 1 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 873 transition count 1119
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 155 place count 796 transition count 1119
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 155 place count 796 transition count 1076
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 241 place count 753 transition count 1076
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 297 place count 697 transition count 1020
Iterating global reduction 2 with 56 rules applied. Total rules applied 353 place count 697 transition count 1020
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 356 place count 697 transition count 1017
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 370 place count 683 transition count 1003
Iterating global reduction 3 with 14 rules applied. Total rules applied 384 place count 683 transition count 1003
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 398 place count 683 transition count 989
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 594 place count 585 transition count 891
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 597 place count 582 transition count 888
Iterating global reduction 4 with 3 rules applied. Total rules applied 600 place count 582 transition count 888
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 603 place count 582 transition count 885
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 619 place count 582 transition count 869
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 621 place count 580 transition count 867
Applied a total of 621 rules in 189 ms. Remains 580 /955 variables (removed 375) and now considering 867/1279 (removed 412) transitions.
[2024-05-31 19:28:36] [INFO ] Flow matrix only has 836 transitions (discarded 31 similar events)
// Phase 1: matrix 836 rows 580 cols
[2024-05-31 19:28:36] [INFO ] Computed 18 invariants in 22 ms
[2024-05-31 19:28:36] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-31 19:28:36] [INFO ] Flow matrix only has 836 transitions (discarded 31 similar events)
[2024-05-31 19:28:36] [INFO ] Invariant cache hit.
[2024-05-31 19:28:36] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
[2024-05-31 19:28:36] [INFO ] Redundant transitions in 6 ms returned []
Running 369 sub problems to find dead transitions.
[2024-05-31 19:28:37] [INFO ] Flow matrix only has 836 transitions (discarded 31 similar events)
[2024-05-31 19:28:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/564 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/564 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 16/580 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (OVERLAPS) 835/1415 variables, 580/598 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1415 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (OVERLAPS) 0/1415 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 369 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1415/1416 variables, and 598 constraints, problems are : Problem set: 0 solved, 369 unsolved in 29102 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/564 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/564 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 16/580 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (OVERLAPS) 835/1415 variables, 580/598 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1415 variables, 369/967 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1415 variables, 0/967 constraints. Problems are: Problem set: 0 solved, 369 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 1415/1416 variables, and 967 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 0/0 constraints]
After SMT, in 59407ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 59411ms
Starting structural reductions in SI_LTL mode, iteration 1 : 580/955 places, 867/1279 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60382 ms. Remains : 580/955 places, 867/1279 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLCardinality-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-08 finished in 60432 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))||(p1&&G(p2)))))'
Support contains 5 out of 955 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 955/955 places, 1279/1279 transitions.
Graph (trivial) has 899 edges and 955 vertex of which 97 / 955 are part of one of the 16 SCC in 1 ms
Free SCC test removed 81 places
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 75 place count 873 transition count 1122
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 149 place count 799 transition count 1122
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 149 place count 799 transition count 1079
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 235 place count 756 transition count 1079
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 288 place count 703 transition count 1026
Iterating global reduction 2 with 53 rules applied. Total rules applied 341 place count 703 transition count 1026
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 344 place count 703 transition count 1023
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 358 place count 689 transition count 1009
Iterating global reduction 3 with 14 rules applied. Total rules applied 372 place count 689 transition count 1009
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 385 place count 689 transition count 996
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 581 place count 591 transition count 898
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 584 place count 588 transition count 895
Iterating global reduction 4 with 3 rules applied. Total rules applied 587 place count 588 transition count 895
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 590 place count 588 transition count 892
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 606 place count 588 transition count 876
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 608 place count 586 transition count 874
Applied a total of 608 rules in 189 ms. Remains 586 /955 variables (removed 369) and now considering 874/1279 (removed 405) transitions.
[2024-05-31 19:29:36] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
// Phase 1: matrix 843 rows 586 cols
[2024-05-31 19:29:36] [INFO ] Computed 18 invariants in 16 ms
[2024-05-31 19:29:36] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-31 19:29:36] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-31 19:29:36] [INFO ] Invariant cache hit.
[2024-05-31 19:29:37] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
[2024-05-31 19:29:37] [INFO ] Redundant transitions in 7 ms returned []
Running 375 sub problems to find dead transitions.
[2024-05-31 19:29:37] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-31 19:29:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 16/586 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 842/1428 variables, 586/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1428 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (OVERLAPS) 0/1428 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1428/1429 variables, and 604 constraints, problems are : Problem set: 0 solved, 375 unsolved in 29716 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 16/586 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 842/1428 variables, 586/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1428 variables, 375/979 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1428 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1428/1429 variables, and 979 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 0/0 constraints]
After SMT, in 60031ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 60034ms
Starting structural reductions in SI_LTL mode, iteration 1 : 586/955 places, 874/1279 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60988 ms. Remains : 586/955 places, 874/1279 transitions.
Stuttering acceptance computed with spot in 78 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLCardinality-10
Product exploration explored 100000 steps with 33247 reset in 1455 ms.
Product exploration explored 100000 steps with 33387 reset in 1472 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
RANDOM walk for 40000 steps (1825 resets) in 482 ms. (82 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 36 ms. (1081 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 28 ms. (1379 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 28 ms. (1379 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 311017 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 4
Probabilistic random walk after 311017 steps, saw 77689 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
[2024-05-31 19:30:44] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-31 19:30:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 292/297 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 528/825 variables, 297/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/825 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 473/1298 variables, 211/512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1298 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1298 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 78/1376 variables, 13/526 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1376 variables, 26/552 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1376 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 52/1428 variables, 52/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1428 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1428 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1428/1429 variables, and 604 constraints, problems are : Problem set: 0 solved, 4 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 292/297 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 528/825 variables, 297/301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/825 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/825 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 473/1298 variables, 211/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1298 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1298 variables, 3/517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1298 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 78/1376 variables, 13/530 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1376 variables, 26/556 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1376 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 52/1428 variables, 52/608 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1428 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/1428 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1428/1429 variables, and 608 constraints, problems are : Problem set: 0 solved, 4 unsolved in 610 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1101ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 1242 steps, including 36 resets, run visited all 4 properties in 20 ms. (steps per millisecond=62 )
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 4 properties in 19 ms.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Support contains 5 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 874/874 transitions.
Applied a total of 0 rules in 37 ms. Remains 586 /586 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2024-05-31 19:30:45] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-31 19:30:45] [INFO ] Invariant cache hit.
[2024-05-31 19:30:45] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-31 19:30:45] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-31 19:30:45] [INFO ] Invariant cache hit.
[2024-05-31 19:30:46] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
[2024-05-31 19:30:46] [INFO ] Redundant transitions in 5 ms returned []
Running 375 sub problems to find dead transitions.
[2024-05-31 19:30:46] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-31 19:30:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 16/586 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 842/1428 variables, 586/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1428 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (OVERLAPS) 0/1428 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1428/1429 variables, and 604 constraints, problems are : Problem set: 0 solved, 375 unsolved in 29660 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 16/586 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 842/1428 variables, 586/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1428 variables, 375/979 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1428 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 1)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 1)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 1)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 1)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 1)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 1)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 1)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 1)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 1)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1428/1429 variables, and 979 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 0/0 constraints]
After SMT, in 59980ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 59983ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60759 ms. Remains : 586/586 places, 874/874 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
RANDOM walk for 40000 steps (1819 resets) in 1043 ms. (38 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
[2024-05-31 19:31:46] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-31 19:31:46] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 293/297 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 528/825 variables, 297/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/825 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 473/1298 variables, 211/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1298 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1298 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 78/1376 variables, 13/526 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1376 variables, 26/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1376 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 52/1428 variables, 52/604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1428 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1428 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1428/1429 variables, and 604 constraints, problems are : Problem set: 0 solved, 2 unsolved in 342 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 293/297 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 528/825 variables, 297/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/825 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 473/1298 variables, 211/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1298 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1298 variables, 2/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1298 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 78/1376 variables, 13/528 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1376 variables, 26/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1376 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 52/1428 variables, 52/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1428 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1428 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1428/1429 variables, and 606 constraints, problems are : Problem set: 0 solved, 2 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 751ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 23 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Product exploration explored 100000 steps with 33355 reset in 1455 ms.
Product exploration explored 100000 steps with 33490 reset in 1462 ms.
Support contains 5 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 874/874 transitions.
Applied a total of 0 rules in 32 ms. Remains 586 /586 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2024-05-31 19:31:51] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-31 19:31:51] [INFO ] Invariant cache hit.
[2024-05-31 19:31:51] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-31 19:31:51] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-31 19:31:51] [INFO ] Invariant cache hit.
[2024-05-31 19:31:51] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
[2024-05-31 19:31:51] [INFO ] Redundant transitions in 5 ms returned []
Running 375 sub problems to find dead transitions.
[2024-05-31 19:31:51] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-31 19:31:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 16/586 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 842/1428 variables, 586/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1428 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (OVERLAPS) 0/1428 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1428/1429 variables, and 604 constraints, problems are : Problem set: 0 solved, 375 unsolved in 29100 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/570 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/570 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (OVERLAPS) 16/586 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 842/1428 variables, 586/604 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1428 variables, 375/979 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1428 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1428/1429 variables, and 979 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 0/0 constraints]
After SMT, in 59428ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 59431ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60227 ms. Remains : 586/586 places, 874/874 transitions.
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-10 finished in 194806 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(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))'
Support contains 6 out of 955 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 955/955 places, 1279/1279 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 935 transition count 1259
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 935 transition count 1259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 935 transition count 1258
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 58 place count 918 transition count 1241
Iterating global reduction 1 with 17 rules applied. Total rules applied 75 place count 918 transition count 1241
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 87 place count 918 transition count 1229
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 917 transition count 1228
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 917 transition count 1228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 917 transition count 1227
Applied a total of 90 rules in 62 ms. Remains 917 /955 variables (removed 38) and now considering 1227/1279 (removed 52) transitions.
// Phase 1: matrix 1227 rows 917 cols
[2024-05-31 19:32:51] [INFO ] Computed 18 invariants in 15 ms
[2024-05-31 19:32:51] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-31 19:32:51] [INFO ] Invariant cache hit.
[2024-05-31 19:32:52] [INFO ] Implicit Places using invariants and state equation in 732 ms returned []
Implicit Place search using SMT with State Equation took 1041 ms to find 0 implicit places.
Running 1226 sub problems to find dead transitions.
[2024-05-31 19:32:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/916 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
At refinement iteration 1 (OVERLAPS) 1/917 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 917/2144 variables, and 18 constraints, problems are : Problem set: 0 solved, 1226 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/917 constraints, PredecessorRefiner: 1226/1226 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/916 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1226 unsolved
At refinement iteration 1 (OVERLAPS) 1/917 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1226 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 917/2144 variables, and 18 constraints, problems are : Problem set: 0 solved, 1226 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 0/917 constraints, PredecessorRefiner: 0/1226 constraints, Known Traps: 0/0 constraints]
After SMT, in 61073ms problems are : Problem set: 0 solved, 1226 unsolved
Search for dead transitions found 0 dead transitions in 61086ms
Starting structural reductions in LTL mode, iteration 1 : 917/955 places, 1227/1279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62193 ms. Remains : 917/955 places, 1227/1279 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLCardinality-13
Stuttering criterion allowed to conclude after 114 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-13 finished in 62326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(p0))||(p1&&G(p2)))))'
[2024-05-31 19:33:53] [INFO ] Flatten gal took : 47 ms
[2024-05-31 19:33:53] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-31 19:33:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 955 places, 1279 transitions and 3779 arcs took 8 ms.
Total runtime 879602 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717186632022

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name FlexibleBarrier-PT-16b-LTLCardinality-07
ltl formula formula --ltl=/tmp/1250/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 955 places, 1279 transitions and 3779 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.030 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1250/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1250/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1250/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1250/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 956 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 956, there are 1328 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~328 levels ~10000 states ~23508 transitions
pnml2lts-mc( 1/ 4): ~454 levels ~20000 states ~56400 transitions
pnml2lts-mc( 1/ 4): ~454 levels ~40000 states ~108320 transitions
pnml2lts-mc( 1/ 4): ~454 levels ~80000 states ~223872 transitions
pnml2lts-mc( 1/ 4): ~454 levels ~160000 states ~444764 transitions
pnml2lts-mc( 1/ 4): ~648 levels ~320000 states ~990104 transitions
pnml2lts-mc( 3/ 4): ~929 levels ~640000 states ~1847712 transitions
pnml2lts-mc( 3/ 4): ~1950 levels ~1280000 states ~3760156 transitions
pnml2lts-mc( 1/ 4): ~7310 levels ~2560000 states ~9308476 transitions
pnml2lts-mc( 1/ 4): ~7310 levels ~5120000 states ~16040564 transitions
pnml2lts-mc( 1/ 4): ~10432 levels ~10240000 states ~32747256 transitions
pnml2lts-mc( 1/ 4): ~10432 levels ~20480000 states ~70231452 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7094906
pnml2lts-mc( 0/ 4): unique states count: 33425856
pnml2lts-mc( 0/ 4): unique transitions count: 136202525
pnml2lts-mc( 0/ 4): - self-loop count: 1642844
pnml2lts-mc( 0/ 4): - claim dead count: 61105858
pnml2lts-mc( 0/ 4): - claim found count: 39876309
pnml2lts-mc( 0/ 4): - claim success count: 33425868
pnml2lts-mc( 0/ 4): - cum. max stack depth: 358776
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33425868 states 136202554 transitions, fanout: 4.075
pnml2lts-mc( 0/ 4): Total exploration time 1297.400 sec (1297.380 sec minimum, 1297.385 sec on average)
pnml2lts-mc( 0/ 4): States per second: 25764, Transitions per second: 104981
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 258.5MB, 8.1 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/3.0%
pnml2lts-mc( 0/ 4): Stored 1309 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 258.5MB (~256.0MB paged-in)
ltl formula name FlexibleBarrier-PT-16b-LTLCardinality-10
ltl formula formula --ltl=/tmp/1250/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 955 places, 1279 transitions and 3779 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.040 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1250/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1250/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1250/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1250/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 957 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 956, there are 1290 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~203 levels ~10000 states ~26308 transitions
pnml2lts-mc( 0/ 4): ~209 levels ~20000 states ~46828 transitions
pnml2lts-mc( 2/ 4): ~398 levels ~40000 states ~114356 transitions
pnml2lts-mc( 2/ 4): ~398 levels ~80000 states ~222620 transitions
pnml2lts-mc( 2/ 4): ~398 levels ~160000 states ~443484 transitions
pnml2lts-mc( 2/ 4): ~398 levels ~320000 states ~903004 transitions
pnml2lts-mc( 3/ 4): ~1632 levels ~640000 states ~2001580 transitions
pnml2lts-mc( 3/ 4): ~6666 levels ~1280000 states ~4818668 transitions
pnml2lts-mc( 3/ 4): ~6666 levels ~2560000 states ~9630868 transitions
pnml2lts-mc( 3/ 4): ~6666 levels ~5120000 states ~18870892 transitions
pnml2lts-mc( 3/ 4): ~6666 levels ~10240000 states ~38620316 transitions
pnml2lts-mc( 2/ 4): ~6968 levels ~20480000 states ~69167088 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 20545228
pnml2lts-mc( 0/ 4): unique states count: 33510859
pnml2lts-mc( 0/ 4): unique transitions count: 134834621
pnml2lts-mc( 0/ 4): - self-loop count: 760383
pnml2lts-mc( 0/ 4): - claim dead count: 82195540
pnml2lts-mc( 0/ 4): - claim found count: 18314797
pnml2lts-mc( 0/ 4): - claim success count: 33510874
pnml2lts-mc( 0/ 4): - cum. max stack depth: 30545
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33510874 states 134834657 transitions, fanout: 4.024
pnml2lts-mc( 0/ 4): Total exploration time 1299.390 sec (1299.250 sec minimum, 1299.295 sec on average)
pnml2lts-mc( 0/ 4): States per second: 25790, Transitions per second: 103768
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 288.7MB, 9.0 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/51.0%
pnml2lts-mc( 0/ 4): Stored 1309 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 288.7MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-16b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FlexibleBarrier-PT-16b, 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 r496-tall-171640602700107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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