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.r549-tall-171734898100251.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 FireWire-PT-11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898100251
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 125K Jun 2 16:33 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 FireWire-PT-11-LTLCardinality-00
FORMULA_NAME FireWire-PT-11-LTLCardinality-01
FORMULA_NAME FireWire-PT-11-LTLCardinality-02
FORMULA_NAME FireWire-PT-11-LTLCardinality-03
FORMULA_NAME FireWire-PT-11-LTLCardinality-04
FORMULA_NAME FireWire-PT-11-LTLCardinality-05
FORMULA_NAME FireWire-PT-11-LTLCardinality-06
FORMULA_NAME FireWire-PT-11-LTLCardinality-07
FORMULA_NAME FireWire-PT-11-LTLCardinality-08
FORMULA_NAME FireWire-PT-11-LTLCardinality-09
FORMULA_NAME FireWire-PT-11-LTLCardinality-10
FORMULA_NAME FireWire-PT-11-LTLCardinality-11
FORMULA_NAME FireWire-PT-11-LTLCardinality-12
FORMULA_NAME FireWire-PT-11-LTLCardinality-13
FORMULA_NAME FireWire-PT-11-LTLCardinality-14
FORMULA_NAME FireWire-PT-11-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717367419061

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 22:30:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 22:30:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:30:20] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-06-02 22:30:20] [INFO ] Transformed 169 places.
[2024-06-02 22:30:20] [INFO ] Transformed 508 transitions.
[2024-06-02 22:30:20] [INFO ] Found NUPN structural information;
[2024-06-02 22:30:20] [INFO ] Parsed PT model containing 169 places and 508 transitions and 1883 arcs in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 65 transitions
Reduce redundant transitions removed 65 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-11-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-11-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-11-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-11-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-11-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-11-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-11-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-11-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 443/443 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 167 transition count 439
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 167 transition count 439
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 167 transition count 433
Applied a total of 10 rules in 53 ms. Remains 167 /169 variables (removed 2) and now considering 433/443 (removed 10) transitions.
[2024-06-02 22:30:20] [INFO ] Flow matrix only has 401 transitions (discarded 32 similar events)
// Phase 1: matrix 401 rows 167 cols
[2024-06-02 22:30:20] [INFO ] Computed 10 invariants in 19 ms
[2024-06-02 22:30:20] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-06-02 22:30:20] [INFO ] Flow matrix only has 401 transitions (discarded 32 similar events)
[2024-06-02 22:30:20] [INFO ] Invariant cache hit.
[2024-06-02 22:30:21] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 22:30:21] [INFO ] Implicit Places using invariants and state equation in 313 ms returned [63, 114]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 648 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 165/169 places, 433/443 transitions.
Applied a total of 0 rules in 6 ms. Remains 165 /165 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 742 ms. Remains : 165/169 places, 433/443 transitions.
Support contains 28 out of 165 places after structural reductions.
[2024-06-02 22:30:21] [INFO ] Flatten gal took : 63 ms
[2024-06-02 22:30:21] [INFO ] Flatten gal took : 34 ms
[2024-06-02 22:30:21] [INFO ] Input system was already deterministic with 433 transitions.
RANDOM walk for 40000 steps (1062 resets) in 1317 ms. (30 steps per ms) remains 3/13 properties
BEST_FIRST walk for 40003 steps (218 resets) in 195 ms. (204 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (208 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (221 resets) in 107 ms. (370 steps per ms) remains 2/3 properties
[2024-06-02 22:30:22] [INFO ] Flow matrix only has 401 transitions (discarded 32 similar events)
// Phase 1: matrix 401 rows 165 cols
[2024-06-02 22:30:22] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 22:30:22] [INFO ] State equation strengthened by 58 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/154 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 392/546 variables, 154/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 55/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 19/565 variables, 11/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/565 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/565 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/566 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/566 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 231 constraints, problems are : Problem set: 0 solved, 2 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 165/165 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 44/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 107/154 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 22:30:22] [INFO ] Deduced a trap composed of 37 places in 157 ms of which 10 ms to minimize.
[2024-06-02 22:30:23] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 392/546 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 55/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 19/565 variables, 11/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/565 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/565 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/566 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/566 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 235 constraints, problems are : Problem set: 0 solved, 2 unsolved in 807 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 165/165 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1206ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 103 ms.
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 433/433 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 165 transition count 430
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 3 place count 165 transition count 424
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 15 place count 159 transition count 424
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 21 place count 156 transition count 432
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 27 place count 156 transition count 426
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 156 transition count 423
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 156 transition count 430
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 50 place count 150 transition count 422
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 57 place count 150 transition count 415
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 149 transition count 414
Applied a total of 58 rules in 92 ms. Remains 149 /165 variables (removed 16) and now considering 414/433 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 149/165 places, 414/433 transitions.
RANDOM walk for 40000 steps (1234 resets) in 408 ms. (97 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (287 resets) in 382 ms. (104 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3687 steps, run visited all 1 properties in 28 ms. (steps per millisecond=131 )
Probabilistic random walk after 3687 steps, saw 1739 distinct states, run finished after 31 ms. (steps per millisecond=118 ) properties seen :1
FORMULA FireWire-PT-11-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 21 stabilizing places and 33 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)))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 433/433 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 164 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 164 transition count 431
Applied a total of 2 rules in 12 ms. Remains 164 /165 variables (removed 1) and now considering 431/433 (removed 2) transitions.
[2024-06-02 22:30:24] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
// Phase 1: matrix 399 rows 164 cols
[2024-06-02 22:30:24] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:30:24] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-02 22:30:24] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 22:30:24] [INFO ] Invariant cache hit.
[2024-06-02 22:30:24] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 22:30:24] [INFO ] Implicit Places using invariants and state equation in 310 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 444 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/165 places, 431/433 transitions.
Applied a total of 0 rules in 3 ms. Remains 163 /163 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 459 ms. Remains : 163/165 places, 431/433 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-11-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 258 ms.
Product exploration explored 100000 steps with 50000 reset in 185 ms.
Computed a total of 19 stabilizing places and 31 stable transitions
Computed a total of 19 stabilizing places and 31 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 42 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-11-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-11-LTLCardinality-00 finished in 1205 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))||F(p1)))'
Support contains 3 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 433/433 transitions.
Applied a total of 0 rules in 3 ms. Remains 165 /165 variables (removed 0) and now considering 433/433 (removed 0) transitions.
[2024-06-02 22:30:25] [INFO ] Flow matrix only has 401 transitions (discarded 32 similar events)
// Phase 1: matrix 401 rows 165 cols
[2024-06-02 22:30:25] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:30:25] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-06-02 22:30:25] [INFO ] Flow matrix only has 401 transitions (discarded 32 similar events)
[2024-06-02 22:30:25] [INFO ] Invariant cache hit.
[2024-06-02 22:30:25] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 22:30:25] [INFO ] Implicit Places using invariants and state equation in 268 ms returned [163]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 439 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/165 places, 433/433 transitions.
Applied a total of 0 rules in 3 ms. Remains 164 /164 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 445 ms. Remains : 164/165 places, 433/433 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-11-LTLCardinality-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-11-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-11-LTLCardinality-03 finished in 573 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 4 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 433/433 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 164 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 164 transition count 431
Applied a total of 2 rules in 7 ms. Remains 164 /165 variables (removed 1) and now considering 431/433 (removed 2) transitions.
[2024-06-02 22:30:25] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
// Phase 1: matrix 399 rows 164 cols
[2024-06-02 22:30:25] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:30:26] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-06-02 22:30:26] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 22:30:26] [INFO ] Invariant cache hit.
[2024-06-02 22:30:26] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 22:30:26] [INFO ] Implicit Places using invariants and state equation in 282 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 458 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/165 places, 431/433 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 468 ms. Remains : 163/165 places, 431/433 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-11-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-11-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-11-LTLCardinality-04 finished in 554 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)||X(G(!p0))))'
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 433/433 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 164 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 164 transition count 431
Applied a total of 2 rules in 5 ms. Remains 164 /165 variables (removed 1) and now considering 431/433 (removed 2) transitions.
[2024-06-02 22:30:26] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 22:30:26] [INFO ] Invariant cache hit.
[2024-06-02 22:30:26] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 22:30:26] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 22:30:26] [INFO ] Invariant cache hit.
[2024-06-02 22:30:26] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 22:30:26] [INFO ] Implicit Places using invariants and state equation in 273 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 362 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/165 places, 431/433 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 371 ms. Remains : 163/165 places, 431/433 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, p0, (NOT p0), false, false]
Running random walk in product with property : FireWire-PT-11-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-11-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-11-LTLCardinality-07 finished in 518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((F(p1)&&X(G(p2)))))))'
Support contains 6 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 433/433 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 164 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 164 transition count 431
Applied a total of 2 rules in 5 ms. Remains 164 /165 variables (removed 1) and now considering 431/433 (removed 2) transitions.
[2024-06-02 22:30:26] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 22:30:27] [INFO ] Invariant cache hit.
[2024-06-02 22:30:27] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 22:30:27] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 22:30:27] [INFO ] Invariant cache hit.
[2024-06-02 22:30:27] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 22:30:27] [INFO ] Implicit Places using invariants and state equation in 268 ms returned [162]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 363 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/165 places, 431/433 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 370 ms. Remains : 163/165 places, 431/433 transitions.
Stuttering acceptance computed with spot in 164 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 : FireWire-PT-11-LTLCardinality-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-11-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-11-LTLCardinality-08 finished in 559 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)))'
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 165/165 places, 433/433 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 164 transition count 427
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 159 transition count 427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 158 transition count 425
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 158 transition count 425
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 155 transition count 434
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 155 transition count 428
Applied a total of 24 rules in 31 ms. Remains 155 /165 variables (removed 10) and now considering 428/433 (removed 5) transitions.
[2024-06-02 22:30:27] [INFO ] Flow matrix only has 389 transitions (discarded 39 similar events)
// Phase 1: matrix 389 rows 155 cols
[2024-06-02 22:30:27] [INFO ] Computed 8 invariants in 6 ms
[2024-06-02 22:30:27] [INFO ] Implicit Places using invariants in 416 ms returned []
[2024-06-02 22:30:27] [INFO ] Flow matrix only has 389 transitions (discarded 39 similar events)
[2024-06-02 22:30:27] [INFO ] Invariant cache hit.
[2024-06-02 22:30:28] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 22:30:28] [INFO ] Implicit Places using invariants and state equation in 257 ms returned [153]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 682 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/165 places, 428/433 transitions.
Applied a total of 0 rules in 9 ms. Remains 154 /154 variables (removed 0) and now considering 428/428 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 722 ms. Remains : 154/165 places, 428/433 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-11-LTLCardinality-11
Product exploration explored 100000 steps with 3 reset in 191 ms.
Product exploration explored 100000 steps with 0 reset in 111 ms.
Computed a total of 13 stabilizing places and 28 stable transitions
Computed a total of 13 stabilizing places and 28 stable transitions
Detected a total of 13/154 stabilizing places and 28/428 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 166 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 15562 steps (482 resets) in 46 ms. (331 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 7 factoid took 281 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 5 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 428/428 transitions.
Applied a total of 0 rules in 12 ms. Remains 154 /154 variables (removed 0) and now considering 428/428 (removed 0) transitions.
[2024-06-02 22:30:29] [INFO ] Flow matrix only has 389 transitions (discarded 39 similar events)
// Phase 1: matrix 389 rows 154 cols
[2024-06-02 22:30:29] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 22:30:29] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-02 22:30:29] [INFO ] Flow matrix only has 389 transitions (discarded 39 similar events)
[2024-06-02 22:30:29] [INFO ] Invariant cache hit.
[2024-06-02 22:30:29] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 22:30:29] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2024-06-02 22:30:29] [INFO ] Redundant transitions in 26 ms returned []
Running 421 sub problems to find dead transitions.
[2024-06-02 22:30:29] [INFO ] Flow matrix only has 389 transitions (discarded 39 similar events)
[2024-06-02 22:30:29] [INFO ] Invariant cache hit.
[2024-06-02 22:30:29] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-02 22:30:31] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 2 ms to minimize.
[2024-06-02 22:30:32] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 2 ms to minimize.
[2024-06-02 22:30:32] [INFO ] Deduced a trap composed of 34 places in 121 ms of which 1 ms to minimize.
[2024-06-02 22:30:32] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-06-02 22:30:33] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-06-02 22:30:33] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-06-02 22:30:33] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-02 22:30:34] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (OVERLAPS) 388/542 variables, 154/169 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-02 22:30:41] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:30:42] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 2 ms to minimize.
[2024-06-02 22:30:42] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 8 (OVERLAPS) 0/542 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 421 unsolved
No progress, stopping.
After SMT solving in domain Real declared 542/543 variables, and 228 constraints, problems are : Problem set: 0 solved, 421 unsolved in 21673 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 388/542 variables, 154/172 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 56/228 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 421/649 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-02 22:31:13] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 2 ms to minimize.
[2024-06-02 22:31:13] [INFO ] Deduced a trap composed of 91 places in 79 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/542 variables, 2/651 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 542/543 variables, and 651 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 13/13 constraints]
After SMT, in 52156ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 52167ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52625 ms. Remains : 154/154 places, 428/428 transitions.
Computed a total of 13 stabilizing places and 28 stable transitions
Computed a total of 13 stabilizing places and 28 stable transitions
Detected a total of 13/154 stabilizing places and 28/428 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 173 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
RANDOM walk for 13376 steps (404 resets) in 35 ms. (371 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 7 factoid took 250 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 78 ms.
Product exploration explored 100000 steps with 4 reset in 182 ms.
Support contains 5 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 428/428 transitions.
Applied a total of 0 rules in 11 ms. Remains 154 /154 variables (removed 0) and now considering 428/428 (removed 0) transitions.
[2024-06-02 22:31:23] [INFO ] Flow matrix only has 389 transitions (discarded 39 similar events)
[2024-06-02 22:31:23] [INFO ] Invariant cache hit.
[2024-06-02 22:31:23] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 22:31:23] [INFO ] Flow matrix only has 389 transitions (discarded 39 similar events)
[2024-06-02 22:31:23] [INFO ] Invariant cache hit.
[2024-06-02 22:31:23] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 22:31:23] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-06-02 22:31:23] [INFO ] Redundant transitions in 11 ms returned []
Running 421 sub problems to find dead transitions.
[2024-06-02 22:31:23] [INFO ] Flow matrix only has 389 transitions (discarded 39 similar events)
[2024-06-02 22:31:23] [INFO ] Invariant cache hit.
[2024-06-02 22:31:23] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-02 22:31:25] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 1 ms to minimize.
[2024-06-02 22:31:25] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:31:25] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:31:25] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:31:26] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:31:26] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
[2024-06-02 22:31:26] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-02 22:31:27] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (OVERLAPS) 388/542 variables, 154/169 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-02 22:31:34] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-06-02 22:31:35] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 1 ms to minimize.
[2024-06-02 22:31:35] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 8 (OVERLAPS) 0/542 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 421 unsolved
No progress, stopping.
After SMT solving in domain Real declared 542/543 variables, and 228 constraints, problems are : Problem set: 0 solved, 421 unsolved in 20875 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 388/542 variables, 154/172 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 56/228 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 421/649 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-06-02 22:32:06] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
[2024-06-02 22:32:06] [INFO ] Deduced a trap composed of 91 places in 71 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/542 variables, 2/651 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 542/543 variables, and 651 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 154/154 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 13/13 constraints]
After SMT, in 51294ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 51299ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51703 ms. Remains : 154/154 places, 428/428 transitions.
Treatment of property FireWire-PT-11-LTLCardinality-11 finished in 107562 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((F(p1)||p0))))'
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 165/165 places, 433/433 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 164 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 164 transition count 431
Applied a total of 2 rules in 2 ms. Remains 164 /165 variables (removed 1) and now considering 431/433 (removed 2) transitions.
[2024-06-02 22:32:15] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
// Phase 1: matrix 399 rows 164 cols
[2024-06-02 22:32:15] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:32:15] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 22:32:15] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 22:32:15] [INFO ] Invariant cache hit.
[2024-06-02 22:32:15] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 22:32:15] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2024-06-02 22:32:15] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 22:32:15] [INFO ] Invariant cache hit.
[2024-06-02 22:32:15] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 22:32:18] [INFO ] Deduced a trap composed of 36 places in 33 ms of which 1 ms to minimize.
[2024-06-02 22:32:18] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 1 ms to minimize.
[2024-06-02 22:32:18] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:32:18] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:32:18] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-06-02 22:32:19] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2024-06-02 22:32:20] [INFO ] Deduced a trap composed of 36 places in 43 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 398/562 variables, 164/179 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 57/236 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 7 (OVERLAPS) 1/563 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 9 (OVERLAPS) 0/563 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 430 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 237 constraints, problems are : Problem set: 0 solved, 430 unsolved in 24342 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 164/164 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (OVERLAPS) 398/562 variables, 164/179 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 57/236 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 430/666 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 22:32:54] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:32:54] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 2/668 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 22:33:06] [INFO ] Deduced a trap composed of 96 places in 83 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/562 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 562/563 variables, and 669 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 164/164 constraints, ReadFeed: 57/58 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 10/10 constraints]
After SMT, in 54716ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 54726ms
Starting structural reductions in LTL mode, iteration 1 : 164/165 places, 431/433 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55121 ms. Remains : 164/165 places, 431/433 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FireWire-PT-11-LTLCardinality-12
Product exploration explored 100000 steps with 16 reset in 163 ms.
Product exploration explored 100000 steps with 1 reset in 162 ms.
Computed a total of 20 stabilizing places and 31 stable transitions
Computed a total of 20 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 89 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 32299 steps (879 resets) in 65 ms. (489 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 431/431 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 164 transition count 427
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 160 transition count 427
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 157 transition count 436
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 157 transition count 430
Applied a total of 20 rules in 26 ms. Remains 157 /164 variables (removed 7) and now considering 430/431 (removed 1) transitions.
[2024-06-02 22:33:11] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
// Phase 1: matrix 391 rows 157 cols
[2024-06-02 22:33:11] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:33:11] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 22:33:11] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2024-06-02 22:33:11] [INFO ] Invariant cache hit.
[2024-06-02 22:33:11] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 22:33:11] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2024-06-02 22:33:11] [INFO ] Redundant transitions in 3 ms returned []
Running 429 sub problems to find dead transitions.
[2024-06-02 22:33:11] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2024-06-02 22:33:11] [INFO ] Invariant cache hit.
[2024-06-02 22:33:11] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-06-02 22:33:14] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 1 ms to minimize.
[2024-06-02 22:33:14] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 2 ms to minimize.
[2024-06-02 22:33:14] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
[2024-06-02 22:33:14] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:33:15] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:33:15] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:33:15] [INFO ] Deduced a trap composed of 35 places in 37 ms of which 0 ms to minimize.
[2024-06-02 22:33:15] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 1 ms to minimize.
[2024-06-02 22:33:16] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 390/547 variables, 157/174 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 59/233 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 7 (OVERLAPS) 1/548 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 429 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 234 constraints, problems are : Problem set: 0 solved, 429 unsolved in 24085 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 429 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 390/547 variables, 157/174 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 59/233 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 429/662 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-06-02 22:33:49] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2024-06-02 22:33:49] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 2/664 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 9 (OVERLAPS) 1/548 variables, 1/665 constraints. Problems are: Problem set: 0 solved, 429 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 665 constraints, problems are : Problem set: 0 solved, 429 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 11/11 constraints]
After SMT, in 54426ms problems are : Problem set: 0 solved, 429 unsolved
Search for dead transitions found 0 dead transitions in 54430ms
Starting structural reductions in SI_LTL mode, iteration 1 : 157/164 places, 430/431 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54792 ms. Remains : 157/164 places, 430/431 transitions.
Computed a total of 16 stabilizing places and 30 stable transitions
Computed a total of 16 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 38538 steps (1130 resets) in 139 ms. (275 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 48 ms.
Product exploration explored 100000 steps with 14 reset in 52 ms.
Support contains 5 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 430/430 transitions.
Applied a total of 0 rules in 8 ms. Remains 157 /157 variables (removed 0) and now considering 430/430 (removed 0) transitions.
[2024-06-02 22:34:06] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2024-06-02 22:34:06] [INFO ] Invariant cache hit.
[2024-06-02 22:34:06] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 22:34:06] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2024-06-02 22:34:06] [INFO ] Invariant cache hit.
[2024-06-02 22:34:06] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 22:34:07] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2024-06-02 22:34:07] [INFO ] Redundant transitions in 3 ms returned []
Running 429 sub problems to find dead transitions.
[2024-06-02 22:34:07] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2024-06-02 22:34:07] [INFO ] Invariant cache hit.
[2024-06-02 22:34:07] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-06-02 22:34:09] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 1 ms to minimize.
[2024-06-02 22:34:10] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 2 ms to minimize.
[2024-06-02 22:34:10] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-06-02 22:34:10] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-06-02 22:34:10] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 1 ms to minimize.
[2024-06-02 22:34:10] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2024-06-02 22:34:10] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:34:11] [INFO ] Deduced a trap composed of 35 places in 43 ms of which 1 ms to minimize.
[2024-06-02 22:34:11] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 390/547 variables, 157/174 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 59/233 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 7 (OVERLAPS) 1/548 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 429 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 234 constraints, problems are : Problem set: 0 solved, 429 unsolved in 24237 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 429 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 390/547 variables, 157/174 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 59/233 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 429/662 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-06-02 22:34:45] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-06-02 22:34:45] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 2/664 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 429 unsolved
SMT process timed out in 54559ms, After SMT, problems are : Problem set: 0 solved, 429 unsolved
Search for dead transitions found 0 dead transitions in 54564ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 54948 ms. Remains : 157/157 places, 430/430 transitions.
Treatment of property FireWire-PT-11-LTLCardinality-12 finished in 166528 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)))'
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((F(p1)||p0))))'
Found a Lengthening insensitive property : FireWire-PT-11-LTLCardinality-12
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 165 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 165/165 places, 433/433 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 165 transition count 429
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 161 transition count 429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 160 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 160 transition count 427
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 16 place count 157 transition count 436
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 157 transition count 433
Applied a total of 19 rules in 27 ms. Remains 157 /165 variables (removed 8) and now considering 433/433 (removed 0) transitions.
[2024-06-02 22:35:02] [INFO ] Flow matrix only has 394 transitions (discarded 39 similar events)
// Phase 1: matrix 394 rows 157 cols
[2024-06-02 22:35:02] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 22:35:02] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-06-02 22:35:02] [INFO ] Flow matrix only has 394 transitions (discarded 39 similar events)
[2024-06-02 22:35:02] [INFO ] Invariant cache hit.
[2024-06-02 22:35:02] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 22:35:02] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Running 432 sub problems to find dead transitions.
[2024-06-02 22:35:02] [INFO ] Flow matrix only has 394 transitions (discarded 39 similar events)
[2024-06-02 22:35:02] [INFO ] Invariant cache hit.
[2024-06-02 22:35:02] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-02 22:35:05] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 1 ms to minimize.
[2024-06-02 22:35:05] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 0 ms to minimize.
[2024-06-02 22:35:05] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:35:05] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:35:06] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-06-02 22:35:06] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 0 ms to minimize.
[2024-06-02 22:35:07] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (OVERLAPS) 393/550 variables, 157/172 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 59/231 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 7 (OVERLAPS) 1/551 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 9 (OVERLAPS) 0/551 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 432 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 232 constraints, problems are : Problem set: 0 solved, 432 unsolved in 24295 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (OVERLAPS) 393/550 variables, 157/172 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 59/231 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 432/663 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-06-02 22:35:40] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-06-02 22:35:40] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 2/665 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 9 (OVERLAPS) 1/551 variables, 1/666 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 666 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 9/9 constraints]
After SMT, in 54700ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 54705ms
Starting structural reductions in LI_LTL mode, iteration 1 : 157/165 places, 433/433 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 55137 ms. Remains : 157/165 places, 433/433 transitions.
Running random walk in product with property : FireWire-PT-11-LTLCardinality-12
Product exploration explored 100000 steps with 1 reset in 45 ms.
Product exploration explored 100000 steps with 3 reset in 50 ms.
Computed a total of 16 stabilizing places and 30 stable transitions
Computed a total of 16 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 81 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 12692 steps (383 resets) in 70 ms. (178 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 5 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 433/433 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 157 transition count 430
Applied a total of 3 rules in 19 ms. Remains 157 /157 variables (removed 0) and now considering 430/433 (removed 3) transitions.
[2024-06-02 22:35:57] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
// Phase 1: matrix 391 rows 157 cols
[2024-06-02 22:35:57] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:35:57] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 22:35:57] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2024-06-02 22:35:57] [INFO ] Invariant cache hit.
[2024-06-02 22:35:57] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 22:35:58] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2024-06-02 22:35:58] [INFO ] Redundant transitions in 4 ms returned []
Running 429 sub problems to find dead transitions.
[2024-06-02 22:35:58] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2024-06-02 22:35:58] [INFO ] Invariant cache hit.
[2024-06-02 22:35:58] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-06-02 22:36:00] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:36:01] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2024-06-02 22:36:01] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2024-06-02 22:36:01] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-06-02 22:36:01] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:36:01] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 0 ms to minimize.
[2024-06-02 22:36:01] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 0 ms to minimize.
[2024-06-02 22:36:02] [INFO ] Deduced a trap composed of 35 places in 34 ms of which 0 ms to minimize.
[2024-06-02 22:36:02] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 390/547 variables, 157/174 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 59/233 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 7 (OVERLAPS) 1/548 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 429 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 234 constraints, problems are : Problem set: 0 solved, 429 unsolved in 24469 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 429 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 390/547 variables, 157/174 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 59/233 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 429/662 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-06-02 22:36:36] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
[2024-06-02 22:36:36] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 2/664 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 429 unsolved
SMT process timed out in 54811ms, After SMT, problems are : Problem set: 0 solved, 429 unsolved
Search for dead transitions found 0 dead transitions in 54816ms
Starting structural reductions in SI_LTL mode, iteration 1 : 157/157 places, 430/433 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55176 ms. Remains : 157/157 places, 430/433 transitions.
Computed a total of 16 stabilizing places and 30 stable transitions
Computed a total of 16 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 24973 steps (745 resets) in 62 ms. (396 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 3 reset in 49 ms.
Product exploration explored 100000 steps with 3 reset in 50 ms.
Support contains 5 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 430/430 transitions.
Applied a total of 0 rules in 6 ms. Remains 157 /157 variables (removed 0) and now considering 430/430 (removed 0) transitions.
[2024-06-02 22:36:53] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2024-06-02 22:36:53] [INFO ] Invariant cache hit.
[2024-06-02 22:36:53] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 22:36:53] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2024-06-02 22:36:53] [INFO ] Invariant cache hit.
[2024-06-02 22:36:53] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 22:36:53] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-06-02 22:36:53] [INFO ] Redundant transitions in 4 ms returned []
Running 429 sub problems to find dead transitions.
[2024-06-02 22:36:54] [INFO ] Flow matrix only has 391 transitions (discarded 39 similar events)
[2024-06-02 22:36:54] [INFO ] Invariant cache hit.
[2024-06-02 22:36:54] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-06-02 22:36:56] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 1 ms to minimize.
[2024-06-02 22:36:57] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2024-06-02 22:36:57] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-06-02 22:36:57] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-06-02 22:36:57] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2024-06-02 22:36:57] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2024-06-02 22:36:57] [INFO ] Deduced a trap composed of 35 places in 33 ms of which 1 ms to minimize.
[2024-06-02 22:36:58] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:36:58] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 390/547 variables, 157/174 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 59/233 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 7 (OVERLAPS) 1/548 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 429 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 234 constraints, problems are : Problem set: 0 solved, 429 unsolved in 24604 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 429/429 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 429 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 4 (OVERLAPS) 390/547 variables, 157/174 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 59/233 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 429/662 constraints. Problems are: Problem set: 0 solved, 429 unsolved
[2024-06-02 22:37:32] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2024-06-02 22:37:32] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 2/664 constraints. Problems are: Problem set: 0 solved, 429 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 429 unsolved
SMT process timed out in 54922ms, After SMT, problems are : Problem set: 0 solved, 429 unsolved
Search for dead transitions found 0 dead transitions in 54926ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55279 ms. Remains : 157/157 places, 430/430 transitions.
Treatment of property FireWire-PT-11-LTLCardinality-12 finished in 167138 ms.
[2024-06-02 22:37:48] [INFO ] Flatten gal took : 27 ms
[2024-06-02 22:37:48] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-02 22:37:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 165 places, 433 transitions and 1585 arcs took 6 ms.
Total runtime 448808 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-11

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 1477
MODEL NAME: /home/mcc/execution/414/model
165 places, 433 transitions.

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

BK_STOP 1717368164955

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

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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