MCC'2024- Execution of r179-tall-171640600800124

About the Execution of GreatSPN+red for FlexibleBarrier-PT-18b

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
11720.731	3600000.00	7848509.00	8971.30	FTFFTFFFFFFFF?FF	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.r179-tall-171640600800124.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is FlexibleBarrier-PT-18b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640600800124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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 Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 13 08:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 13 08:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 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 1.2M 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-18b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-18b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716425650191

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-18b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 00:54:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 00:54:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 00:54:11] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2024-05-23 00:54:11] [INFO ] Transformed 4370 places.
[2024-05-23 00:54:11] [INFO ] Transformed 5037 transitions.
[2024-05-23 00:54:11] [INFO ] Found NUPN structural information;
[2024-05-23 00:54:11] [INFO ] Parsed PT model containing 4370 places and 5037 transitions and 12657 arcs in 362 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA FlexibleBarrier-PT-18b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-18b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-18b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-18b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 4370 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4370/4370 places, 5037/5037 transitions.
Discarding 1823 places :
Symmetric choice reduction at 0 with 1823 rule applications. Total rules 1823 place count 2547 transition count 3214
Iterating global reduction 0 with 1823 rules applied. Total rules applied 3646 place count 2547 transition count 3214
Discarding 862 places :
Symmetric choice reduction at 0 with 862 rule applications. Total rules 4508 place count 1685 transition count 2352
Iterating global reduction 0 with 862 rules applied. Total rules applied 5370 place count 1685 transition count 2352
Discarding 561 places :
Symmetric choice reduction at 0 with 561 rule applications. Total rules 5931 place count 1124 transition count 1791
Iterating global reduction 0 with 561 rules applied. Total rules applied 6492 place count 1124 transition count 1791
Ensure Unique test removed 274 transitions
Reduce isomorphic transitions removed 274 transitions.
Iterating post reduction 0 with 274 rules applied. Total rules applied 6766 place count 1124 transition count 1517
Applied a total of 6766 rules in 761 ms. Remains 1124 /4370 variables (removed 3246) and now considering 1517/5037 (removed 3520) transitions.
// Phase 1: matrix 1517 rows 1124 cols
[2024-05-23 00:54:12] [INFO ] Computed 20 invariants in 63 ms
[2024-05-23 00:54:13] [INFO ] Implicit Places using invariants in 793 ms returned []
[2024-05-23 00:54:13] [INFO ] Invariant cache hit.
[2024-05-23 00:54:14] [INFO ] Implicit Places using invariants and state equation in 1034 ms returned []
Implicit Place search using SMT with State Equation took 1856 ms to find 0 implicit places.
Running 1516 sub problems to find dead transitions.
[2024-05-23 00:54:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1516 unsolved
SMT process timed out in 31985ms, After SMT, problems are : Problem set: 0 solved, 1516 unsolved
Search for dead transitions found 0 dead transitions in 32011ms
Starting structural reductions in LTL mode, iteration 1 : 1124/4370 places, 1517/5037 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34667 ms. Remains : 1124/4370 places, 1517/5037 transitions.
Support contains 38 out of 1124 places after structural reductions.
[2024-05-23 00:54:46] [INFO ] Flatten gal took : 112 ms
[2024-05-23 00:54:46] [INFO ] Flatten gal took : 65 ms
[2024-05-23 00:54:47] [INFO ] Input system was already deterministic with 1517 transitions.
RANDOM walk for 40000 steps (320 resets) in 2081 ms. (19 steps per ms) remains 21/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
[2024-05-23 00:54:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 750/779 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/779 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 345/1124 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1124 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 1517/2641 variables, 1124/1144 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2641 variables, 0/1144 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/2641 variables, 0/1144 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2641/2641 variables, and 1144 constraints, problems are : Problem set: 0 solved, 21 unsolved in 2436 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 1124/1124 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 750/779 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-23 00:54:50] [INFO ] Deduced a trap composed of 339 places in 311 ms of which 59 ms to minimize.
[2024-05-23 00:54:51] [INFO ] Deduced a trap composed of 335 places in 245 ms of which 5 ms to minimize.
[2024-05-23 00:54:51] [INFO ] Deduced a trap composed of 138 places in 151 ms of which 3 ms to minimize.
[2024-05-23 00:54:51] [INFO ] Deduced a trap composed of 343 places in 242 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/779 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/779 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 345/1124 variables, 8/24 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-23 00:54:52] [INFO ] Deduced a trap composed of 335 places in 330 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1124 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1124 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 1517/2641 variables, 1124/1149 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2641 variables, 21/1170 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-23 00:54:54] [INFO ] Deduced a trap composed of 80 places in 217 ms of which 4 ms to minimize.
[2024-05-23 00:54:54] [INFO ] Deduced a trap composed of 46 places in 174 ms of which 4 ms to minimize.
[2024-05-23 00:54:55] [INFO ] Deduced a trap composed of 76 places in 220 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2641/2641 variables, and 1173 constraints, problems are : Problem set: 0 solved, 21 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 1124/1124 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 8/8 constraints]
After SMT, in 7477ms problems are : Problem set: 0 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 1124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1124/1124 places, 1517/1517 transitions.
Graph (trivial) has 1033 edges and 1124 vertex of which 109 / 1124 are part of one of the 18 SCC in 6 ms
Free SCC test removed 91 places
Drop transitions (Empty/Sink Transition effects.) removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 83 place count 1033 transition count 1325
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 165 place count 951 transition count 1325
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 165 place count 951 transition count 1289
Deduced a syphon composed of 36 places in 4 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 237 place count 915 transition count 1289
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 272 place count 880 transition count 1254
Iterating global reduction 2 with 35 rules applied. Total rules applied 307 place count 880 transition count 1254
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 313 place count 874 transition count 1248
Iterating global reduction 2 with 6 rules applied. Total rules applied 319 place count 874 transition count 1248
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 545 place count 761 transition count 1135
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 563 place count 761 transition count 1117
Free-agglomeration rule applied 615 times.
Iterating global reduction 3 with 615 rules applied. Total rules applied 1178 place count 761 transition count 502
Reduce places removed 615 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 236 transitions
Reduce isomorphic transitions removed 236 transitions.
Iterating post reduction 3 with 851 rules applied. Total rules applied 2029 place count 146 transition count 266
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2030 place count 146 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2031 place count 145 transition count 264
Applied a total of 2031 rules in 655 ms. Remains 145 /1124 variables (removed 979) and now considering 264/1517 (removed 1253) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 656 ms. Remains : 145/1124 places, 264/1517 transitions.
RANDOM walk for 40000 steps (254 resets) in 1371 ms. (29 steps per ms) remains 1/21 properties
BEST_FIRST walk for 40003 steps (43 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
[2024-05-23 00:54:56] [INFO ] Flow matrix only has 206 transitions (discarded 58 similar events)
// Phase 1: matrix 206 rows 145 cols
[2024-05-23 00:54:56] [INFO ] Computed 20 invariants in 1 ms
[2024-05-23 00:54:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/25 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 141/166 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 21/187 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 11/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 151/338 variables, 105/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/338 variables, 8/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/338 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/348 variables, 7/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/348 variables, 4/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/348 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/351 variables, 6/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/351 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/351 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 166 constraints, problems are : Problem set: 0 solved, 1 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 145/145 constraints, ReadFeed: 1/1 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/25 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 141/166 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/166 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 21/187 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/187 variables, 11/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 151/338 variables, 105/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/338 variables, 8/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/338 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/348 variables, 7/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/348 variables, 4/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/348 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/351 variables, 6/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/351 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/351 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/351 variables, and 167 constraints, problems are : Problem set: 0 solved, 1 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 145/145 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 258ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 652 steps, including 54 resets, run visited all 1 properties in 4 ms. (steps per millisecond=163 )
Parikh walk visited 1 properties in 10 ms.
Computed a total of 20 stabilizing places and 20 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(F((p0||G(p1)||G(p2)))))'
Support contains 6 out of 1124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1124/1124 places, 1517/1517 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1107 transition count 1500
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1107 transition count 1500
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 1107 transition count 1497
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 50 place count 1094 transition count 1484
Iterating global reduction 1 with 13 rules applied. Total rules applied 63 place count 1094 transition count 1484
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 71 place count 1094 transition count 1476
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 75 place count 1090 transition count 1472
Iterating global reduction 2 with 4 rules applied. Total rules applied 79 place count 1090 transition count 1472
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 82 place count 1090 transition count 1469
Applied a total of 82 rules in 338 ms. Remains 1090 /1124 variables (removed 34) and now considering 1469/1517 (removed 48) transitions.
// Phase 1: matrix 1469 rows 1090 cols
[2024-05-23 00:54:57] [INFO ] Computed 20 invariants in 34 ms
[2024-05-23 00:54:57] [INFO ] Implicit Places using invariants in 424 ms returned []
[2024-05-23 00:54:57] [INFO ] Invariant cache hit.
[2024-05-23 00:54:58] [INFO ] Implicit Places using invariants and state equation in 998 ms returned []
Implicit Place search using SMT with State Equation took 1428 ms to find 0 implicit places.
Running 1468 sub problems to find dead transitions.
[2024-05-23 00:54:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1089 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1468 unsolved
SMT process timed out in 32034ms, After SMT, problems are : Problem set: 0 solved, 1468 unsolved
Search for dead transitions found 0 dead transitions in 32049ms
Starting structural reductions in LTL mode, iteration 1 : 1090/1124 places, 1469/1517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33824 ms. Remains : 1090/1124 places, 1469/1517 transitions.
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 379 ms.
Product exploration explored 100000 steps with 50000 reset in 343 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 22 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-18b-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-18b-LTLFireability-01 finished in 34942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||(p1&&(p2 U p0)))))'
Support contains 5 out of 1124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1124/1124 places, 1517/1517 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1109 transition count 1502
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1109 transition count 1502
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 1109 transition count 1499
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 44 place count 1098 transition count 1488
Iterating global reduction 1 with 11 rules applied. Total rules applied 55 place count 1098 transition count 1488
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 61 place count 1098 transition count 1482
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 65 place count 1094 transition count 1478
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 1094 transition count 1478
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 1094 transition count 1475
Applied a total of 72 rules in 130 ms. Remains 1094 /1124 variables (removed 30) and now considering 1475/1517 (removed 42) transitions.
// Phase 1: matrix 1475 rows 1094 cols
[2024-05-23 00:55:32] [INFO ] Computed 20 invariants in 34 ms
[2024-05-23 00:55:32] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-05-23 00:55:32] [INFO ] Invariant cache hit.
[2024-05-23 00:55:33] [INFO ] Implicit Places using invariants and state equation in 1104 ms returned []
Implicit Place search using SMT with State Equation took 1560 ms to find 0 implicit places.
Running 1474 sub problems to find dead transitions.
[2024-05-23 00:55:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1093 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1474 unsolved
SMT process timed out in 32024ms, After SMT, problems are : Problem set: 0 solved, 1474 unsolved
Search for dead transitions found 0 dead transitions in 32042ms
Starting structural reductions in LTL mode, iteration 1 : 1094/1124 places, 1475/1517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33738 ms. Remains : 1094/1124 places, 1475/1517 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-18b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18b-LTLFireability-02 finished in 33986 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0||G(F(p1))) U (p2&&(!p0||G(F(p1)))))))'
Support contains 5 out of 1124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1124/1124 places, 1517/1517 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1109 transition count 1502
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1109 transition count 1502
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 1109 transition count 1499
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 44 place count 1098 transition count 1488
Iterating global reduction 1 with 11 rules applied. Total rules applied 55 place count 1098 transition count 1488
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 62 place count 1098 transition count 1481
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 65 place count 1095 transition count 1478
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 1095 transition count 1478
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 70 place count 1095 transition count 1476
Applied a total of 70 rules in 143 ms. Remains 1095 /1124 variables (removed 29) and now considering 1476/1517 (removed 41) transitions.
// Phase 1: matrix 1476 rows 1095 cols
[2024-05-23 00:56:06] [INFO ] Computed 20 invariants in 17 ms
[2024-05-23 00:56:06] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-05-23 00:56:06] [INFO ] Invariant cache hit.
[2024-05-23 00:56:07] [INFO ] Implicit Places using invariants and state equation in 1066 ms returned []
Implicit Place search using SMT with State Equation took 1507 ms to find 0 implicit places.
Running 1475 sub problems to find dead transitions.
[2024-05-23 00:56:07] [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 timeout
1.0)
(s589 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1094 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1475 unsolved
SMT process timed out in 31644ms, After SMT, problems are : Problem set: 0 solved, 1475 unsolved
Search for dead transitions found 0 dead transitions in 31659ms
Starting structural reductions in LTL mode, iteration 1 : 1095/1124 places, 1476/1517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33314 ms. Remains : 1095/1124 places, 1476/1517 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p2) (AND p0 (NOT p1))), (OR (NOT p2) (AND p0 (NOT p1))), (NOT p1), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLFireability-03
Stuttering criterion allowed to conclude after 119 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-18b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18b-LTLFireability-03 finished in 33554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||G(p1)||(p1&&F(p2)))))'
Support contains 3 out of 1124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1124/1124 places, 1517/1517 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1107 transition count 1500
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1107 transition count 1500
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 1107 transition count 1496
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 51 place count 1094 transition count 1483
Iterating global reduction 1 with 13 rules applied. Total rules applied 64 place count 1094 transition count 1483
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 72 place count 1094 transition count 1475
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 76 place count 1090 transition count 1471
Iterating global reduction 2 with 4 rules applied. Total rules applied 80 place count 1090 transition count 1471
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 83 place count 1090 transition count 1468
Applied a total of 83 rules in 118 ms. Remains 1090 /1124 variables (removed 34) and now considering 1468/1517 (removed 49) transitions.
// Phase 1: matrix 1468 rows 1090 cols
[2024-05-23 00:56:39] [INFO ] Computed 20 invariants in 25 ms
[2024-05-23 00:56:40] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-23 00:56:40] [INFO ] Invariant cache hit.
[2024-05-23 00:56:41] [INFO ] Implicit Places using invariants and state equation in 1040 ms returned []
Implicit Place search using SMT with State Equation took 1472 ms to find 0 implicit places.
Running 1467 sub problems to find dead transitions.
[2024-05-23 00:56:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1089 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1467 unsolved
SMT process timed out in 31863ms, After SMT, problems are : Problem set: 0 solved, 1467 unsolved
Search for dead transitions found 0 dead transitions in 31876ms
Starting structural reductions in LTL mode, iteration 1 : 1090/1124 places, 1468/1517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33472 ms. Remains : 1090/1124 places, 1468/1517 transitions.
Stuttering acceptance computed with spot in 282 ms :[true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 315 ms.
Product exploration explored 100000 steps with 50000 reset in 315 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X p1), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X p2)), (X (X p0)), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 21 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-18b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-18b-LTLFireability-04 finished in 34451 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 1 out of 1124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1124/1124 places, 1517/1517 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1107 transition count 1500
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1107 transition count 1500
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 1107 transition count 1496
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 50 place count 1095 transition count 1484
Iterating global reduction 1 with 12 rules applied. Total rules applied 62 place count 1095 transition count 1484
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 70 place count 1095 transition count 1476
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 1092 transition count 1473
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 1092 transition count 1473
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 79 place count 1092 transition count 1470
Applied a total of 79 rules in 106 ms. Remains 1092 /1124 variables (removed 32) and now considering 1470/1517 (removed 47) transitions.
// Phase 1: matrix 1470 rows 1092 cols
[2024-05-23 00:57:14] [INFO ] Computed 20 invariants in 28 ms
[2024-05-23 00:57:14] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-05-23 00:57:14] [INFO ] Invariant cache hit.
[2024-05-23 00:57:15] [INFO ] Implicit Places using invariants and state equation in 1029 ms returned []
Implicit Place search using SMT with State Equation took 1461 ms to find 0 implicit places.
Running 1469 sub problems to find dead transitions.
[2024-05-23 00:57:15] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1091 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1469 unsolved
SMT process timed out in 31783ms, After SMT, problems are : Problem set: 0 solved, 1469 unsolved
Search for dead transitions found 0 dead transitions in 31794ms
Starting structural reductions in LTL mode, iteration 1 : 1092/1124 places, 1470/1517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33364 ms. Remains : 1092/1124 places, 1470/1517 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLFireability-08
Product exploration explored 100000 steps with 801 reset in 290 ms.
Product exploration explored 100000 steps with 803 reset in 336 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 185 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (318 resets) in 268 ms. (148 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (27 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 666812 steps, run timeout after 3001 ms. (steps per millisecond=222 ) properties seen :0 out of 1
Probabilistic random walk after 666812 steps, saw 266848 distinct states, run finished after 3004 ms. (steps per millisecond=221 ) properties seen :0
[2024-05-23 00:57:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 297/298 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 794/1092 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1092 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1470/2562 variables, 1092/1112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2562 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2562 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2562/2562 variables, and 1112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 1092/1092 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 297/298 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 794/1092 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1092 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1470/2562 variables, 1092/1112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2562 variables, 1/1113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2562 variables, 0/1113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2562 variables, 0/1113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2562/2562 variables, and 1113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 550 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 1092/1092 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 995ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 858 steps, including 6 resets, run visited all 1 properties in 4 ms. (steps per millisecond=214 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-18b-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-18b-LTLFireability-08 finished in 38611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F((p1&&X(p2))))))'
Support contains 4 out of 1124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1124/1124 places, 1517/1517 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1108 transition count 1501
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1108 transition count 1501
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 1108 transition count 1497
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 47 place count 1097 transition count 1486
Iterating global reduction 1 with 11 rules applied. Total rules applied 58 place count 1097 transition count 1486
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 66 place count 1097 transition count 1478
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 69 place count 1094 transition count 1475
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 1094 transition count 1475
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 74 place count 1094 transition count 1473
Applied a total of 74 rules in 105 ms. Remains 1094 /1124 variables (removed 30) and now considering 1473/1517 (removed 44) transitions.
// Phase 1: matrix 1473 rows 1094 cols
[2024-05-23 00:57:52] [INFO ] Computed 20 invariants in 37 ms
[2024-05-23 00:57:53] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-05-23 00:57:53] [INFO ] Invariant cache hit.
[2024-05-23 00:57:54] [INFO ] Implicit Places using invariants and state equation in 1040 ms returned []
Implicit Place search using SMT with State Equation took 1472 ms to find 0 implicit places.
Running 1472 sub problems to find dead transitions.
[2024-05-23 00:57:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1093 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
SMT process timed out in 31851ms, After SMT, problems are : Problem set: 0 solved, 1472 unsolved
Search for dead transitions found 0 dead transitions in 31865ms
Starting structural reductions in LTL mode, iteration 1 : 1094/1124 places, 1473/1517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33446 ms. Remains : 1094/1124 places, 1473/1517 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p0)), true]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-18b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18b-LTLFireability-09 finished in 33683 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||F(p1)))'
Support contains 2 out of 1124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1124/1124 places, 1517/1517 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1108 transition count 1501
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1108 transition count 1501
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 1108 transition count 1497
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 47 place count 1097 transition count 1486
Iterating global reduction 1 with 11 rules applied. Total rules applied 58 place count 1097 transition count 1486
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 64 place count 1097 transition count 1480
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 1093 transition count 1476
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 1093 transition count 1476
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 75 place count 1093 transition count 1473
Applied a total of 75 rules in 102 ms. Remains 1093 /1124 variables (removed 31) and now considering 1473/1517 (removed 44) transitions.
// Phase 1: matrix 1473 rows 1093 cols
[2024-05-23 00:58:26] [INFO ] Computed 20 invariants in 25 ms
[2024-05-23 00:58:26] [INFO ] Implicit Places using invariants in 436 ms returned []
[2024-05-23 00:58:26] [INFO ] Invariant cache hit.
[2024-05-23 00:58:27] [INFO ] Implicit Places using invariants and state equation in 1034 ms returned []
Implicit Place search using SMT with State Equation took 1471 ms to find 0 implicit places.
Running 1472 sub problems to find dead transitions.
[2024-05-23 00:58:27] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1092 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1472 unsolved
SMT process timed out in 31883ms, After SMT, problems are : Problem set: 0 solved, 1472 unsolved
Search for dead transitions found 0 dead transitions in 31901ms
Starting structural reductions in LTL mode, iteration 1 : 1093/1124 places, 1473/1517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33479 ms. Remains : 1093/1124 places, 1473/1517 transitions.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLFireability-10
Stuttering criterion allowed to conclude after 118 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-18b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18b-LTLFireability-10 finished in 33681 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((X((p0 U p1))&&F(p2))))'
Support contains 2 out of 1124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1124/1124 places, 1517/1517 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1108 transition count 1501
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1108 transition count 1501
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 1108 transition count 1497
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 47 place count 1097 transition count 1486
Iterating global reduction 1 with 11 rules applied. Total rules applied 58 place count 1097 transition count 1486
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 65 place count 1097 transition count 1479
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 1094 transition count 1476
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 1094 transition count 1476
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 1094 transition count 1474
Applied a total of 73 rules in 105 ms. Remains 1094 /1124 variables (removed 30) and now considering 1474/1517 (removed 43) transitions.
// Phase 1: matrix 1474 rows 1094 cols
[2024-05-23 00:59:00] [INFO ] Computed 20 invariants in 26 ms
[2024-05-23 00:59:00] [INFO ] Implicit Places using invariants in 437 ms returned []
[2024-05-23 00:59:00] [INFO ] Invariant cache hit.
[2024-05-23 00:59:01] [INFO ] Implicit Places using invariants and state equation in 1039 ms returned []
Implicit Place search using SMT with State Equation took 1481 ms to find 0 implicit places.
Running 1473 sub problems to find dead transitions.
[2024-05-23 00:59:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1093 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1473 unsolved
SMT process timed out in 31868ms, After SMT, problems are : Problem set: 0 solved, 1473 unsolved
Search for dead transitions found 0 dead transitions in 31882ms
Starting structural reductions in LTL mode, iteration 1 : 1094/1124 places, 1474/1517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33472 ms. Remains : 1094/1124 places, 1474/1517 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLFireability-11
Stuttering criterion allowed to conclude after 115 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-18b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18b-LTLFireability-11 finished in 33665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0)))||(F(p0)&&F(p1)))))'
Support contains 3 out of 1124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1124/1124 places, 1517/1517 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 1106 transition count 1499
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 1106 transition count 1499
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 1106 transition count 1495
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 53 place count 1093 transition count 1482
Iterating global reduction 1 with 13 rules applied. Total rules applied 66 place count 1093 transition count 1482
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 74 place count 1093 transition count 1474
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 78 place count 1089 transition count 1470
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 1089 transition count 1470
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 85 place count 1089 transition count 1467
Applied a total of 85 rules in 97 ms. Remains 1089 /1124 variables (removed 35) and now considering 1467/1517 (removed 50) transitions.
// Phase 1: matrix 1467 rows 1089 cols
[2024-05-23 00:59:33] [INFO ] Computed 20 invariants in 23 ms
[2024-05-23 00:59:34] [INFO ] Implicit Places using invariants in 437 ms returned []
[2024-05-23 00:59:34] [INFO ] Invariant cache hit.
[2024-05-23 00:59:35] [INFO ] Implicit Places using invariants and state equation in 1058 ms returned []
Implicit Place search using SMT with State Equation took 1497 ms to find 0 implicit places.
Running 1466 sub problems to find dead transitions.
[2024-05-23 00:59:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1088 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1466 unsolved
SMT process timed out in 31826ms, After SMT, problems are : Problem set: 0 solved, 1466 unsolved
Search for dead transitions found 0 dead transitions in 31843ms
Starting structural reductions in LTL mode, iteration 1 : 1089/1124 places, 1467/1517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33442 ms. Remains : 1089/1124 places, 1467/1517 transitions.
Stuttering acceptance computed with spot in 262 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLFireability-12
Stuttering criterion allowed to conclude after 118 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-18b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18b-LTLFireability-12 finished in 33731 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(F(p1)))))'
Support contains 6 out of 1124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1124/1124 places, 1517/1517 transitions.
Graph (trivial) has 1062 edges and 1124 vertex of which 109 / 1124 are part of one of the 18 SCC in 3 ms
Free SCC test removed 91 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 1032 transition count 1336
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 177 place count 944 transition count 1336
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 177 place count 944 transition count 1292
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 265 place count 900 transition count 1292
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 316 place count 849 transition count 1241
Iterating global reduction 2 with 51 rules applied. Total rules applied 367 place count 849 transition count 1241
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 370 place count 849 transition count 1238
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 370 place count 849 transition count 1237
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 372 place count 848 transition count 1237
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 380 place count 840 transition count 1229
Iterating global reduction 3 with 8 rules applied. Total rules applied 388 place count 840 transition count 1229
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 396 place count 840 transition count 1221
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 4 with 220 rules applied. Total rules applied 616 place count 730 transition count 1111
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 618 place count 728 transition count 1109
Iterating global reduction 4 with 2 rules applied. Total rules applied 620 place count 728 transition count 1109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 622 place count 728 transition count 1107
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 640 place count 728 transition count 1089
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 642 place count 726 transition count 1087
Applied a total of 642 rules in 392 ms. Remains 726 /1124 variables (removed 398) and now considering 1087/1517 (removed 430) transitions.
[2024-05-23 01:00:07] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
// Phase 1: matrix 1052 rows 726 cols
[2024-05-23 01:00:07] [INFO ] Computed 20 invariants in 26 ms
[2024-05-23 01:00:08] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-23 01:00:08] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
[2024-05-23 01:00:08] [INFO ] Invariant cache hit.
[2024-05-23 01:00:08] [INFO ] Implicit Places using invariants and state equation in 721 ms returned []
Implicit Place search using SMT with State Equation took 1097 ms to find 0 implicit places.
[2024-05-23 01:00:08] [INFO ] Redundant transitions in 61 ms returned []
Running 453 sub problems to find dead transitions.
[2024-05-23 01:00:08] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
[2024-05-23 01:00:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/708 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/708 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 18/726 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/726 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (OVERLAPS) 1051/1777 variables, 726/746 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1777 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1777/1778 variables, and 746 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 726/726 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/708 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/708 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 18/726 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/726 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (OVERLAPS) 1051/1777 variables, 726/746 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1777 variables, 453/1199 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1777/1778 variables, and 1199 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 726/726 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 0/0 constraints]
After SMT, in 60474ms problems are : Problem set: 0 solved, 453 unsolved
Search for dead transitions found 0 dead transitions in 60478ms
Starting structural reductions in SI_LTL mode, iteration 1 : 726/1124 places, 1087/1517 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62038 ms. Remains : 726/1124 places, 1087/1517 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLFireability-13
Product exploration explored 100000 steps with 4085 reset in 1225 ms.
Product exploration explored 100000 steps with 4078 reset in 964 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 p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 129 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1657 resets) in 1691 ms. (23 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/2 properties
[2024-05-23 01:01:12] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
[2024-05-23 01:01:12] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 364/1778 variables, and 4 constraints, problems are : Problem set: 1 solved, 0 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 4/20 constraints, State Equation: 0/726 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 60ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 10 factoid took 173 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (NOT p1)]
Support contains 3 out of 726 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 726/726 places, 1087/1087 transitions.
Applied a total of 0 rules in 70 ms. Remains 726 /726 variables (removed 0) and now considering 1087/1087 (removed 0) transitions.
[2024-05-23 01:01:13] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
[2024-05-23 01:01:13] [INFO ] Invariant cache hit.
[2024-05-23 01:01:13] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-23 01:01:13] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
[2024-05-23 01:01:13] [INFO ] Invariant cache hit.
[2024-05-23 01:01:14] [INFO ] Implicit Places using invariants and state equation in 739 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
[2024-05-23 01:01:14] [INFO ] Redundant transitions in 17 ms returned []
Running 453 sub problems to find dead transitions.
[2024-05-23 01:01:14] [INFO ] Flow matrix only has 1052 transitions (discarded 35 similar events)
[2024-05-23 01:01:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/708 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/708 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 18/726 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/726 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (OVERLAPS) 1051/1777 variables, 726/746 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1777 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1777/1778 variables, and 746 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 726/726 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/708 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/708 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 18/726 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/726 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (OVERLAPS) 1051/1777 variables, 726/746 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1777 variables, 453/1199 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1777/1778 variables, and 1199 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 726/726 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 0/0 constraints]
After SMT, in 60538ms problems are : Problem set: 0 solved, 453 unsolved
Search for dead transitions found 0 dead transitions in 60543ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61713 ms. Remains : 726/726 places, 1087/1087 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (1680 resets) in 401 ms. (99 steps per ms) remains 1/1 properties
BEST_FIRST walk for 6366 steps (0 resets) in 9 ms. (636 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 4077 reset in 959 ms.
Product exploration explored 100000 steps with 4108 reset in 983 ms.
Support contains 3 out of 726 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 726/726 places, 1087/1087 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 725 transition count 1086
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 725 transition count 1086
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 725 transition count 1085
Applied a total of 3 rules in 75 ms. Remains 725 /726 variables (removed 1) and now considering 1085/1087 (removed 2) transitions.
[2024-05-23 01:02:17] [INFO ] Flow matrix only has 1050 transitions (discarded 35 similar events)
// Phase 1: matrix 1050 rows 725 cols
[2024-05-23 01:02:17] [INFO ] Computed 20 invariants in 18 ms
[2024-05-23 01:02:18] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-23 01:02:18] [INFO ] Flow matrix only has 1050 transitions (discarded 35 similar events)
[2024-05-23 01:02:18] [INFO ] Invariant cache hit.
[2024-05-23 01:02:18] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 1071 ms to find 0 implicit places.
[2024-05-23 01:02:18] [INFO ] Redundant transitions in 12 ms returned []
Running 452 sub problems to find dead transitions.
[2024-05-23 01:02:18] [INFO ] Flow matrix only has 1050 transitions (discarded 35 similar events)
[2024-05-23 01:02:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/707 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/707 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (OVERLAPS) 18/725 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/725 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (OVERLAPS) 1049/1774 variables, 725/745 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1774 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1774/1775 variables, and 745 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 725/725 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 452 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/707 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/707 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 2 (OVERLAPS) 18/725 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/725 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 4 (OVERLAPS) 1049/1774 variables, 725/745 constraints. Problems are: Problem set: 0 solved, 452 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1774 variables, 452/1197 constraints. Problems are: Problem set: 0 solved, 452 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1774/1775 variables, and 1197 constraints, problems are : Problem set: 0 solved, 452 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 725/725 constraints, PredecessorRefiner: 452/452 constraints, Known Traps: 0/0 constraints]
After SMT, in 60505ms problems are : Problem set: 0 solved, 452 unsolved
Search for dead transitions found 0 dead transitions in 60509ms
Starting structural reductions in SI_LTL mode, iteration 1 : 725/726 places, 1085/1087 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61679 ms. Remains : 725/726 places, 1085/1087 transitions.
Treatment of property FlexibleBarrier-PT-18b-LTLFireability-13 finished in 192145 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1124/1124 places, 1517/1517 transitions.
Graph (trivial) has 1067 edges and 1124 vertex of which 109 / 1124 are part of one of the 18 SCC in 2 ms
Free SCC test removed 91 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 1032 transition count 1336
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 177 place count 944 transition count 1336
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 177 place count 944 transition count 1292
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 265 place count 900 transition count 1292
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 316 place count 849 transition count 1241
Iterating global reduction 2 with 51 rules applied. Total rules applied 367 place count 849 transition count 1241
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 371 place count 849 transition count 1237
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 371 place count 849 transition count 1236
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 373 place count 848 transition count 1236
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 382 place count 839 transition count 1227
Iterating global reduction 3 with 9 rules applied. Total rules applied 391 place count 839 transition count 1227
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 400 place count 839 transition count 1218
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: 110
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 4 with 220 rules applied. Total rules applied 620 place count 729 transition count 1108
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 621 place count 728 transition count 1107
Iterating global reduction 4 with 1 rules applied. Total rules applied 622 place count 728 transition count 1107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 623 place count 728 transition count 1106
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 641 place count 728 transition count 1088
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 643 place count 726 transition count 1086
Applied a total of 643 rules in 312 ms. Remains 726 /1124 variables (removed 398) and now considering 1086/1517 (removed 431) transitions.
[2024-05-23 01:03:19] [INFO ] Flow matrix only has 1051 transitions (discarded 35 similar events)
// Phase 1: matrix 1051 rows 726 cols
[2024-05-23 01:03:19] [INFO ] Computed 20 invariants in 23 ms
[2024-05-23 01:03:20] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-05-23 01:03:20] [INFO ] Flow matrix only has 1051 transitions (discarded 35 similar events)
[2024-05-23 01:03:20] [INFO ] Invariant cache hit.
[2024-05-23 01:03:20] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 1042 ms to find 0 implicit places.
[2024-05-23 01:03:20] [INFO ] Redundant transitions in 11 ms returned []
Running 453 sub problems to find dead transitions.
[2024-05-23 01:03:20] [INFO ] Flow matrix only has 1051 transitions (discarded 35 similar events)
[2024-05-23 01:03:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/708 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/708 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 18/726 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/726 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (OVERLAPS) 1050/1776 variables, 726/746 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1776 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1776/1777 variables, and 746 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 726/726 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 453 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/708 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/708 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 2 (OVERLAPS) 18/726 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/726 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 4 (OVERLAPS) 1050/1776 variables, 726/746 constraints. Problems are: Problem set: 0 solved, 453 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1776 variables, 453/1199 constraints. Problems are: Problem set: 0 solved, 453 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1776/1777 variables, and 1199 constraints, problems are : Problem set: 0 solved, 453 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 726/726 constraints, PredecessorRefiner: 453/453 constraints, Known Traps: 0/0 constraints]
After SMT, in 60511ms problems are : Problem set: 0 solved, 453 unsolved
Search for dead transitions found 0 dead transitions in 60515ms
Starting structural reductions in SI_LTL mode, iteration 1 : 726/1124 places, 1086/1517 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61888 ms. Remains : 726/1124 places, 1086/1517 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-18b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18b-LTLFireability-14 finished in 61969 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U p1)||X(F(p0)))))'
Support contains 2 out of 1124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1124/1124 places, 1517/1517 transitions.
Graph (trivial) has 1049 edges and 1124 vertex of which 103 / 1124 are part of one of the 17 SCC in 2 ms
Free SCC test removed 86 places
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 1037 transition count 1341
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 177 place count 949 transition count 1341
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 177 place count 949 transition count 1297
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 265 place count 905 transition count 1297
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 314 place count 856 transition count 1248
Iterating global reduction 2 with 49 rules applied. Total rules applied 363 place count 856 transition count 1248
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 367 place count 856 transition count 1244
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 367 place count 856 transition count 1243
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 369 place count 855 transition count 1243
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 378 place count 846 transition count 1234
Iterating global reduction 3 with 9 rules applied. Total rules applied 387 place count 846 transition count 1234
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 395 place count 846 transition count 1226
Performed 113 Post agglomeration using F-continuation condition.Transition count delta: 113
Deduced a syphon composed of 113 places in 0 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 4 with 226 rules applied. Total rules applied 621 place count 733 transition count 1113
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 623 place count 731 transition count 1111
Iterating global reduction 4 with 2 rules applied. Total rules applied 625 place count 731 transition count 1111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 627 place count 731 transition count 1109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 629 place count 730 transition count 1109
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 5 with 19 rules applied. Total rules applied 648 place count 730 transition count 1090
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 650 place count 728 transition count 1088
Applied a total of 650 rules in 292 ms. Remains 728 /1124 variables (removed 396) and now considering 1088/1517 (removed 429) transitions.
[2024-05-23 01:04:21] [INFO ] Flow matrix only has 1054 transitions (discarded 34 similar events)
// Phase 1: matrix 1054 rows 728 cols
[2024-05-23 01:04:21] [INFO ] Computed 20 invariants in 23 ms
[2024-05-23 01:04:22] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-05-23 01:04:22] [INFO ] Flow matrix only has 1054 transitions (discarded 34 similar events)
[2024-05-23 01:04:22] [INFO ] Invariant cache hit.
[2024-05-23 01:04:22] [INFO ] Implicit Places using invariants and state equation in 736 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
[2024-05-23 01:04:22] [INFO ] Redundant transitions in 12 ms returned []
Running 472 sub problems to find dead transitions.
[2024-05-23 01:04:22] [INFO ] Flow matrix only has 1054 transitions (discarded 34 similar events)
[2024-05-23 01:04:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/710 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/710 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 18/728 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/728 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (OVERLAPS) 1053/1781 variables, 728/748 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1781 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 472 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 1781/1782 variables, and 748 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 728/728 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 472 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/710 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/710 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 18/728 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/728 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (OVERLAPS) 1053/1781 variables, 728/748 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1781 variables, 472/1220 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1781/1782 variables, and 1220 constraints, problems are : Problem set: 0 solved, 472 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 728/728 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 0/0 constraints]
After SMT, in 60497ms problems are : Problem set: 0 solved, 472 unsolved
Search for dead transitions found 0 dead transitions in 60501ms
Starting structural reductions in SI_LTL mode, iteration 1 : 728/1124 places, 1088/1517 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61932 ms. Remains : 728/1124 places, 1088/1517 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-18b-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-18b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-18b-LTLFireability-15 finished in 62034 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(F(p1)))))'
[2024-05-23 01:05:23] [INFO ] Flatten gal took : 53 ms
[2024-05-23 01:05:23] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-23 01:05:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1124 places, 1517 transitions and 4521 arcs took 25 ms.
Total runtime 672514 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FlexibleBarrier-PT-18b

IS_COLORED=
IS_NUPN=

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

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

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

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

Process ID: 1139
MODEL NAME: /home/mcc/execution/399/model
1124 places, 1517 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

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

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FlexibleBarrier-PT-18b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-171640600800124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-18b.tgz
mv FlexibleBarrier-PT-18b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;