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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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 4.0K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 07:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Apr 13 07:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 13 07:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 13 07:52 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-00640-LTLFireability-00
FORMULA_NAME MAPK-PT-00640-LTLFireability-01
FORMULA_NAME MAPK-PT-00640-LTLFireability-02
FORMULA_NAME MAPK-PT-00640-LTLFireability-03
FORMULA_NAME MAPK-PT-00640-LTLFireability-04
FORMULA_NAME MAPK-PT-00640-LTLFireability-05
FORMULA_NAME MAPK-PT-00640-LTLFireability-06
FORMULA_NAME MAPK-PT-00640-LTLFireability-07
FORMULA_NAME MAPK-PT-00640-LTLFireability-08
FORMULA_NAME MAPK-PT-00640-LTLFireability-09
FORMULA_NAME MAPK-PT-00640-LTLFireability-10
FORMULA_NAME MAPK-PT-00640-LTLFireability-11
FORMULA_NAME MAPK-PT-00640-LTLFireability-12
FORMULA_NAME MAPK-PT-00640-LTLFireability-13
FORMULA_NAME MAPK-PT-00640-LTLFireability-14
FORMULA_NAME MAPK-PT-00640-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716556767163

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MAPK-PT-00640
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 13:19:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 13:19:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 13:19:28] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2024-05-24 13:19:28] [INFO ] Transformed 22 places.
[2024-05-24 13:19:28] [INFO ] Transformed 30 transitions.
[2024-05-24 13:19:28] [INFO ] Parsed PT model containing 22 places and 30 transitions and 90 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MAPK-PT-00640-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00640-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00640-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00640-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00640-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 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 9 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2024-05-24 13:19:28] [INFO ] Computed 7 invariants in 8 ms
[2024-05-24 13:19:28] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-24 13:19:28] [INFO ] Invariant cache hit.
[2024-05-24 13:19:28] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2024-05-24 13:19:28] [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 338 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 268 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 637ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 645ms
Finished structural reductions in LTL mode , in 1 iterations and 923 ms. Remains : 22/22 places, 30/30 transitions.
Support contains 16 out of 22 places after structural reductions.
[2024-05-24 13:19:29] [INFO ] Flatten gal took : 16 ms
[2024-05-24 13:19:29] [INFO ] Flatten gal took : 5 ms
[2024-05-24 13:19:29] [INFO ] Input system was already deterministic with 30 transitions.
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40315 steps (8 resets) in 171 ms. (234 steps per ms) remains 1/14 properties
BEST_FIRST walk for 14879 steps (2 resets) in 79 ms. (185 steps per ms) remains 0/1 properties
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 1 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 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 21 place count 10 transition count 21
Graph (trivial) has 8 edges and 10 vertex of which 2 / 10 are part of one of the 1 SCC in 1 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 23 place count 8 transition count 21
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 7 edges and 8 vertex of which 3 / 8 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 28 place count 6 transition count 17
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 36 place count 5 transition count 10
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 5 transition count 6
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 2 with 2 rules applied. Total rules applied 42 place count 4 transition count 5
Applied a total of 42 rules in 33 ms. Remains 4 /22 variables (removed 18) and now considering 5/30 (removed 25) transitions.
// Phase 1: matrix 5 rows 4 cols
[2024-05-24 13:19:30] [INFO ] Computed 2 invariants in 0 ms
[2024-05-24 13:19:30] [INFO ] Implicit Places using invariants in 17 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 18 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 3/22 places, 5/30 transitions.
Graph (trivial) has 2 edges and 3 vertex of which 2 / 3 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 place count 2 transition count 3
Applied a total of 2 rules in 1 ms. Remains 2 /3 variables (removed 1) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-24 13:19:30] [INFO ] Computed 1 invariants in 1 ms
[2024-05-24 13:19:30] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 13:19:30] [INFO ] Invariant cache hit.
[2024-05-24 13:19:30] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/22 places, 3/30 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 84 ms. Remains : 2/22 places, 3/30 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0)]
Running random walk in product with property : MAPK-PT-00640-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA MAPK-PT-00640-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00640-LTLFireability-00 finished in 286 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 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 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 19 rules applied. Total rules applied 22 place count 9 transition count 21
Graph (trivial) has 12 edges and 9 vertex of which 2 / 9 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 8 transition count 21
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 26 place count 8 transition count 18
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 30 place count 8 transition count 14
Applied a total of 30 rules in 6 ms. Remains 8 /22 variables (removed 14) and now considering 14/30 (removed 16) transitions.
[2024-05-24 13:19:30] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 8 cols
[2024-05-24 13:19:30] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 13:19:30] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 13:19:30] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
[2024-05-24 13:19:30] [INFO ] Invariant cache hit.
[2024-05-24 13:19:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 13:19:30] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-24 13:19:30] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-24 13:19:30] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
[2024-05-24 13:19:30] [INFO ] Invariant cache hit.
[2024-05-24 13:19:30] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 9/17 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/18 variables, and 13 constraints, problems are : Problem set: 0 solved, 12 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 9/17 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/17 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/17 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/18 variables, and 25 constraints, problems are : Problem set: 0 solved, 12 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 167ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 167ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/22 places, 14/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 222 ms. Remains : 8/22 places, 14/30 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : MAPK-PT-00640-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-00640-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00640-LTLFireability-01 finished in 360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 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-05-24 13:19:30] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 13:19:30] [INFO ] Implicit Places using invariants in 35 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 37 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MAPK-PT-00640-LTLFireability-02
Product exploration explored 100000 steps with 2416 reset in 245 ms.
Stack based approach found an accepted trace after 10 steps with 1 reset with depth 5 and stack size 5 in 1 ms.
FORMULA MAPK-PT-00640-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-00640-LTLFireability-02 finished in 367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(F(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 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2024-05-24 13:19:31] [INFO ] Invariant cache hit.
[2024-05-24 13:19:31] [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 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 32 ms. Remains : 21/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MAPK-PT-00640-LTLFireability-04
Product exploration explored 100000 steps with 23299 reset in 100 ms.
Product exploration explored 100000 steps with 23295 reset in 120 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40718 steps (8 resets) in 28 ms. (1404 steps per ms) remains 2/3 properties
BEST_FIRST walk for 2832 steps (0 resets) in 13 ms. (202 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 3 factoid took 176 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 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-05-24 13:19:32] [INFO ] Computed 6 invariants in 2 ms
[2024-05-24 13:19:32] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 13:19:32] [INFO ] Invariant cache hit.
[2024-05-24 13:19:32] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2024-05-24 13:19:32] [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 208 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 216 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 431ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 432ms
Finished structural reductions in LTL mode , in 1 iterations and 497 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 p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40235 steps (8 resets) in 53 ms. (745 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 23349 reset in 60 ms.
Product exploration explored 100000 steps with 23321 reset in 72 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL 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
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 19 transition count 31
Deduced a syphon composed of 3 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 19 transition count 26
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 9 rules in 11 ms. Remains 19 /21 variables (removed 2) and now considering 26/30 (removed 4) transitions.
[2024-05-24 13:19:34] [INFO ] Redundant transitions in 0 ms returned []
Running 25 sub problems to find dead transitions.
[2024-05-24 13:19:34] [INFO ] Flow matrix only has 24 transitions (discarded 2 similar events)
// Phase 1: matrix 24 rows 19 cols
[2024-05-24 13:19:34] [INFO ] Computed 6 invariants in 1 ms
[2024-05-24 13:19:34] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 2/19 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD21 is UNSAT
At refinement iteration 4 (OVERLAPS) 23/42 variables, 19/25 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 2/27 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/27 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 1/43 variables, 1/28 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/28 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 0/43 variables, 0/28 constraints. Problems are: Problem set: 3 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 28 constraints, problems are : Problem set: 3 solved, 22 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 19/19 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 5/19 variables, 4/6 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 23/42 variables, 19/25 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 2/27 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 22/49 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/49 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 8 (OVERLAPS) 1/43 variables, 1/50 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/50 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 0/43 variables, 0/50 constraints. Problems are: Problem set: 3 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 50 constraints, problems are : Problem set: 3 solved, 22 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 19/19 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 22/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 427ms problems are : Problem set: 3 solved, 22 unsolved
Search for dead transitions found 3 dead transitions in 428ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 19/21 places, 23/30 transitions.
Graph (complete) has 41 edges and 19 vertex of which 16 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 0 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 2 place count 15 transition count 22
Applied a total of 2 rules in 6 ms. Remains 15 /19 variables (removed 4) and now considering 22/23 (removed 1) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/21 places, 22/30 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 453 ms. Remains : 15/21 places, 22/30 transitions.
Support contains 3 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-05-24 13:19:34] [INFO ] Computed 6 invariants in 0 ms
[2024-05-24 13:19:34] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 13:19:34] [INFO ] Invariant cache hit.
[2024-05-24 13:19:34] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Running 29 sub problems to find dead transitions.
[2024-05-24 13:19:34] [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 192 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 187 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 388ms 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 448 ms. Remains : 21/21 places, 30/30 transitions.
Treatment of property MAPK-PT-00640-LTLFireability-04 finished in 4129 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 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 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 19 rules applied. Total rules applied 22 place count 9 transition count 21
Graph (trivial) has 12 edges and 9 vertex of which 2 / 9 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 23 place count 8 transition count 21
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 26 place count 8 transition count 18
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 30 place count 8 transition count 14
Applied a total of 30 rules in 2 ms. Remains 8 /22 variables (removed 14) and now considering 14/30 (removed 16) transitions.
[2024-05-24 13:19:35] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
// Phase 1: matrix 10 rows 8 cols
[2024-05-24 13:19:35] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 13:19:35] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 13:19:35] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
[2024-05-24 13:19:35] [INFO ] Invariant cache hit.
[2024-05-24 13:19:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 13:19:35] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-24 13:19:35] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-24 13:19:35] [INFO ] Flow matrix only has 10 transitions (discarded 4 similar events)
[2024-05-24 13:19:35] [INFO ] Invariant cache hit.
[2024-05-24 13:19:35] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 9/17 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/17 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 17/18 variables, and 13 constraints, problems are : Problem set: 0 solved, 12 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 9/17 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/17 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/17 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 17/18 variables, and 25 constraints, problems are : Problem set: 0 solved, 12 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 154ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 154ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/22 places, 14/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 202 ms. Remains : 8/22 places, 14/30 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : MAPK-PT-00640-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-00640-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00640-LTLFireability-05 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' '!((F(p0)&&G(F(p1))))'
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 1 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 0 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 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 10 transition count 16
Applied a total of 26 rules in 6 ms. Remains 10 /22 variables (removed 12) and now considering 16/30 (removed 14) transitions.
[2024-05-24 13:19:35] [INFO ] Flow matrix only has 13 transitions (discarded 3 similar events)
// Phase 1: matrix 13 rows 10 cols
[2024-05-24 13:19:35] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 13:19:35] [INFO ] Implicit Places using invariants in 23 ms returned [3]
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 : 9/22 places, 16/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 9 transition count 15
Applied a total of 1 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 15/16 (removed 1) transitions.
[2024-05-24 13:19:35] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
// Phase 1: matrix 12 rows 9 cols
[2024-05-24 13:19:35] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 13:19:35] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-24 13:19:35] [INFO ] Flow matrix only has 12 transitions (discarded 3 similar events)
[2024-05-24 13:19:35] [INFO ] Invariant cache hit.
[2024-05-24 13:19:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 13:19:35] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/22 places, 15/30 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 79 ms. Remains : 9/22 places, 15/30 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : MAPK-PT-00640-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-00640-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00640-LTLFireability-06 finished in 242 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((G(p1)||(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-05-24 13:19:35] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 13:19:35] [INFO ] Implicit Places using invariants in 28 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 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 1 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 29 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : MAPK-PT-00640-LTLFireability-08
Product exploration explored 100000 steps with 5752 reset in 92 ms.
Stack based approach found an accepted trace after 36 steps with 3 reset with depth 3 and stack size 3 in 1 ms.
FORMULA MAPK-PT-00640-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property MAPK-PT-00640-LTLFireability-08 finished in 349 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((F((G(F(p1))||(p2&&F(p1))))||p0))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 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 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 8 place count 17 transition count 27
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 10 place count 17 transition count 25
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 12 place count 17 transition count 25
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 16 transition count 24
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 16 transition count 24
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 15 place count 16 transition count 23
Applied a total of 15 rules in 13 ms. Remains 16 /22 variables (removed 6) and now considering 23/30 (removed 7) transitions.
[2024-05-24 13:19:36] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
// Phase 1: matrix 21 rows 16 cols
[2024-05-24 13:19:36] [INFO ] Computed 5 invariants in 0 ms
[2024-05-24 13:19:36] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-24 13:19:36] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
[2024-05-24 13:19:36] [INFO ] Invariant cache hit.
[2024-05-24 13:19:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:19:36] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-24 13:19:36] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
[2024-05-24 13:19:36] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
[2024-05-24 13:19:36] [INFO ] Invariant cache hit.
[2024-05-24 13:19:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 20/36 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/36 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/37 variables, and 22 constraints, problems are : Problem set: 0 solved, 21 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 20/36 variables, 16/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 21/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/36 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/36 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 36/37 variables, and 43 constraints, problems are : Problem set: 0 solved, 21 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 313ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 313ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/22 places, 23/30 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 377 ms. Remains : 16/22 places, 23/30 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MAPK-PT-00640-LTLFireability-09
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-00640-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00640-LTLFireability-09 finished in 480 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 U (p1||F(!p2))))))'
Support contains 4 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 5 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 15 transition count 25
Graph (trivial) has 4 edges and 15 vertex of which 2 / 15 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 13 place count 14 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 16 place count 14 transition count 22
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 17 place count 14 transition count 22
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 18 place count 14 transition count 21
Applied a total of 18 rules in 5 ms. Remains 14 /22 variables (removed 8) and now considering 21/30 (removed 9) transitions.
[2024-05-24 13:19:36] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
// Phase 1: matrix 18 rows 14 cols
[2024-05-24 13:19:36] [INFO ] Computed 5 invariants in 0 ms
[2024-05-24 13:19:36] [INFO ] Implicit Places using invariants in 23 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/22 places, 21/30 transitions.
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 2 place count 13 transition count 19
Applied a total of 2 rules in 3 ms. Remains 13 /13 variables (removed 0) and now considering 19/21 (removed 2) transitions.
[2024-05-24 13:19:36] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
// Phase 1: matrix 18 rows 13 cols
[2024-05-24 13:19:36] [INFO ] Computed 4 invariants in 1 ms
[2024-05-24 13:19:36] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-24 13:19:36] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
[2024-05-24 13:19:36] [INFO ] Invariant cache hit.
[2024-05-24 13:19:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 13:19:36] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/22 places, 19/30 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 74 ms. Remains : 13/22 places, 19/30 transitions.
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) p2), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : MAPK-PT-00640-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-00640-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00640-LTLFireability-10 finished in 237 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) U p1))&&G((X(p1)||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.
// Phase 1: matrix 30 rows 22 cols
[2024-05-24 13:19:36] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 13:19:36] [INFO ] Implicit Places using invariants in 27 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 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 1 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 30 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p1), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MAPK-PT-00640-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-00640-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00640-LTLFireability-14 finished in 272 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(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.
[2024-05-24 13:19:37] [INFO ] Invariant cache hit.
[2024-05-24 13:19:37] [INFO ] Implicit Places using invariants in 27 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 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 30 ms. Remains : 20/22 places, 30/30 transitions.
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND p0 (NOT p1)), p0]
Running random walk in product with property : MAPK-PT-00640-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MAPK-PT-00640-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MAPK-PT-00640-LTLFireability-15 finished in 196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(F(p1)))))))'
Found a Shortening insensitive property : MAPK-PT-00640-LTLFireability-04
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
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 0 with 12 rules applied. Total rules applied 12 place count 15 transition count 25
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 14 place count 15 transition count 23
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 16 place count 15 transition count 23
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 14 transition count 22
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 14 transition count 22
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 19 place count 14 transition count 21
Applied a total of 19 rules in 5 ms. Remains 14 /22 variables (removed 8) and now considering 21/30 (removed 9) transitions.
[2024-05-24 13:19:37] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
// Phase 1: matrix 19 rows 14 cols
[2024-05-24 13:19:37] [INFO ] Computed 5 invariants in 1 ms
[2024-05-24 13:19:37] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 13:19:37] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
[2024-05-24 13:19:37] [INFO ] Invariant cache hit.
[2024-05-24 13:19:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-24 13:19:37] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Running 20 sub problems to find dead transitions.
[2024-05-24 13:19:37] [INFO ] Flow matrix only has 19 transitions (discarded 2 similar events)
[2024-05-24 13:19:37] [INFO ] Invariant cache hit.
[2024-05-24 13:19:37] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 2/14 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 18/32 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 1/33 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/33 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/33 variables, and 23 constraints, problems are : Problem set: 0 solved, 20 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 14/14 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 2/14 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 18/32 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/32 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 1/33 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/33 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/33 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/33 variables, and 43 constraints, problems are : Problem set: 0 solved, 20 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 14/14 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 327ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 329ms
Starting structural reductions in LI_LTL mode, iteration 1 : 14/22 places, 21/30 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 382 ms. Remains : 14/22 places, 21/30 transitions.
Running random walk in product with property : MAPK-PT-00640-LTLFireability-04
Stuttering criterion allowed to conclude after 2044 steps with 476 reset in 7 ms.
Treatment of property MAPK-PT-00640-LTLFireability-04 finished in 636 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-24 13:19:37] [INFO ] Flatten gal took : 7 ms
[2024-05-24 13:19:37] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-24 13:19:37] [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 9590 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MAPK-PT-00640

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1068
MODEL NAME: /home/mcc/execution/411/model
22 places, 30 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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