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

About the Execution of LTSMin+red for FlexibleBarrier-PT-10a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
497.659 79020.00 105948.00 284.70 FFFFFFFFFFFFFFTF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 13 09:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 13 09:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 13 09:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 13 09:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 94K 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-10a-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-10a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717182121220

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-10a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:02:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 19:02:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:02:02] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-31 19:02:02] [INFO ] Transformed 123 places.
[2024-05-31 19:02:02] [INFO ] Transformed 334 transitions.
[2024-05-31 19:02:02] [INFO ] Found NUPN structural information;
[2024-05-31 19:02:02] [INFO ] Parsed PT model containing 123 places and 334 transitions and 1467 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 82 transitions
Reduce redundant transitions removed 82 transitions.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 252/252 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 123 transition count 242
Applied a total of 10 rules in 30 ms. Remains 123 /123 variables (removed 0) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 123 cols
[2024-05-31 19:02:02] [INFO ] Computed 12 invariants in 14 ms
[2024-05-31 19:02:03] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-31 19:02:03] [INFO ] Invariant cache hit.
[2024-05-31 19:02:03] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-31 19:02:03] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-31 19:02:03] [INFO ] Invariant cache hit.
[2024-05-31 19:02:03] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 6939 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 6380 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 13475ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 13492ms
Starting structural reductions in LTL mode, iteration 1 : 123/123 places, 242/252 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13958 ms. Remains : 123/123 places, 242/252 transitions.
Support contains 35 out of 123 places after structural reductions.
[2024-05-31 19:02:16] [INFO ] Flatten gal took : 46 ms
[2024-05-31 19:02:16] [INFO ] Flatten gal took : 15 ms
[2024-05-31 19:02:16] [INFO ] Input system was already deterministic with 242 transitions.
Support contains 34 out of 123 places (down from 35) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 34 to 33
RANDOM walk for 40000 steps (8 resets) in 921 ms. (43 steps per ms) remains 1/33 properties
BEST_FIRST walk for 40003 steps (8 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
[2024-05-31 19:02:17] [INFO ] Invariant cache hit.
[2024-05-31 19:02:17] [INFO ] State equation strengthened by 141 read => feed constraints.
Problem AtomicPropp19 is UNSAT
After SMT solving in domain Real declared 3/365 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 13 ms.
Refiners :[Domain max(s): 0/123 constraints, Positive P Invariants (semi-flows): 0/12 constraints, State Equation: 0/123 constraints, ReadFeed: 0/141 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 21ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 3 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U ((p1 U p0)&&X(F(!p2))))))'
Support contains 7 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-31 19:02:17] [INFO ] Invariant cache hit.
[2024-05-31 19:02:17] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 19:02:17] [INFO ] Invariant cache hit.
[2024-05-31 19:02:17] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-31 19:02:18] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-31 19:02:18] [INFO ] Invariant cache hit.
[2024-05-31 19:02:18] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 6414 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 6351 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 12867ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 12871ms
Finished structural reductions in LTL mode , in 1 iterations and 13064 ms. Remains : 123/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 492 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (NOT p0), p2, (NOT p0), true]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-00
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-00 finished in 13637 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)||(!p1 U (G(!p1)||(!p1&&G(p2))))))'
Support contains 6 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-31 19:02:31] [INFO ] Invariant cache hit.
[2024-05-31 19:02:31] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 19:02:31] [INFO ] Invariant cache hit.
[2024-05-31 19:02:31] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-31 19:02:31] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-31 19:02:31] [INFO ] Invariant cache hit.
[2024-05-31 19:02:31] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 6467 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 6414 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 12958ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 12962ms
Finished structural reductions in LTL mode , in 1 iterations and 13164 ms. Remains : 123/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 271 ms :[true, (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p2) p1 (NOT p0)), p1, (AND p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-03 finished in 13461 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(p0)&&((F(p2)&&p1)||(F(p2)&&p3)))))))'
Support contains 7 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-31 19:02:44] [INFO ] Invariant cache hit.
[2024-05-31 19:02:44] [INFO ] Implicit Places using invariants in 64 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 78 ms. Remains : 122/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p2) (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-05
Product exploration explored 100000 steps with 1943 reset in 480 ms.
Stack based approach found an accepted trace after 203 steps with 7 reset with depth 11 and stack size 11 in 1 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-05 finished in 835 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 100 edges and 123 vertex of which 30 / 123 are part of one of the 10 SCC in 3 ms
Free SCC test removed 20 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 61 place count 73 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 0 with 45 rules applied. Total rules applied 106 place count 73 transition count 111
Applied a total of 106 rules in 44 ms. Remains 73 /123 variables (removed 50) and now considering 111/242 (removed 131) transitions.
[2024-05-31 19:02:45] [INFO ] Flow matrix only has 92 transitions (discarded 19 similar events)
// Phase 1: matrix 92 rows 73 cols
[2024-05-31 19:02:45] [INFO ] Computed 12 invariants in 1 ms
[2024-05-31 19:02:45] [INFO ] Implicit Places using invariants in 43 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/123 places, 111/242 transitions.
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 0 place count 72 transition count 101
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 62 transition count 101
Applied a total of 20 rules in 9 ms. Remains 62 /72 variables (removed 10) and now considering 101/111 (removed 10) transitions.
[2024-05-31 19:02:45] [INFO ] Flow matrix only has 82 transitions (discarded 19 similar events)
// Phase 1: matrix 82 rows 62 cols
[2024-05-31 19:02:45] [INFO ] Computed 11 invariants in 1 ms
[2024-05-31 19:02:45] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-31 19:02:45] [INFO ] Flow matrix only has 82 transitions (discarded 19 similar events)
[2024-05-31 19:02:45] [INFO ] Invariant cache hit.
[2024-05-31 19:02:45] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-31 19:02:45] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/123 places, 101/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 206 ms. Remains : 62/123 places, 101/242 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-06 finished in 262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((X(X(F(!p0)))&&G(!p1))||G(F(!p0))))))'
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2024-05-31 19:02:45] [INFO ] Computed 12 invariants in 2 ms
[2024-05-31 19:02:46] [INFO ] Implicit Places using invariants in 69 ms returned [122]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 122 /122 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 122/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 182 ms :[p0, p0, (AND (NOT p1) p0), (AND p1 p0), p0]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-07
Product exploration explored 100000 steps with 2571 reset in 301 ms.
Stack based approach found an accepted trace after 585 steps with 23 reset with depth 11 and stack size 11 in 2 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-07 finished in 584 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((p1&&(X(!p2) U ((!p3&&X(!p2))||X(G(!p2))))))))))'
Support contains 5 out of 123 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-31 19:02:46] [INFO ] Invariant cache hit.
[2024-05-31 19:02:46] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-31 19:02:46] [INFO ] Invariant cache hit.
[2024-05-31 19:02:46] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-31 19:02:46] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-31 19:02:46] [INFO ] Invariant cache hit.
[2024-05-31 19:02:46] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 6455 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 6445 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 12974ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 12977ms
Finished structural reductions in LTL mode , in 1 iterations and 13159 ms. Remains : 123/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-08
Product exploration explored 100000 steps with 2928 reset in 296 ms.
Stack based approach found an accepted trace after 475 steps with 19 reset with depth 137 and stack size 136 in 2 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-08 finished in 13616 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 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 97 edges and 123 vertex of which 27 / 123 are part of one of the 9 SCC in 1 ms
Free SCC test removed 18 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 139 edges and 102 vertex of which 95 / 102 are part of one of the 11 SCC in 1 ms
Free SCC test removed 84 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 18 transition count 194
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 180 transitions
Reduce isomorphic transitions removed 180 transitions.
Graph (trivial) has 10 edges and 8 vertex of which 2 / 8 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 192 rules applied. Total rules applied 197 place count 7 transition count 13
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 199 place count 6 transition count 12
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 200 place count 5 transition count 10
Iterating global reduction 3 with 1 rules applied. Total rules applied 201 place count 5 transition count 10
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 203 place count 5 transition count 8
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 205 place count 4 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 206 place count 3 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 209 place count 3 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 210 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 211 place count 2 transition count 3
Applied a total of 211 rules in 12 ms. Remains 2 /123 variables (removed 121) and now considering 3/242 (removed 239) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-31 19:03:00] [INFO ] Computed 1 invariants in 0 ms
[2024-05-31 19:03:00] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-31 19:03:00] [INFO ] Invariant cache hit.
[2024-05-31 19:03:00] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-31 19:03:00] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-31 19:03:00] [INFO ] Invariant cache hit.
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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 16 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 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) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 38ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 38ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/123 places, 3/242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 2/123 places, 3/242 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-09 finished in 134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 95 edges and 123 vertex of which 24 / 123 are part of one of the 8 SCC in 1 ms
Free SCC test removed 16 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 61 place count 77 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 0 with 58 rules applied. Total rules applied 119 place count 77 transition count 117
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 77 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 76 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 76 transition count 116
Applied a total of 122 rules in 22 ms. Remains 76 /123 variables (removed 47) and now considering 116/242 (removed 126) transitions.
[2024-05-31 19:03:00] [INFO ] Flow matrix only has 99 transitions (discarded 17 similar events)
// Phase 1: matrix 99 rows 76 cols
[2024-05-31 19:03:00] [INFO ] Computed 12 invariants in 1 ms
[2024-05-31 19:03:00] [INFO ] Implicit Places using invariants in 53 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/123 places, 116/242 transitions.
Graph (trivial) has 98 edges and 75 vertex of which 24 / 75 are part of one of the 8 SCC in 1 ms
Free SCC test removed 16 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 59 transition count 74
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 49 transition count 74
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 21 place count 49 transition count 64
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 41 place count 39 transition count 64
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 65 place count 27 transition count 52
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 75 place count 27 transition count 42
Applied a total of 75 rules in 7 ms. Remains 27 /75 variables (removed 48) and now considering 42/116 (removed 74) transitions.
[2024-05-31 19:03:00] [INFO ] Flow matrix only has 31 transitions (discarded 11 similar events)
// Phase 1: matrix 31 rows 27 cols
[2024-05-31 19:03:00] [INFO ] Computed 11 invariants in 0 ms
[2024-05-31 19:03:00] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-31 19:03:00] [INFO ] Flow matrix only has 31 transitions (discarded 11 similar events)
[2024-05-31 19:03:00] [INFO ] Invariant cache hit.
[2024-05-31 19:03:00] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-31 19:03:00] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/123 places, 42/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 138 ms. Remains : 27/123 places, 42/242 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-10 finished in 214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(G(p1)&&X(p2))))))'
Support contains 7 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 91 edges and 123 vertex of which 21 / 123 are part of one of the 7 SCC in 0 ms
Free SCC test removed 14 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 0 with 58 rules applied. Total rules applied 59 place count 80 transition count 184
Drop transitions (Redundant composition of simpler transitions.) removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 0 with 54 rules applied. Total rules applied 113 place count 80 transition count 130
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 115 place count 80 transition count 130
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 117 place count 78 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 119 place count 78 transition count 128
Applied a total of 119 rules in 14 ms. Remains 78 /123 variables (removed 45) and now considering 128/242 (removed 114) transitions.
[2024-05-31 19:03:00] [INFO ] Flow matrix only has 107 transitions (discarded 21 similar events)
// Phase 1: matrix 107 rows 78 cols
[2024-05-31 19:03:00] [INFO ] Computed 12 invariants in 1 ms
[2024-05-31 19:03:00] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-31 19:03:00] [INFO ] Flow matrix only has 107 transitions (discarded 21 similar events)
[2024-05-31 19:03:00] [INFO ] Invariant cache hit.
[2024-05-31 19:03:00] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-31 19:03:00] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-31 19:03:00] [INFO ] Redundant transitions in 16 ms returned [55, 56]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 125 sub problems to find dead transitions.
[2024-05-31 19:03:00] [INFO ] Flow matrix only has 105 transitions (discarded 21 similar events)
// Phase 1: matrix 105 rows 78 cols
[2024-05-31 19:03:00] [INFO ] Computed 12 invariants in 1 ms
[2024-05-31 19:03:00] [INFO ] State equation strengthened by 76 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 104/182 variables, 78/90 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 75/165 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 1/183 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/183 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 0/183 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 166 constraints, problems are : Problem set: 0 solved, 125 unsolved in 2512 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 78/78 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 104/182 variables, 78/90 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 75/165 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 125/290 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 1/183 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/183 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (OVERLAPS) 0/183 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 291 constraints, problems are : Problem set: 0 solved, 125 unsolved in 2389 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 78/78 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
After SMT, in 4919ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 4921ms
Starting structural reductions in SI_LTL mode, iteration 1 : 78/123 places, 126/242 transitions.
Applied a total of 0 rules in 7 ms. Remains 78 /78 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5079 ms. Remains : 78/123 places, 126/242 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-11
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-11 finished in 5271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(X((G(p0)||p1)))||(X(p2) U p3)))'
Support contains 7 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 123 cols
[2024-05-31 19:03:05] [INFO ] Computed 12 invariants in 1 ms
[2024-05-31 19:03:05] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-31 19:03:05] [INFO ] Invariant cache hit.
[2024-05-31 19:03:05] [INFO ] State equation strengthened by 141 read => feed constraints.
[2024-05-31 19:03:05] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-31 19:03:05] [INFO ] Invariant cache hit.
[2024-05-31 19:03:05] [INFO ] State equation strengthened by 141 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 399 constraints, problems are : Problem set: 0 solved, 241 unsolved in 6401 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 122/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/365 variables, 123/258 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 141/399 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 241/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (OVERLAPS) 0/365 variables, 0/640 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 640 constraints, problems are : Problem set: 0 solved, 241 unsolved in 6450 ms.
Refiners :[Domain max(s): 123/123 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 123/123 constraints, ReadFeed: 141/141 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 12915ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 12918ms
Finished structural reductions in LTL mode , in 1 iterations and 13105 ms. Remains : 123/123 places, 242/242 transitions.
Stuttering acceptance computed with spot in 257 ms :[true, (AND (NOT p0) (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-12 finished in 13386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 99 edges and 123 vertex of which 30 / 123 are part of one of the 10 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 61 place count 73 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 0 with 45 rules applied. Total rules applied 106 place count 73 transition count 111
Applied a total of 106 rules in 16 ms. Remains 73 /123 variables (removed 50) and now considering 111/242 (removed 131) transitions.
[2024-05-31 19:03:19] [INFO ] Flow matrix only has 92 transitions (discarded 19 similar events)
// Phase 1: matrix 92 rows 73 cols
[2024-05-31 19:03:19] [INFO ] Computed 12 invariants in 1 ms
[2024-05-31 19:03:19] [INFO ] Implicit Places using invariants in 49 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/123 places, 111/242 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 72 transition count 102
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 63 transition count 102
Applied a total of 18 rules in 4 ms. Remains 63 /72 variables (removed 9) and now considering 102/111 (removed 9) transitions.
[2024-05-31 19:03:19] [INFO ] Flow matrix only has 83 transitions (discarded 19 similar events)
// Phase 1: matrix 83 rows 63 cols
[2024-05-31 19:03:19] [INFO ] Computed 11 invariants in 0 ms
[2024-05-31 19:03:19] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-31 19:03:19] [INFO ] Flow matrix only has 83 transitions (discarded 19 similar events)
[2024-05-31 19:03:19] [INFO ] Invariant cache hit.
[2024-05-31 19:03:19] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-31 19:03:19] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 63/123 places, 102/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 177 ms. Remains : 63/123 places, 102/242 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-13 finished in 226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U p1)||G(p2)))'
Support contains 3 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 93 edges and 123 vertex of which 21 / 123 are part of one of the 7 SCC in 0 ms
Free SCC test removed 14 places
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 0 with 62 rules applied. Total rules applied 63 place count 78 transition count 176
Drop transitions (Redundant composition of simpler transitions.) removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 0 with 56 rules applied. Total rules applied 119 place count 78 transition count 120
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 120 place count 78 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 121 place count 77 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 122 place count 77 transition count 119
Applied a total of 122 rules in 18 ms. Remains 77 /123 variables (removed 46) and now considering 119/242 (removed 123) transitions.
[2024-05-31 19:03:19] [INFO ] Flow matrix only has 103 transitions (discarded 16 similar events)
// Phase 1: matrix 103 rows 77 cols
[2024-05-31 19:03:19] [INFO ] Computed 12 invariants in 1 ms
[2024-05-31 19:03:19] [INFO ] Implicit Places using invariants in 62 ms returned [75, 76]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 63 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/123 places, 119/242 transitions.
Graph (trivial) has 106 edges and 75 vertex of which 58 / 75 are part of one of the 10 SCC in 0 ms
Free SCC test removed 48 places
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 27 transition count 40
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 24 transition count 40
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 16 place count 15 transition count 28
Iterating global reduction 2 with 9 rules applied. Total rules applied 25 place count 15 transition count 28
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 29 place count 15 transition count 24
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 14 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 34 place count 12 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 37 place count 12 transition count 19
Applied a total of 37 rules in 2 ms. Remains 12 /75 variables (removed 63) and now considering 19/119 (removed 100) transitions.
[2024-05-31 19:03:19] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 12 cols
[2024-05-31 19:03:19] [INFO ] Computed 4 invariants in 0 ms
[2024-05-31 19:03:19] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-31 19:03:19] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
[2024-05-31 19:03:19] [INFO ] Invariant cache hit.
[2024-05-31 19:03:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 19:03:19] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/123 places, 19/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 118 ms. Remains : 12/123 places, 19/242 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 78 ms.
Product exploration explored 100000 steps with 50000 reset in 80 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT p0)), (X p1), (X (NOT p2)), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X p2))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 21 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-10a-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-14 finished in 431 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)&&(p1 U p2)))&&G(F(p3))))'
Support contains 5 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 242/242 transitions.
Graph (trivial) has 91 edges and 123 vertex of which 24 / 123 are part of one of the 8 SCC in 0 ms
Free SCC test removed 16 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 0 with 54 rules applied. Total rules applied 55 place count 80 transition count 178
Drop transitions (Redundant composition of simpler transitions.) removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 0 with 58 rules applied. Total rules applied 113 place count 80 transition count 120
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 115 place count 80 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 116 place count 79 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 117 place count 79 transition count 119
Applied a total of 117 rules in 15 ms. Remains 79 /123 variables (removed 44) and now considering 119/242 (removed 123) transitions.
[2024-05-31 19:03:19] [INFO ] Flow matrix only has 103 transitions (discarded 16 similar events)
// Phase 1: matrix 103 rows 79 cols
[2024-05-31 19:03:19] [INFO ] Computed 12 invariants in 2 ms
[2024-05-31 19:03:19] [INFO ] Implicit Places using invariants in 55 ms returned [78]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/123 places, 119/242 transitions.
Graph (trivial) has 95 edges and 78 vertex of which 18 / 78 are part of one of the 6 SCC in 0 ms
Free SCC test removed 12 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 66 transition count 86
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 57 transition count 86
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 19 place count 57 transition count 76
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 39 place count 47 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 46 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 46 transition count 75
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 69 place count 32 transition count 61
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 79 place count 32 transition count 51
Applied a total of 79 rules in 4 ms. Remains 32 /78 variables (removed 46) and now considering 51/119 (removed 68) transitions.
[2024-05-31 19:03:19] [INFO ] Flow matrix only has 38 transitions (discarded 13 similar events)
// Phase 1: matrix 38 rows 32 cols
[2024-05-31 19:03:19] [INFO ] Computed 11 invariants in 1 ms
[2024-05-31 19:03:19] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-31 19:03:19] [INFO ] Flow matrix only has 38 transitions (discarded 13 similar events)
[2024-05-31 19:03:19] [INFO ] Invariant cache hit.
[2024-05-31 19:03:19] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-31 19:03:19] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/123 places, 51/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 136 ms. Remains : 32/123 places, 51/242 transitions.
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p0)), (NOT p3), (NOT p3), (NOT p0), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLFireability-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLFireability-15 finished in 366 ms.
All properties solved by simple procedures.
Total runtime 77872 ms.
ITS solved all properties within timeout

BK_STOP 1717182200240

--------------------
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

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-10a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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