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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K 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 84K 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-01-LTLCardinality-00
FORMULA_NAME FireWire-PT-01-LTLCardinality-01
FORMULA_NAME FireWire-PT-01-LTLCardinality-02
FORMULA_NAME FireWire-PT-01-LTLCardinality-03
FORMULA_NAME FireWire-PT-01-LTLCardinality-04
FORMULA_NAME FireWire-PT-01-LTLCardinality-05
FORMULA_NAME FireWire-PT-01-LTLCardinality-06
FORMULA_NAME FireWire-PT-01-LTLCardinality-07
FORMULA_NAME FireWire-PT-01-LTLCardinality-08
FORMULA_NAME FireWire-PT-01-LTLCardinality-09
FORMULA_NAME FireWire-PT-01-LTLCardinality-10
FORMULA_NAME FireWire-PT-01-LTLCardinality-11
FORMULA_NAME FireWire-PT-01-LTLCardinality-12
FORMULA_NAME FireWire-PT-01-LTLCardinality-13
FORMULA_NAME FireWire-PT-01-LTLCardinality-14
FORMULA_NAME FireWire-PT-01-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717365096945

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-01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 21:51:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 21:51:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:51:38] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-06-02 21:51:38] [INFO ] Transformed 107 places.
[2024-06-02 21:51:38] [INFO ] Transformed 346 transitions.
[2024-06-02 21:51:38] [INFO ] Found NUPN structural information;
[2024-06-02 21:51:38] [INFO ] Parsed PT model containing 107 places and 346 transitions and 1271 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 53 transitions
Reduce redundant transitions removed 53 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-01-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-01-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-01-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-01-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-01-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-01-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-01-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-01-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-01-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 293/293 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 106 transition count 291
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 106 transition count 291
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 8 place count 106 transition count 285
Applied a total of 8 rules in 33 ms. Remains 106 /107 variables (removed 1) and now considering 285/293 (removed 8) transitions.
[2024-06-02 21:51:38] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 106 cols
[2024-06-02 21:51:38] [INFO ] Computed 8 invariants in 16 ms
[2024-06-02 21:51:38] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-06-02 21:51:38] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
[2024-06-02 21:51:38] [INFO ] Invariant cache hit.
[2024-06-02 21:51:39] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 21:51:39] [INFO ] Implicit Places using invariants and state equation in 324 ms returned [104]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 678 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/107 places, 285/293 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 285/285 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 732 ms. Remains : 105/107 places, 285/293 transitions.
Support contains 24 out of 105 places after structural reductions.
[2024-06-02 21:51:39] [INFO ] Flatten gal took : 57 ms
[2024-06-02 21:51:39] [INFO ] Flatten gal took : 26 ms
[2024-06-02 21:51:39] [INFO ] Input system was already deterministic with 285 transitions.
RANDOM walk for 40000 steps (2212 resets) in 1867 ms. (21 steps per ms) remains 4/13 properties
BEST_FIRST walk for 40004 steps (620 resets) in 316 ms. (126 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (560 resets) in 149 ms. (266 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (600 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (531 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
[2024-06-02 21:51:40] [INFO ] Flow matrix only has 259 transitions (discarded 26 similar events)
// Phase 1: matrix 259 rows 105 cols
[2024-06-02 21:51:40] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 21:51:40] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 1 (OVERLAPS) 87/97 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/101 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 255/356 variables, 101/108 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 38/146 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 0/146 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 4/360 variables, 2/148 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 1/149 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 3/363 variables, 2/151 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/363 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/364 variables, 1/152 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/364 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/364 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 152 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1313 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 91/97 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-02 21:51:42] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 4/101 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 255/356 variables, 101/109 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 38/147 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 2/149 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-02 21:51:42] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 1/150 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/356 variables, 0/150 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 4/360 variables, 2/152 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 1/153 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/360 variables, 1/154 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-02 21:51:42] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 1/155 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/360 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 3/363 variables, 2/157 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/363 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 1/364 variables, 1/158 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/364 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/364 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/364 variables, and 158 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1068 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 2427ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 222 ms.
Support contains 6 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 285/285 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 105 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 104 transition count 281
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 104 transition count 280
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 103 transition count 280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 10 place count 100 transition count 271
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 100 transition count 271
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 16 place count 97 transition count 265
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 97 transition count 265
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 95 transition count 269
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 27 place count 95 transition count 265
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 29 place count 95 transition count 263
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 32 place count 95 transition count 293
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 39 place count 92 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 57 place count 92 transition count 271
Applied a total of 57 rules in 121 ms. Remains 92 /105 variables (removed 13) and now considering 271/285 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 92/105 places, 271/285 transitions.
RANDOM walk for 40000 steps (2354 resets) in 763 ms. (52 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (765 resets) in 93 ms. (425 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (674 resets) in 107 ms. (370 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (678 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 836471 steps, run visited all 3 properties in 2555 ms. (steps per millisecond=327 )
Probabilistic random walk after 836471 steps, saw 174127 distinct states, run finished after 2560 ms. (steps per millisecond=326 ) properties seen :3
FORMULA FireWire-PT-01-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
FORMULA FireWire-PT-01-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 7 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' '!(G((X(G(p0))||F(p1))))'
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 285/285 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 103 transition count 279
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 103 transition count 279
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 101 transition count 275
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 101 transition count 275
Applied a total of 8 rules in 7 ms. Remains 101 /105 variables (removed 4) and now considering 275/285 (removed 10) transitions.
[2024-06-02 21:51:46] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
// Phase 1: matrix 249 rows 101 cols
[2024-06-02 21:51:46] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:51:46] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 21:51:46] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
[2024-06-02 21:51:46] [INFO ] Invariant cache hit.
[2024-06-02 21:51:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 21:51:46] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2024-06-02 21:51:46] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
[2024-06-02 21:51:46] [INFO ] Invariant cache hit.
[2024-06-02 21:51:46] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-06-02 21:51:48] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 2 ms to minimize.
[2024-06-02 21:51:48] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:51:48] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:51:48] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-06-02 21:51:48] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-06-02 21:51:48] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-06-02 21:51:48] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 248/349 variables, 101/115 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 37/152 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (OVERLAPS) 1/350 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-06-02 21:51:53] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 10 (OVERLAPS) 0/350 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 154 constraints, problems are : Problem set: 0 solved, 274 unsolved in 12346 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 248/349 variables, 101/116 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/349 variables, 37/153 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 274/427 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (OVERLAPS) 1/350 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 10 (OVERLAPS) 0/350 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Int declared 350/350 variables, and 428 constraints, problems are : Problem set: 0 solved, 274 unsolved in 16956 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 8/8 constraints]
After SMT, in 29531ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 29537ms
Starting structural reductions in LTL mode, iteration 1 : 101/105 places, 275/285 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29783 ms. Remains : 101/105 places, 275/285 transitions.
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FireWire-PT-01-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 146 ms.
Product exploration explored 100000 steps with 4 reset in 82 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 83 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (2192 resets) in 239 ms. (166 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (16 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
[2024-06-02 21:52:17] [INFO ] Flow matrix only has 249 transitions (discarded 26 similar events)
[2024-06-02 21:52:17] [INFO ] Invariant cache hit.
[2024-06-02 21:52:17] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 61/97 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 245/342 variables, 97/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 36/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/346 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/346 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/346 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/349 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/350 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/350 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 146 constraints, problems are : Problem set: 0 solved, 1 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 36/350 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 3/7 constraints, State Equation: 0/101 constraints, ReadFeed: 0/38 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 138ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 13 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-01-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-01-LTLCardinality-00 finished in 30891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 285/285 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 103 transition count 283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 103 transition count 282
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 102 transition count 282
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 100 transition count 276
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 100 transition count 276
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 98 transition count 272
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 98 transition count 272
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 95 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 95 transition count 273
Applied a total of 24 rules in 35 ms. Remains 95 /105 variables (removed 10) and now considering 273/285 (removed 12) transitions.
[2024-06-02 21:52:17] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
// Phase 1: matrix 240 rows 95 cols
[2024-06-02 21:52:17] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:52:17] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 21:52:17] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
[2024-06-02 21:52:17] [INFO ] Invariant cache hit.
[2024-06-02 21:52:17] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 21:52:17] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-06-02 21:52:17] [INFO ] Redundant transitions in 17 ms returned []
Running 270 sub problems to find dead transitions.
[2024-06-02 21:52:17] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
[2024-06-02 21:52:17] [INFO ] Invariant cache hit.
[2024-06-02 21:52:17] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:52:18] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 0 ms to minimize.
[2024-06-02 21:52:18] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-06-02 21:52:18] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
[2024-06-02 21:52:18] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 8 ms to minimize.
[2024-06-02 21:52:18] [INFO ] Deduced a trap composed of 34 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:52:19] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:52:19] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 239/333 variables, 94/108 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 38/146 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:52:22] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 1/334 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 0/334 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/335 variables, and 148 constraints, problems are : Problem set: 0 solved, 270 unsolved in 11801 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 239/333 variables, 94/109 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 38/147 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 270/417 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 1/334 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 0/334 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/335 variables, and 418 constraints, problems are : Problem set: 0 solved, 270 unsolved in 15678 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 8/8 constraints]
After SMT, in 27649ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 27653ms
Starting structural reductions in SI_LTL mode, iteration 1 : 95/105 places, 273/285 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27925 ms. Remains : 95/105 places, 273/285 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-01-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 82 ms.
Product exploration explored 100000 steps with 0 reset in 88 ms.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 24285 steps (1567 resets) in 43 ms. (551 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 273/273 transitions.
Applied a total of 0 rules in 11 ms. Remains 95 /95 variables (removed 0) and now considering 273/273 (removed 0) transitions.
[2024-06-02 21:52:46] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
[2024-06-02 21:52:46] [INFO ] Invariant cache hit.
[2024-06-02 21:52:46] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 21:52:46] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
[2024-06-02 21:52:46] [INFO ] Invariant cache hit.
[2024-06-02 21:52:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 21:52:46] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-06-02 21:52:46] [INFO ] Redundant transitions in 3 ms returned []
Running 270 sub problems to find dead transitions.
[2024-06-02 21:52:46] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
[2024-06-02 21:52:46] [INFO ] Invariant cache hit.
[2024-06-02 21:52:46] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:52:47] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-06-02 21:52:47] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-06-02 21:52:47] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-02 21:52:47] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2024-06-02 21:52:47] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:52:47] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-02 21:52:47] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 239/333 variables, 94/108 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 38/146 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:52:50] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 1/334 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 0/334 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/335 variables, and 148 constraints, problems are : Problem set: 0 solved, 270 unsolved in 11430 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 239/333 variables, 94/109 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 38/147 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 270/417 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 1/334 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 0/334 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/335 variables, and 418 constraints, problems are : Problem set: 0 solved, 270 unsolved in 15601 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 8/8 constraints]
After SMT, in 27202ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 27205ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 27416 ms. Remains : 95/95 places, 273/273 transitions.
Computed a total of 2 stabilizing places and 5 stable transitions
Computed a total of 2 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 31921 steps (2048 resets) in 84 ms. (375 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 47 ms.
Product exploration explored 100000 steps with 0 reset in 64 ms.
Support contains 2 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 273/273 transitions.
Applied a total of 0 rules in 6 ms. Remains 95 /95 variables (removed 0) and now considering 273/273 (removed 0) transitions.
[2024-06-02 21:53:14] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
[2024-06-02 21:53:14] [INFO ] Invariant cache hit.
[2024-06-02 21:53:14] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 21:53:14] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
[2024-06-02 21:53:14] [INFO ] Invariant cache hit.
[2024-06-02 21:53:14] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 21:53:14] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-06-02 21:53:14] [INFO ] Redundant transitions in 4 ms returned []
Running 270 sub problems to find dead transitions.
[2024-06-02 21:53:14] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
[2024-06-02 21:53:14] [INFO ] Invariant cache hit.
[2024-06-02 21:53:14] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:53:15] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-06-02 21:53:15] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 0 ms to minimize.
[2024-06-02 21:53:15] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2024-06-02 21:53:15] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-02 21:53:15] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:53:15] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-06-02 21:53:15] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 239/333 variables, 94/108 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 38/146 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:53:18] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 1/334 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 0/334 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/335 variables, and 148 constraints, problems are : Problem set: 0 solved, 270 unsolved in 11644 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 239/333 variables, 94/109 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 38/147 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 270/417 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 1/334 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 0/334 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/335 variables, and 418 constraints, problems are : Problem set: 0 solved, 270 unsolved in 16263 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 8/8 constraints]
After SMT, in 28064ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 28067ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 28289 ms. Remains : 95/95 places, 273/273 transitions.
Treatment of property FireWire-PT-01-LTLCardinality-01 finished in 84988 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))&&(X(F(p1)) U (X(X(p0))&&p2))))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 285/285 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 102 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 102 transition count 276
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 99 transition count 270
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 99 transition count 270
Applied a total of 12 rules in 3 ms. Remains 99 /105 variables (removed 6) and now considering 270/285 (removed 15) transitions.
[2024-06-02 21:53:42] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
// Phase 1: matrix 244 rows 99 cols
[2024-06-02 21:53:42] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:53:42] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 21:53:42] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 21:53:42] [INFO ] Invariant cache hit.
[2024-06-02 21:53:42] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 21:53:42] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-06-02 21:53:42] [INFO ] Flow matrix only has 244 transitions (discarded 26 similar events)
[2024-06-02 21:53:42] [INFO ] Invariant cache hit.
[2024-06-02 21:53:42] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-06-02 21:53:43] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:53:44] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 0 ms to minimize.
[2024-06-02 21:53:44] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 0 ms to minimize.
[2024-06-02 21:53:44] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-06-02 21:53:44] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 2 ms to minimize.
[2024-06-02 21:53:44] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2024-06-02 21:53:44] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-06-02 21:53:44] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 0 ms to minimize.
[2024-06-02 21:53:44] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
[2024-06-02 21:53:44] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-02 21:53:44] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 1/343 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (OVERLAPS) 0/343 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 154 constraints, problems are : Problem set: 0 solved, 269 unsolved in 10160 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 243/342 variables, 99/117 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 36/153 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 269/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 1/343 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 423 constraints, problems are : Problem set: 0 solved, 269 unsolved in 15003 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 99/99 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 11/11 constraints]
After SMT, in 25308ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 25311ms
Starting structural reductions in LTL mode, iteration 1 : 99/105 places, 270/285 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25511 ms. Remains : 99/105 places, 270/285 transitions.
Stuttering acceptance computed with spot in 195 ms :[true, (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : FireWire-PT-01-LTLCardinality-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-01-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-01-LTLCardinality-03 finished in 25729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||G(p1))))'
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 285/285 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 102 transition count 276
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 102 transition count 276
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 101 transition count 274
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 101 transition count 274
Applied a total of 8 rules in 8 ms. Remains 101 /105 variables (removed 4) and now considering 274/285 (removed 11) transitions.
[2024-06-02 21:54:08] [INFO ] Flow matrix only has 248 transitions (discarded 26 similar events)
// Phase 1: matrix 248 rows 101 cols
[2024-06-02 21:54:08] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:54:08] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 21:54:08] [INFO ] Flow matrix only has 248 transitions (discarded 26 similar events)
[2024-06-02 21:54:08] [INFO ] Invariant cache hit.
[2024-06-02 21:54:08] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-06-02 21:54:08] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 273 sub problems to find dead transitions.
[2024-06-02 21:54:08] [INFO ] Flow matrix only has 248 transitions (discarded 26 similar events)
[2024-06-02 21:54:08] [INFO ] Invariant cache hit.
[2024-06-02 21:54:08] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 273 unsolved
[2024-06-02 21:54:09] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2024-06-02 21:54:09] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-06-02 21:54:10] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2024-06-02 21:54:10] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-06-02 21:54:10] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:54:10] [INFO ] Deduced a trap composed of 36 places in 26 ms of which 0 ms to minimize.
[2024-06-02 21:54:10] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 247/348 variables, 101/115 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 36/151 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (OVERLAPS) 1/349 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 273 unsolved
[2024-06-02 21:54:14] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 10 (OVERLAPS) 0/349 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 153 constraints, problems are : Problem set: 0 solved, 273 unsolved in 11537 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 273 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 4 (OVERLAPS) 247/348 variables, 101/116 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/348 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/348 variables, 273/425 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/348 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 8 (OVERLAPS) 1/349 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 273 unsolved
At refinement iteration 10 (OVERLAPS) 0/349 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 273 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 426 constraints, problems are : Problem set: 0 solved, 273 unsolved in 15583 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 273/273 constraints, Known Traps: 8/8 constraints]
After SMT, in 27318ms problems are : Problem set: 0 solved, 273 unsolved
Search for dead transitions found 0 dead transitions in 27320ms
Starting structural reductions in LTL mode, iteration 1 : 101/105 places, 274/285 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27542 ms. Remains : 101/105 places, 274/285 transitions.
Stuttering acceptance computed with spot in 181 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FireWire-PT-01-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 146 ms.
Product exploration explored 100000 steps with 0 reset in 111 ms.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 140 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2173 resets) in 204 ms. (195 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (552 resets) in 273 ms. (145 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (567 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (582 resets) in 117 ms. (339 steps per ms) remains 3/3 properties
[2024-06-02 21:54:36] [INFO ] Flow matrix only has 248 transitions (discarded 26 similar events)
[2024-06-02 21:54:36] [INFO ] Invariant cache hit.
[2024-06-02 21:54:36] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 55/60 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 37/97 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 244/341 variables, 97/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 35/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 4/345 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 3/348 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/348 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/349 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/349 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/349 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 145 constraints, problems are : Problem set: 0 solved, 3 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf5 is UNSAT
At refinement iteration 1 (OVERLAPS) 55/60 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 37/97 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 244/341 variables, 97/104 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 35/139 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 2/141 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/141 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/345 variables, 2/143 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 1/144 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/348 variables, 2/146 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/348 variables, 0/146 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/349 variables, 1/147 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/349 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/349 variables, 0/147 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 147 constraints, problems are : Problem set: 1 solved, 2 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 357ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 70 ms.
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 274/274 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 101 transition count 270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 100 transition count 270
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 100 transition count 269
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 99 transition count 269
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 96 transition count 276
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 19 place count 96 transition count 270
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 96 transition count 267
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 96 transition count 270
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 29 place count 94 transition count 267
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 31 place count 94 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 93 transition count 264
Applied a total of 32 rules in 33 ms. Remains 93 /101 variables (removed 8) and now considering 264/274 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 93/101 places, 264/274 transitions.
RANDOM walk for 40000 steps (2627 resets) in 190 ms. (209 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (641 resets) in 105 ms. (377 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (639 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 3911 steps, run visited all 2 properties in 37 ms. (steps per millisecond=105 )
Probabilistic random walk after 3911 steps, saw 1916 distinct states, run finished after 37 ms. (steps per millisecond=105 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (G (OR (NOT p1) p0))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR p1 p0)))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 14 factoid took 211 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-01-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-01-LTLCardinality-06 finished in 29387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 285/285 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 103 transition count 283
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 103 transition count 282
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 102 transition count 282
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 100 transition count 276
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 100 transition count 276
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 98 transition count 272
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 98 transition count 272
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 95 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 95 transition count 273
Applied a total of 24 rules in 29 ms. Remains 95 /105 variables (removed 10) and now considering 273/285 (removed 12) transitions.
[2024-06-02 21:54:37] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
// Phase 1: matrix 240 rows 95 cols
[2024-06-02 21:54:37] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:54:37] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 21:54:37] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
[2024-06-02 21:54:37] [INFO ] Invariant cache hit.
[2024-06-02 21:54:37] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-06-02 21:54:37] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-06-02 21:54:37] [INFO ] Redundant transitions in 1 ms returned []
Running 270 sub problems to find dead transitions.
[2024-06-02 21:54:37] [INFO ] Flow matrix only has 240 transitions (discarded 33 similar events)
[2024-06-02 21:54:37] [INFO ] Invariant cache hit.
[2024-06-02 21:54:37] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:54:38] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-06-02 21:54:38] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 2 ms to minimize.
[2024-06-02 21:54:38] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:54:38] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:54:39] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:54:39] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-06-02 21:54:39] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 239/333 variables, 94/108 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 38/146 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-06-02 21:54:42] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 1/334 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 0/334 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/335 variables, and 148 constraints, problems are : Problem set: 0 solved, 270 unsolved in 11680 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (OVERLAPS) 239/333 variables, 94/109 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 38/147 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 270/417 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 1/334 variables, 1/418 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 9 (OVERLAPS) 0/334 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/335 variables, and 418 constraints, problems are : Problem set: 0 solved, 270 unsolved in 16136 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 95/95 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 8/8 constraints]
After SMT, in 27985ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 27989ms
Starting structural reductions in SI_LTL mode, iteration 1 : 95/105 places, 273/285 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28204 ms. Remains : 95/105 places, 273/285 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-01-LTLCardinality-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-01-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-01-LTLCardinality-14 finished in 28267 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)))'
[2024-06-02 21:55:05] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:55:06] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-02 21:55:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 105 places, 285 transitions and 1030 arcs took 5 ms.
Total runtime 207817 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-01

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 105
TRANSITIONS: 285
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.008s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 1091
MODEL NAME: /home/mcc/execution/412/model
105 places, 285 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-01-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717365310258

--------------------
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-01"
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-01, 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-171734898000171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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