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.r504-tall-171649612900483.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is MAPK-PT-05120, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612900483
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 07:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 13 07:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 07:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 13 07:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 25K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MAPK-PT-05120-LTLCardinality-00
FORMULA_NAME MAPK-PT-05120-LTLCardinality-01
FORMULA_NAME MAPK-PT-05120-LTLCardinality-02
FORMULA_NAME MAPK-PT-05120-LTLCardinality-03
FORMULA_NAME MAPK-PT-05120-LTLCardinality-04
FORMULA_NAME MAPK-PT-05120-LTLCardinality-05
FORMULA_NAME MAPK-PT-05120-LTLCardinality-06
FORMULA_NAME MAPK-PT-05120-LTLCardinality-07
FORMULA_NAME MAPK-PT-05120-LTLCardinality-08
FORMULA_NAME MAPK-PT-05120-LTLCardinality-09
FORMULA_NAME MAPK-PT-05120-LTLCardinality-10
FORMULA_NAME MAPK-PT-05120-LTLCardinality-11
FORMULA_NAME MAPK-PT-05120-LTLCardinality-12
FORMULA_NAME MAPK-PT-05120-LTLCardinality-13
FORMULA_NAME MAPK-PT-05120-LTLCardinality-14
FORMULA_NAME MAPK-PT-05120-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717229671178

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MAPK-PT-05120
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:14:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 08:14:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:14:32] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2024-06-01 08:14:32] [INFO ] Transformed 22 places.
[2024-06-01 08:14:32] [INFO ] Transformed 30 transitions.
[2024-06-01 08:14:32] [INFO ] Parsed PT model containing 22 places and 30 transitions and 90 arcs in 135 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 2 formulas.
FORMULA MAPK-PT-05120-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-05120-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 8 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2024-06-01 08:14:32] [INFO ] Computed 7 invariants in 9 ms
[2024-06-01 08:14:32] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-01 08:14:32] [INFO ] Invariant cache hit.
[2024-06-01 08:14:32] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2024-06-01 08:14:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 2/22 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 30/52 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 29 constraints, problems are : Problem set: 0 solved, 29 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 2/22 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 30/52 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 29/58 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 58 constraints, problems are : Problem set: 0 solved, 29 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
After SMT, in 720ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 728ms
Finished structural reductions in LTL mode , in 1 iterations and 949 ms. Remains : 22/22 places, 30/30 transitions.
Support contains 22 out of 22 places after structural reductions.
[2024-06-01 08:14:33] [INFO ] Flatten gal took : 15 ms
[2024-06-01 08:14:33] [INFO ] Flatten gal took : 7 ms
[2024-06-01 08:14:33] [INFO ] Input system was already deterministic with 30 transitions.
RANDOM walk for 41007 steps (8 resets) in 102 ms. (398 steps per ms) remains 27/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 95 ms. (41 steps per ms) remains 17/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 84 ms. (47 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
[2024-06-01 08:14:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 6/22 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 30/52 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 29 constraints, problems are : Problem set: 0 solved, 15 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 6/22 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 30/52 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 15/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/52 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 44 constraints, problems are : Problem set: 0 solved, 15 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 324ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 11 different solutions.
Parikh walk visited 11 properties in 44299 ms.
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 20 transition count 28
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 16 place count 13 transition count 23
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 4 edges and 13 vertex of which 2 / 13 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 22 place count 12 transition count 18
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 4 edges and 11 vertex of which 3 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 9 transition count 16
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 30 place count 9 transition count 12
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 9 transition count 11
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 33 place count 8 transition count 10
Applied a total of 33 rules in 40 ms. Remains 8 /22 variables (removed 14) and now considering 10/30 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 8/22 places, 10/30 transitions.
RANDOM walk for 40984 steps (8 resets) in 283 ms. (144 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 57 ms. (689 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 520324 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 4
Probabilistic random walk after 520324 steps, saw 229596 distinct states, run finished after 3004 ms. (steps per millisecond=173 ) properties seen :0
// Phase 1: matrix 10 rows 8 cols
[2024-06-01 08:15:21] [INFO ] Computed 3 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 10/18 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/18 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 11 constraints, problems are : Problem set: 0 solved, 4 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 10/18 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 15 constraints, problems are : Problem set: 0 solved, 4 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 95ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 11520 steps, including 0 resets, run visited all 2 properties in 65 ms. (steps per millisecond=177 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 6558 ms.
FORMULA MAPK-PT-05120-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 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' '!(F(p0))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 19 place count 11 transition count 22
Graph (trivial) has 8 edges and 11 vertex of which 2 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 10 transition count 22
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 10 transition count 19
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 10 transition count 15
Applied a total of 27 rules in 9 ms. Remains 10 /22 variables (removed 12) and now considering 15/30 (removed 15) transitions.
[2024-06-01 08:15:29] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
// Phase 1: matrix 12 rows 10 cols
[2024-06-01 08:15:29] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 08:15:29] [INFO ] Implicit Places using invariants in 31 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/22 places, 15/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 15/15 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45 ms. Remains : 9/22 places, 15/30 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA MAPK-PT-05120-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-00 finished in 246 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)||G((F(G(p1))&&F(p2))))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2024-06-01 08:15:29] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 08:15:29] [INFO ] Implicit Places using invariants in 31 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 253 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-01
Product exploration explored 100000 steps with 21 reset in 286 ms.
Stack based approach found an accepted trace after 32 steps with 0 reset with depth 33 and stack size 19 in 0 ms.
FORMULA MAPK-PT-05120-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-01 finished in 597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F(p1)&&(p2 U (p3||G(p2)))))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2024-06-01 08:15:29] [INFO ] Invariant cache hit.
[2024-06-01 08:15:29] [INFO ] Implicit Places using invariants in 32 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-05120-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-03 finished in 331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p1)||p0)))))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2024-06-01 08:15:30] [INFO ] Invariant cache hit.
[2024-06-01 08:15:30] [INFO ] Implicit Places using invariants in 34 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 40 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-05120-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-04 finished in 203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(X(G(!p1)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2024-06-01 08:15:30] [INFO ] Invariant cache hit.
[2024-06-01 08:15:30] [INFO ] Implicit Places using invariants in 30 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33 ms. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 229 ms :[p1, (AND (NOT p0) p1), p1, true, (AND (NOT p0) p1), p1, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 2224 steps with 561 reset in 7 ms.
FORMULA MAPK-PT-05120-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-05 finished in 289 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 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 11 rules applied. Total rules applied 14 place count 14 transition count 24
Graph (trivial) has 4 edges and 14 vertex of which 2 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 12 transition count 24
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 12 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 12 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 11 transition count 14
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 10 transition count 13
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 10 transition count 13
Applied a total of 29 rules in 95 ms. Remains 10 /22 variables (removed 12) and now considering 13/30 (removed 17) transitions.
// Phase 1: matrix 13 rows 10 cols
[2024-06-01 08:15:30] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 08:15:30] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 08:15:30] [INFO ] Invariant cache hit.
[2024-06-01 08:15:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 08:15:30] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-06-01 08:15:30] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-06-01 08:15:30] [INFO ] Invariant cache hit.
[2024-06-01 08:15:30] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1/10 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 12/22 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/23 variables, and 16 constraints, problems are : Problem set: 0 solved, 10 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1/10 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 12/22 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 10/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/22 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/23 variables, and 26 constraints, problems are : Problem set: 0 solved, 10 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 145ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 145ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/22 places, 13/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 295 ms. Remains : 10/22 places, 13/30 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-05120-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-06 finished in 339 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2024-06-01 08:15:30] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 08:15:30] [INFO ] Implicit Places using invariants in 32 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-07
Product exploration explored 100000 steps with 692 reset in 123 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA MAPK-PT-05120-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-07 finished in 249 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)&&F(G(p1)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 13 place count 14 transition count 25
Graph (trivial) has 8 edges and 14 vertex of which 2 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 13 transition count 25
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 17 place count 13 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 13 transition count 20
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 13 transition count 20
Applied a total of 20 rules in 5 ms. Remains 13 /22 variables (removed 9) and now considering 20/30 (removed 10) transitions.
[2024-06-01 08:15:31] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 13 cols
[2024-06-01 08:15:31] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 08:15:31] [INFO ] Implicit Places using invariants in 27 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/22 places, 20/30 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 19
Applied a total of 1 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 19/20 (removed 1) transitions.
[2024-06-01 08:15:31] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
// Phase 1: matrix 16 rows 12 cols
[2024-06-01 08:15:31] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 08:15:31] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 08:15:31] [INFO ] Flow matrix only has 16 transitions (discarded 3 similar events)
[2024-06-01 08:15:31] [INFO ] Invariant cache hit.
[2024-06-01 08:15:31] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/22 places, 19/30 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 86 ms. Remains : 12/22 places, 19/30 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-05120-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-08 finished in 313 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||(F(p2)&&p1)))))'
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 17 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 17 transition count 24
Applied a total of 11 rules in 4 ms. Remains 17 /22 variables (removed 5) and now considering 24/30 (removed 6) transitions.
[2024-06-01 08:15:31] [INFO ] Flow matrix only has 22 transitions (discarded 2 similar events)
// Phase 1: matrix 22 rows 17 cols
[2024-06-01 08:15:31] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 08:15:31] [INFO ] Implicit Places using invariants in 37 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/22 places, 24/30 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 16 transition count 23
Applied a total of 1 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 23/24 (removed 1) transitions.
[2024-06-01 08:15:31] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
// Phase 1: matrix 21 rows 16 cols
[2024-06-01 08:15:31] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 08:15:31] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 08:15:31] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
[2024-06-01 08:15:31] [INFO ] Invariant cache hit.
[2024-06-01 08:15:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 08:15:31] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/22 places, 23/30 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 111 ms. Remains : 16/22 places, 23/30 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-09
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-05120-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-09 finished in 246 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(G(p1)))) U G((!p1||X(F((!p1&&F(p1))))))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 17 place count 12 transition count 23
Graph (trivial) has 8 edges and 12 vertex of which 2 / 12 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 19 place count 10 transition count 23
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 7 edges and 10 vertex of which 3 / 10 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 24 place count 8 transition count 19
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 30 place count 8 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 8 transition count 11
Applied a total of 32 rules in 6 ms. Remains 8 /22 variables (removed 14) and now considering 11/30 (removed 19) transitions.
// Phase 1: matrix 11 rows 8 cols
[2024-06-01 08:15:31] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 08:15:31] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 08:15:31] [INFO ] Invariant cache hit.
[2024-06-01 08:15:31] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-06-01 08:15:31] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-06-01 08:15:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 10/18 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/19 variables, and 11 constraints, problems are : Problem set: 0 solved, 9 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 10/18 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 20 constraints, problems are : Problem set: 0 solved, 9 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 135ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 135ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/22 places, 11/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 187 ms. Remains : 8/22 places, 11/30 transitions.
Stuttering acceptance computed with spot in 344 ms :[p1, false, (NOT p1), (AND (NOT p1) (NOT p0)), p1, p1, true, (NOT p1)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-10
Product exploration explored 100000 steps with 0 reset in 125 ms.
Product exploration explored 100000 steps with 0 reset in 197 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 140 ms. Reduced automaton from 8 states, 20 edges and 2 AP (stutter insensitive) to 8 states, 20 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 333 ms :[p1, false, (NOT p1), (AND (NOT p1) (NOT p0)), p1, p1, true, (NOT p1)]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 46100 steps (8 resets) in 35 ms. (1280 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 172 ms. (231 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 672145 steps, run timeout after 3003 ms. (steps per millisecond=223 ) properties seen :3 out of 6
Probabilistic random walk after 672145 steps, saw 331034 distinct states, run finished after 3004 ms. (steps per millisecond=223 ) properties seen :3
[2024-06-01 08:15:36] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 10/18 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/18 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/19 variables, and 11 constraints, problems are : Problem set: 0 solved, 3 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf6 is UNSAT
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/18 variables, 8/11 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 2/13 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 13 constraints, problems are : Problem set: 1 solved, 2 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 79ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 7682 steps, including 0 resets, run visited all 2 properties in 55 ms. (steps per millisecond=139 )
Parikh walk visited 2 properties in 54 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 14 factoid took 415 ms. Reduced automaton from 8 states, 20 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 293 ms :[p1, (AND (NOT p1) (NOT p0)), p1, p1, true, (NOT p1), false]
Stuttering acceptance computed with spot in 284 ms :[p1, (AND (NOT p1) (NOT p0)), p1, p1, true, (NOT p1), false]
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-06-01 08:15:37] [INFO ] Invariant cache hit.
[2024-06-01 08:15:37] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 08:15:37] [INFO ] Invariant cache hit.
[2024-06-01 08:15:37] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-06-01 08:15:37] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-06-01 08:15:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 10/18 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/19 variables, and 11 constraints, problems are : Problem set: 0 solved, 9 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 10/18 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 20 constraints, problems are : Problem set: 0 solved, 9 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 125ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 126ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 184 ms. Remains : 8/8 places, 11/11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 97 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 252 ms :[p1, (AND (NOT p1) (NOT p0)), p1, p1, true, (NOT p1), false]
RANDOM walk for 46103 steps (8 resets) in 12 ms. (3546 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 17 ms. (2222 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 928982 steps, run timeout after 3001 ms. (steps per millisecond=309 ) properties seen :2 out of 4
Probabilistic random walk after 928982 steps, saw 448475 distinct states, run finished after 3002 ms. (steps per millisecond=309 ) properties seen :2
[2024-06-01 08:15:41] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/18 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/18 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/19 variables, and 11 constraints, problems are : Problem set: 0 solved, 2 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf3 is UNSAT
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/18 variables, 8/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 12 constraints, problems are : Problem set: 1 solved, 1 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 72ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 7682 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=1097 )
Parikh walk visited 1 properties in 7 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 222 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 366 ms :[p1, (AND (NOT p1) (NOT p0)), p1, p1, true, (NOT p1), false]
Stuttering acceptance computed with spot in 278 ms :[p1, (AND (NOT p1) (NOT p0)), p1, p1, true, (NOT p1), false]
Stuttering acceptance computed with spot in 247 ms :[p1, (AND (NOT p1) (NOT p0)), p1, p1, true, (NOT p1), false]
Product exploration explored 100000 steps with 0 reset in 87 ms.
Product exploration explored 100000 steps with 0 reset in 192 ms.
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-06-01 08:15:42] [INFO ] Invariant cache hit.
[2024-06-01 08:15:42] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 08:15:42] [INFO ] Invariant cache hit.
[2024-06-01 08:15:42] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-06-01 08:15:42] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-06-01 08:15:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 10/18 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/19 variables, and 11 constraints, problems are : Problem set: 0 solved, 9 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 10/18 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 20 constraints, problems are : Problem set: 0 solved, 9 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 129ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 130ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 176 ms. Remains : 8/8 places, 11/11 transitions.
Treatment of property MAPK-PT-05120-LTLCardinality-10 finished in 11156 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 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 15 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 15 transition count 21
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 15 transition count 21
Applied a total of 18 rules in 3 ms. Remains 15 /22 variables (removed 7) and now considering 21/30 (removed 9) transitions.
[2024-06-01 08:15:42] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
// Phase 1: matrix 18 rows 15 cols
[2024-06-01 08:15:42] [INFO ] Computed 6 invariants in 0 ms
[2024-06-01 08:15:42] [INFO ] Implicit Places using invariants in 26 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/22 places, 21/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 21/21 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31 ms. Remains : 14/22 places, 21/30 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-11
Stuttering criterion allowed to conclude after 46 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-05120-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-05120-LTLCardinality-11 finished in 81 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(G(p1)))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2024-06-01 08:15:43] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 08:15:43] [INFO ] Implicit Places using invariants in 43 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 269 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 155 ms.
Product exploration explored 100000 steps with 0 reset in 195 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 88 ms. Reduced automaton from 7 states, 14 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[true, (NOT p0)]
RANDOM walk for 41000 steps (8 resets) in 14 ms. (2733 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3028264 steps, run timeout after 3001 ms. (steps per millisecond=1009 ) properties seen :0 out of 1
Probabilistic random walk after 3028264 steps, saw 1903604 distinct states, run finished after 3001 ms. (steps per millisecond=1009 ) properties seen :0
// Phase 1: matrix 30 rows 21 cols
[2024-06-01 08:15:46] [INFO ] Computed 6 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 5/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/19 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/21 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 30/51 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/51 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/51 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 27 constraints, problems are : Problem set: 0 solved, 1 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/15 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/19 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/21 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 30/51 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/51 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/51 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/51 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 28 constraints, problems are : Problem set: 0 solved, 1 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 89ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 20483 steps, including 0 resets, run visited all 1 properties in 23 ms. (steps per millisecond=890 )
Parikh walk visited 1 properties in 22 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 8 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA MAPK-PT-05120-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property MAPK-PT-05120-LTLCardinality-13 finished in 4060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||(p0&&F(((p1&&X(p2))||G(p2))))))))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2024-06-01 08:15:47] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 08:15:47] [INFO ] Implicit Places using invariants in 28 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31 ms. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 326 ms :[(NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : MAPK-PT-05120-LTLCardinality-15
Product exploration explored 100000 steps with 18917 reset in 81 ms.
Product exploration explored 100000 steps with 18956 reset in 91 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 247 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
RANDOM walk for 41000 steps (8 resets) in 18 ms. (2157 steps per ms) remains 10/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 37 ms. (1052 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 36 ms. (1081 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (8 resets) in 41 ms. (952 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 7/7 properties
// Phase 1: matrix 30 rows 21 cols
[2024-06-01 08:15:48] [INFO ] Computed 6 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 15/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/21 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 30/51 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 27 constraints, problems are : Problem set: 0 solved, 7 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 15/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/21 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 30/51 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 34 constraints, problems are : Problem set: 0 solved, 7 unsolved in 87 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 155ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 5 properties in 31424 ms.
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 30/30 transitions.
Graph (trivial) has 6 edges and 21 vertex of which 4 / 21 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 15 transition count 23
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 15 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 15 transition count 19
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 15 transition count 18
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 14 transition count 17
Applied a total of 15 rules in 4 ms. Remains 14 /21 variables (removed 7) and now considering 17/30 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 14/21 places, 17/30 transitions.
RANDOM walk for 40997 steps (8 resets) in 8 ms. (4555 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 868858 steps, run timeout after 3001 ms. (steps per millisecond=289 ) properties seen :0 out of 2
Probabilistic random walk after 868858 steps, saw 438915 distinct states, run finished after 3001 ms. (steps per millisecond=289 ) properties seen :0
// Phase 1: matrix 17 rows 14 cols
[2024-06-01 08:16:22] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 08:16:22] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 17/31 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/31 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 22 constraints, problems are : Problem set: 0 solved, 2 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 14/14 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 17/31 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 24 constraints, problems are : Problem set: 0 solved, 2 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 14/14 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 87ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 62956 steps, including 119 resets, run visited all 2 properties in 368 ms. (steps per millisecond=171 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 367 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 p0))), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p0 p2))), (F p1), (F (NOT p0)), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 p0 p2))), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR p1 (NOT p0) p2))), (F (NOT (OR (NOT p1) (NOT p0) p2)))]
Knowledge based reduction with 2 factoid took 676 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2024-06-01 08:16:24] [INFO ] Computed 6 invariants in 0 ms
[2024-06-01 08:16:24] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 08:16:24] [INFO ] Invariant cache hit.
[2024-06-01 08:16:24] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2024-06-01 08:16:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 2/21 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 30/51 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 27 constraints, problems are : Problem set: 0 solved, 29 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 2/21 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 30/51 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 29/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 56 constraints, problems are : Problem set: 0 solved, 29 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
After SMT, in 394ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 394ms
Finished structural reductions in LTL mode , in 1 iterations and 447 ms. Remains : 21/21 places, 30/30 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 227 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
RANDOM walk for 41000 steps (8 resets) in 19 ms. (2050 steps per ms) remains 10/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 26 ms. (1481 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 24 ms. (1600 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 32 ms. (1212 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 36 ms. (1081 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 7/7 properties
[2024-06-01 08:16:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 15/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/21 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 30/51 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 27 constraints, problems are : Problem set: 0 solved, 7 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 15/20 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/21 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 30/51 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 34 constraints, problems are : Problem set: 0 solved, 7 unsolved in 89 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 164ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 3 properties in 43491 ms.
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 30/30 transitions.
Graph (trivial) has 6 edges and 21 vertex of which 4 / 21 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 15 transition count 23
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 15 transition count 20
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 15 transition count 19
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 15 transition count 18
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 14 transition count 17
Applied a total of 15 rules in 4 ms. Remains 14 /21 variables (removed 7) and now considering 17/30 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 14/21 places, 17/30 transitions.
RANDOM walk for 40996 steps (8 resets) in 8 ms. (4555 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 35 ms. (1111 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 23 ms. (1666 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 29 ms. (1333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 417092 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 4
Probabilistic random walk after 417092 steps, saw 210914 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
// Phase 1: matrix 17 rows 14 cols
[2024-06-01 08:17:12] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 08:17:12] [INFO ] State equation strengthened by 3 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, 4 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 17/31 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/31 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 22 constraints, problems are : Problem set: 0 solved, 4 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 14/14 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 17/31 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 26 constraints, problems are : Problem set: 0 solved, 4 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 14/14 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 3 properties in 14418 ms.
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 14/14 places, 17/17 transitions.
RANDOM walk for 40997 steps (8 resets) in 17 ms. (2277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3402223 steps, run timeout after 3011 ms. (steps per millisecond=1129 ) properties seen :0 out of 1
Probabilistic random walk after 3402223 steps, saw 1713525 distinct states, run finished after 3011 ms. (steps per millisecond=1129 ) properties seen :0
[2024-06-01 08:17:29] [INFO ] Invariant cache hit.
[2024-06-01 08:17:29] [INFO ] State equation strengthened by 3 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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/31 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/31 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 22 constraints, problems are : Problem set: 0 solved, 1 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 14/14 constraints, ReadFeed: 3/3 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/14 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 17/31 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 23 constraints, problems are : Problem set: 0 solved, 1 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 14/14 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 731 ms.
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 17/17 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 17/17 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 14/14 places, 17/17 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 14/14 places, 17/17 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 17/17 (removed 0) transitions.
[2024-06-01 08:17:30] [INFO ] Invariant cache hit.
[2024-06-01 08:17:30] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 08:17:30] [INFO ] Invariant cache hit.
[2024-06-01 08:17:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 08:17:30] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-06-01 08:17:30] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-06-01 08:17:30] [INFO ] Invariant cache hit.
[2024-06-01 08:17:30] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 2/14 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 17/31 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 22 constraints, problems are : Problem set: 0 solved, 16 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 14/14 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 2/14 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 17/31 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 16/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/31 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 38 constraints, problems are : Problem set: 0 solved, 16 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 14/14 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 224ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 225ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 286 ms. Remains : 14/14 places, 17/17 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 5 edges and 14 vertex of which 3 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 10 transition count 12
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 10 transition count 11
Applied a total of 5 rules in 2 ms. Remains 10 /14 variables (removed 4) and now considering 11/17 (removed 6) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 10 cols
[2024-06-01 08:17:31] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 08:17:31] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 08:17:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 08:17:31] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 08:17:31] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 08:17:31] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 67 ms.
Knowledge obtained : [(AND (NOT p1) p0 p2)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p0 p1 p2))), (F (NOT (AND (NOT p1) p2))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT p0)), (F (NOT (OR p1 p2))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT p2)), (F (NOT (OR p0 p1))), (F p1)]
Knowledge based reduction with 1 factoid took 484 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 334 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 437 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 18875 reset in 67 ms.
Product exploration explored 100000 steps with 18911 reset in 88 ms.
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2024-06-01 08:17:32] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 08:17:33] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 08:17:33] [INFO ] Invariant cache hit.
[2024-06-01 08:17:33] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2024-06-01 08:17:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 2/21 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 30/51 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 27 constraints, problems are : Problem set: 0 solved, 29 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (OVERLAPS) 2/21 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 30/51 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 29/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 56 constraints, problems are : Problem set: 0 solved, 29 unsolved in 184 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
After SMT, in 389ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 389ms
Finished structural reductions in LTL mode , in 1 iterations and 464 ms. Remains : 21/21 places, 30/30 transitions.
Treatment of property MAPK-PT-05120-LTLCardinality-15 finished in 106404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X(G(p1)))) U G((!p1||X(F((!p1&&F(p1))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||(p0&&F(((p1&&X(p2))||G(p2))))))))'
[2024-06-01 08:17:33] [INFO ] Flatten gal took : 3 ms
[2024-06-01 08:17:33] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 08:17:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 22 places, 30 transitions and 90 arcs took 2 ms.
Total runtime 181458 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : MAPK-PT-05120-LTLCardinality-10
Could not compute solution for formula : MAPK-PT-05120-LTLCardinality-15

