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.r201-smll-171649586300003.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 HexagonalGrid-PT-110, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-171649586300003
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 02:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 13 02:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 02:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 13 02:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rwxr-xr-x 1 mcc users 29K 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 HexagonalGrid-PT-110-LTLCardinality-00
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-01
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-02
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-03
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-04
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-05
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-06
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-07
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-08
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-09
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-10
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-11
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-12
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-13
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-14
FORMULA_NAME HexagonalGrid-PT-110-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716534849089

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HexagonalGrid-PT-110
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 07:14:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 07:14:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 07:14:12] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2024-05-24 07:14:12] [INFO ] Transformed 31 places.
[2024-05-24 07:14:12] [INFO ] Transformed 42 transitions.
[2024-05-24 07:14:12] [INFO ] Parsed PT model containing 31 places and 42 transitions and 168 arcs in 339 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA HexagonalGrid-PT-110-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-110-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-110-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-110-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-110-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 20 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2024-05-24 07:14:12] [INFO ] Computed 14 invariants in 23 ms
[2024-05-24 07:14:12] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-05-24 07:14:12] [INFO ] Invariant cache hit.
[2024-05-24 07:14:13] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
Running 36 sub problems to find dead transitions.
[2024-05-24 07:14:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 6/25 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 6/31 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 42/73 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/73 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 45 constraints, problems are : Problem set: 0 solved, 36 unsolved in 1223 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 6/25 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 6/31 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 42/73 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 36/81 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 0/73 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 81 constraints, problems are : Problem set: 0 solved, 36 unsolved in 1154 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 2581ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 2604ms
Finished structural reductions in LTL mode , in 1 iterations and 3288 ms. Remains : 31/31 places, 42/42 transitions.
Support contains 23 out of 31 places after structural reductions.
[2024-05-24 07:14:16] [INFO ] Flatten gal took : 48 ms
[2024-05-24 07:14:16] [INFO ] Flatten gal took : 21 ms
[2024-05-24 07:14:16] [INFO ] Input system was already deterministic with 42 transitions.
Support contains 22 out of 31 places (down from 23) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2391 ms. (16 steps per ms) remains 5/21 properties
BEST_FIRST walk for 40003 steps (8 resets) in 179 ms. (222 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 168 ms. (236 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 122 ms. (325 steps per ms) remains 5/5 properties
[2024-05-24 07:14:17] [INFO ] Invariant cache hit.
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp16 is UNSAT
After SMT solving in domain Real declared 17/73 variables, and 5 constraints, problems are : Problem set: 5 solved, 0 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 5/13 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/31 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 56ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA HexagonalGrid-PT-110-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HexagonalGrid-PT-110-LTLCardinality-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HexagonalGrid-PT-110-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 8 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA HexagonalGrid-PT-110-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HexagonalGrid-PT-110-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA HexagonalGrid-PT-110-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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)) U G((p1 U p2))))'
Support contains 7 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-24 07:14:17] [INFO ] Invariant cache hit.
[2024-05-24 07:14:17] [INFO ] Implicit Places using invariants in 81 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 91 ms. Remains : 30/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 746 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), true, (NOT p2), (AND p0 (NOT p2))]
Running random walk in product with property : HexagonalGrid-PT-110-LTLCardinality-00
Product exploration explored 100000 steps with 28939 reset in 625 ms.
Product exploration explored 100000 steps with 29115 reset in 386 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 p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (OR p2 p1)), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (OR p2 p1))), (X (X p1))]
False Knowledge obtained : [(X (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (OR (AND p2 p0) (AND p1 p0))), (X (NOT (OR (AND p2 p0) (AND p1 p0)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (OR (AND p2 p0) (AND p1 p0)))), (X (X (NOT (OR (AND p2 p0) (AND p1 p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 1173 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter sensitive) to 6 states, 20 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 318 ms :[(NOT p2), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p2), true, (NOT p2), (AND p0 (NOT p2))]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (8 resets) in 524 ms. (76 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 2/2 properties
// Phase 1: matrix 42 rows 30 cols
[2024-05-24 07:14:21] [INFO ] Computed 13 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 16/23 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 7/30 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 42/72 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/72 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 43 constraints, problems are : Problem set: 0 solved, 2 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 30/30 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/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Int declared 23/72 variables, and 6 constraints, problems are : Problem set: 2 solved, 0 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 6/13 constraints, State Equation: 0/30 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 274ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (OR p2 p1)), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (OR p2 p1))), (X (X p1)), (G (OR (NOT p1) p2 p0)), (G (OR p1 p2 p0))]
False Knowledge obtained : [(X (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (OR (AND p2 p0) (AND p1 p0))), (X (NOT (OR (AND p2 p0) (AND p1 p0)))), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2))), (X (X (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (OR (AND p2 p0) (AND p1 p0)))), (X (X (NOT (OR (AND p2 p0) (AND p1 p0))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p2))), (F (NOT (AND (OR (NOT p1) p0) (OR (NOT p2) p0)))), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT p1)), (F (NOT (OR (AND p1 p0) (AND p2 p0))))]
Knowledge based reduction with 16 factoid took 1534 ms. Reduced automaton from 6 states, 20 edges and 3 AP (stutter insensitive) to 6 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 286 ms :[(NOT p2), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p2), true, (NOT p2), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 301 ms :[(NOT p2), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p2), true, (NOT p2), (AND p0 (NOT p2))]
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 42/42 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 30 transition count 39
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 24 transition count 39
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 9 place count 24 transition count 37
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 15 place count 20 transition count 37
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 18 transition count 36
Graph (trivial) has 8 edges and 18 vertex of which 2 / 18 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 17 transition count 36
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 28 place count 17 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 38 place count 17 transition count 17
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 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 41 place count 15 transition count 16
Applied a total of 41 rules in 61 ms. Remains 15 /30 variables (removed 15) and now considering 16/42 (removed 26) transitions.
// Phase 1: matrix 16 rows 15 cols
[2024-05-24 07:14:23] [INFO ] Computed 6 invariants in 1 ms
[2024-05-24 07:14:23] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-24 07:14:23] [INFO ] Invariant cache hit.
[2024-05-24 07:14:23] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-24 07:14:23] [INFO ] Redundant transitions in 1 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-24 07:14:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 9/15 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 15/30 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/31 variables, and 21 constraints, problems are : Problem set: 0 solved, 7 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 15/15 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/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 9/15 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 15/30 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/31 variables, and 28 constraints, problems are : Problem set: 0 solved, 7 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 282ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 282ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/30 places, 16/42 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 452 ms. Remains : 15/30 places, 16/42 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 p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR p1 p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p1 p2))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p1))]
False Knowledge obtained : [(X (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X p0), (X (NOT p0)), (X (OR (AND p1 p0) (AND p2 p0))), (X (NOT (OR (AND p1 p0) (AND p2 p0)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (OR (AND p1 p0) (AND p2 p0)))), (X (X (NOT (OR (AND p1 p0) (AND p2 p0)))))]
Knowledge based reduction with 16 factoid took 1161 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter insensitive) to 6 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 296 ms :[(NOT p2), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p2), true, (NOT p2), (AND p0 (NOT p2))]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (8 resets) in 742 ms. (53 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 197 ms. (202 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
[2024-05-24 07:14:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 8/15 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 15/30 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/31 variables, and 21 constraints, problems are : Problem set: 0 solved, 2 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 15/15 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/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Int declared 15/31 variables, and 6 constraints, problems are : Problem set: 2 solved, 0 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 0/15 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR p1 p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) p0))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p1 p2))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p1)), (G (OR (NOT p1) p2 p0)), (G (OR p1 p2 p0))]
False Knowledge obtained : [(X (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X p0), (X (NOT p0)), (X (OR (AND p1 p0) (AND p2 p0))), (X (NOT (OR (AND p1 p0) (AND p2 p0)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (OR (AND p1 p0) (AND p2 p0)))), (X (X (NOT (OR (AND p1 p0) (AND p2 p0))))), (F (NOT p0)), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (OR (NOT p1) p2))), (F (NOT (OR p1 p2))), (F (NOT (AND (OR (NOT p1) p0) (OR (NOT p2) p0)))), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT p1)), (F (NOT (OR (AND p1 p0) (AND p2 p0))))]
Knowledge based reduction with 18 factoid took 1698 ms. Reduced automaton from 6 states, 19 edges and 3 AP (stutter insensitive) to 6 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 307 ms :[(NOT p2), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p2), true, (NOT p2), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 300 ms :[(NOT p2), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p2), true, (NOT p2), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 304 ms :[(NOT p2), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (NOT p2), true, (NOT p2), (AND p0 (NOT p2))]
Stuttering criterion allowed to conclude after 31 steps with 3 reset in 1 ms.
FORMULA HexagonalGrid-PT-110-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-110-LTLCardinality-00 finished in 11358 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||F(p1))))'
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2024-05-24 07:14:28] [INFO ] Computed 14 invariants in 4 ms
[2024-05-24 07:14:28] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-24 07:14:28] [INFO ] Invariant cache hit.
[2024-05-24 07:14:29] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-05-24 07:14:29] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2024-05-24 07:14:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 6/25 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 6/31 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 42/73 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 0/73 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 45 constraints, problems are : Problem set: 0 solved, 36 unsolved in 864 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 6/25 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 6/31 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 42/73 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 36/81 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 0/73 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 81 constraints, problems are : Problem set: 0 solved, 36 unsolved in 1102 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 2028ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 2030ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2210 ms. Remains : 31/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HexagonalGrid-PT-110-LTLCardinality-03
Product exploration explored 100000 steps with 12513 reset in 376 ms.
Stack based approach found an accepted trace after 7821 steps with 965 reset with depth 7 and stack size 7 in 50 ms.
FORMULA HexagonalGrid-PT-110-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property HexagonalGrid-PT-110-LTLCardinality-03 finished in 2761 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 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 5 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-05-24 07:14:31] [INFO ] Invariant cache hit.
[2024-05-24 07:14:31] [INFO ] Implicit Places using invariants in 124 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 125 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/31 places, 42/42 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 30 transition count 38
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 22 transition count 38
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 12 place count 22 transition count 34
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 14 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 27 place count 12 transition count 33
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 10 transition count 32
Graph (trivial) has 16 edges and 10 vertex of which 4 / 10 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 31 place count 7 transition count 32
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 54 place count 7 transition count 9
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 56 place count 7 transition count 7
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 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 5 transition count 6
Applied a total of 59 rules in 9 ms. Remains 5 /30 variables (removed 25) and now considering 6/42 (removed 36) transitions.
// Phase 1: matrix 6 rows 5 cols
[2024-05-24 07:14:31] [INFO ] Computed 2 invariants in 0 ms
[2024-05-24 07:14:31] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 07:14:31] [INFO ] Invariant cache hit.
[2024-05-24 07:14:31] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/31 places, 6/42 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 206 ms. Remains : 5/31 places, 6/42 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-110-LTLCardinality-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HexagonalGrid-PT-110-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-110-LTLCardinality-05 finished in 279 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 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2024-05-24 07:14:31] [INFO ] Computed 14 invariants in 1 ms
[2024-05-24 07:14:32] [INFO ] Implicit Places using invariants in 95 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/31 places, 42/42 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 30 transition count 37
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 15 place count 20 transition count 37
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 15 place count 20 transition count 32
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 10 transition count 32
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 33 place count 8 transition count 31
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 6 transition count 30
Graph (trivial) has 20 edges and 6 vertex of which 5 / 6 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Iterating global reduction 0 with 1 rules applied. Total rules applied 37 place count 2 transition count 30
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 64 place count 2 transition count 3
Applied a total of 64 rules in 7 ms. Remains 2 /30 variables (removed 28) and now considering 3/42 (removed 39) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-24 07:14:32] [INFO ] Computed 1 invariants in 0 ms
[2024-05-24 07:14:32] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 07:14:32] [INFO ] Invariant cache hit.
[2024-05-24 07:14:32] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/31 places, 3/42 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 162 ms. Remains : 2/31 places, 3/42 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0)]
Running random walk in product with property : HexagonalGrid-PT-110-LTLCardinality-06
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA HexagonalGrid-PT-110-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-110-LTLCardinality-06 finished in 259 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0||X(p1))))&&F(p0)))'
Support contains 5 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 31 cols
[2024-05-24 07:14:32] [INFO ] Computed 14 invariants in 2 ms
[2024-05-24 07:14:32] [INFO ] Implicit Places using invariants in 111 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 112 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/31 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116 ms. Remains : 30/31 places, 42/42 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : HexagonalGrid-PT-110-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 43 steps with 0 reset in 1 ms.
FORMULA HexagonalGrid-PT-110-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HexagonalGrid-PT-110-LTLCardinality-08 finished in 357 ms.
All properties solved by simple procedures.
Total runtime 20829 ms.
ITS solved all properties within timeout

BK_STOP 1716534872625

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is HexagonalGrid-PT-110, 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 r201-smll-171649586300003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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