About the Execution of ITS-Tools for FlexibleBarrier-PT-16b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16205.584 | 3600000.00 | 11505144.00 | 7171.60 | FFFTFFF?FF?FTFTT | 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.r180-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 itstools
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 r180-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 1716426082167
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-16b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-23 01:01:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 01:01:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 01:01:23] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2024-05-23 01:01:23] [INFO ] Transformed 3472 places.
[2024-05-23 01:01:23] [INFO ] Transformed 4001 transitions.
[2024-05-23 01:01:23] [INFO ] Found NUPN structural information;
[2024-05-23 01:01:23] [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 579 ms. Remains 955 /3472 variables (removed 2517) and now considering 1279/4001 (removed 2722) transitions.
// Phase 1: matrix 1279 rows 955 cols
[2024-05-23 01:01:24] [INFO ] Computed 18 invariants in 53 ms
[2024-05-23 01:01:24] [INFO ] Implicit Places using invariants in 579 ms returned []
[2024-05-23 01:01:24] [INFO ] Invariant cache hit.
[2024-05-23 01:01:25] [INFO ] Implicit Places using invariants and state equation in 914 ms returned []
Implicit Place search using SMT with State Equation took 1523 ms to find 0 implicit places.
Running 1278 sub problems to find dead transitions.
[2024-05-23 01:01:25] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 timeout
1.0)
(s84 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 31425ms, After SMT, problems are : Problem set: 0 solved, 1278 unsolved
Search for dead transitions found 0 dead transitions in 31451ms
Starting structural reductions in LTL mode, iteration 1 : 955/3472 places, 1279/4001 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33587 ms. Remains : 955/3472 places, 1279/4001 transitions.
Support contains 31 out of 955 places after structural reductions.
[2024-05-23 01:01:57] [INFO ] Flatten gal took : 100 ms
[2024-05-23 01:01:57] [INFO ] Flatten gal took : 60 ms
[2024-05-23 01:01:57] [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 (357 resets) in 1422 ms. (28 steps per ms) remains 11/16 properties
BEST_FIRST walk for 40004 steps (33 resets) in 245 ms. (162 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (31 resets) in 141 ms. (281 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (33 resets) in 111 ms. (357 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (33 resets) in 95 ms. (416 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (32 resets) in 87 ms. (454 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (33 resets) in 81 ms. (487 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (34 resets) in 73 ms. (540 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (33 resets) in 76 ms. (519 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (31 resets) in 66 ms. (597 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (33 resets) in 60 ms. (655 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (32 resets) in 68 ms. (579 steps per ms) remains 11/11 properties
[2024-05-23 01:01:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 551/570 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 385/955 variables, 10/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 1231 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/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 551/570 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-23 01:02:00] [INFO ] Deduced a trap composed of 314 places in 226 ms of which 36 ms to minimize.
[2024-05-23 01:02:00] [INFO ] Deduced a trap composed of 278 places in 224 ms of which 5 ms to minimize.
[2024-05-23 01:02:00] [INFO ] Deduced a trap composed of 277 places in 189 ms of which 4 ms to minimize.
[2024-05-23 01:02:00] [INFO ] Deduced a trap composed of 282 places in 164 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/570 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/570 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 385/955 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/955 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 1279/2234 variables, 955/977 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2234 variables, 11/988 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-23 01:02:02] [INFO ] Deduced a trap composed of 103 places in 148 ms of which 6 ms to minimize.
[2024-05-23 01:02:02] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/2234 variables, 2/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 3657 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 4908ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
Finished Parikh walk after 445 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=222 )
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 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 11 properties in 740 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 205 ms. Remains 922 /955 variables (removed 33) and now considering 1234/1279 (removed 45) transitions.
// Phase 1: matrix 1234 rows 922 cols
[2024-05-23 01:02:04] [INFO ] Computed 18 invariants in 26 ms
[2024-05-23 01:02:05] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-05-23 01:02:05] [INFO ] Invariant cache hit.
[2024-05-23 01:02:05] [INFO ] Implicit Places using invariants and state equation in 738 ms returned []
Implicit Place search using SMT with State Equation took 1106 ms to find 0 implicit places.
Running 1233 sub problems to find dead transitions.
[2024-05-23 01:02: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 30029 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 30024 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 61290ms problems are : Problem set: 0 solved, 1233 unsolved
Search for dead transitions found 0 dead transitions in 61304ms
Starting structural reductions in LTL mode, iteration 1 : 922/955 places, 1234/1279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62620 ms. Remains : 922/955 places, 1234/1279 transitions.
Stuttering acceptance computed with spot in 308 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 889 reset in 388 ms.
Product exploration explored 100000 steps with 888 reset in 279 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 88 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 145 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (357 resets) in 331 ms. (120 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (33 resets) in 242 ms. (164 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 562881 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :0 out of 1
Probabilistic random walk after 562881 steps, saw 198824 distinct states, run finished after 3004 ms. (steps per millisecond=187 ) properties seen :0
[2024-05-23 01:03:11] [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 374 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 430 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 815ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 113 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=28 )
Parikh walk visited 1 properties in 4 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 122 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 187 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 174 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 38 ms. Remains 922 /922 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
[2024-05-23 01:03:12] [INFO ] Invariant cache hit.
[2024-05-23 01:03:13] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-05-23 01:03:13] [INFO ] Invariant cache hit.
[2024-05-23 01:03:14] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
Running 1233 sub problems to find dead transitions.
[2024-05-23 01:03:14] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/921 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1233 unsolved
SMT process timed out in 31162ms, After SMT, problems are : Problem set: 0 solved, 1233 unsolved
Search for dead transitions found 0 dead transitions in 31172ms
Finished structural reductions in LTL mode , in 1 iterations and 32315 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 76 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 137 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (355 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (32 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 559000 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 1
Probabilistic random walk after 559000 steps, saw 197401 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :0
[2024-05-23 01:03:48] [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 396 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 474 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 885ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 113 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=113 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p2]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 1 factoid took 95 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 154 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Entered a terminal (fully accepting) state of product in 95306 steps with 848 reset in 218 ms.
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-00 finished in 105733 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 100 ms. Remains 907 /955 variables (removed 48) and now considering 1212/1279 (removed 67) transitions.
// Phase 1: matrix 1212 rows 907 cols
[2024-05-23 01:03:50] [INFO ] Computed 18 invariants in 14 ms
[2024-05-23 01:03:50] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-05-23 01:03:50] [INFO ] Invariant cache hit.
[2024-05-23 01:03:51] [INFO ] Implicit Places using invariants and state equation in 751 ms returned []
Implicit Place search using SMT with State Equation took 1110 ms to find 0 implicit places.
Running 1211 sub problems to find dead transitions.
[2024-05-23 01:03:51] [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 30023 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
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 30026 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 61250ms problems are : Problem set: 0 solved, 1211 unsolved
Search for dead transitions found 0 dead transitions in 61266ms
Starting structural reductions in LTL mode, iteration 1 : 907/955 places, 1212/1279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62482 ms. Remains : 907/955 places, 1212/1279 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLCardinality-01
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-01 finished in 62568 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 99 ms. Remains 907 /955 variables (removed 48) and now considering 1211/1279 (removed 68) transitions.
// Phase 1: matrix 1211 rows 907 cols
[2024-05-23 01:04:52] [INFO ] Computed 18 invariants in 22 ms
[2024-05-23 01:04:53] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-05-23 01:04:53] [INFO ] Invariant cache hit.
[2024-05-23 01:04:54] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 1121 ms to find 0 implicit places.
Running 1210 sub problems to find dead transitions.
[2024-05-23 01:04:54] [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 30023 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
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 30022 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 61154ms problems are : Problem set: 0 solved, 1210 unsolved
Search for dead transitions found 0 dead transitions in 61166ms
Starting structural reductions in LTL mode, iteration 1 : 907/955 places, 1211/1279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62389 ms. Remains : 907/955 places, 1211/1279 transitions.
Stuttering acceptance computed with spot in 90 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 10870 steps with 97 reset in 23 ms.
FORMULA FlexibleBarrier-PT-16b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-02 finished in 62523 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 10 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 569 ms. Remains 586 /955 variables (removed 369) and now considering 875/1279 (removed 404) transitions.
[2024-05-23 01:05:55] [INFO ] Flow matrix only has 844 transitions (discarded 31 similar events)
// Phase 1: matrix 844 rows 586 cols
[2024-05-23 01:05:55] [INFO ] Computed 18 invariants in 13 ms
[2024-05-23 01:05:56] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-23 01:05:56] [INFO ] Flow matrix only has 844 transitions (discarded 31 similar events)
[2024-05-23 01:05:56] [INFO ] Invariant cache hit.
[2024-05-23 01:05:56] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
[2024-05-23 01:05:56] [INFO ] Redundant transitions in 55 ms returned []
Running 375 sub problems to find dead transitions.
[2024-05-23 01:05:56] [INFO ] Flow matrix only has 844 transitions (discarded 31 similar events)
[2024-05-23 01:05:56] [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 30010 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 30018 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 60417ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 60420ms
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 61926 ms. Remains : 586/955 places, 875/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-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 61981 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 2 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 1 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 234 ms. Remains 584 /955 variables (removed 371) and now considering 872/1279 (removed 407) transitions.
[2024-05-23 01:06:57] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
// Phase 1: matrix 841 rows 584 cols
[2024-05-23 01:06:57] [INFO ] Computed 18 invariants in 13 ms
[2024-05-23 01:06:57] [INFO ] Implicit Places using invariants in 337 ms returned []
[2024-05-23 01:06:57] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-23 01:06:57] [INFO ] Invariant cache hit.
[2024-05-23 01:06:58] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 855 ms to find 0 implicit places.
[2024-05-23 01:06:58] [INFO ] Redundant transitions in 25 ms returned []
Running 373 sub problems to find dead transitions.
[2024-05-23 01:06:58] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-23 01:06:58] [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 30013 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 60330ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 60334ms
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 61453 ms. Remains : 584/955 places, 872/1279 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-16b-LTLCardinality-07
Product exploration explored 100000 steps with 4425 reset in 1032 ms.
Product exploration explored 100000 steps with 4459 reset in 854 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 140 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 41 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1822 resets) in 2233 ms. (17 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 195 ms. (204 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 197 ms. (202 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 162 ms. (245 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 331826 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 6
Probabilistic random walk after 331826 steps, saw 82795 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
[2024-05-23 01:08:05] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-23 01:08:05] [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 983 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-23 01:08:06] [INFO ] Deduced a trap composed of 247 places in 182 ms of which 6 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 958 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 1964ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 21 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=7 )
Parikh walk visited 4 properties in 2 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 221 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 28 ms :[false]
Stuttering acceptance computed with spot in 41 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 42 ms. Remains 584 /584 variables (removed 0) and now considering 872/872 (removed 0) transitions.
[2024-05-23 01:08:07] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-23 01:08:07] [INFO ] Invariant cache hit.
[2024-05-23 01:08:07] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-23 01:08:07] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-23 01:08:07] [INFO ] Invariant cache hit.
[2024-05-23 01:08:08] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
[2024-05-23 01:08:08] [INFO ] Redundant transitions in 8 ms returned []
Running 373 sub problems to find dead transitions.
[2024-05-23 01:08:08] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-23 01:08:08] [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 29822 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 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 60181ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 60184ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61012 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 64 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 26 ms :[false]
RANDOM walk for 40000 steps (1823 resets) in 349 ms. (114 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (12 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 692459 steps, run timeout after 3001 ms. (steps per millisecond=230 ) properties seen :0 out of 1
Probabilistic random walk after 692459 steps, saw 164105 distinct states, run finished after 3001 ms. (steps per millisecond=230 ) properties seen :0
[2024-05-23 01:09:11] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-23 01:09:11] [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 374 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 326 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 709ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 116 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 45 ms :[false]
Stuttering acceptance computed with spot in 37 ms :[false]
Stuttering acceptance computed with spot in 32 ms :[false]
Product exploration explored 100000 steps with 4445 reset in 742 ms.
Product exploration explored 100000 steps with 4425 reset in 757 ms.
Built C files in :
/tmp/ltsmin3407215099436736918
[2024-05-23 01:09:14] [INFO ] Computing symmetric may disable matrix : 872 transitions.
[2024-05-23 01:09:14] [INFO ] Computation of Complete disable matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:09:14] [INFO ] Computing symmetric may enable matrix : 872 transitions.
[2024-05-23 01:09:14] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:09:14] [INFO ] Computing Do-Not-Accords matrix : 872 transitions.
[2024-05-23 01:09:14] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:09:14] [INFO ] Built C files in 217ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3407215099436736918
Running compilation step : cd /tmp/ltsmin3407215099436736918;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3407215099436736918;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3407215099436736918;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
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 47 ms. Remains 584 /584 variables (removed 0) and now considering 872/872 (removed 0) transitions.
[2024-05-23 01:09:17] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-23 01:09:17] [INFO ] Invariant cache hit.
[2024-05-23 01:09:17] [INFO ] Implicit Places using invariants in 404 ms returned []
[2024-05-23 01:09:17] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-23 01:09:17] [INFO ] Invariant cache hit.
[2024-05-23 01:09:18] [INFO ] Implicit Places using invariants and state equation in 509 ms returned []
Implicit Place search using SMT with State Equation took 914 ms to find 0 implicit places.
[2024-05-23 01:09:18] [INFO ] Redundant transitions in 6 ms returned []
Running 373 sub problems to find dead transitions.
[2024-05-23 01:09:18] [INFO ] Flow matrix only has 841 transitions (discarded 31 similar events)
[2024-05-23 01:09:18] [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 29911 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 1)
(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 1)
(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 1)
(s54 0)
(s55 0)
(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 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 1)
(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 1)
(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 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 1)
(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 1)
(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 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(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 1)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(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 1)
(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 1)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(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 0)
(s282 0)
(s283 0)
(s284 1)
(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 1)
(s299 0)
(s300 0)
(s301 0)
(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 1)
(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 0)
(s343 1)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(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 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 1)
(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 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 30020 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 60249ms problems are : Problem set: 0 solved, 373 unsolved
Search for dead transitions found 0 dead transitions in 60253ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61224 ms. Remains : 584/584 places, 872/872 transitions.
Built C files in :
/tmp/ltsmin6210535354793473041
[2024-05-23 01:10:18] [INFO ] Computing symmetric may disable matrix : 872 transitions.
[2024-05-23 01:10:18] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:10:18] [INFO ] Computing symmetric may enable matrix : 872 transitions.
[2024-05-23 01:10:18] [INFO ] Computation of Complete enable matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:10:18] [INFO ] Computing Do-Not-Accords matrix : 872 transitions.
[2024-05-23 01:10:18] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:10:18] [INFO ] Built C files in 196ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6210535354793473041
Running compilation step : cd /tmp/ltsmin6210535354793473041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2907 ms.
Running link step : cd /tmp/ltsmin6210535354793473041;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin6210535354793473041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7197520318584819139.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 01:10:33] [INFO ] Flatten gal took : 33 ms
[2024-05-23 01:10:33] [INFO ] Flatten gal took : 29 ms
[2024-05-23 01:10:33] [INFO ] Time to serialize gal into /tmp/LTL14294211185277171310.gal : 7 ms
[2024-05-23 01:10:33] [INFO ] Time to serialize properties into /tmp/LTL17131250863657818800.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14294211185277171310.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17375750990876511080.hoa' '-atoms' '/tmp/LTL17131250863657818800.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL17131250863657818800.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17375750990876511080.hoa
Detected timeout of ITS tools.
[2024-05-23 01:10:48] [INFO ] Flatten gal took : 27 ms
[2024-05-23 01:10:48] [INFO ] Flatten gal took : 28 ms
[2024-05-23 01:10:48] [INFO ] Time to serialize gal into /tmp/LTL14824784687339447087.gal : 7 ms
[2024-05-23 01:10:48] [INFO ] Time to serialize properties into /tmp/LTL12938271193309753855.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14824784687339447087.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12938271193309753855.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G("((p2521==0)||(p3334==1))"))||(G("((p3334==0)&&(p2521==1))")))))
Formula 0 simplified : G(F!"((p2521==0)||(p3334==1))" & F!"((p3334==0)&&(p2521==1))")
Detected timeout of ITS tools.
[2024-05-23 01:11:04] [INFO ] Flatten gal took : 25 ms
[2024-05-23 01:11:04] [INFO ] Applying decomposition
[2024-05-23 01:11:04] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15956997856262703683.txt' '-o' '/tmp/graph15956997856262703683.bin' '-w' '/tmp/graph15956997856262703683.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15956997856262703683.bin' '-l' '-1' '-v' '-w' '/tmp/graph15956997856262703683.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:11:04] [INFO ] Decomposing Gal with order
[2024-05-23 01:11:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:11:04] [INFO ] Removed a total of 352 redundant transitions.
[2024-05-23 01:11:04] [INFO ] Flatten gal took : 260 ms
[2024-05-23 01:11:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 70 labels/synchronizations in 17 ms.
[2024-05-23 01:11:04] [INFO ] Time to serialize gal into /tmp/LTL16739653660491367075.gal : 10 ms
[2024-05-23 01:11:04] [INFO ] Time to serialize properties into /tmp/LTL4021118143381794694.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16739653660491367075.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4021118143381794694.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G("((u49.p2521==0)||(u48.p3334==1))"))||(G("((u48.p3334==0)&&(u49.p2521==1))")))))
Formula 0 simplified : G(F!"((u49.p2521==0)||(u48.p3334==1))" & F!"((u48.p3334==0)&&(u49.p2521==1))")
Detected timeout of ITS tools.
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-07 finished in 262303 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 0 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 1 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 221 ms. Remains 580 /955 variables (removed 375) and now considering 867/1279 (removed 412) transitions.
[2024-05-23 01:11:19] [INFO ] Flow matrix only has 836 transitions (discarded 31 similar events)
// Phase 1: matrix 836 rows 580 cols
[2024-05-23 01:11:19] [INFO ] Computed 18 invariants in 12 ms
[2024-05-23 01:11:20] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-05-23 01:11:20] [INFO ] Flow matrix only has 836 transitions (discarded 31 similar events)
[2024-05-23 01:11:20] [INFO ] Invariant cache hit.
[2024-05-23 01:11:20] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 972 ms to find 0 implicit places.
[2024-05-23 01:11:20] [INFO ] Redundant transitions in 5 ms returned []
Running 369 sub problems to find dead transitions.
[2024-05-23 01:11:20] [INFO ] Flow matrix only has 836 transitions (discarded 31 similar events)
[2024-05-23 01:11:20] [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 28938 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
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 30016 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 59287ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 59290ms
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 60494 ms. Remains : 580/955 places, 867/1279 transitions.
Stuttering acceptance computed with spot in 41 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 60549 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 1 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 223 ms. Remains 586 /955 variables (removed 369) and now considering 874/1279 (removed 405) transitions.
[2024-05-23 01:12:20] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
// Phase 1: matrix 843 rows 586 cols
[2024-05-23 01:12:20] [INFO ] Computed 18 invariants in 21 ms
[2024-05-23 01:12:20] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-23 01:12:20] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-23 01:12:20] [INFO ] Invariant cache hit.
[2024-05-23 01:12:21] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 831 ms to find 0 implicit places.
[2024-05-23 01:12:21] [INFO ] Redundant transitions in 5 ms returned []
Running 375 sub problems to find dead transitions.
[2024-05-23 01:12:21] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-23 01:12:21] [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 29883 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 30014 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 60251ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 60255ms
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 61322 ms. Remains : 586/955 places, 874/1279 transitions.
Stuttering acceptance computed with spot in 76 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 33260 reset in 1497 ms.
Product exploration explored 100000 steps with 33285 reset in 1510 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 85 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 73 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
RANDOM walk for 40000 steps (1819 resets) in 401 ms. (99 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 22 ms. (1739 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 24 ms. (1600 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 359078 steps, run timeout after 3007 ms. (steps per millisecond=119 ) properties seen :0 out of 4
Probabilistic random walk after 359078 steps, saw 87157 distinct states, run finished after 3008 ms. (steps per millisecond=119 ) properties seen :0
[2024-05-23 01:13:28] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-23 01:13:28] [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 510 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 633 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 1159ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 738 steps, including 21 resets, run visited all 4 properties in 19 ms. (steps per millisecond=38 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 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 149 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 69 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 67 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 41 ms. Remains 586 /586 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2024-05-23 01:13:29] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-23 01:13:29] [INFO ] Invariant cache hit.
[2024-05-23 01:13:29] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-23 01:13:29] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-23 01:13:29] [INFO ] Invariant cache hit.
[2024-05-23 01:13:30] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 786 ms to find 0 implicit places.
[2024-05-23 01:13:30] [INFO ] Redundant transitions in 7 ms returned []
Running 375 sub problems to find dead transitions.
[2024-05-23 01:13:30] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-23 01:13:30] [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 30008 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 30020 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 60360ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 60364ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61204 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 72 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 64 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
RANDOM walk for 40000 steps (1828 resets) in 673 ms. (59 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 34 ms. (1142 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 26 ms. (1481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 24 ms. (1600 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 20 ms. (1904 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 384566 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :0 out of 4
Probabilistic random walk after 384566 steps, saw 94621 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
[2024-05-23 01:14:34] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-23 01:14:34] [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 538 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 604 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 1149ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 732 steps, including 21 resets, run visited all 4 properties in 12 ms. (steps per millisecond=61 )
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 12 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 229 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 71 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Product exploration explored 100000 steps with 33382 reset in 1436 ms.
Product exploration explored 100000 steps with 33355 reset in 1456 ms.
Built C files in :
/tmp/ltsmin12223904479733120884
[2024-05-23 01:14:38] [INFO ] Computing symmetric may disable matrix : 874 transitions.
[2024-05-23 01:14:38] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:14:38] [INFO ] Computing symmetric may enable matrix : 874 transitions.
[2024-05-23 01:14:38] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:14:39] [INFO ] Computing Do-Not-Accords matrix : 874 transitions.
[2024-05-23 01:14:39] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:14:39] [INFO ] Built C files in 168ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12223904479733120884
Running compilation step : cd /tmp/ltsmin12223904479733120884;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2760 ms.
Running link step : cd /tmp/ltsmin12223904479733120884;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin12223904479733120884;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased341423096592534812.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 42 ms. Remains 586 /586 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2024-05-23 01:14:53] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-23 01:14:53] [INFO ] Invariant cache hit.
[2024-05-23 01:14:54] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-23 01:14:54] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-23 01:14:54] [INFO ] Invariant cache hit.
[2024-05-23 01:14:54] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
[2024-05-23 01:14:54] [INFO ] Redundant transitions in 5 ms returned []
Running 375 sub problems to find dead transitions.
[2024-05-23 01:14:54] [INFO ] Flow matrix only has 843 transitions (discarded 31 similar events)
[2024-05-23 01:14:54] [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 29328 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 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 0)
(s56 1)
(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 1)
(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 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 1)
(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 1)
(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 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(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 1)
(s170 0)
(s171 0)
(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 1)
(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 1)
(s214 0)
(s215 0)
(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 1)
(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 1)
(s258 0)
(s259 0)
(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 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 1)
(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 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 1)
(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 1)
(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 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 1)
(s348 0)
(s349 timeout
0)
(s350 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 30019 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 59684ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 59687ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60508 ms. Remains : 586/586 places, 874/874 transitions.
Built C files in :
/tmp/ltsmin17737502475184722257
[2024-05-23 01:15:54] [INFO ] Computing symmetric may disable matrix : 874 transitions.
[2024-05-23 01:15:54] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:15:54] [INFO ] Computing symmetric may enable matrix : 874 transitions.
[2024-05-23 01:15:54] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:15:54] [INFO ] Computing Do-Not-Accords matrix : 874 transitions.
[2024-05-23 01:15:54] [INFO ] Computation of Completed DNA matrix. took 13 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:15:54] [INFO ] Built C files in 165ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17737502475184722257
Running compilation step : cd /tmp/ltsmin17737502475184722257;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2856 ms.
Running link step : cd /tmp/ltsmin17737502475184722257;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin17737502475184722257;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14065315247455212905.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 01:16:09] [INFO ] Flatten gal took : 31 ms
[2024-05-23 01:16:09] [INFO ] Flatten gal took : 20 ms
[2024-05-23 01:16:09] [INFO ] Time to serialize gal into /tmp/LTL8004606443376684041.gal : 4 ms
[2024-05-23 01:16:09] [INFO ] Time to serialize properties into /tmp/LTL540018606793854634.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8004606443376684041.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15760074717818057201.hoa' '-atoms' '/tmp/LTL540018606793854634.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL540018606793854634.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15760074717818057201.hoa
Detected timeout of ITS tools.
[2024-05-23 01:16:24] [INFO ] Flatten gal took : 17 ms
[2024-05-23 01:16:24] [INFO ] Flatten gal took : 17 ms
[2024-05-23 01:16:24] [INFO ] Time to serialize gal into /tmp/LTL8088766485009595806.gal : 4 ms
[2024-05-23 01:16:24] [INFO ] Time to serialize properties into /tmp/LTL17324568239070076737.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8088766485009595806.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17324568239070076737.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((X(F("((p619==0)||(p2648==1))")))||(("(p3286==1)")&&(G("((p897==0)||(p1921==1))"))))))
Formula 0 simplified : F(XG!"((p619==0)||(p2648==1))" & (!"(p3286==1)" | F!"((p897==0)||(p1921==1))"))
Detected timeout of ITS tools.
[2024-05-23 01:16:39] [INFO ] Flatten gal took : 18 ms
[2024-05-23 01:16:39] [INFO ] Applying decomposition
[2024-05-23 01:16:39] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10908784302409064313.txt' '-o' '/tmp/graph10908784302409064313.bin' '-w' '/tmp/graph10908784302409064313.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10908784302409064313.bin' '-l' '-1' '-v' '-w' '/tmp/graph10908784302409064313.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:16:39] [INFO ] Decomposing Gal with order
[2024-05-23 01:16:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:16:39] [INFO ] Removed a total of 353 redundant transitions.
[2024-05-23 01:16:39] [INFO ] Flatten gal took : 79 ms
[2024-05-23 01:16:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 11 ms.
[2024-05-23 01:16:39] [INFO ] Time to serialize gal into /tmp/LTL7100378274094554887.gal : 7 ms
[2024-05-23 01:16:39] [INFO ] Time to serialize properties into /tmp/LTL11215458677642204356.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7100378274094554887.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11215458677642204356.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((X(F("((u14.p619==0)||(u49.p2648==1))")))||(("(i17.u50.p3286==1)")&&(G("((i6.u17.p897==0)||(i5.i1.u37.p1921==1))"))))))
Formula 0 simplified : F(XG!"((u14.p619==0)||(u49.p2648==1))" & (!"(i17.u50.p3286==1)" | F!"((i6.u17.p897==0)||(i5.i1.u37.p1921==1))"))
Detected timeout of ITS tools.
Treatment of property FlexibleBarrier-PT-16b-LTLCardinality-10 finished in 274756 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 100 ms. Remains 917 /955 variables (removed 38) and now considering 1227/1279 (removed 52) transitions.
// Phase 1: matrix 1227 rows 917 cols
[2024-05-23 01:16:55] [INFO ] Computed 18 invariants in 19 ms
[2024-05-23 01:16:55] [INFO ] Implicit Places using invariants in 383 ms returned []
[2024-05-23 01:16:55] [INFO ] Invariant cache hit.
[2024-05-23 01:16:56] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 1133 ms to find 0 implicit places.
Running 1226 sub problems to find dead transitions.
[2024-05-23 01:16:56] [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
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 917/2144 variables, and 18 constraints, problems are : Problem set: 0 solved, 1226 unsolved in 30021 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
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 30021 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 61280ms problems are : Problem set: 0 solved, 1226 unsolved
Search for dead transitions found 0 dead transitions in 61291ms
Starting structural reductions in LTL mode, iteration 1 : 917/955 places, 1227/1279 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62526 ms. Remains : 917/955 places, 1227/1279 transitions.
Stuttering acceptance computed with spot in 123 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 102 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 62671 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-23 01:17:57] [INFO ] Flatten gal took : 24 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16378659228749863718
[2024-05-23 01:17:57] [INFO ] Computing symmetric may disable matrix : 1279 transitions.
[2024-05-23 01:17:57] [INFO ] Applying decomposition
[2024-05-23 01:17:57] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:17:57] [INFO ] Computing symmetric may enable matrix : 1279 transitions.
[2024-05-23 01:17:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:17:57] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3272071046017200572.txt' '-o' '/tmp/graph3272071046017200572.bin' '-w' '/tmp/graph3272071046017200572.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3272071046017200572.bin' '-l' '-1' '-v' '-w' '/tmp/graph3272071046017200572.weights' '-q' '0' '-e' '0.001'
[2024-05-23 01:17:58] [INFO ] Decomposing Gal with order
[2024-05-23 01:17:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:17:58] [INFO ] Computing Do-Not-Accords matrix : 1279 transitions.
[2024-05-23 01:17:58] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 01:17:58] [INFO ] Built C files in 299ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16378659228749863718
Running compilation step : cd /tmp/ltsmin16378659228749863718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-23 01:17:58] [INFO ] Removed a total of 369 redundant transitions.
[2024-05-23 01:17:58] [INFO ] Flatten gal took : 174 ms
[2024-05-23 01:17:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 30 ms.
[2024-05-23 01:17:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality5741626162649921800.gal : 77 ms
[2024-05-23 01:17:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality9864793784341017459.ltl : 38 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5741626162649921800.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9864793784341017459.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((F((G("((i18.u177.p2521==0)||(i18.u180.p3334==1))"))||(G("((i18.u180.p3334==0)&&(i18.u177.p2521==1))")))))
Formula 0 simplified : G(F!"((i18.u177.p2521==0)||(i18.u180.p3334==1))" & F!"((i18.u180.p3334==0)&&(i18.u177.p2521==1))")
Compilation finished in 4693 ms.
Running link step : cd /tmp/ltsmin16378659228749863718;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin16378659228749863718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin16378659228749863718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin16378659228749863718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(<>((LTLAPp2==true)))||((LTLAPp3==true)&&[]((LTLAPp4==true)))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-23 01:41:23] [INFO ] Applying decomposition
[2024-05-23 01:41:24] [INFO ] Flatten gal took : 28 ms
[2024-05-23 01:41:24] [INFO ] Decomposing Gal with order
[2024-05-23 01:41:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 01:41:24] [INFO ] Removed a total of 342 redundant transitions.
[2024-05-23 01:41:24] [INFO ] Flatten gal took : 206 ms
[2024-05-23 01:41:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 1071 labels/synchronizations in 313 ms.
[2024-05-23 01:41:24] [INFO ] Time to serialize gal into /tmp/LTLCardinality3105826240129574802.gal : 25 ms
[2024-05-23 01:41:24] [INFO ] Time to serialize properties into /tmp/LTLCardinality17501200146772263307.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3105826240129574802.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17501200146772263307.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((F((G("((i1.u33.p2521==0)||(i1.u33.p3334==1))"))||(G("((i1.u33.p3334==0)&&(i1.u33.p2521==1))")))))
Formula 0 simplified : G(F!"((i1.u33.p2521==0)||(i1.u33.p3334==1))" & F!"((i1.u33.p3334==0)&&(i1.u33.p2521==1))")
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin16378659228749863718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X(<>((LTLAPp2==true)))||((LTLAPp3==true)&&[]((LTLAPp4==true)))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin16378659228749863718;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-23 01:59:57] [INFO ] Flatten gal took : 65 ms
[2024-05-23 01:59:57] [INFO ] Input system was already deterministic with 1279 transitions.
[2024-05-23 01:59:57] [INFO ] Transformed 955 places.
[2024-05-23 01:59:57] [INFO ] Transformed 1279 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-23 01:59:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality5175407236563393581.gal : 5 ms
[2024-05-23 01:59:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality3944202028167040980.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5175407236563393581.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3944202028167040980.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G("((p2521==0)||(p3334==1))"))||(G("((p3334==0)&&(p2521==1))")))))
Formula 0 simplified : G(F!"((p2521==0)||(p3334==1))" & F!"((p3334==0)&&(p2521==1))")
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
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 r180-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 '
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 ;