BK_STOP 1717229864158

--------------------
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
mcc2024
ltl formula name MAPK-PT-05120-LTLCardinality-10
ltl formula formula --ltl=/tmp/1617/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 22 places, 30 transitions and 90 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1617/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1617/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1617/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1617/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 23 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 23, there are 50 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2498 levels ~10000 states ~72532 transitions
pnml2lts-mc( 3/ 4): ~5000 levels ~20000 states ~79988 transitions
pnml2lts-mc( 3/ 4): ~10000 levels ~40000 states ~159988 transitions
pnml2lts-mc( 3/ 4): ~20000 levels ~80000 states ~377528 transitions
pnml2lts-mc( 0/ 4): ~40000 levels ~160000 states ~939464 transitions
pnml2lts-mc( 0/ 4): ~80000 levels ~320000 states ~1735912 transitions
pnml2lts-mc( 0/ 4): ~160000 levels ~640000 states ~3330352 transitions
pnml2lts-mc( 0/ 4): ~320000 levels ~1280000 states ~6525360 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1205340
pnml2lts-mc( 0/ 4): unique transitions count: 8220366
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 2449927
pnml2lts-mc( 0/ 4): - claim success count: 1207762
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1207760
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1207762 states 8230041 transitions, fanout: 6.814
pnml2lts-mc( 0/ 4): Total exploration time 3.660 sec (3.610 sec minimum, 3.625 sec on average)
pnml2lts-mc( 0/ 4): States per second: 329990, Transitions per second: 2248645
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 98.5MB, 22.9 B/state, compr.: 24.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 13.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 30 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 98.5MB (~256.0MB paged-in)
ltl formula name MAPK-PT-05120-LTLCardinality-15
ltl formula formula --ltl=/tmp/1617/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 22 places, 30 transitions and 90 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1617/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1617/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1617/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1617/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): There are 23 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 23, there are 52 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~519 levels ~10000 states ~23676 transitions
pnml2lts-mc( 1/ 4): ~118 levels ~20000 states ~43764 transitions
pnml2lts-mc( 1/ 4): ~158 levels ~40000 states ~88440 transitions
pnml2lts-mc( 1/ 4): ~218 levels ~80000 states ~179400 transitions
pnml2lts-mc( 1/ 4): ~299 levels ~160000 states ~363432 transitions
pnml2lts-mc( 3/ 4): ~11341 levels ~320000 states ~784332 transitions
pnml2lts-mc( 2/ 4): ~10247 levels ~640000 states ~1209012 transitions
pnml2lts-mc( 2/ 4): ~10247 levels ~1280000 states ~2272300 transitions
pnml2lts-mc( 2/ 4): ~10247 levels ~2560000 states ~4400724 transitions
pnml2lts-mc( 0/ 4): ~15389 levels ~5120000 states ~8615720 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4951053
pnml2lts-mc( 0/ 4): unique states count: 6139310
pnml2lts-mc( 0/ 4): unique transitions count: 12359137
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 3578532
pnml2lts-mc( 0/ 4): - claim found count: 1975365
pnml2lts-mc( 0/ 4): - claim success count: 6139341
pnml2lts-mc( 0/ 4): - cum. max stack depth: 227958
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6139347 states 12359271 transitions, fanout: 2.013
pnml2lts-mc( 0/ 4): Total exploration time 5.840 sec (5.830 sec minimum, 5.835 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1051258, Transitions per second: 2116314
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 114.4MB, 18.2 B/state, compr.: 19.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 19.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 30 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 114.4MB (~256.0MB paged-in)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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