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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.5M
-rw-r--r-- 1 mcc users 5.5K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 8.8K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 4.1M Jun 7 06:26 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 ResIsolation-PT-N08P1-LTLCardinality-00
FORMULA_NAME ResIsolation-PT-N08P1-LTLCardinality-01
FORMULA_NAME ResIsolation-PT-N08P1-LTLCardinality-02
FORMULA_NAME ResIsolation-PT-N08P1-LTLCardinality-03
FORMULA_NAME ResIsolation-PT-N08P1-LTLCardinality-04
FORMULA_NAME ResIsolation-PT-N08P1-LTLCardinality-05
FORMULA_NAME ResIsolation-PT-N08P1-LTLCardinality-06
FORMULA_NAME ResIsolation-PT-N08P1-LTLCardinality-07
FORMULA_NAME ResIsolation-PT-N08P1-LTLCardinality-08
FORMULA_NAME ResIsolation-PT-N08P1-LTLCardinality-09
FORMULA_NAME ResIsolation-PT-N08P1-LTLCardinality-10
FORMULA_NAME ResIsolation-PT-N08P1-LTLCardinality-11
FORMULA_NAME ResIsolation-PT-N08P1-LTLCardinality-12
FORMULA_NAME ResIsolation-PT-N08P1-LTLCardinality-13
FORMULA_NAME ResIsolation-PT-N08P1-LTLCardinality-14
FORMULA_NAME ResIsolation-PT-N08P1-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717745605232

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResIsolation-PT-N08P1
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-07 07:33:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-07 07:33:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:33:29] [INFO ] Load time of PNML (sax parser for PT used): 1073 ms
[2024-06-07 07:33:29] [INFO ] Transformed 270 places.
[2024-06-07 07:33:29] [INFO ] Transformed 4850 transitions.
[2024-06-07 07:33:29] [INFO ] Found NUPN structural information;
[2024-06-07 07:33:29] [INFO ] Parsed PT model containing 270 places and 4850 transitions and 83436 arcs in 1374 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA ResIsolation-PT-N08P1-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P1-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P1-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P1-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P1-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P1-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P1-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ResIsolation-PT-N08P1-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P1-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 270/270 places, 4850/4850 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 262 transition count 4850
Discarding 139 places :
Symmetric choice reduction at 1 with 139 rule applications. Total rules 147 place count 123 transition count 4711
Iterating global reduction 1 with 139 rules applied. Total rules applied 286 place count 123 transition count 4711
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 1 with 99 rules applied. Total rules applied 385 place count 123 transition count 4612
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 397 place count 111 transition count 4600
Iterating global reduction 2 with 12 rules applied. Total rules applied 409 place count 111 transition count 4600
Applied a total of 409 rules in 291 ms. Remains 111 /270 variables (removed 159) and now considering 4600/4850 (removed 250) transitions.
// Phase 1: matrix 4600 rows 111 cols
[2024-06-07 07:33:30] [INFO ] Computed 1 invariants in 239 ms
[2024-06-07 07:33:31] [INFO ] Implicit Places using invariants in 1695 ms returned []
[2024-06-07 07:33:31] [INFO ] Invariant cache hit.
[2024-06-07 07:33:35] [INFO ] Implicit Places using invariants and state equation in 3585 ms returned []
Implicit Place search using SMT with State Equation took 5345 ms to find 0 implicit places.
Running 4599 sub problems to find dead transitions.
[2024-06-07 07:33:35] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 109/4711 variables, and 0 constraints, problems are : Problem set: 0 solved, 4599 unsolved in 30265 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/111 constraints, PredecessorRefiner: 4599/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4599 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4599 unsolved
SMT process timed out in 140647ms, After SMT, problems are : Problem set: 0 solved, 4599 unsolved
Search for dead transitions found 0 dead transitions in 140849ms
Starting structural reductions in LTL mode, iteration 1 : 111/270 places, 4600/4850 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146588 ms. Remains : 111/270 places, 4600/4850 transitions.
Support contains 18 out of 111 places after structural reductions.
[2024-06-07 07:35:58] [INFO ] Flatten gal took : 1354 ms
[2024-06-07 07:35:59] [INFO ] Flatten gal took : 771 ms
[2024-06-07 07:36:00] [INFO ] Input system was already deterministic with 4600 transitions.
RANDOM walk for 40000 steps (8 resets) in 5762 ms. (6 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 320 ms. (124 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 333 ms. (119 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 353 ms. (113 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 331 ms. (120 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 515 ms. (77 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 8/8 properties
[2024-06-07 07:36:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 15/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 4529/4554 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4554 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 92/4646 variables, 51/77 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4646 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 39/4685 variables, 22/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4685 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 16/4701 variables, 7/106 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4701 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 9/4710 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4710 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 1/4711 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4711 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/4711 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4711/4711 variables, and 112 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4752 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 111/111 constraints, PredecessorRefiner: 8/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 15/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 4529/4554 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4554 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 92/4646 variables, 51/77 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4646 variables, 7/84 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4646 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 39/4685 variables, 22/106 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4685/4711 variables, and 106 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 98/111 constraints, PredecessorRefiner: 8/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 9989ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 4600/4600 transitions.
Graph (trivial) has 75 edges and 111 vertex of which 24 / 111 are part of one of the 8 SCC in 6 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Graph (complete) has 806 edges and 95 vertex of which 90 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.54 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 28 rules applied. Total rules applied 30 place count 90 transition count 4544
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 49 place count 71 transition count 4544
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 69 transition count 4542
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 69 transition count 4542
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 86 place count 69 transition count 4509
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 86 place count 69 transition count 4507
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 90 place count 67 transition count 4507
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 124 place count 50 transition count 4490
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 125 place count 50 transition count 4489
Drop transitions (Redundant composition of simpler transitions.) removed 513 transitions
Redundant transition composition rules discarded 513 transitions
Iterating global reduction 4 with 513 rules applied. Total rules applied 638 place count 50 transition count 3976
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 644 place count 50 transition count 3970
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 4 with 134 rules applied. Total rules applied 778 place count 44 transition count 3842
Drop transitions (Redundant composition of simpler transitions.) removed 512 transitions
Redundant transition composition rules discarded 512 transitions
Iterating global reduction 5 with 512 rules applied. Total rules applied 1290 place count 44 transition count 3330
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1291 place count 43 transition count 3329
Applied a total of 1291 rules in 20773 ms. Remains 43 /111 variables (removed 68) and now considering 3329/4600 (removed 1271) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20776 ms. Remains : 43/111 places, 3329/4600 transitions.
RANDOM walk for 223 steps (0 resets) in 196 ms. (1 steps per ms) remains 0/8 properties
FORMULA ResIsolation-PT-N08P1-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 38 stabilizing places and 46 stable transitions
Graph (complete) has 836 edges and 111 vertex of which 106 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.107 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(((p0&&X(p1)) U (p2||X(X(!p0))))))'
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 4600/4600 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 101 transition count 4590
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 101 transition count 4590
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 418 transitions.
Iterating post reduction 0 with 418 rules applied. Total rules applied 438 place count 101 transition count 4172
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 441 place count 98 transition count 3914
Iterating global reduction 1 with 3 rules applied. Total rules applied 444 place count 98 transition count 3914
Applied a total of 444 rules in 104 ms. Remains 98 /111 variables (removed 13) and now considering 3914/4600 (removed 686) transitions.
// Phase 1: matrix 3914 rows 98 cols
[2024-06-07 07:36:35] [INFO ] Computed 1 invariants in 101 ms
[2024-06-07 07:36:36] [INFO ] Implicit Places using invariants in 1130 ms returned []
[2024-06-07 07:36:36] [INFO ] Invariant cache hit.
[2024-06-07 07:36:38] [INFO ] Implicit Places using invariants and state equation in 2409 ms returned []
Implicit Place search using SMT with State Equation took 3556 ms to find 0 implicit places.
Running 3913 sub problems to find dead transitions.
[2024-06-07 07:36:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3913 unsolved
SMT process timed out in 99450ms, After SMT, problems are : Problem set: 0 solved, 3913 unsolved
Search for dead transitions found 0 dead transitions in 99517ms
Starting structural reductions in LTL mode, iteration 1 : 98/111 places, 3914/4600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103224 ms. Remains : 98/111 places, 3914/4600 transitions.
Stuttering acceptance computed with spot in 833 ms :[(AND p0 (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), true, p0, (AND p0 (NOT p2)), p0, p0]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 806 ms.
Product exploration explored 100000 steps with 50000 reset in 437 ms.
Computed a total of 35 stabilizing places and 43 stable transitions
Graph (complete) has 705 edges and 98 vertex of which 93 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.41 ms
Computed a total of 35 stabilizing places and 43 stable transitions
Detected a total of 35/98 stabilizing places and 43/3914 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 32 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N08P1-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N08P1-LTLCardinality-01 finished in 105660 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&&X(p1))||G(p1))))))'
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 4600/4600 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 4600
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 98 transition count 4588
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 98 transition count 4588
Ensure Unique test removed 546 transitions
Reduce isomorphic transitions removed 546 transitions.
Iterating post reduction 1 with 546 rules applied. Total rules applied 571 place count 98 transition count 4042
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 576 place count 93 transition count 3527
Iterating global reduction 2 with 5 rules applied. Total rules applied 581 place count 93 transition count 3527
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 582 place count 93 transition count 3526
Applied a total of 582 rules in 91 ms. Remains 93 /111 variables (removed 18) and now considering 3526/4600 (removed 1074) transitions.
// Phase 1: matrix 3526 rows 93 cols
[2024-06-07 07:38:20] [INFO ] Computed 0 invariants in 69 ms
[2024-06-07 07:38:21] [INFO ] Implicit Places using invariants in 755 ms returned []
[2024-06-07 07:38:21] [INFO ] Invariant cache hit.
[2024-06-07 07:38:23] [INFO ] Implicit Places using invariants and state equation in 2210 ms returned []
Implicit Place search using SMT with State Equation took 2971 ms to find 0 implicit places.
Running 3525 sub problems to find dead transitions.
[2024-06-07 07:38:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3525 unsolved
SMT process timed out in 93896ms, After SMT, problems are : Problem set: 0 solved, 3525 unsolved
Search for dead transitions found 0 dead transitions in 93947ms
Starting structural reductions in LTL mode, iteration 1 : 93/111 places, 3526/4600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97019 ms. Remains : 93/111 places, 3526/4600 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 1810 ms.
Product exploration explored 100000 steps with 0 reset in 1600 ms.
Computed a total of 32 stabilizing places and 41 stable transitions
Graph (complete) has 675 edges and 93 vertex of which 91 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.34 ms
Computed a total of 32 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 154 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 2241 ms. (17 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 378 ms. (105 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 422 ms. (94 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 306 ms. (130 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (8 resets) in 540 ms. (73 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 359 ms. (111 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 156880 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :3 out of 6
Probabilistic random walk after 156880 steps, saw 27113 distinct states, run finished after 3007 ms. (steps per millisecond=52 ) properties seen :3
[2024-06-07 07:40:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 769/771 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/771 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2747/3518 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3518 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 37/3555 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3555 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 28/3583 variables, 11/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3583 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 21/3604 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3604 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 15/3619 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3619 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/3619 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3619/3619 variables, and 93 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3312 ms.
Refiners :[State Equation: 93/93 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 769/771 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/771 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 2747/3518 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3518 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3518 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 37/3555 variables, 22/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3555 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 28/3583 variables, 11/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3583 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 21/3604 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3604 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 12 (OVERLAPS) 15/3619 variables, 12/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3619 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/3619 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3619/3619 variables, and 96 constraints, problems are : Problem set: 1 solved, 2 unsolved in 4639 ms.
Refiners :[State Equation: 93/93 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 8030ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 10790 steps, including 78 resets, run visited all 2 properties in 1260 ms. (steps per millisecond=8 )
Parikh walk visited 2 properties in 1272 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 324 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 3526/3526 transitions.
Applied a total of 0 rules in 32 ms. Remains 93 /93 variables (removed 0) and now considering 3526/3526 (removed 0) transitions.
[2024-06-07 07:40:16] [INFO ] Invariant cache hit.
[2024-06-07 07:40:17] [INFO ] Implicit Places using invariants in 876 ms returned []
[2024-06-07 07:40:17] [INFO ] Invariant cache hit.
[2024-06-07 07:40:19] [INFO ] Implicit Places using invariants and state equation in 2661 ms returned []
Implicit Place search using SMT with State Equation took 3541 ms to find 0 implicit places.
Running 3525 sub problems to find dead transitions.
[2024-06-07 07:40:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3525 unsolved
SMT process timed out in 91901ms, After SMT, problems are : Problem set: 0 solved, 3525 unsolved
Search for dead transitions found 0 dead transitions in 91965ms
Finished structural reductions in LTL mode , in 1 iterations and 95577 ms. Remains : 93/93 places, 3526/3526 transitions.
Computed a total of 32 stabilizing places and 41 stable transitions
Graph (complete) has 675 edges and 93 vertex of which 91 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.45 ms
Computed a total of 32 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 146 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 801 ms. (49 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 163 ms. (243 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 269 ms. (148 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 235 ms. (169 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 183499 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :2 out of 4
Probabilistic random walk after 183499 steps, saw 31575 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :2
[2024-06-07 07:41:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 769/771 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/771 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2747/3518 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3518 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 37/3555 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3555 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/3583 variables, 11/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3583 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 21/3604 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3604 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 15/3619 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3619 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/3619 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3619/3619 variables, and 93 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1961 ms.
Refiners :[State Equation: 93/93 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 769/771 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/771 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2747/3518 variables, 36/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3518 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3518 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 37/3555 variables, 22/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3555 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 28/3583 variables, 11/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3583 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 21/3604 variables, 10/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3604 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 15/3619 variables, 12/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3619 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/3619 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3619/3619 variables, and 95 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3200 ms.
Refiners :[State Equation: 93/93 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 5206ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 68 steps, including 0 resets, run visited all 2 properties in 16 ms. (steps per millisecond=4 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 26 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 357 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 1538 ms.
Product exploration explored 100000 steps with 0 reset in 1365 ms.
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 3526/3526 transitions.
Applied a total of 0 rules in 27 ms. Remains 93 /93 variables (removed 0) and now considering 3526/3526 (removed 0) transitions.
[2024-06-07 07:42:05] [INFO ] Invariant cache hit.
[2024-06-07 07:42:06] [INFO ] Implicit Places using invariants in 948 ms returned []
[2024-06-07 07:42:06] [INFO ] Invariant cache hit.
[2024-06-07 07:42:09] [INFO ] Implicit Places using invariants and state equation in 2593 ms returned []
Implicit Place search using SMT with State Equation took 3546 ms to find 0 implicit places.
Running 3525 sub problems to find dead transitions.
[2024-06-07 07:42:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3525 unsolved
SMT process timed out in 92622ms, After SMT, problems are : Problem set: 0 solved, 3525 unsolved
Search for dead transitions found 0 dead transitions in 92692ms
Finished structural reductions in LTL mode , in 1 iterations and 96289 ms. Remains : 93/93 places, 3526/3526 transitions.
Treatment of property ResIsolation-PT-N08P1-LTLCardinality-04 finished in 322505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(G(p0)) U G(p1))||F(p0))))'
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 4600/4600 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 4600
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 98 transition count 4588
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 98 transition count 4588
Ensure Unique test removed 673 transitions
Reduce isomorphic transitions removed 673 transitions.
Iterating post reduction 1 with 673 rules applied. Total rules applied 698 place count 98 transition count 3915
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 704 place count 92 transition count 3144
Iterating global reduction 2 with 6 rules applied. Total rules applied 710 place count 92 transition count 3144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 711 place count 92 transition count 3143
Applied a total of 711 rules in 86 ms. Remains 92 /111 variables (removed 19) and now considering 3143/4600 (removed 1457) transitions.
// Phase 1: matrix 3143 rows 92 cols
[2024-06-07 07:43:43] [INFO ] Computed 0 invariants in 42 ms
[2024-06-07 07:43:43] [INFO ] Implicit Places using invariants in 560 ms returned []
[2024-06-07 07:43:43] [INFO ] Invariant cache hit.
[2024-06-07 07:43:45] [INFO ] Implicit Places using invariants and state equation in 1777 ms returned []
Implicit Place search using SMT with State Equation took 2345 ms to find 0 implicit places.
Running 3142 sub problems to find dead transitions.
[2024-06-07 07:43:45] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3142 unsolved
SMT process timed out in 88389ms, After SMT, problems are : Problem set: 0 solved, 3142 unsolved
Search for dead transitions found 0 dead transitions in 88453ms
Starting structural reductions in LTL mode, iteration 1 : 92/111 places, 3143/4600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90896 ms. Remains : 92/111 places, 3143/4600 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 326 ms.
Product exploration explored 100000 steps with 50000 reset in 304 ms.
Computed a total of 32 stabilizing places and 41 stable transitions
Graph (complete) has 658 edges and 92 vertex of which 90 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.46 ms
Computed a total of 32 stabilizing places and 41 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 25 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ResIsolation-PT-N08P1-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ResIsolation-PT-N08P1-LTLCardinality-06 finished in 91833 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(X((G(p1)||p0)))))'
Support contains 5 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 4600/4600 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 4600
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 102 transition count 4592
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 102 transition count 4592
Ensure Unique test removed 162 transitions
Reduce isomorphic transitions removed 162 transitions.
Iterating post reduction 1 with 162 rules applied. Total rules applied 179 place count 102 transition count 4430
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 181 place count 100 transition count 4173
Iterating global reduction 2 with 2 rules applied. Total rules applied 183 place count 100 transition count 4173
Applied a total of 183 rules in 141 ms. Remains 100 /111 variables (removed 11) and now considering 4173/4600 (removed 427) transitions.
// Phase 1: matrix 4173 rows 100 cols
[2024-06-07 07:45:15] [INFO ] Computed 0 invariants in 49 ms
[2024-06-07 07:45:15] [INFO ] Implicit Places using invariants in 958 ms returned []
[2024-06-07 07:45:15] [INFO ] Invariant cache hit.
[2024-06-07 07:45:19] [INFO ] Implicit Places using invariants and state equation in 3217 ms returned []
Implicit Place search using SMT with State Equation took 4204 ms to find 0 implicit places.
Running 4172 sub problems to find dead transitions.
[2024-06-07 07:45:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4172 unsolved
SMT process timed out in 105172ms, After SMT, problems are : Problem set: 0 solved, 4172 unsolved
Search for dead transitions found 0 dead transitions in 105242ms
Starting structural reductions in LTL mode, iteration 1 : 100/111 places, 4173/4600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109602 ms. Remains : 100/111 places, 4173/4600 transitions.
Stuttering acceptance computed with spot in 309 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLCardinality-07
Product exploration explored 100000 steps with 25000 reset in 367 ms.
Product exploration explored 100000 steps with 25000 reset in 305 ms.
Computed a total of 34 stabilizing places and 43 stable transitions
Graph (complete) has 725 edges and 100 vertex of which 98 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.39 ms
Computed a total of 34 stabilizing places and 43 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 1620 ms. (24 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 417 ms. (95 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 313 ms. (127 steps per ms) remains 2/2 properties
[2024-06-07 07:47:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 775/780 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/780 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3396/4176 variables, 45/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4176 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/4207 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4207 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 30/4237 variables, 12/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4237 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 21/4258 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4258 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 15/4273 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4273 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/4273 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4273/4273 variables, and 100 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1868 ms.
Refiners :[State Equation: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 775/780 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/780 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3396/4176 variables, 45/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4176 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4176 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 31/4207 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4207 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/4237 variables, 12/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4237 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 21/4258 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4258 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 15/4273 variables, 12/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4273 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/4273 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4273/4273 variables, and 102 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4917 ms.
Refiners :[State Equation: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 6843ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 1834 steps, including 33 resets, run visited all 2 properties in 70 ms. (steps per millisecond=26 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 72 ms.
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 204 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 4173/4173 transitions.
Applied a total of 0 rules in 33 ms. Remains 100 /100 variables (removed 0) and now considering 4173/4173 (removed 0) transitions.
[2024-06-07 07:47:14] [INFO ] Invariant cache hit.
[2024-06-07 07:47:15] [INFO ] Implicit Places using invariants in 956 ms returned []
[2024-06-07 07:47:15] [INFO ] Invariant cache hit.
[2024-06-07 07:47:17] [INFO ] Implicit Places using invariants and state equation in 2685 ms returned []
Implicit Place search using SMT with State Equation took 3645 ms to find 0 implicit places.
Running 4172 sub problems to find dead transitions.
[2024-06-07 07:47:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4172 unsolved
SMT process timed out in 103348ms, After SMT, problems are : Problem set: 0 solved, 4172 unsolved
Search for dead transitions found 0 dead transitions in 103430ms
Finished structural reductions in LTL mode , in 1 iterations and 107164 ms. Remains : 100/100 places, 4173/4173 transitions.
Computed a total of 34 stabilizing places and 43 stable transitions
Graph (complete) has 725 edges and 100 vertex of which 98 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.40 ms
Computed a total of 34 stabilizing places and 43 stable transitions
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 113 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 2855 ms. (14 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 435 ms. (91 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 444 ms. (89 steps per ms) remains 2/2 properties
[2024-06-07 07:49:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 775/780 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/780 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3396/4176 variables, 45/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4176 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 31/4207 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4207 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 30/4237 variables, 12/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4237 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 21/4258 variables, 10/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4258 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 15/4273 variables, 12/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4273 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/4273 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4273/4273 variables, and 100 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1891 ms.
Refiners :[State Equation: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 775/780 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/780 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3396/4176 variables, 45/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4176 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4176 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 31/4207 variables, 16/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4207 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 30/4237 variables, 12/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4237 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 21/4258 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4258 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 15/4273 variables, 12/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4273 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/4273 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4273/4273 variables, and 102 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4390 ms.
Refiners :[State Equation: 100/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 6346ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 707 steps, including 12 resets, run visited all 2 properties in 27 ms. (steps per millisecond=26 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 29 ms.
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 204 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 284 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 321 ms.
Product exploration explored 100000 steps with 25000 reset in 326 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 4173/4173 transitions.
Graph (trivial) has 66 edges and 100 vertex of which 18 / 100 are part of one of the 6 SCC in 0 ms
Free SCC test removed 12 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 707 edges and 88 vertex of which 86 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.23 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 11 place count 86 transition count 4159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 86 transition count 4158
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 12 place count 86 transition count 4167
Deduced a syphon composed of 18 places in 3 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 21 place count 86 transition count 4167
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 25 place count 82 transition count 4163
Deduced a syphon composed of 14 places in 4 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 82 transition count 4163
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 26 places in 1 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 41 place count 82 transition count 4164
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 46 place count 77 transition count 4158
Deduced a syphon composed of 21 places in 1 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 51 place count 77 transition count 4158
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 24 places in 2 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 77 transition count 4193
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 74 transition count 4187
Deduced a syphon composed of 21 places in 2 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 74 transition count 4187
Deduced a syphon composed of 21 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 74 transition count 4184
Deduced a syphon composed of 21 places in 0 ms
Applied a total of 63 rules in 11500 ms. Remains 74 /100 variables (removed 26) and now considering 4184/4173 (removed -11) transitions.
[2024-06-07 07:49:33] [INFO ] Redundant transitions in 10591 ms returned []
Running 4168 sub problems to find dead transitions.
[2024-06-07 07:49:33] [INFO ] Flow matrix only has 4179 transitions (discarded 5 similar events)
// Phase 1: matrix 4179 rows 74 cols
[2024-06-07 07:49:33] [INFO ] Computed 0 invariants in 34 ms
[2024-06-07 07:49:42] [INFO ] State equation strengthened by 4079 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4168 unsolved
SMT process timed out in 115815ms, After SMT, problems are : Problem set: 0 solved, 4168 unsolved
Search for dead transitions found 0 dead transitions in 115873ms
Starting structural reductions in SI_LTL mode, iteration 1 : 74/100 places, 4184/4173 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137984 ms. Remains : 74/100 places, 4184/4173 transitions.
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 4173/4173 transitions.
Applied a total of 0 rules in 21 ms. Remains 100 /100 variables (removed 0) and now considering 4173/4173 (removed 0) transitions.
// Phase 1: matrix 4173 rows 100 cols
[2024-06-07 07:51:29] [INFO ] Computed 0 invariants in 30 ms
[2024-06-07 07:51:29] [INFO ] Implicit Places using invariants in 667 ms returned []
[2024-06-07 07:51:29] [INFO ] Invariant cache hit.
[2024-06-07 07:51:32] [INFO ] Implicit Places using invariants and state equation in 2320 ms returned []
Implicit Place search using SMT with State Equation took 2998 ms to find 0 implicit places.
Running 4172 sub problems to find dead transitions.
[2024-06-07 07:51:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4172 unsolved
SMT process timed out in 102843ms, After SMT, problems are : Problem set: 0 solved, 4172 unsolved
Search for dead transitions found 0 dead transitions in 102892ms
Finished structural reductions in LTL mode , in 1 iterations and 105921 ms. Remains : 100/100 places, 4173/4173 transitions.
Treatment of property ResIsolation-PT-N08P1-LTLCardinality-07 finished in 481097 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(X(G(p0)))))'
Support contains 1 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 4600/4600 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 110 transition count 4600
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 98 transition count 4588
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 98 transition count 4588
Ensure Unique test removed 546 transitions
Reduce isomorphic transitions removed 546 transitions.
Iterating post reduction 1 with 546 rules applied. Total rules applied 571 place count 98 transition count 4042
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 576 place count 93 transition count 3527
Iterating global reduction 2 with 5 rules applied. Total rules applied 581 place count 93 transition count 3527
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 582 place count 93 transition count 3526
Applied a total of 582 rules in 81 ms. Remains 93 /111 variables (removed 18) and now considering 3526/4600 (removed 1074) transitions.
// Phase 1: matrix 3526 rows 93 cols
[2024-06-07 07:53:16] [INFO ] Computed 0 invariants in 46 ms
[2024-06-07 07:53:16] [INFO ] Implicit Places using invariants in 623 ms returned []
[2024-06-07 07:53:16] [INFO ] Invariant cache hit.
[2024-06-07 07:53:19] [INFO ] Implicit Places using invariants and state equation in 2564 ms returned []
Implicit Place search using SMT with State Equation took 3197 ms to find 0 implicit places.
Running 3525 sub problems to find dead transitions.
[2024-06-07 07:53:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3525 unsolved
SMT process timed out in 92570ms, After SMT, problems are : Problem set: 0 solved, 3525 unsolved
Search for dead transitions found 0 dead transitions in 92639ms
Starting structural reductions in LTL mode, iteration 1 : 93/111 places, 3526/4600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95930 ms. Remains : 93/111 places, 3526/4600 transitions.
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ResIsolation-PT-N08P1-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N08P1-LTLCardinality-12 finished in 96193 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 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 4600/4600 transitions.
Graph (trivial) has 78 edges and 111 vertex of which 24 / 111 are part of one of the 8 SCC in 1 ms
Free SCC test removed 16 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 814 edges and 95 vertex of which 90 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.25 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 12 place count 89 transition count 4569
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 22 place count 79 transition count 4569
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 22 place count 79 transition count 4561
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 38 place count 71 transition count 4561
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 43 place count 66 transition count 4556
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 66 transition count 4556
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Iterating post reduction 2 with 67 rules applied. Total rules applied 115 place count 66 transition count 4489
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 115 place count 66 transition count 4488
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 65 transition count 4488
Performed 12 Post agglomeration using F-continuation condition with reduction of 415 identical transitions.
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 141 place count 53 transition count 4061
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 3 with 64 rules applied. Total rules applied 205 place count 53 transition count 3997
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 207 place count 51 transition count 3485
Iterating global reduction 4 with 2 rules applied. Total rules applied 209 place count 51 transition count 3485
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 211 place count 51 transition count 3483
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 211 place count 51 transition count 3481
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 215 place count 49 transition count 3481
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 221 place count 46 transition count 3489
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 222 place count 46 transition count 3488
Applied a total of 222 rules in 10099 ms. Remains 46 /111 variables (removed 65) and now considering 3488/4600 (removed 1112) transitions.
[2024-06-07 07:55:02] [INFO ] Flow matrix only has 3481 transitions (discarded 7 similar events)
// Phase 1: matrix 3481 rows 46 cols
[2024-06-07 07:55:02] [INFO ] Computed 0 invariants in 20 ms
[2024-06-07 07:55:02] [INFO ] Implicit Places using invariants in 524 ms returned []
[2024-06-07 07:55:02] [INFO ] Flow matrix only has 3481 transitions (discarded 7 similar events)
[2024-06-07 07:55:02] [INFO ] Invariant cache hit.
[2024-06-07 07:55:05] [INFO ] State equation strengthened by 3444 read => feed constraints.
[2024-06-07 07:55:25] [INFO ] Implicit Places using invariants and state equation in 22473 ms returned []
Implicit Place search using SMT with State Equation took 23002 ms to find 0 implicit places.
[2024-06-07 07:55:35] [INFO ] Redundant transitions in 10558 ms returned []
Running 3470 sub problems to find dead transitions.
[2024-06-07 07:55:35] [INFO ] Flow matrix only has 3481 transitions (discarded 7 similar events)
[2024-06-07 07:55:35] [INFO ] Invariant cache hit.
[2024-06-07 07:55:39] [INFO ] State equation strengthened by 3444 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3470 unsolved
SMT process timed out in 96941ms, After SMT, problems are : Problem set: 0 solved, 3470 unsolved
Search for dead transitions found 0 dead transitions in 96984ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/111 places, 3488/4600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140660 ms. Remains : 46/111 places, 3488/4600 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Running random walk in product with property : ResIsolation-PT-N08P1-LTLCardinality-14
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA ResIsolation-PT-N08P1-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResIsolation-PT-N08P1-LTLCardinality-14 finished in 140760 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&&X(p1))||G(p1))))))'
Found a Shortening insensitive property : ResIsolation-PT-N08P1-LTLCardinality-04
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 111/111 places, 4600/4600 transitions.
Graph (trivial) has 81 edges and 111 vertex of which 24 / 111 are part of one of the 8 SCC in 2 ms
Free SCC test removed 16 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 814 edges and 95 vertex of which 90 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.34 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 12 place count 89 transition count 4569
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 22 place count 79 transition count 4569
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 22 place count 79 transition count 4560
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 40 place count 70 transition count 4560
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 45 place count 65 transition count 4555
Iterating global reduction 2 with 5 rules applied. Total rules applied 50 place count 65 transition count 4555
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 2 with 99 rules applied. Total rules applied 149 place count 65 transition count 4456
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 149 place count 65 transition count 4455
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 151 place count 64 transition count 4455
Performed 12 Post agglomeration using F-continuation condition with reduction of 319 identical transitions.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 175 place count 52 transition count 4124
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 3 with 128 rules applied. Total rules applied 303 place count 52 transition count 3996
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 305 place count 50 transition count 3484
Iterating global reduction 4 with 2 rules applied. Total rules applied 307 place count 50 transition count 3484
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 309 place count 50 transition count 3482
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 309 place count 50 transition count 3480
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 313 place count 48 transition count 3480
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 319 place count 45 transition count 3488
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 320 place count 45 transition count 3487
Applied a total of 320 rules in 913 ms. Remains 45 /111 variables (removed 66) and now considering 3487/4600 (removed 1113) transitions.
[2024-06-07 07:57:14] [INFO ] Flow matrix only has 3480 transitions (discarded 7 similar events)
// Phase 1: matrix 3480 rows 45 cols
[2024-06-07 07:57:14] [INFO ] Computed 0 invariants in 12 ms
[2024-06-07 07:57:14] [INFO ] Implicit Places using invariants in 559 ms returned []
[2024-06-07 07:57:14] [INFO ] Flow matrix only has 3480 transitions (discarded 7 similar events)
[2024-06-07 07:57:14] [INFO ] Invariant cache hit.
[2024-06-07 07:57:17] [INFO ] State equation strengthened by 3444 read => feed constraints.
[2024-06-07 07:57:39] [INFO ] Implicit Places using invariants and state equation in 24687 ms returned []
Implicit Place search using SMT with State Equation took 25250 ms to find 0 implicit places.
Running 3469 sub problems to find dead transitions.
[2024-06-07 07:57:39] [INFO ] Flow matrix only has 3480 transitions (discarded 7 similar events)
[2024-06-07 07:57:39] [INFO ] Invariant cache hit.
[2024-06-07 07:57:43] [INFO ] State equation strengthened by 3444 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3469 unsolved
At refinement iteration 1 (OVERLAPS) 3478/3521 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 3469 unsolved
SMT process timed out in 97361ms, After SMT, problems are : Problem set: 0 solved, 3469 unsolved
Search for dead transitions found 0 dead transitions in 97403ms
Starting structural reductions in LI_LTL mode, iteration 1 : 45/111 places, 3487/4600 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 123586 ms. Remains : 45/111 places, 3487/4600 transitions.
Running random walk in product with property : ResIsolation-PT-N08P1-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 228 ms.
Product exploration explored 100000 steps with 0 reset in 219 ms.
Computed a total of 6 stabilizing places and 26 stable transitions
Computed a total of 6 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 221 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (2414 resets) in 13181 ms. (3 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (717 resets) in 208 ms. (191 steps per ms) remains 1/1 properties
[2024-06-07 07:59:22] [INFO ] Flow matrix only has 3480 transitions (discarded 7 similar events)
[2024-06-07 07:59:22] [INFO ] Invariant cache hit.
[2024-06-07 07:59:27] [INFO ] State equation strengthened by 3444 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 769/771 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/771 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2729/3500 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 10417ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 45/45 places, 3487/3487 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 45 transition count 3474
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 21 place count 41 transition count 3470
Drop transitions (Redundant composition of simpler transitions.) removed 128 transitions
Redundant transition composition rules discarded 128 transitions
Iterating global reduction 1 with 128 rules applied. Total rules applied 149 place count 41 transition count 3342
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 151 place count 41 transition count 3340
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 1 with 130 rules applied. Total rules applied 281 place count 39 transition count 3212
Drop transitions (Redundant composition of simpler transitions.) removed 128 transitions
Redundant transition composition rules discarded 128 transitions
Iterating global reduction 2 with 128 rules applied. Total rules applied 409 place count 39 transition count 3084
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 410 place count 38 transition count 3083
Applied a total of 410 rules in 18441 ms. Remains 38 /45 variables (removed 7) and now considering 3083/3487 (removed 404) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18442 ms. Remains : 38/45 places, 3083/3487 transitions.
RANDOM walk for 40000 steps (53 resets) in 21710 ms. (1 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (26 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
Probably explored full state space saw : 1551 states, properties seen :0
Probabilistic random walk after 4634 steps, saw 1551 distinct states, run finished after 217 ms. (steps per millisecond=21 ) properties seen :0
Explored full state space saw : 1551 states, properties seen :0
Exhaustive walk after 4634 steps, saw 1551 distinct states, run finished after 211 ms. (steps per millisecond=21 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 418 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 3487/3487 transitions.
Applied a total of 0 rules in 23 ms. Remains 45 /45 variables (removed 0) and now considering 3487/3487 (removed 0) transitions.
[2024-06-07 07:59:58] [INFO ] Flow matrix only has 3480 transitions (discarded 7 similar events)
[2024-06-07 07:59:58] [INFO ] Invariant cache hit.
[2024-06-07 07:59:58] [INFO ] Implicit Places using invariants in 788 ms returned []
[2024-06-07 07:59:58] [INFO ] Flow matrix only has 3480 transitions (discarded 7 similar events)
[2024-06-07 07:59:58] [INFO ] Invariant cache hit.
[2024-06-07 08:00:01] [INFO ] State equation strengthened by 3444 read => feed constraints.
[2024-06-07 08:00:23] [INFO ] Implicit Places using invariants and state equation in 24257 ms returned []
Implicit Place search using SMT with State Equation took 25048 ms to find 0 implicit places.
Running 3469 sub problems to find dead transitions.
[2024-06-07 08:00:23] [INFO ] Flow matrix only has 3480 transitions (discarded 7 similar events)
[2024-06-07 08:00:23] [INFO ] Invariant cache hit.
[2024-06-07 08:00:28] [INFO ] State equation strengthened by 3444 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3469 unsolved
At refinement iteration 1 (OVERLAPS) 3478/3521 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 3469 unsolved
SMT process timed out in 104569ms, After SMT, problems are : Problem set: 0 solved, 3469 unsolved
Search for dead transitions found 0 dead transitions in 104636ms
Finished structural reductions in LTL mode , in 1 iterations and 129717 ms. Remains : 45/45 places, 3487/3487 transitions.
Computed a total of 6 stabilizing places and 26 stable transitions
Computed a total of 6 stabilizing places and 26 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 177 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 21933 steps (3114 resets) in 1761 ms. (12 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 257 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 51 ms.
Product exploration explored 100000 steps with 0 reset in 63 ms.
Support contains 2 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 3487/3487 transitions.
Applied a total of 0 rules in 15 ms. Remains 45 /45 variables (removed 0) and now considering 3487/3487 (removed 0) transitions.
[2024-06-07 08:02:10] [INFO ] Flow matrix only has 3480 transitions (discarded 7 similar events)
[2024-06-07 08:02:10] [INFO ] Invariant cache hit.
[2024-06-07 08:02:10] [INFO ] Implicit Places using invariants in 696 ms returned []
[2024-06-07 08:02:10] [INFO ] Flow matrix only has 3480 transitions (discarded 7 similar events)
[2024-06-07 08:02:10] [INFO ] Invariant cache hit.
[2024-06-07 08:02:12] [INFO ] State equation strengthened by 3444 read => feed constraints.
[2024-06-07 08:02:34] [INFO ] Implicit Places using invariants and state equation in 23710 ms returned []
Implicit Place search using SMT with State Equation took 24412 ms to find 0 implicit places.
Running 3469 sub problems to find dead transitions.
[2024-06-07 08:02:34] [INFO ] Flow matrix only has 3480 transitions (discarded 7 similar events)
[2024-06-07 08:02:34] [INFO ] Invariant cache hit.
[2024-06-07 08:02:39] [INFO ] State equation strengthened by 3444 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3469 unsolved
At refinement iteration 1 (OVERLAPS) 3478/3521 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 3469 unsolved
SMT process timed out in 101514ms, After SMT, problems are : Problem set: 0 solved, 3469 unsolved
Search for dead transitions found 0 dead transitions in 101559ms
Finished structural reductions in LTL mode , in 1 iterations and 125992 ms. Remains : 45/45 places, 3487/3487 transitions.
Treatment of property ResIsolation-PT-N08P1-LTLCardinality-04 finished in 424212 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(X((G(p1)||p0)))))'
[2024-06-07 08:04:18] [INFO ] Flatten gal took : 1016 ms
[2024-06-07 08:04:18] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-07 08:04:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 111 places, 4600 transitions and 81351 arcs took 117 ms.
Total runtime 1850453 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ResIsolation-PT-N08P1-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ResIsolation-PT-N08P1-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717748084116

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name ResIsolation-PT-N08P1-LTLCardinality-04
ltl formula formula --ltl=/tmp/1487/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 111 places, 4600 transitions and 81351 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.890 real 0.370 user 0.210 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1487/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1487/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1487/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1487/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 111 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 112, there are 4619 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~746 levels ~10000 states ~57700 transitions
pnml2lts-mc( 0/ 4): ~746 levels ~20000 states ~119356 transitions
pnml2lts-mc( 0/ 4): ~746 levels ~40000 states ~250040 transitions
pnml2lts-mc( 0/ 4): ~746 levels ~80000 states ~522916 transitions
pnml2lts-mc( 0/ 4): ~2113 levels ~160000 states ~1095948 transitions
pnml2lts-mc( 0/ 4): ~2113 levels ~320000 states ~2330588 transitions
pnml2lts-mc( 3/ 4): ~896 levels ~640000 states ~4398528 transitions
pnml2lts-mc( 3/ 4): ~896 levels ~1280000 states ~9362992 transitions
pnml2lts-mc( 3/ 4): ~2179 levels ~2560000 states ~19311168 transitions
pnml2lts-mc( 2/ 4): ~286 levels ~5120000 states ~34280336 transitions
pnml2lts-mc( 2/ 4): ~286 levels ~10240000 states ~72032304 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~1985!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 763584
pnml2lts-mc( 0/ 4): unique states count: 11040457
pnml2lts-mc( 0/ 4): unique transitions count: 86154018
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 44644537
pnml2lts-mc( 0/ 4): - claim found count: 30458074
pnml2lts-mc( 0/ 4): - claim success count: 11040469
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12364
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 11040469 states 86154046 transitions, fanout: 7.803
pnml2lts-mc( 0/ 4): Total exploration time 621.820 sec (621.820 sec minimum, 621.820 sec on average)
pnml2lts-mc( 0/ 4): States per second: 17755, Transitions per second: 138551
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 88.8MB, 8.4 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 32.0%/7.0%
pnml2lts-mc( 0/ 4): Stored 4719 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 88.8MB (~256.0MB paged-in)
ltl formula name ResIsolation-PT-N08P1-LTLCardinality-07
ltl formula formula --ltl=/tmp/1487/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 111 places, 4600 transitions and 81351 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.870 real 0.330 user 0.170 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1487/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1487/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1487/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1487/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 112 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 112, there are 4658 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 9
pnml2lts-mc( 0/ 4): unique states count: 9
pnml2lts-mc( 0/ 4): unique transitions count: 9
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 6
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 30
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 30 states 40 transitions, fanout: 1.333
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 59.6 B/state, compr.: 13.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 4719 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ResIsolation-PT-N08P1, 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 r631-smll-171774446900003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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