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.r492-smll-171636266100075.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 Echo-PT-d02r09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266100075
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 784K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 12 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 04:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 114K Apr 12 04:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 303K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717194656886

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d02r09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:30:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:30:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:30:59] [INFO ] Load time of PNML (sax parser for PT used): 361 ms
[2024-05-31 22:30:59] [INFO ] Transformed 735 places.
[2024-05-31 22:30:59] [INFO ] Transformed 570 transitions.
[2024-05-31 22:30:59] [INFO ] Found NUPN structural information;
[2024-05-31 22:30:59] [INFO ] Parsed PT model containing 735 places and 570 transitions and 3220 arcs in 828 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 44 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Echo-PT-d02r09-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 735 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 735/735 places, 570/570 transitions.
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 658 transition count 570
Applied a total of 77 rules in 197 ms. Remains 658 /735 variables (removed 77) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 658 cols
[2024-05-31 22:31:01] [INFO ] Computed 292 invariants in 538 ms
[2024-05-31 22:31:05] [INFO ] Implicit Places using invariants in 4128 ms returned []
[2024-05-31 22:31:05] [INFO ] Invariant cache hit.
[2024-05-31 22:31:10] [INFO ] Implicit Places using invariants and state equation in 5834 ms returned []
Implicit Place search using SMT with State Equation took 10087 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-31 22:31:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 135/788 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (OVERLAPS) 4/657 variables, 12/800 constraints. Problems are: Problem set: 0 solved, 569 unsolved
SMT process timed out in 30609ms, After SMT, problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 30650ms
Starting structural reductions in LTL mode, iteration 1 : 658/735 places, 570/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40986 ms. Remains : 658/735 places, 570/570 transitions.
Support contains 28 out of 658 places after structural reductions.
[2024-05-31 22:31:42] [INFO ] Flatten gal took : 212 ms
[2024-05-31 22:31:42] [INFO ] Flatten gal took : 127 ms
[2024-05-31 22:31:42] [INFO ] Input system was already deterministic with 570 transitions.
RANDOM walk for 40000 steps (244 resets) in 2150 ms. (18 steps per ms) remains 1/15 properties
BEST_FIRST walk for 40004 steps (12 resets) in 418 ms. (95 steps per ms) remains 1/1 properties
[2024-05-31 22:31:43] [INFO ] Invariant cache hit.
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Real declared 4/1228 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 57 ms.
Refiners :[Domain max(s): 0/658 constraints, Positive P Invariants (semi-flows): 0/12 constraints, Generalized P Invariants (flows): 0/280 constraints, State Equation: 0/658 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Computed a total of 658 stabilizing places and 570 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 658 transition count 570
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(X((G(!X(X(p0))) U p1))))))'
Support contains 2 out of 658 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 658/658 places, 570/570 transitions.
Graph (complete) has 1925 edges and 658 vertex of which 650 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.8 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 75 ms. Remains 649 /658 variables (removed 9) and now considering 568/570 (removed 2) transitions.
// Phase 1: matrix 568 rows 649 cols
[2024-05-31 22:31:44] [INFO ] Computed 285 invariants in 136 ms
[2024-05-31 22:31:48] [INFO ] Implicit Places using invariants in 4714 ms returned [93, 122, 125, 154]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 4721 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 645/658 places, 568/570 transitions.
Applied a total of 0 rules in 38 ms. Remains 645 /645 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4835 ms. Remains : 645/658 places, 568/570 transitions.
Stuttering acceptance computed with spot in 399 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : Echo-PT-d02r09-LTLCardinality-00
Product exploration explored 100000 steps with 655 reset in 1079 ms.
Product exploration explored 100000 steps with 658 reset in 886 ms.
Computed a total of 645 stabilizing places and 568 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 645 transition count 568
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 590 steps (1 resets) in 19 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 242 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 645 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 645/645 places, 568/568 transitions.
Applied a total of 0 rules in 56 ms. Remains 645 /645 variables (removed 0) and now considering 568/568 (removed 0) transitions.
// Phase 1: matrix 568 rows 645 cols
[2024-05-31 22:31:52] [INFO ] Computed 281 invariants in 201 ms
[2024-05-31 22:31:56] [INFO ] Implicit Places using invariants in 3778 ms returned []
[2024-05-31 22:31:56] [INFO ] Invariant cache hit.
[2024-05-31 22:32:01] [INFO ] Implicit Places using invariants and state equation in 5084 ms returned []
Implicit Place search using SMT with State Equation took 8870 ms to find 0 implicit places.
[2024-05-31 22:32:01] [INFO ] Redundant transitions in 62 ms returned []
Running 564 sub problems to find dead transitions.
[2024-05-31 22:32:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/644 variables, 644/644 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/644 variables, 104/748 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/644 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 3 (OVERLAPS) 1/645 variables, 3/751 constraints. Problems are: Problem set: 0 solved, 564 unsolved
SMT process timed out in 30482ms, After SMT, problems are : Problem set: 0 solved, 564 unsolved
Search for dead transitions found 0 dead transitions in 30499ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39502 ms. Remains : 645/645 places, 568/568 transitions.
Computed a total of 645 stabilizing places and 568 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 645 transition count 568
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 660 steps (1 resets) in 58 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 658 reset in 904 ms.
Product exploration explored 100000 steps with 657 reset in 770 ms.
Support contains 2 out of 645 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 645/645 places, 568/568 transitions.
Graph (complete) has 1860 edges and 645 vertex of which 644 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 31 ms. Remains 644 /645 variables (removed 1) and now considering 568/568 (removed 0) transitions.
// Phase 1: matrix 568 rows 644 cols
[2024-05-31 22:32:34] [INFO ] Computed 280 invariants in 172 ms
[2024-05-31 22:32:38] [INFO ] Implicit Places using invariants in 3357 ms returned []
[2024-05-31 22:32:38] [INFO ] Invariant cache hit.
[2024-05-31 22:32:42] [INFO ] Implicit Places using invariants and state equation in 4699 ms returned []
Implicit Place search using SMT with State Equation took 8061 ms to find 0 implicit places.
[2024-05-31 22:32:42] [INFO ] Redundant transitions in 65 ms returned []
Running 564 sub problems to find dead transitions.
[2024-05-31 22:32:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/644 variables, 644/644 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/644 variables, 280/924 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/644 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 3 (OVERLAPS) 568/1212 variables, 644/1568 constraints. Problems are: Problem set: 0 solved, 564 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1212/1212 variables, and 1568 constraints, problems are : Problem set: 0 solved, 564 unsolved in 30026 ms.
Refiners :[Domain max(s): 644/644 constraints, Generalized P Invariants (flows): 280/280 constraints, State Equation: 644/644 constraints, PredecessorRefiner: 564/564 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 564 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/644 variables, 644/644 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/644 variables, 280/924 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/644 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 3 (OVERLAPS) 568/1212 variables, 644/1568 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1212 variables, 564/2132 constraints. Problems are: Problem set: 0 solved, 564 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1212/1212 variables, and 2132 constraints, problems are : Problem set: 0 solved, 564 unsolved in 30024 ms.
Refiners :[Domain max(s): 644/644 constraints, Generalized P Invariants (flows): 280/280 constraints, State Equation: 644/644 constraints, PredecessorRefiner: 564/564 constraints, Known Traps: 0/0 constraints]
After SMT, in 60262ms problems are : Problem set: 0 solved, 564 unsolved
Search for dead transitions found 0 dead transitions in 60269ms
Starting structural reductions in SI_LTL mode, iteration 1 : 644/645 places, 568/568 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68434 ms. Remains : 644/645 places, 568/568 transitions.
Treatment of property Echo-PT-d02r09-LTLCardinality-00 finished in 119534 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 658 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 658/658 places, 570/570 transitions.
Graph (complete) has 1925 edges and 658 vertex of which 650 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 28 ms. Remains 649 /658 variables (removed 9) and now considering 568/570 (removed 2) transitions.
// Phase 1: matrix 568 rows 649 cols
[2024-05-31 22:33:43] [INFO ] Computed 285 invariants in 106 ms
[2024-05-31 22:33:46] [INFO ] Implicit Places using invariants in 3183 ms returned [93, 122, 125, 154]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3187 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 645/658 places, 568/570 transitions.
Applied a total of 0 rules in 25 ms. Remains 645 /645 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3243 ms. Remains : 645/658 places, 568/570 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d02r09-LTLCardinality-01
Product exploration explored 100000 steps with 621 reset in 1059 ms.
Product exploration explored 100000 steps with 621 reset in 733 ms.
Computed a total of 645 stabilizing places and 568 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 645 transition count 568
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
RANDOM walk for 509 steps (0 resets) in 12 ms. (39 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
// Phase 1: matrix 568 rows 645 cols
[2024-05-31 22:33:49] [INFO ] Computed 281 invariants in 211 ms
[2024-05-31 22:33:50] [INFO ] [Real]Absence check using 4 positive place invariants in 12 ms returned sat
[2024-05-31 22:34:04] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 22:34:04] [INFO ] [Real]Absence check using 4 positive and 277 generalized place invariants in 14077 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 645 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 645/645 places, 568/568 transitions.
Applied a total of 0 rules in 23 ms. Remains 645 /645 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-31 22:34:04] [INFO ] Invariant cache hit.
[2024-05-31 22:34:07] [INFO ] Implicit Places using invariants in 3457 ms returned []
[2024-05-31 22:34:07] [INFO ] Invariant cache hit.
[2024-05-31 22:34:14] [INFO ] Implicit Places using invariants and state equation in 6452 ms returned []
Implicit Place search using SMT with State Equation took 9916 ms to find 0 implicit places.
[2024-05-31 22:34:14] [INFO ] Redundant transitions in 30 ms returned []
Running 564 sub problems to find dead transitions.
[2024-05-31 22:34:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/644 variables, 644/644 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/644 variables, 220/864 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/644 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 564 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1/645 variables, 4/868 constraints. Problems are: Problem set: 0 solved, 564 unsolved
SMT process timed out in 30279ms, After SMT, problems are : Problem set: 0 solved, 564 unsolved
Search for dead transitions found 0 dead transitions in 30289ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40268 ms. Remains : 645/645 places, 568/568 transitions.
Computed a total of 645 stabilizing places and 568 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 645 transition count 568
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 145 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
RANDOM walk for 564 steps (0 resets) in 14 ms. (37 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2024-05-31 22:34:45] [INFO ] Invariant cache hit.
[2024-05-31 22:34:46] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2024-05-31 22:35:00] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 22:35:00] [INFO ] [Real]Absence check using 4 positive and 277 generalized place invariants in 13901 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 621 reset in 662 ms.
Product exploration explored 100000 steps with 621 reset in 755 ms.
Support contains 2 out of 645 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 645/645 places, 568/568 transitions.
Applied a total of 0 rules in 24 ms. Remains 645 /645 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-31 22:35:02] [INFO ] Invariant cache hit.
[2024-05-31 22:35:05] [INFO ] Implicit Places using invariants in 3444 ms returned []
[2024-05-31 22:35:05] [INFO ] Invariant cache hit.
[2024-05-31 22:35:10] [INFO ] Implicit Places using invariants and state equation in 5241 ms returned []
Implicit Place search using SMT with State Equation took 8687 ms to find 0 implicit places.
[2024-05-31 22:35:10] [INFO ] Redundant transitions in 14 ms returned []
Running 564 sub problems to find dead transitions.
[2024-05-31 22:35:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/644 variables, 644/644 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/644 variables, 220/864 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/644 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 3 (OVERLAPS) 1/645 variables, 4/868 constraints. Problems are: Problem set: 0 solved, 564 unsolved
SMT process timed out in 30212ms, After SMT, problems are : Problem set: 0 solved, 564 unsolved
Search for dead transitions found 0 dead transitions in 30219ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38953 ms. Remains : 645/645 places, 568/568 transitions.
Treatment of property Echo-PT-d02r09-LTLCardinality-01 finished in 117952 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(p0))) U ((X(X(X(p0)))&&(p1||X(G(p0))))||X(X(X(G(p0)))))))'
Support contains 3 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 570/570 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 654 transition count 570
Applied a total of 4 rules in 18 ms. Remains 654 /658 variables (removed 4) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 654 cols
[2024-05-31 22:35:41] [INFO ] Computed 288 invariants in 158 ms
[2024-05-31 22:35:45] [INFO ] Implicit Places using invariants in 4303 ms returned []
[2024-05-31 22:35:45] [INFO ] Invariant cache hit.
[2024-05-31 22:35:51] [INFO ] Implicit Places using invariants and state equation in 6285 ms returned []
Implicit Place search using SMT with State Equation took 10590 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-31 22:35:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 653/1224 variables, and 936 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30033 ms.
Refiners :[Domain max(s): 653/654 constraints, Generalized P Invariants (flows): 283/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (OVERLAPS) 1/654 variables, 5/941 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 1/942 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/1224 variables, and 942 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30031 ms.
Refiners :[Domain max(s): 654/654 constraints, Generalized P Invariants (flows): 288/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 0/569 constraints, Known Traps: 0/0 constraints]
After SMT, in 60405ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60416ms
Starting structural reductions in LTL mode, iteration 1 : 654/658 places, 570/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71026 ms. Remains : 654/658 places, 570/570 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : Echo-PT-d02r09-LTLCardinality-02
Product exploration explored 100000 steps with 25000 reset in 613 ms.
Product exploration explored 100000 steps with 25000 reset in 472 ms.
Computed a total of 654 stabilizing places and 570 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 654 transition count 570
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 421 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 444 steps (2 resets) in 9 ms. (44 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 11 factoid took 591 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 654 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 570/570 transitions.
Applied a total of 0 rules in 15 ms. Remains 654 /654 variables (removed 0) and now considering 570/570 (removed 0) transitions.
[2024-05-31 22:36:55] [INFO ] Invariant cache hit.
[2024-05-31 22:37:00] [INFO ] Implicit Places using invariants in 5054 ms returned []
[2024-05-31 22:37:00] [INFO ] Invariant cache hit.
[2024-05-31 22:37:06] [INFO ] Implicit Places using invariants and state equation in 6024 ms returned []
Implicit Place search using SMT with State Equation took 11080 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-31 22:37:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 653/1224 variables, and 936 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30021 ms.
Refiners :[Domain max(s): 653/654 constraints, Generalized P Invariants (flows): 283/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (OVERLAPS) 1/654 variables, 5/941 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 1/942 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/1224 variables, and 942 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30027 ms.
Refiners :[Domain max(s): 654/654 constraints, Generalized P Invariants (flows): 288/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 0/569 constraints, Known Traps: 0/0 constraints]
After SMT, in 60245ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60252ms
Finished structural reductions in LTL mode , in 1 iterations and 71350 ms. Remains : 654/654 places, 570/570 transitions.
Computed a total of 654 stabilizing places and 570 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 654 transition count 570
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 349 steps (1 resets) in 10 ms. (31 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 25000 reset in 623 ms.
Product exploration explored 100000 steps with 25000 reset in 733 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 654 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 654/654 places, 570/570 transitions.
Graph (complete) has 1893 edges and 654 vertex of which 649 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 100 ms. Remains 649 /654 variables (removed 5) and now considering 569/570 (removed 1) transitions.
[2024-05-31 22:38:10] [INFO ] Redundant transitions in 11 ms returned []
Running 568 sub problems to find dead transitions.
// Phase 1: matrix 569 rows 649 cols
[2024-05-31 22:38:11] [INFO ] Computed 284 invariants in 209 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/648 variables, 648/648 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/648 variables, 280/928 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 648/1218 variables, and 928 constraints, problems are : Problem set: 0 solved, 568 unsolved in 30026 ms.
Refiners :[Domain max(s): 648/649 constraints, Generalized P Invariants (flows): 280/284 constraints, State Equation: 0/649 constraints, PredecessorRefiner: 568/568 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 568 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/648 variables, 648/648 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/648 variables, 280/928 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/648 variables, 0/928 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 3 (OVERLAPS) 1/649 variables, 4/932 constraints. Problems are: Problem set: 0 solved, 568 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/649 variables, 1/933 constraints. Problems are: Problem set: 0 solved, 568 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 649/1218 variables, and 933 constraints, problems are : Problem set: 0 solved, 568 unsolved in 30025 ms.
Refiners :[Domain max(s): 649/649 constraints, Generalized P Invariants (flows): 284/284 constraints, State Equation: 0/649 constraints, PredecessorRefiner: 0/568 constraints, Known Traps: 0/0 constraints]
After SMT, in 60588ms problems are : Problem set: 0 solved, 568 unsolved
Search for dead transitions found 0 dead transitions in 60599ms
Starting structural reductions in SI_LTL mode, iteration 1 : 649/654 places, 569/570 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60727 ms. Remains : 649/654 places, 569/570 transitions.
Support contains 2 out of 654 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 654/654 places, 570/570 transitions.
Applied a total of 0 rules in 35 ms. Remains 654 /654 variables (removed 0) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 654 cols
[2024-05-31 22:39:11] [INFO ] Computed 288 invariants in 156 ms
[2024-05-31 22:39:16] [INFO ] Implicit Places using invariants in 4855 ms returned []
[2024-05-31 22:39:16] [INFO ] Invariant cache hit.
[2024-05-31 22:39:22] [INFO ] Implicit Places using invariants and state equation in 5741 ms returned []
Implicit Place search using SMT with State Equation took 10600 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-31 22:39:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 653/1224 variables, and 936 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30021 ms.
Refiners :[Domain max(s): 653/654 constraints, Generalized P Invariants (flows): 283/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (OVERLAPS) 1/654 variables, 5/941 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 1/942 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/1224 variables, and 942 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30026 ms.
Refiners :[Domain max(s): 654/654 constraints, Generalized P Invariants (flows): 288/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 0/569 constraints, Known Traps: 0/0 constraints]
After SMT, in 60233ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60239ms
Finished structural reductions in LTL mode , in 1 iterations and 70877 ms. Remains : 654/654 places, 570/570 transitions.
Treatment of property Echo-PT-d02r09-LTLCardinality-02 finished in 281136 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 570/570 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 654 transition count 570
Applied a total of 4 rules in 22 ms. Remains 654 /658 variables (removed 4) and now considering 570/570 (removed 0) transitions.
[2024-05-31 22:40:22] [INFO ] Invariant cache hit.
[2024-05-31 22:40:27] [INFO ] Implicit Places using invariants in 5106 ms returned []
[2024-05-31 22:40:27] [INFO ] Invariant cache hit.
[2024-05-31 22:40:33] [INFO ] Implicit Places using invariants and state equation in 5871 ms returned []
Implicit Place search using SMT with State Equation took 10979 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-31 22:40:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 1.0)
(s124 0.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 (/ 1.0 2.0))
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 0.0)
(s172 1.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 (/ 1.0 2.0))
(s190 1.0)
(s191 (/ 1.0 2.0))
(s192 1.0)
(s193 0.0)
(s194 (/ 1.0 2.0))
(s195 1.0)
(s196 1.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 0.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 (/ 1.0 2.0))
(s226 1.0)
(s227 1.0)
(s228 (/ 1.0 2.0))
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 0.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 1.0)
(s253 (/ 1.0 2.0))
(s254 1.0)
(s255 (/ 1.0 2.0))
(s256 0.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 0.0)
(s274 1.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 1.0)
(s280 0.0)
(s281 1.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 1.0)
(s286 0.0)
(s287 1.0)
(s288 1.0)
(s289 0.0)
(s290 1.0)
(s291 1.0)
(s292 0.0)
(s293 1.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 1.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 1.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 1.0)
(s319 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 653/1224 variables, and 936 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30024 ms.
Refiners :[Domain max(s): 653/654 constraints, Generalized P Invariants (flows): 283/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (OVERLAPS) 1/654 variables, 5/941 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 1/942 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/1224 variables, and 942 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30023 ms.
Refiners :[Domain max(s): 654/654 constraints, Generalized P Invariants (flows): 288/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 0/569 constraints, Known Traps: 0/0 constraints]
After SMT, in 60238ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60245ms
Starting structural reductions in LTL mode, iteration 1 : 654/658 places, 570/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71248 ms. Remains : 654/658 places, 570/570 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r09-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 520 ms.
Product exploration explored 100000 steps with 50000 reset in 573 ms.
Computed a total of 654 stabilizing places and 570 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 654 transition count 570
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d02r09-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r09-LTLCardinality-05 finished in 72876 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)||G(p1))))'
Support contains 3 out of 658 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 658/658 places, 570/570 transitions.
Graph (complete) has 1925 edges and 658 vertex of which 649 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 29 ms. Remains 648 /658 variables (removed 10) and now considering 568/570 (removed 2) transitions.
// Phase 1: matrix 568 rows 648 cols
[2024-05-31 22:41:35] [INFO ] Computed 284 invariants in 133 ms
[2024-05-31 22:41:38] [INFO ] Implicit Places using invariants in 3428 ms returned [93, 122, 125, 154]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3431 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 644/658 places, 568/570 transitions.
Applied a total of 0 rules in 18 ms. Remains 644 /644 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3478 ms. Remains : 644/658 places, 568/570 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Echo-PT-d02r09-LTLCardinality-11
Product exploration explored 100000 steps with 621 reset in 1041 ms.
Product exploration explored 100000 steps with 621 reset in 784 ms.
Computed a total of 644 stabilizing places and 568 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 644 transition count 568
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 543 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 7506 steps (45 resets) in 201 ms. (37 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 15 factoid took 1117 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 644 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 644/644 places, 568/568 transitions.
Applied a total of 0 rules in 23 ms. Remains 644 /644 variables (removed 0) and now considering 568/568 (removed 0) transitions.
// Phase 1: matrix 568 rows 644 cols
[2024-05-31 22:41:43] [INFO ] Computed 280 invariants in 245 ms
[2024-05-31 22:41:46] [INFO ] Implicit Places using invariants in 3492 ms returned []
[2024-05-31 22:41:46] [INFO ] Invariant cache hit.
[2024-05-31 22:41:51] [INFO ] Implicit Places using invariants and state equation in 4521 ms returned []
Implicit Place search using SMT with State Equation took 8017 ms to find 0 implicit places.
[2024-05-31 22:41:51] [INFO ] Redundant transitions in 7 ms returned []
Running 564 sub problems to find dead transitions.
[2024-05-31 22:41:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/644 variables, 644/644 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/644 variables, 280/924 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/644 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 564 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 1.0)
(s64 1.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 0.0)
(s90 1.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 1.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 1.0)
(s147 0.0)
(s148 1.0)
(s149 1.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 1.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 1.0)
(s177 1.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 1.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 1.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 1.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 1.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 1.0)
(s222 1.0)
(s223 0.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 1.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 1.0)
(s242 0.0)
(s243 1.0)
(s244 1.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 1.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 1.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 1.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 1.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 1.0)
(s327 0.0)
(s328 1.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 1.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 1.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 1.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 0.0)
(s378 1.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 1.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 1.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 1.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 1.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 568/1212 variables, 644/1568 constraints. Problems are: Problem set: 0 solved, 564 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1212/1212 variables, and 1568 constraints, problems are : Problem set: 0 solved, 564 unsolved in 30025 ms.
Refiners :[Domain max(s): 644/644 constraints, Generalized P Invariants (flows): 280/280 constraints, State Equation: 644/644 constraints, PredecessorRefiner: 564/564 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 564 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/644 variables, 644/644 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/644 variables, 280/924 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/644 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 3 (OVERLAPS) 568/1212 variables, 644/1568 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1212 variables, 564/2132 constraints. Problems are: Problem set: 0 solved, 564 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1212/1212 variables, and 2132 constraints, problems are : Problem set: 0 solved, 564 unsolved in 30022 ms.
Refiners :[Domain max(s): 644/644 constraints, Generalized P Invariants (flows): 280/280 constraints, State Equation: 644/644 constraints, PredecessorRefiner: 564/564 constraints, Known Traps: 0/0 constraints]
After SMT, in 60292ms problems are : Problem set: 0 solved, 564 unsolved
Search for dead transitions found 0 dead transitions in 60302ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 68359 ms. Remains : 644/644 places, 568/568 transitions.
Computed a total of 644 stabilizing places and 568 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 644 transition count 568
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 605 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 16263 steps (100 resets) in 621 ms. (26 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 15 factoid took 1169 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 621 reset in 901 ms.
Product exploration explored 100000 steps with 621 reset in 798 ms.
Support contains 3 out of 644 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 644/644 places, 568/568 transitions.
Applied a total of 0 rules in 18 ms. Remains 644 /644 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2024-05-31 22:42:55] [INFO ] Invariant cache hit.
[2024-05-31 22:42:59] [INFO ] Implicit Places using invariants in 3441 ms returned []
[2024-05-31 22:42:59] [INFO ] Invariant cache hit.
[2024-05-31 22:43:04] [INFO ] Implicit Places using invariants and state equation in 5507 ms returned []
Implicit Place search using SMT with State Equation took 8953 ms to find 0 implicit places.
[2024-05-31 22:43:04] [INFO ] Redundant transitions in 9 ms returned []
Running 564 sub problems to find dead transitions.
[2024-05-31 22:43:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/644 variables, 644/644 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/644 variables, 280/924 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/644 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 564 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 568/1212 variables, 644/1568 constraints. Problems are: Problem set: 0 solved, 564 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1212/1212 variables, and 1568 constraints, problems are : Problem set: 0 solved, 564 unsolved in 30016 ms.
Refiners :[Domain max(s): 644/644 constraints, Generalized P Invariants (flows): 280/280 constraints, State Equation: 644/644 constraints, PredecessorRefiner: 564/564 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 564 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/644 variables, 644/644 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/644 variables, 280/924 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/644 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 3 (OVERLAPS) 568/1212 variables, 644/1568 constraints. Problems are: Problem set: 0 solved, 564 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1212 variables, 564/2132 constraints. Problems are: Problem set: 0 solved, 564 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1212/1212 variables, and 2132 constraints, problems are : Problem set: 0 solved, 564 unsolved in 30019 ms.
Refiners :[Domain max(s): 644/644 constraints, Generalized P Invariants (flows): 280/280 constraints, State Equation: 644/644 constraints, PredecessorRefiner: 564/564 constraints, Known Traps: 0/0 constraints]
After SMT, in 60341ms problems are : Problem set: 0 solved, 564 unsolved
Search for dead transitions found 0 dead transitions in 60351ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 69341 ms. Remains : 644/644 places, 568/568 transitions.
Treatment of property Echo-PT-d02r09-LTLCardinality-11 finished in 149900 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' '!(((!p0||G(p1)) U X(G(p2))))'
Support contains 6 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 570/570 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 654 transition count 570
Applied a total of 4 rules in 11 ms. Remains 654 /658 variables (removed 4) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 654 cols
[2024-05-31 22:44:05] [INFO ] Computed 288 invariants in 101 ms
[2024-05-31 22:44:09] [INFO ] Implicit Places using invariants in 4058 ms returned []
[2024-05-31 22:44:09] [INFO ] Invariant cache hit.
[2024-05-31 22:44:15] [INFO ] Implicit Places using invariants and state equation in 6496 ms returned []
Implicit Place search using SMT with State Equation took 10556 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-31 22:44:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 653/1224 variables, and 936 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30023 ms.
Refiners :[Domain max(s): 653/654 constraints, Generalized P Invariants (flows): 283/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (OVERLAPS) 1/654 variables, 5/941 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 1/942 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/1224 variables, and 942 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30023 ms.
Refiners :[Domain max(s): 654/654 constraints, Generalized P Invariants (flows): 288/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 0/569 constraints, Known Traps: 0/0 constraints]
After SMT, in 60303ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60311ms
Starting structural reductions in LTL mode, iteration 1 : 654/658 places, 570/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70884 ms. Remains : 654/658 places, 570/570 transitions.
Stuttering acceptance computed with spot in 280 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : Echo-PT-d02r09-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 5547 steps with 34 reset in 61 ms.
FORMULA Echo-PT-d02r09-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r09-LTLCardinality-12 finished in 71255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 4 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 570/570 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 655 transition count 570
Applied a total of 3 rules in 17 ms. Remains 655 /658 variables (removed 3) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 655 cols
[2024-05-31 22:45:16] [INFO ] Computed 289 invariants in 181 ms
[2024-05-31 22:45:20] [INFO ] Implicit Places using invariants in 4431 ms returned []
[2024-05-31 22:45:20] [INFO ] Invariant cache hit.
[2024-05-31 22:45:27] [INFO ] Implicit Places using invariants and state equation in 6578 ms returned []
Implicit Place search using SMT with State Equation took 11015 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-31 22:45:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 190/843 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (OVERLAPS) 1/654 variables, 4/847 constraints. Problems are: Problem set: 0 solved, 569 unsolved
SMT process timed out in 30212ms, After SMT, problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 30219ms
Starting structural reductions in LTL mode, iteration 1 : 655/658 places, 570/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41253 ms. Remains : 655/658 places, 570/570 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Echo-PT-d02r09-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 628 ms.
Product exploration explored 100000 steps with 50000 reset in 674 ms.
Computed a total of 655 stabilizing places and 570 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 655 transition count 570
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 14 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d02r09-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r09-LTLCardinality-13 finished in 43086 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 570/570 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 655 transition count 570
Applied a total of 3 rules in 11 ms. Remains 655 /658 variables (removed 3) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 655 cols
[2024-05-31 22:45:59] [INFO ] Computed 289 invariants in 174 ms
[2024-05-31 22:46:04] [INFO ] Implicit Places using invariants in 4685 ms returned []
[2024-05-31 22:46:04] [INFO ] Invariant cache hit.
[2024-05-31 22:48:44] [INFO ] Implicit Places with SMT raised an exceptionSMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... after 160013 ms
Implicit Place search using SMT with State Equation took 164704 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2024-05-31 22:48:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 148/801 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 0.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 1.0)
(s37 0.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 0.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 1.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 0.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 1.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 1.0)
(s155 0.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 0.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 0.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 0.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 0.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 (/ 1.0 2.0))
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 1.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 0.0)
(s285 1.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 1.0)
(s291 0.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 1.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 0.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 0.0)
(s319 1.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 0.0)
(s332 1.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 0.0)
(s358 1.0)
(s359 0.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 0.0)
(s366 1.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 1.0)
(s380 1.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 1.0)
(s393 0.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 0.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 0.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 (/ 1.0 2.0))
(s429 1.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 1.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 0.0)
(s443 1.0)
(s444 0.0)
(s445 1.0)
(s446 0.0)
(s447 0.0)
(s448 1.0)
(s449 0.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 0.0)
(s454 1.0)
(s455 1.0)
(s456 (/ 1.0 2.0))
(s457 (/ 1.0 2.0))
(s458 1.0)
(s459 (/ 1.0 2.0))
(s460 1.0)
(s461 (/ 1.0 2.0))
(s462 1.0)
(s463 1.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 0.0)
(s470 0.0)
(s471 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1/654 variables, 4/805 constraints. Problems are: Problem set: 0 solved, 569 unsolved
SMT process timed out in 30202ms, After SMT, problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 30208ms
Starting structural reductions in LTL mode, iteration 1 : 655/658 places, 570/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 194925 ms. Remains : 655/658 places, 570/570 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r09-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d02r09-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r09-LTLCardinality-15 finished in 195053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(X((G(!X(X(p0))) U p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
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(p0))) U ((X(X(X(p0)))&&(p1||X(G(p0))))||X(X(X(G(p0)))))))'
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)||G(p1))))'
[2024-05-31 22:49:15] [INFO ] Flatten gal took : 95 ms
[2024-05-31 22:49:15] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-05-31 22:49:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 658 places, 570 transitions and 2951 arcs took 21 ms.
Total runtime 1096409 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : Echo-PT-d02r09-LTLCardinality-00
Could not compute solution for formula : Echo-PT-d02r09-LTLCardinality-01
FORMULA Echo-PT-d02r09-LTLCardinality-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Echo-PT-d02r09-LTLCardinality-11

BK_STOP 1717196077932

--------------------
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 Echo-PT-d02r09-LTLCardinality-00
ltl formula formula --ltl=/tmp/1386/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 658 places, 570 transitions and 2951 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.250 real 0.030 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1386/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1386/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1386/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1386/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 656 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 659, there are 579 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~162 levels ~10000 states ~33752 transitions
pnml2lts-mc( 0/ 4): ~150 levels ~20000 states ~61292 transitions
pnml2lts-mc( 0/ 4): ~150 levels ~40000 states ~118412 transitions
pnml2lts-mc( 0/ 4): ~150 levels ~80000 states ~234972 transitions
pnml2lts-mc( 0/ 4): ~150 levels ~160000 states ~480536 transitions
pnml2lts-mc( 0/ 4): ~150 levels ~320000 states ~967944 transitions
pnml2lts-mc( 0/ 4): ~150 levels ~640000 states ~2081760 transitions
pnml2lts-mc( 0/ 4): ~150 levels ~1280000 states ~4341608 transitions
pnml2lts-mc( 0/ 4): ~150 levels ~2560000 states ~9320604 transitions
pnml2lts-mc( 0/ 4): ~150 levels ~5120000 states ~19360900 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 5388800
pnml2lts-mc( 0/ 4): unique states count: 5389288
pnml2lts-mc( 0/ 4): unique transitions count: 30025072
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 24625845
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 5389297
pnml2lts-mc( 0/ 4): - cum. max stack depth: 635
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5389297 states 30025109 transitions, fanout: 5.571
pnml2lts-mc( 0/ 4): Total exploration time 104.690 sec (104.650 sec minimum, 104.660 sec on average)
pnml2lts-mc( 0/ 4): States per second: 51479, Transitions per second: 286800
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 105.2MB, 20.4 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 16.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 582 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 105.2MB (~256.0MB paged-in)
ltl formula name Echo-PT-d02r09-LTLCardinality-01
ltl formula formula --ltl=/tmp/1386/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 658 places, 570 transitions and 2951 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.100 real 0.030 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1386/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1386/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1386/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1386/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 655 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 659, there are 582 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): ~161 levels ~10000 states ~42752 transitions
pnml2lts-mc( 0/ 4): ~161 levels ~20000 states ~84996 transitions
pnml2lts-mc( 0/ 4): ~161 levels ~40000 states ~168204 transitions
pnml2lts-mc( 0/ 4): ~161 levels ~80000 states ~344352 transitions
pnml2lts-mc( 0/ 4): ~161 levels ~160000 states ~743140 transitions
pnml2lts-mc( 0/ 4): ~161 levels ~320000 states ~1611864 transitions
pnml2lts-mc( 0/ 4): ~161 levels ~640000 states ~3466304 transitions
pnml2lts-mc( 0/ 4): ~161 levels ~1280000 states ~7353100 transitions
pnml2lts-mc( 0/ 4): ~161 levels ~2560000 states ~16090840 transitions
pnml2lts-mc( 0/ 4): ~161 levels ~5120000 states ~34009608 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 5252328
pnml2lts-mc( 0/ 4): unique states count: 5252832
pnml2lts-mc( 0/ 4): unique transitions count: 40827811
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 35562621
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 5252839
pnml2lts-mc( 0/ 4): - cum. max stack depth: 645
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 5252839 states 40827833 transitions, fanout: 7.773
pnml2lts-mc( 0/ 4): Total exploration time 105.800 sec (105.790 sec minimum, 105.795 sec on average)
pnml2lts-mc( 0/ 4): States per second: 49649, Transitions per second: 385896
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 104.2MB, 20.7 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 15.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 582 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 104.2MB (~256.0MB paged-in)
ltl formula name Echo-PT-d02r09-LTLCardinality-02
ltl formula formula --ltl=/tmp/1386/ltl_2_
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 658 places, 570 transitions and 2951 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.100 real 0.020 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1386/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1386/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1386/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1386/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 11 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 656 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 659, there are 609 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: 24
pnml2lts-mc( 0/ 4): unique states count: 24
pnml2lts-mc( 0/ 4): unique transitions count: 29
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 18
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 42
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 42 states 78 transitions, fanout: 1.857
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, 157.0 B/state, compr.: 6.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 582 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)
ltl formula name Echo-PT-d02r09-LTLCardinality-11
ltl formula formula --ltl=/tmp/1386/ltl_3_
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 658 places, 570 transitions and 2951 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.090 real 0.030 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1386/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1386/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1386/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1386/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 655 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 659, there are 601 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): ~163 levels ~10000 states ~46860 transitions
pnml2lts-mc( 0/ 4): ~163 levels ~20000 states ~87332 transitions
pnml2lts-mc( 0/ 4): ~163 levels ~40000 states ~173520 transitions
pnml2lts-mc( 0/ 4): ~163 levels ~80000 states ~377760 transitions
pnml2lts-mc( 0/ 4): ~163 levels ~160000 states ~789284 transitions
pnml2lts-mc( 0/ 4): ~163 levels ~320000 states ~1654384 transitions
pnml2lts-mc( 0/ 4): ~163 levels ~640000 states ~3541488 transitions
pnml2lts-mc( 0/ 4): ~163 levels ~1280000 states ~7672724 transitions
pnml2lts-mc( 0/ 4): ~163 levels ~2560000 states ~16638212 transitions
pnml2lts-mc( 0/ 4): ~163 levels ~5120000 states ~35465944 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4971332
pnml2lts-mc( 0/ 4): unique states count: 4971822
pnml2lts-mc( 0/ 4): unique transitions count: 51331777
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 46341401
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4971828
pnml2lts-mc( 0/ 4): - cum. max stack depth: 645
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4971828 states 51331794 transitions, fanout: 10.325
pnml2lts-mc( 0/ 4): Total exploration time 108.610 sec (108.570 sec minimum, 108.590 sec on average)
pnml2lts-mc( 0/ 4): States per second: 45777, Transitions per second: 472625
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 102.0MB, 21.5 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 14.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 582 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 102.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="Echo-PT-d02r09"
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 Echo-PT-d02r09, 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 r492-smll-171636266100075"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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