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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.1K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 04:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 12 04:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 04:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 12 04:36 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 469K 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-d02r11-LTLCardinality-00
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-01
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-02
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-03
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-04
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-05
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-06
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-07
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-08
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-09
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-10
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-11
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-12
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-13
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-14
FORMULA_NAME Echo-PT-d02r11-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717196093996

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-d02r11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:54:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:54:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:54:56] [INFO ] Load time of PNML (sax parser for PT used): 492 ms
[2024-05-31 22:54:56] [INFO ] Transformed 1119 places.
[2024-05-31 22:54:56] [INFO ] Transformed 874 transitions.
[2024-05-31 22:54:56] [INFO ] Found NUPN structural information;
[2024-05-31 22:54:56] [INFO ] Parsed PT model containing 1119 places and 874 transitions and 4996 arcs in 712 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Echo-PT-d02r11-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r11-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r11-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r11-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r11-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r11-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r11-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r11-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 1119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1119/1119 places, 874/874 transitions.
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 1000 transition count 874
Applied a total of 119 rules in 353 ms. Remains 1000 /1119 variables (removed 119) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 1000 cols
[2024-05-31 22:54:58] [INFO ] Computed 442 invariants in 603 ms
[2024-05-31 22:55:26] [INFO ] Implicit Places using invariants in 29143 ms returned []
[2024-05-31 22:55:26] [INFO ] Invariant cache hit.
[2024-05-31 22:55:34] [INFO ] Implicit Places using invariants and state equation in 8001 ms returned []
Implicit Place search using SMT with State Equation took 37215 ms to find 0 implicit places.
Running 873 sub problems to find dead transitions.
[2024-05-31 22:55:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 184/1181 constraints. Problems are: Problem set: 0 solved, 873 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 0.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 1.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 0.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 2.0))
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 0.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 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.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 0.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 0.0)
(s101 1.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 1.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 0.0)
(s132 1.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 0.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 0.0)
(s143 1.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 997/1874 variables, and 1181 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30091 ms.
Refiners :[Domain max(s): 997/1000 constraints, Positive P Invariants (semi-flows): 0/8 constraints, Generalized P Invariants (flows): 184/434 constraints, State Equation: 0/1000 constraints, PredecessorRefiner: 873/873 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 873 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 184/1181 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/997 variables, 0/1181 constraints. Problems are: Problem set: 0 solved, 873 unsolved
SMT process timed out in 61159ms, After SMT, problems are : Problem set: 0 solved, 873 unsolved
Search for dead transitions found 0 dead transitions in 61219ms
Starting structural reductions in LTL mode, iteration 1 : 1000/1119 places, 874/874 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98853 ms. Remains : 1000/1119 places, 874/874 transitions.
Support contains 19 out of 1000 places after structural reductions.
[2024-05-31 22:56:36] [INFO ] Flatten gal took : 285 ms
[2024-05-31 22:56:36] [INFO ] Flatten gal took : 165 ms
[2024-05-31 22:56:37] [INFO ] Input system was already deterministic with 874 transitions.
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 13235 steps (53 resets) in 865 ms. (15 steps per ms) remains 0/10 properties
Computed a total of 1000 stabilizing places and 874 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1000 transition count 874
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(p0)))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 874/874 transitions.
Graph (complete) has 2949 edges and 1000 vertex of which 993 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.12 ms
Discarding 7 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 116 ms. Remains 992 /1000 variables (removed 8) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 992 cols
[2024-05-31 22:56:38] [INFO ] Computed 436 invariants in 366 ms
[2024-05-31 22:57:00] [INFO ] Implicit Places using invariants in 22688 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 22701 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 988/1000 places, 872/874 transitions.
Applied a total of 0 rules in 90 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 22908 ms. Remains : 988/1000 places, 872/874 transitions.
Stuttering acceptance computed with spot in 327 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r11-LTLCardinality-01
Stuttering criterion allowed to conclude after 354 steps with 7 reset in 17 ms.
FORMULA Echo-PT-d02r11-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLCardinality-01 finished in 23339 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 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 874/874 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 998 transition count 874
Applied a total of 2 rules in 50 ms. Remains 998 /1000 variables (removed 2) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 998 cols
[2024-05-31 22:57:01] [INFO ] Computed 440 invariants in 327 ms
[2024-05-31 22:57:16] [INFO ] Implicit Places using invariants in 15825 ms returned []
[2024-05-31 22:57:16] [INFO ] Invariant cache hit.
[2024-05-31 22:57:46] [INFO ] Implicit Places using invariants and state equation in 29153 ms returned []
Implicit Place search using SMT with State Equation took 44982 ms to find 0 implicit places.
Running 873 sub problems to find dead transitions.
[2024-05-31 22:57:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 435/1432 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 997/1872 variables, and 1432 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30034 ms.
Refiners :[Domain max(s): 997/998 constraints, Generalized P Invariants (flows): 435/440 constraints, State Equation: 0/998 constraints, PredecessorRefiner: 873/873 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 873 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 435/1432 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/1872 variables, and 1432 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30033 ms.
Refiners :[Domain max(s): 997/998 constraints, Generalized P Invariants (flows): 435/440 constraints, State Equation: 0/998 constraints, PredecessorRefiner: 0/873 constraints, Known Traps: 0/0 constraints]
After SMT, in 60561ms problems are : Problem set: 0 solved, 873 unsolved
Search for dead transitions found 0 dead transitions in 60577ms
Starting structural reductions in LTL mode, iteration 1 : 998/1000 places, 874/874 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105614 ms. Remains : 998/1000 places, 874/874 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r11-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 1303 ms.
Product exploration explored 100000 steps with 50000 reset in 849 ms.
Computed a total of 998 stabilizing places and 874 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 998 transition count 874
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 26 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-d02r11-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r11-LTLCardinality-05 finished in 108710 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 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 874/874 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 999 transition count 874
Applied a total of 1 rules in 40 ms. Remains 999 /1000 variables (removed 1) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 999 cols
[2024-05-31 22:58:50] [INFO ] Computed 441 invariants in 764 ms
[2024-05-31 22:59:26] [INFO ] Performed 377/999 implicitness test of which 0 returned IMPLICIT in 33 seconds.
[2024-05-31 22:59:29] [INFO ] Implicit Places using invariants in 39879 ms returned []
[2024-05-31 22:59:29] [INFO ] Invariant cache hit.
[2024-05-31 23:00:00] [INFO ] Implicit Places using invariants and state equation in 30943 ms returned []
Implicit Place search using SMT with State Equation took 70828 ms to find 0 implicit places.
Running 873 sub problems to find dead transitions.
[2024-05-31 23:00:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 357/1354 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 0.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 0.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 0.0)
(s48 0.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 0.0)
(s59 0.0)
(s60 0.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 0.0)
(s71 0.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 (/ 4.0 5.0))
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 1.0)
(s107 0.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 0.0)
(s126 1.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 0.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 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 0.0)
(s166 1.0)
(s167 0.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 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)
(s190 0.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 2.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 2.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 0.0)
(s220 0.0)
(s221 0.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 0.0)
(s226 1.0)
(s227 (/ 2.0 5.0))
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 1.0)
(s233 1.0)
(s234 0.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 0.0)
(s246 0.0)
(s247 1.0)
(s248 (/ 1.0 2.0))
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 (/ 3.0 5.0))
(s254 0.0)
(s255 (/ 3.0 5.0))
(s256 (/ 1.0 5.0))
(s257 1.0)
(s258 1.0)
(s259 (/ 3.0 5.0))
(s260 1.0)
(s261 1.0)
(s262 0.0)
(s263 (/ 3.0 5.0))
(s264 1.0)
(s265 1.0)
(s266 0.0)
(s267 (/ 3.0 5.0))
(s268 1.0)
(s269 0.0)
(s270 1.0)
(s271 (/ 3.0 5.0))
(s272 1.0)
(s273 (/ 1.0 5.0))
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 0.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 (/ 1.0 2.0))
(s291 1.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 (/ 3.0 5.0))
(s299 0.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 (/ 3.0 5.0))
(s313 (/ 1.0 5.0))
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.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 0.0)
(s333 1.0)
(s334 (/ 1.0 2.0))
(s335 0.0)
(s336 1.0)
(s337 1.0)
(s338 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 997/1873 variables, and 1354 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30032 ms.
Refiners :[Domain max(s): 997/999 constraints, Positive P Invariants (semi-flows): 0/4 constraints, Generalized P Invariants (flows): 357/437 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 873/873 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 873 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 357/1354 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/1873 variables, and 1354 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30041 ms.
Refiners :[Domain max(s): 997/999 constraints, Positive P Invariants (semi-flows): 0/4 constraints, Generalized P Invariants (flows): 357/437 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 0/873 constraints, Known Traps: 0/0 constraints]
After SMT, in 60513ms problems are : Problem set: 0 solved, 873 unsolved
Search for dead transitions found 0 dead transitions in 60529ms
Starting structural reductions in LTL mode, iteration 1 : 999/1000 places, 874/874 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131399 ms. Remains : 999/1000 places, 874/874 transitions.
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r11-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 155 steps with 0 reset in 5 ms.
FORMULA Echo-PT-d02r11-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLCardinality-08 finished in 131556 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))&&F(p1)))'
Support contains 5 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 874/874 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 998 transition count 874
Applied a total of 2 rules in 37 ms. Remains 998 /1000 variables (removed 2) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 998 cols
[2024-05-31 23:01:01] [INFO ] Computed 440 invariants in 423 ms
[2024-05-31 23:01:25] [INFO ] Implicit Places using invariants in 23770 ms returned []
[2024-05-31 23:01:25] [INFO ] Invariant cache hit.
[2024-05-31 23:01:55] [INFO ] Implicit Places using invariants and state equation in 30763 ms returned []
Implicit Place search using SMT with State Equation took 54544 ms to find 0 implicit places.
Running 873 sub problems to find dead transitions.
[2024-05-31 23:01:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 435/1432 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 997/1872 variables, and 1432 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30030 ms.
Refiners :[Domain max(s): 997/998 constraints, Generalized P Invariants (flows): 435/440 constraints, State Equation: 0/998 constraints, PredecessorRefiner: 873/873 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 873 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 435/1432 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/1872 variables, and 1432 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30030 ms.
Refiners :[Domain max(s): 997/998 constraints, Generalized P Invariants (flows): 435/440 constraints, State Equation: 0/998 constraints, PredecessorRefiner: 0/873 constraints, Known Traps: 0/0 constraints]
After SMT, in 60429ms problems are : Problem set: 0 solved, 873 unsolved
Search for dead transitions found 0 dead transitions in 60440ms
Starting structural reductions in LTL mode, iteration 1 : 998/1000 places, 874/874 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115023 ms. Remains : 998/1000 places, 874/874 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : Echo-PT-d02r11-LTLCardinality-09
Product exploration explored 100000 steps with 2729 reset in 1526 ms.
Product exploration explored 100000 steps with 2758 reset in 1214 ms.
Computed a total of 998 stabilizing places and 874 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 998 transition count 874
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 (NOT p1) p0), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 390 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 177 steps (0 resets) in 8 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 297 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 95 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1)]
[2024-05-31 23:03:00] [INFO ] Invariant cache hit.
[2024-05-31 23:03:15] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:03:15] [INFO ] [Real]Absence check using 0 positive and 440 generalized place invariants in 13327 ms returned unknown
Could not prove EG (NOT p1)
Support contains 2 out of 998 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 : 998/998 places, 874/874 transitions.
Graph (complete) has 2933 edges and 998 vertex of which 993 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.5 ms
Discarding 5 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 50 ms. Remains 992 /998 variables (removed 6) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 992 cols
[2024-05-31 23:03:16] [INFO ] Computed 436 invariants in 305 ms
[2024-05-31 23:03:22] [INFO ] Implicit Places using invariants in 6458 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 6460 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 988/998 places, 872/874 transitions.
Applied a total of 0 rules in 49 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6559 ms. Remains : 988/998 places, 872/874 transitions.
Computed a total of 988 stabilizing places and 872 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 988 transition count 872
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 p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 138 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 97 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 277 steps (0 resets) in 14 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 168 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 97 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 872 rows 988 cols
[2024-05-31 23:03:24] [INFO ] Computed 432 invariants in 476 ms
[2024-05-31 23:03:39] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:03:39] [INFO ] [Real]Absence check using 0 positive and 432 generalized place invariants in 13449 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1483 reset in 1088 ms.
Product exploration explored 100000 steps with 1468 reset in 1865 ms.
Support contains 2 out of 988 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 988/988 places, 872/872 transitions.
Applied a total of 0 rules in 41 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
[2024-05-31 23:03:42] [INFO ] Invariant cache hit.
[2024-05-31 23:04:05] [INFO ] Implicit Places using invariants in 22884 ms returned []
[2024-05-31 23:04:05] [INFO ] Invariant cache hit.
[2024-05-31 23:04:12] [INFO ] Implicit Places using invariants and state equation in 7658 ms returned []
Implicit Place search using SMT with State Equation took 30553 ms to find 0 implicit places.
[2024-05-31 23:04:12] [INFO ] Redundant transitions in 58 ms returned []
Running 868 sub problems to find dead transitions.
[2024-05-31 23:04:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/988 variables, 988/988 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 988/1860 variables, and 1420 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30021 ms.
Refiners :[Domain max(s): 988/988 constraints, Generalized P Invariants (flows): 432/432 constraints, State Equation: 0/988 constraints, PredecessorRefiner: 868/868 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/988 variables, 988/988 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 988/1860 variables, and 1420 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30021 ms.
Refiners :[Domain max(s): 988/988 constraints, Generalized P Invariants (flows): 432/432 constraints, State Equation: 0/988 constraints, PredecessorRefiner: 0/868 constraints, Known Traps: 0/0 constraints]
After SMT, in 60388ms problems are : Problem set: 0 solved, 868 unsolved
Search for dead transitions found 0 dead transitions in 60402ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 91063 ms. Remains : 988/988 places, 872/872 transitions.
Treatment of property Echo-PT-d02r11-LTLCardinality-09 finished in 252219 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 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 874/874 transitions.
Graph (complete) has 2949 edges and 1000 vertex of which 993 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Discarding 7 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 67 ms. Remains 992 /1000 variables (removed 8) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 992 cols
[2024-05-31 23:05:13] [INFO ] Computed 436 invariants in 372 ms
[2024-05-31 23:05:37] [INFO ] Implicit Places using invariants in 24022 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 24028 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 988/1000 places, 872/874 transitions.
Applied a total of 0 rules in 63 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 24159 ms. Remains : 988/1000 places, 872/874 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d02r11-LTLCardinality-10
Product exploration explored 100000 steps with 414 reset in 1173 ms.
Product exploration explored 100000 steps with 414 reset in 1054 ms.
Computed a total of 988 stabilizing places and 872 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 988 transition count 872
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 : []
Knowledge based reduction with 4 factoid took 134 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)]
RANDOM walk for 520 steps (0 resets) in 29 ms. (17 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 176 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)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Support contains 2 out of 988 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 988/988 places, 872/872 transitions.
Applied a total of 0 rules in 56 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
// Phase 1: matrix 872 rows 988 cols
[2024-05-31 23:05:41] [INFO ] Computed 432 invariants in 480 ms
[2024-05-31 23:05:49] [INFO ] Implicit Places using invariants in 8303 ms returned []
[2024-05-31 23:05:49] [INFO ] Invariant cache hit.
[2024-05-31 23:05:56] [INFO ] Implicit Places using invariants and state equation in 7063 ms returned []
Implicit Place search using SMT with State Equation took 15370 ms to find 0 implicit places.
[2024-05-31 23:05:56] [INFO ] Redundant transitions in 126 ms returned []
Running 868 sub problems to find dead transitions.
[2024-05-31 23:05:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/988 variables, 988/988 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 988/1860 variables, and 1420 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30025 ms.
Refiners :[Domain max(s): 988/988 constraints, Generalized P Invariants (flows): 432/432 constraints, State Equation: 0/988 constraints, PredecessorRefiner: 868/868 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/988 variables, 988/988 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 988/1860 variables, and 1420 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30021 ms.
Refiners :[Domain max(s): 988/988 constraints, Generalized P Invariants (flows): 432/432 constraints, State Equation: 0/988 constraints, PredecessorRefiner: 0/868 constraints, Known Traps: 0/0 constraints]
After SMT, in 60570ms problems are : Problem set: 0 solved, 868 unsolved
Search for dead transitions found 0 dead transitions in 60581ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 76143 ms. Remains : 988/988 places, 872/872 transitions.
Computed a total of 988 stabilizing places and 872 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 988 transition count 872
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 : []
Knowledge based reduction with 4 factoid took 129 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 48 ms :[(NOT p0)]
RANDOM walk for 594 steps (0 resets) in 19 ms. (29 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 161 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 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 414 reset in 1283 ms.
Product exploration explored 100000 steps with 414 reset in 1240 ms.
Support contains 2 out of 988 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 988/988 places, 872/872 transitions.
Applied a total of 0 rules in 32 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
[2024-05-31 23:07:00] [INFO ] Invariant cache hit.
[2024-05-31 23:07:06] [INFO ] Implicit Places using invariants in 6066 ms returned []
[2024-05-31 23:07:06] [INFO ] Invariant cache hit.
[2024-05-31 23:07:14] [INFO ] Implicit Places using invariants and state equation in 7772 ms returned []
Implicit Place search using SMT with State Equation took 13842 ms to find 0 implicit places.
[2024-05-31 23:07:14] [INFO ] Redundant transitions in 12 ms returned []
Running 868 sub problems to find dead transitions.
[2024-05-31 23:07:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/988 variables, 988/988 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 988/1860 variables, and 1420 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30023 ms.
Refiners :[Domain max(s): 988/988 constraints, Generalized P Invariants (flows): 432/432 constraints, State Equation: 0/988 constraints, PredecessorRefiner: 868/868 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/988 variables, 988/988 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 988/1860 variables, and 1420 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30022 ms.
Refiners :[Domain max(s): 988/988 constraints, Generalized P Invariants (flows): 432/432 constraints, State Equation: 0/988 constraints, PredecessorRefiner: 0/868 constraints, Known Traps: 0/0 constraints]
After SMT, in 60579ms problems are : Problem set: 0 solved, 868 unsolved
Search for dead transitions found 0 dead transitions in 60589ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 74484 ms. Remains : 988/988 places, 872/872 transitions.
Treatment of property Echo-PT-d02r11-LTLCardinality-10 finished in 181818 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 874/874 transitions.
Graph (complete) has 2949 edges and 1000 vertex of which 993 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 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 32 ms. Remains 992 /1000 variables (removed 8) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 992 cols
[2024-05-31 23:08:15] [INFO ] Computed 436 invariants in 326 ms
[2024-05-31 23:08:23] [INFO ] Implicit Places using invariants in 8407 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 8409 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 988/1000 places, 872/874 transitions.
Applied a total of 0 rules in 41 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8484 ms. Remains : 988/1000 places, 872/874 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d02r11-LTLCardinality-11
Stuttering criterion allowed to conclude after 240 steps with 0 reset in 3 ms.
FORMULA Echo-PT-d02r11-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r11-LTLCardinality-11 finished in 8554 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 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 874/874 transitions.
Graph (complete) has 2949 edges and 1000 vertex of which 993 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 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 43 ms. Remains 992 /1000 variables (removed 8) and now considering 872/874 (removed 2) transitions.
[2024-05-31 23:08:23] [INFO ] Invariant cache hit.
[2024-05-31 23:08:45] [INFO ] Implicit Places using invariants in 21698 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 21701 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 988/1000 places, 872/874 transitions.
Applied a total of 0 rules in 31 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21775 ms. Remains : 988/1000 places, 872/874 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d02r11-LTLCardinality-12
Product exploration explored 100000 steps with 414 reset in 1121 ms.
Product exploration explored 100000 steps with 414 reset in 1300 ms.
Computed a total of 988 stabilizing places and 872 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 988 transition count 872
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 142 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 43 ms :[(NOT p0)]
RANDOM walk for 123 steps (0 resets) in 8 ms. (13 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 305 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 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
// Phase 1: matrix 872 rows 988 cols
[2024-05-31 23:08:49] [INFO ] Computed 432 invariants in 480 ms
[2024-05-31 23:09:04] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:09:04] [INFO ] [Real]Absence check using 0 positive and 432 generalized place invariants in 13218 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 988 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 988/988 places, 872/872 transitions.
Applied a total of 0 rules in 28 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
[2024-05-31 23:09:04] [INFO ] Invariant cache hit.
[2024-05-31 23:09:10] [INFO ] Implicit Places using invariants in 5706 ms returned []
[2024-05-31 23:09:10] [INFO ] Invariant cache hit.
[2024-05-31 23:09:18] [INFO ] Implicit Places using invariants and state equation in 7723 ms returned []
Implicit Place search using SMT with State Equation took 13430 ms to find 0 implicit places.
[2024-05-31 23:09:18] [INFO ] Redundant transitions in 21 ms returned []
Running 868 sub problems to find dead transitions.
[2024-05-31 23:09:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/988 variables, 988/988 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 988/1860 variables, and 1420 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30021 ms.
Refiners :[Domain max(s): 988/988 constraints, Generalized P Invariants (flows): 432/432 constraints, State Equation: 0/988 constraints, PredecessorRefiner: 868/868 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/988 variables, 988/988 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 988/1860 variables, and 1420 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30022 ms.
Refiners :[Domain max(s): 988/988 constraints, Generalized P Invariants (flows): 432/432 constraints, State Equation: 0/988 constraints, PredecessorRefiner: 0/868 constraints, Known Traps: 0/0 constraints]
After SMT, in 60603ms problems are : Problem set: 0 solved, 868 unsolved
Search for dead transitions found 0 dead transitions in 60619ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 74110 ms. Remains : 988/988 places, 872/872 transitions.
Computed a total of 988 stabilizing places and 872 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 988 transition count 872
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 134 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 45 ms :[(NOT p0)]
RANDOM walk for 161 steps (0 resets) in 8 ms. (17 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 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 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2024-05-31 23:10:20] [INFO ] Invariant cache hit.
[2024-05-31 23:10:35] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:10:35] [INFO ] [Real]Absence check using 0 positive and 432 generalized place invariants in 13365 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 414 reset in 956 ms.
Product exploration explored 100000 steps with 414 reset in 1255 ms.
Support contains 2 out of 988 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 988/988 places, 872/872 transitions.
Applied a total of 0 rules in 27 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
[2024-05-31 23:10:37] [INFO ] Invariant cache hit.
[2024-05-31 23:10:44] [INFO ] Implicit Places using invariants in 6549 ms returned []
[2024-05-31 23:10:44] [INFO ] Invariant cache hit.
[2024-05-31 23:10:51] [INFO ] Implicit Places using invariants and state equation in 7380 ms returned []
Implicit Place search using SMT with State Equation took 13936 ms to find 0 implicit places.
[2024-05-31 23:10:51] [INFO ] Redundant transitions in 12 ms returned []
Running 868 sub problems to find dead transitions.
[2024-05-31 23:10:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/988 variables, 988/988 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 988/1860 variables, and 1420 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30023 ms.
Refiners :[Domain max(s): 988/988 constraints, Generalized P Invariants (flows): 432/432 constraints, State Equation: 0/988 constraints, PredecessorRefiner: 868/868 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/988 variables, 988/988 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 988/1860 variables, and 1420 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30020 ms.
Refiners :[Domain max(s): 988/988 constraints, Generalized P Invariants (flows): 432/432 constraints, State Equation: 0/988 constraints, PredecessorRefiner: 0/868 constraints, Known Traps: 0/0 constraints]
After SMT, in 60409ms problems are : Problem set: 0 solved, 868 unsolved
Search for dead transitions found 0 dead transitions in 60420ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 74403 ms. Remains : 988/988 places, 872/872 transitions.
Treatment of property Echo-PT-d02r11-LTLCardinality-12 finished in 207970 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((X(G((p1||X(G(p2)))))&&p0)))'
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 874/874 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 999 transition count 874
Applied a total of 1 rules in 19 ms. Remains 999 /1000 variables (removed 1) and now considering 874/874 (removed 0) transitions.
// Phase 1: matrix 874 rows 999 cols
[2024-05-31 23:11:52] [INFO ] Computed 441 invariants in 343 ms
[2024-05-31 23:12:09] [INFO ] Implicit Places using invariants in 17504 ms returned []
[2024-05-31 23:12:09] [INFO ] Invariant cache hit.
[2024-05-31 23:12:15] [INFO ] Implicit Places using invariants and state equation in 6538 ms returned []
Implicit Place search using SMT with State Equation took 24045 ms to find 0 implicit places.
Running 873 sub problems to find dead transitions.
[2024-05-31 23:12:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 412/1409 constraints. Problems are: Problem set: 0 solved, 873 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 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.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 0.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 1.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 1.0)
(s73 1.0)
(s74 1.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 1.0)
(s135 0.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 0.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 0.0)
(s193 1.0)
(s194 0.0)
(s195 1.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.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)
(s211 1.0)
(s212 1.0)
(s213 0.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 0.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 0.0)
(s226 0.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 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 0.0)
(s246 1.0)
(s247 1.0)
(s248 0.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 0.0)
(s253 1.0)
(s254 1.0)
(s255 0.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 1.0)
(s267 0.0)
(s268 0.0)
(s269 1.0)
(s270 0.0)
(s271 0.0)
(s272 1.0)
(s273 1.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 1.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 1.0)
(s296 0.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 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 0.0)
(s320 0.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 0.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 0.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 0.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 0.0)
(s350 1.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 1.0)
(s358 0.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 0.0)
(s364 1.0)
(s365 1.0)
(s366 0.0)
(s367 0.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 1.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 1.0)
(s380 1.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 0.0)
(s388 0.0)
(s389 1.0)
(s390 1.0)
(s391 0.0)
(s392 0.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 1.0)
(s404 1.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 1.0)
(s413 0.0)
(s414 1.0)
(s415 1.0)
(s416 0.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 0.0)
(s426 1.0)
(s427 0.0)
(s428 0.0)
(s429 1.0)
(s430 1.0)
(s431 0.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 0.0)
(s442 1.0)
(s443 0.0)
(s444 0.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 0.0)
(s450 0.0)
(s451 1.0)
(s452 1.0)
(s453 0.0)
(s454 1.0)
(s455 0.0)
(s456 1.0)
(s457 0.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 0.0)
(s463 0.0)
(s464 1.0)
(s465 1.0)
(s466 0.0)
(s467 0.0)
(s468 1.0)
(s469 1.0)
(s470 0.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 0.0)
(s479 1.0)
(s480 0.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 0.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 0.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 0.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 0.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 0.0)
(s535 1.0)
(s536 0.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 0.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 0.0)
(s557 1.0)
(s558 0.0)
(s559 1.0)
(s560 0.0)
(s561 1.0)
(s562 0.0)
(s563 1.0)
(s564 0.0)
(s565 1.0)
(s566 1.0)
(s567 0.0)
(s568 0.0)
(s569 1.0)
(s570 0.0)
(s571 0.0)
(s572 1.0)
(s573 1.0)
(s574 0.0)
(s575 1.0)
(s576 1.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 1.0)
(s585 1.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 1.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 1.0)
(s594 0.0)
(s595 1.0)
(s596 0.0)
(s597 1.0)
(s598 1.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 1.0)
(s620 1.0)
(s621 0.0)
(s622 1.0)
(s623 1.0)
(s624 0.0)
(s625 1.0)
(s626 1.0)
(s627 0.0)
(s628 0.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 0.0)
(s633 1.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 1.0)
(s638 1.0)
(s639 0.0)
(s640 1.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 0.0)
(s648 0.0)
(s649 1.0)
(s650 1.0)
(s651 0.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 0.0)
(s656 1.0)
(s657 0.0)
(s658 0.0)
(s659 1.0)
(s660 0.0)
(s661 0.0)
(s662 1.0)
(s663 0.0)
(s664 0.0)
(s665 1.0)
(s666 0.0)
(s667 1.0)
(s668 0.0)
(s669 0.0)
(s670 1.0)
(s671 0.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 0.0)
(s678 1.0)
(s679 0.0)
(s680 1.0)
(s681 1.0)
(s682 0.0)
(s683 1.0)
(s684 0.0)
(s685 1.0)
(s686 1.0)
(s687 0.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 0.0)
(s694 0.0)
(s695 1.0)
(s696 0.0)
(s697 0.0)
(s698 1.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 1.0)
(s703 1.0)
(s704 0.0)
(s705 1.0)
(s706 1.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 0.0)
(s718 1.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 1.0)
(s723 0.0)
(s724 1.0)
(s725 0.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 0.0)
(s735 0.0)
(s736 1.0)
(s737 1.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 1.0)
(s746 1.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 1.0)
(s751 0.0)
(s752 0.0)
(s753 1.0)
(s754 0.0)
(s755 1.0)
(s756 0.0)
(s757 1.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 1.0)
(s767 1.0)
(s768 0.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 0.0)
(s773 1.0)
(s774 1.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 1.0)
(s779 1.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 1.0)
(s784 0.0)
(s785 1.0)
(s786 1.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 1.0)
(s795 0.0)
(s796 1.0)
(s797 1.0)
(s798 0.0)
(s799 1.0)
(s800 0.0)
(s801 1.0)
(s802 0.0)
(s803 1.0)
(s804 1.0)
(s805 0.0)
(s806 0.0)
(s807 1.0)
(s808 1.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 1.0)
(s814 1.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 1.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 1.0)
(s824 0.0)
(s825 1.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 1.0)
(s833 1.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 1.0)
(s839 0.0)
(s840 1.0)
(s841 0.0)
(s842 0.0)
(s843 1.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 1.0)
(s855 0.0)
(s856 0.0)
(s857 0.0)
(s858 0.0)
(s859 1.0)
(s860 0.0)
(s861 1.0)
(s862 1.0)
(s863 0.0)
(s864 0.0)
(s865 0.0)
(s866 0.0)
(s867 0.0)
(s868 1.0)
(s869 0.0)
(s870 0.0)
(s871 1.0)
(s872 0.0)
(s873 0.0)
(s874 1.0)
(s875 1.0)
(s876 0.0)
(s877 1.0)
(s878 1.0)
(s879 0.0)
(s880 1.0)
(s881 1.0)
(s882 0.0)
(s883 0.0)
(s884 1.0)
(s885 0.0)
(s886 1.0)
(s887 0.0)
(s888 1.0)
(s889 0.0)
(s890 1.0)
(s891 0.0)
(s892 1.0)
(s893 0.0)
(s894 0.0)
(s895 0.0)
(s896 0.0)
(s897 1.0)
(s898 0.0)
(s899 1.0)
(s900 1.0)
(s901 0.0)
(s902 0.0)
(s903 0.0)
(s904 0.0)
(s905 0.0)
(s906 0.0)
(s907 1.0)
(s908 0.0)
(s909 1.0)
(s910 0.0)
(s911 0.0)
(s912 1.0)
(s913 1.0)
(s914 0.0)
(s915 0.0)
(s916 1.0)
(s917 1.0)
(s918 0.0)
(s919 1.0)
(s920 0.0)
(s921 0.0)
(s922 1.0)
(s923 0.0)
(s924 1.0)
(s925 0.0)
(s926 1.0)
(s927 1.0)
(s928 0.0)
(s929 0.0)
(s930 0.0)
(s931 0.0)
(s932 1.0)
(s933 0.0)
(s934 1.0)
(s935 0.0)
(s936 0.0)
(s937 0.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 0.0)
(s942 0.0)
(s943 1.0)
(s944 0.0)
(s945 1.0)
(s946 0.0)
(s947 1.0)
(s948 0.0)
(s949 1.0)
(s950 0.0)
(s951 1.0)
(s952 0.0)
(s953 0.0)
(s954 1.0)
(s955 1.0)
(s956 0.0)
(s957 0.0)
(s958 0.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 0.0)
(s967 0.0)
(s968 0.0)
(s969 1.0)
(s970 1.0)
(s971 0.0)
(s972 0.0)
(s973 1.0)
(s974 0.0)
(s975 1.0)
(s976 0.0)
(s977 1.0)
(s978 1.0)
(s979 0.0)
(s980 0.0)
(s981 1.0)
(s982 0.0)
(s983 0.0)
(s984 0.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 0.0)
(s989 1.0)
(s990 1.0)
(s991 0.0)
(s992 1.0)
(s993 0.0)
(s994 1.0)
(s995 0.0)
(s996 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 997/1873 variables, and 1409 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30038 ms.
Refiners :[Domain max(s): 997/999 constraints, Positive P Invariants (semi-flows): 0/4 constraints, Generalized P Invariants (flows): 412/437 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 873/873 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 873 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 412/1409 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 0)
(s29 0)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 0)
(s39 0)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 0)
(s45 1)
(s46 1)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 0)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 0)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 0)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 0)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 0)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 0)
(s142 1)
(s143 1)
(s144 1)
(s145 0)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 0)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 0)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 0)
(s184 1)
(s185 1)
(s186 1)
(s187 0)
(s188 1)
(s189 0)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 0)
(s211 0)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 0)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 0)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 0)
(s283 1)
(s284 0)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 0)
(s293 0)
(s294 1)
(s295 0)
(s296 0)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 0)
(s310 1)
(s311 1)
(s312 0)
(s313 0)
(s314 1)
(s315 0)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 0)
(s329 0)
(s330 0)
(s331 1)
(s332 1)
(s333 1)
(s334 0)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 0)
(s344 0)
(s345 1)
(s346 0)
(s347 0)
(s348 1)
(s349 1)
(s350 0)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 0)
(s359 0)
(s360 0)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 0)
(s374 1)
(s375 1)
(s376 1)
(s377 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/1873 variables, and 1409 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30035 ms.
Refiners :[Domain max(s): 997/999 constraints, Positive P Invariants (semi-flows): 0/4 constraints, Generalized P Invariants (flows): 412/437 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 0/873 constraints, Known Traps: 0/0 constraints]
After SMT, in 60389ms problems are : Problem set: 0 solved, 873 unsolved
Search for dead transitions found 0 dead transitions in 60400ms
Starting structural reductions in LTL mode, iteration 1 : 999/1000 places, 874/874 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84475 ms. Remains : 999/1000 places, 874/874 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Echo-PT-d02r11-LTLCardinality-14
Product exploration explored 100000 steps with 411 reset in 1227 ms.
Product exploration explored 100000 steps with 411 reset in 1183 ms.
Computed a total of 999 stabilizing places and 874 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 999 transition count 874
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 (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 1207 ms. Reduced automaton from 4 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 14 to 11
RANDOM walk for 40000 steps (164 resets) in 1378 ms. (29 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 491 ms. (81 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 392 ms. (101 steps per ms) remains 3/3 properties
[2024-05-31 23:13:22] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 16/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 649/669 variables, 215/239 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/669 variables, 649/888 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/669 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 322/991 variables, 214/1102 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/991 variables, 322/1424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/991 variables, 0/1424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 8/999 variables, 8/1432 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/999 variables, 8/1440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/999 variables, 0/1440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 874/1873 variables, 999/2439 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1873 variables, 0/2439 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1873 variables, 0/2439 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1873/1873 variables, and 2439 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2196 ms.
Refiners :[Domain max(s): 999/999 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 437/437 constraints, State Equation: 999/999 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Problem apf5 is UNSAT
Problem apf7 is UNSAT
Problem apf10 is UNSAT
After SMT solving in domain Int declared 4/1873 variables, and 4 constraints, problems are : Problem set: 3 solved, 0 unsolved in 26 ms.
Refiners :[Domain max(s): 4/999 constraints, Positive P Invariants (semi-flows): 0/4 constraints, Generalized P Invariants (flows): 0/437 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2238ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p0) p1)), (G (OR (NOT p0) p1 p2)), (G (OR (NOT p0) p1 (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p0), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 p1 (NOT p2)))), (F p1), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 25 factoid took 4087 ms. Reduced automaton from 4 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
[2024-05-31 23:13:28] [INFO ] Invariant cache hit.
[2024-05-31 23:13:30] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2024-05-31 23:13:43] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:13:43] [INFO ] [Real]Absence check using 4 positive and 437 generalized place invariants in 13504 ms returned unknown
Could not prove EG (NOT p0)
[2024-05-31 23:13:43] [INFO ] Invariant cache hit.
[2024-05-31 23:13:45] [INFO ] [Real]Absence check using 4 positive place invariants in 11 ms returned sat
[2024-05-31 23:13:58] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:13:58] [INFO ] [Real]Absence check using 4 positive and 437 generalized place invariants in 13561 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 4 out of 999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 874/874 transitions.
Applied a total of 0 rules in 23 ms. Remains 999 /999 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2024-05-31 23:13:59] [INFO ] Invariant cache hit.
[2024-05-31 23:14:20] [INFO ] Implicit Places using invariants in 21305 ms returned []
[2024-05-31 23:14:20] [INFO ] Invariant cache hit.
[2024-05-31 23:14:26] [INFO ] Implicit Places using invariants and state equation in 5719 ms returned []
Implicit Place search using SMT with State Equation took 27028 ms to find 0 implicit places.
Running 873 sub problems to find dead transitions.
[2024-05-31 23:14:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 412/1409 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 997/1873 variables, and 1409 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30039 ms.
Refiners :[Domain max(s): 997/999 constraints, Positive P Invariants (semi-flows): 0/4 constraints, Generalized P Invariants (flows): 412/437 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 873/873 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 873 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 412/1409 constraints. Problems are: Problem set: 0 solved, 873 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 Int declared 997/1873 variables, and 1409 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30046 ms.
Refiners :[Domain max(s): 997/999 constraints, Positive P Invariants (semi-flows): 0/4 constraints, Generalized P Invariants (flows): 412/437 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 0/873 constraints, Known Traps: 0/0 constraints]
After SMT, in 60487ms problems are : Problem set: 0 solved, 873 unsolved
Search for dead transitions found 0 dead transitions in 60496ms
Finished structural reductions in LTL mode , in 1 iterations and 87550 ms. Remains : 999/999 places, 874/874 transitions.
Computed a total of 999 stabilizing places and 874 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 999 transition count 874
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 (NOT p0) (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 1584 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 10 to 6
RANDOM walk for 40000 steps (164 resets) in 509 ms. (78 steps per ms) remains 1/6 properties
BEST_FIRST walk for 14744 steps (2 resets) in 148 ms. (98 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F p2), (F p1), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 13 factoid took 6777 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
[2024-05-31 23:15:36] [INFO ] Invariant cache hit.
[2024-05-31 23:15:38] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2024-05-31 23:15:51] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:15:51] [INFO ] [Real]Absence check using 4 positive and 437 generalized place invariants in 13403 ms returned unknown
Could not prove EG (NOT p0)
[2024-05-31 23:15:51] [INFO ] Invariant cache hit.
[2024-05-31 23:15:52] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2024-05-31 23:16:06] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:16:06] [INFO ] [Real]Absence check using 4 positive and 437 generalized place invariants in 13712 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 411 reset in 955 ms.
Product exploration explored 100000 steps with 411 reset in 1097 ms.
Support contains 4 out of 999 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 999/999 places, 874/874 transitions.
Applied a total of 0 rules in 17 ms. Remains 999 /999 variables (removed 0) and now considering 874/874 (removed 0) transitions.
[2024-05-31 23:16:09] [INFO ] Invariant cache hit.
[2024-05-31 23:16:31] [INFO ] Implicit Places using invariants in 22627 ms returned []
[2024-05-31 23:16:31] [INFO ] Invariant cache hit.
[2024-05-31 23:16:37] [INFO ] Implicit Places using invariants and state equation in 6040 ms returned []
Implicit Place search using SMT with State Equation took 28669 ms to find 0 implicit places.
Running 873 sub problems to find dead transitions.
[2024-05-31 23:16:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 412/1409 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 997/1873 variables, and 1409 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30028 ms.
Refiners :[Domain max(s): 997/999 constraints, Positive P Invariants (semi-flows): 0/4 constraints, Generalized P Invariants (flows): 412/437 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 873/873 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 873 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/997 variables, 997/997 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/997 variables, 412/1409 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 997/1873 variables, and 1409 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30031 ms.
Refiners :[Domain max(s): 997/999 constraints, Positive P Invariants (semi-flows): 0/4 constraints, Generalized P Invariants (flows): 412/437 constraints, State Equation: 0/999 constraints, PredecessorRefiner: 0/873 constraints, Known Traps: 0/0 constraints]
After SMT, in 60354ms problems are : Problem set: 0 solved, 873 unsolved
Search for dead transitions found 0 dead transitions in 60375ms
Finished structural reductions in LTL mode , in 1 iterations and 89064 ms. Remains : 999/999 places, 874/874 transitions.
Treatment of property Echo-PT-d02r11-LTLCardinality-14 finished in 346400 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))&&F(p1)))'
Found a Shortening insensitive property : Echo-PT-d02r11-LTLCardinality-09
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 5 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1000/1000 places, 874/874 transitions.
Graph (complete) has 2949 edges and 1000 vertex of which 993 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 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 46 ms. Remains 992 /1000 variables (removed 8) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 992 cols
[2024-05-31 23:17:39] [INFO ] Computed 436 invariants in 516 ms
[2024-05-31 23:17:44] [INFO ] Implicit Places using invariants in 6217 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 6219 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 988/1000 places, 872/874 transitions.
Applied a total of 0 rules in 25 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 6291 ms. Remains : 988/1000 places, 872/874 transitions.
Running random walk in product with property : Echo-PT-d02r11-LTLCardinality-09
Product exploration explored 100000 steps with 2850 reset in 1052 ms.
Product exploration explored 100000 steps with 2819 reset in 1169 ms.
Computed a total of 988 stabilizing places and 872 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 988 transition count 872
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 (NOT p1) p0), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 206 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 282 steps (0 resets) in 10 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X p0), (X (X (NOT p1))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 274 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 92 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 872 rows 988 cols
[2024-05-31 23:17:49] [INFO ] Computed 432 invariants in 475 ms
[2024-05-31 23:18:04] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:18:04] [INFO ] [Real]Absence check using 0 positive and 432 generalized place invariants in 13260 ms returned unknown
Could not prove EG (NOT p1)
Support contains 2 out of 988 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 : 988/988 places, 872/872 transitions.
Applied a total of 0 rules in 25 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
[2024-05-31 23:18:04] [INFO ] Invariant cache hit.
[2024-05-31 23:18:10] [INFO ] Implicit Places using invariants in 6741 ms returned []
[2024-05-31 23:18:10] [INFO ] Invariant cache hit.
[2024-05-31 23:18:19] [INFO ] Implicit Places using invariants and state equation in 8164 ms returned []
Implicit Place search using SMT with State Equation took 14910 ms to find 0 implicit places.
[2024-05-31 23:18:19] [INFO ] Redundant transitions in 12 ms returned []
Running 868 sub problems to find dead transitions.
[2024-05-31 23:18:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/988 variables, 988/988 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 988/1860 variables, and 1420 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30019 ms.
Refiners :[Domain max(s): 988/988 constraints, Generalized P Invariants (flows): 432/432 constraints, State Equation: 0/988 constraints, PredecessorRefiner: 868/868 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/988 variables, 988/988 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 988/1860 variables, and 1420 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30019 ms.
Refiners :[Domain max(s): 988/988 constraints, Generalized P Invariants (flows): 432/432 constraints, State Equation: 0/988 constraints, PredecessorRefiner: 0/868 constraints, Known Traps: 0/0 constraints]
After SMT, in 60469ms problems are : Problem set: 0 solved, 868 unsolved
Search for dead transitions found 0 dead transitions in 60478ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 75432 ms. Remains : 988/988 places, 872/872 transitions.
Computed a total of 988 stabilizing places and 872 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 988 transition count 872
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 p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 121 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 241 steps (0 resets) in 9 ms. (24 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 167 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 94 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (NOT p1)]
[2024-05-31 23:19:20] [INFO ] Invariant cache hit.
[2024-05-31 23:19:35] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:19:35] [INFO ] [Real]Absence check using 0 positive and 432 generalized place invariants in 13202 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1458 reset in 1441 ms.
Product exploration explored 100000 steps with 1419 reset in 1371 ms.
Support contains 2 out of 988 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 988/988 places, 872/872 transitions.
Applied a total of 0 rules in 23 ms. Remains 988 /988 variables (removed 0) and now considering 872/872 (removed 0) transitions.
[2024-05-31 23:19:38] [INFO ] Invariant cache hit.
[2024-05-31 23:20:15] [INFO ] Performed 543/988 implicitness test of which 0 returned IMPLICIT in 35 seconds.
[2024-05-31 23:20:16] [INFO ] Implicit Places using invariants in 37932 ms returned []
[2024-05-31 23:20:16] [INFO ] Invariant cache hit.
[2024-05-31 23:20:23] [INFO ] Implicit Places using invariants and state equation in 7356 ms returned []
Implicit Place search using SMT with State Equation took 45290 ms to find 0 implicit places.
[2024-05-31 23:20:23] [INFO ] Redundant transitions in 12 ms returned []
Running 868 sub problems to find dead transitions.
[2024-05-31 23:20:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/988 variables, 988/988 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 988/1860 variables, and 1420 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30019 ms.
Refiners :[Domain max(s): 988/988 constraints, Generalized P Invariants (flows): 432/432 constraints, State Equation: 0/988 constraints, PredecessorRefiner: 868/868 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/988 variables, 988/988 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 988/1860 variables, and 1420 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30027 ms.
Refiners :[Domain max(s): 988/988 constraints, Generalized P Invariants (flows): 432/432 constraints, State Equation: 0/988 constraints, PredecessorRefiner: 0/868 constraints, Known Traps: 0/0 constraints]
After SMT, in 60416ms problems are : Problem set: 0 solved, 868 unsolved
Search for dead transitions found 0 dead transitions in 60425ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 105758 ms. Remains : 988/988 places, 872/872 transitions.
Treatment of property Echo-PT-d02r11-LTLCardinality-09 finished in 226123 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)))'
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' '!(F((X(G((p1||X(G(p2)))))&&p0)))'
Found a Lengthening insensitive property : Echo-PT-d02r11-LTLCardinality-14
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1000/1000 places, 874/874 transitions.
Graph (complete) has 2949 edges and 1000 vertex of which 994 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 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 42 ms. Remains 993 /1000 variables (removed 7) and now considering 872/874 (removed 2) transitions.
// Phase 1: matrix 872 rows 993 cols
[2024-05-31 23:21:25] [INFO ] Computed 437 invariants in 604 ms
[2024-05-31 23:21:32] [INFO ] Implicit Places using invariants in 7488 ms returned [379, 416, 419, 456]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 7489 ms to find 4 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 989/1000 places, 872/874 transitions.
Applied a total of 0 rules in 25 ms. Remains 989 /989 variables (removed 0) and now considering 872/872 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 7556 ms. Remains : 989/1000 places, 872/874 transitions.
Running random walk in product with property : Echo-PT-d02r11-LTLCardinality-14
Product exploration explored 100000 steps with 414 reset in 1105 ms.
Product exploration explored 100000 steps with 414 reset in 1026 ms.
Computed a total of 989 stabilizing places and 872 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 989 transition count 872
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 (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 1224 ms. Reduced automaton from 4 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 14 to 11
RANDOM walk for 40000 steps (164 resets) in 964 ms. (41 steps per ms) remains 3/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 437 ms. (91 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 399 ms. (100 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 365 ms. (109 steps per ms) remains 3/3 properties
// Phase 1: matrix 872 rows 989 cols
[2024-05-31 23:21:37] [INFO ] Computed 433 invariants in 521 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 16/20 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 595/615 variables, 131/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/615 variables, 595/750 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/615 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 373/988 variables, 297/1047 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/988 variables, 373/1420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/988 variables, 0/1420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/989 variables, 1/1421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/989 variables, 1/1422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/989 variables, 0/1422 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 872/1861 variables, 989/2411 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1861 variables, 0/2411 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1861 variables, 0/2411 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1861/1861 variables, and 2411 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3492 ms.
Refiners :[Domain max(s): 989/989 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 429/429 constraints, State Equation: 989/989 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Problem apf5 is UNSAT
Problem apf7 is UNSAT
Problem apf10 is UNSAT
After SMT solving in domain Int declared 4/1861 variables, and 4 constraints, problems are : Problem set: 3 solved, 0 unsolved in 36 ms.
Refiners :[Domain max(s): 4/989 constraints, Positive P Invariants (semi-flows): 0/4 constraints, Generalized P Invariants (flows): 0/429 constraints, State Equation: 0/989 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 4076ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p0) p1)), (G (OR (NOT p0) p1 p2)), (G (OR (NOT p0) p1 (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F p0), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 p1 (NOT p2)))), (F p1), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 25 factoid took 4248 ms. Reduced automaton from 4 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
[2024-05-31 23:21:46] [INFO ] Invariant cache hit.
[2024-05-31 23:21:47] [INFO ] [Real]Absence check using 4 positive place invariants in 9 ms returned sat
[2024-05-31 23:22:01] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:22:01] [INFO ] [Real]Absence check using 4 positive and 429 generalized place invariants in 13574 ms returned unknown
Could not prove EG (NOT p0)
[2024-05-31 23:22:01] [INFO ] Invariant cache hit.
[2024-05-31 23:22:02] [INFO ] [Real]Absence check using 4 positive place invariants in 9 ms returned sat
[2024-05-31 23:22:16] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:22:16] [INFO ] [Real]Absence check using 4 positive and 429 generalized place invariants in 13762 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 4 out of 989 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 989/989 places, 872/872 transitions.
Applied a total of 0 rules in 16 ms. Remains 989 /989 variables (removed 0) and now considering 872/872 (removed 0) transitions.
[2024-05-31 23:22:16] [INFO ] Invariant cache hit.
[2024-05-31 23:22:20] [INFO ] Implicit Places using invariants in 4522 ms returned []
[2024-05-31 23:22:20] [INFO ] Invariant cache hit.
[2024-05-31 23:22:26] [INFO ] Implicit Places using invariants and state equation in 5397 ms returned []
Implicit Place search using SMT with State Equation took 9922 ms to find 0 implicit places.
Running 868 sub problems to find dead transitions.
[2024-05-31 23:22:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/988 variables, 988/988 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/988 variables, 375/1363 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 988/1861 variables, and 1363 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30022 ms.
Refiners :[Domain max(s): 988/989 constraints, Positive P Invariants (semi-flows): 0/4 constraints, Generalized P Invariants (flows): 375/429 constraints, State Equation: 0/989 constraints, PredecessorRefiner: 868/868 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/988 variables, 988/988 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/988 variables, 375/1363 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/988 variables, 0/1363 constraints. Problems are: Problem set: 0 solved, 868 unsolved
SMT process timed out in 60365ms, After SMT, problems are : Problem set: 0 solved, 868 unsolved
Search for dead transitions found 0 dead transitions in 60377ms
Finished structural reductions in LTL mode , in 1 iterations and 70317 ms. Remains : 989/989 places, 872/872 transitions.
Computed a total of 989 stabilizing places and 872 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 989 transition count 872
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 (NOT p0) (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 1068 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 10 to 6
RANDOM walk for 31397 steps (129 resets) in 363 ms. (86 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F p2), (F p1), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 13 factoid took 4373 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
[2024-05-31 23:23:33] [INFO ] Invariant cache hit.
[2024-05-31 23:23:34] [INFO ] [Real]Absence check using 4 positive place invariants in 9 ms returned sat
[2024-05-31 23:23:48] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-31 23:23:48] [INFO ] [Real]Absence check using 4 positive and 429 generalized place invariants in 13749 ms returned unknown
Could not prove EG (NOT p0)
[2024-05-31 23:23:48] [INFO ] Invariant cache hit.
[2024-05-31 23:23:49] [INFO ] [Real]Absence check using 4 positive place invariants in 10 ms returned sat
[2024-05-31 23:24:03] [INFO ] [Real]Absence check using 4 positive and 429 generalized place invariants in 13640 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 414 reset in 981 ms.
Product exploration explored 100000 steps with 414 reset in 1105 ms.
Support contains 4 out of 989 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 989/989 places, 872/872 transitions.
Applied a total of 0 rules in 17 ms. Remains 989 /989 variables (removed 0) and now considering 872/872 (removed 0) transitions.
[2024-05-31 23:24:05] [INFO ] Invariant cache hit.
[2024-05-31 23:24:10] [INFO ] Implicit Places using invariants in 4864 ms returned []
[2024-05-31 23:24:10] [INFO ] Invariant cache hit.
[2024-05-31 23:24:15] [INFO ] Implicit Places using invariants and state equation in 5491 ms returned []
Implicit Place search using SMT with State Equation took 10356 ms to find 0 implicit places.
Running 868 sub problems to find dead transitions.
[2024-05-31 23:24:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/988 variables, 988/988 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/988 variables, 375/1363 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 988/1861 variables, and 1363 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30020 ms.
Refiners :[Domain max(s): 988/989 constraints, Positive P Invariants (semi-flows): 0/4 constraints, Generalized P Invariants (flows): 375/429 constraints, State Equation: 0/989 constraints, PredecessorRefiner: 868/868 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/988 variables, 988/988 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/988 variables, 375/1363 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/988 variables, 0/1363 constraints. Problems are: Problem set: 0 solved, 868 unsolved
SMT process timed out in 60347ms, After SMT, problems are : Problem set: 0 solved, 868 unsolved
Search for dead transitions found 0 dead transitions in 60357ms
Finished structural reductions in LTL mode , in 1 iterations and 70733 ms. Remains : 989/989 places, 872/872 transitions.
Treatment of property Echo-PT-d02r11-LTLCardinality-14 finished in 231609 ms.
[2024-05-31 23:25:16] [INFO ] Flatten gal took : 74 ms
[2024-05-31 23:25:16] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-05-31 23:25:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1000 places, 874 transitions and 4567 arcs took 25 ms.
Total runtime 1820209 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : Echo-PT-d02r11-LTLCardinality-09
Could not compute solution for formula : Echo-PT-d02r11-LTLCardinality-10
Could not compute solution for formula : Echo-PT-d02r11-LTLCardinality-12
Could not compute solution for formula : Echo-PT-d02r11-LTLCardinality-14

BK_STOP 1717198632941

--------------------
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-d02r11-LTLCardinality-09
ltl formula formula --ltl=/tmp/1767/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 1000 places, 874 transitions and 4567 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.260 real 0.030 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1767/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1767/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1767/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1767/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1000 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 948 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~200 levels ~10000 states ~32316 transitions
pnml2lts-mc( 3/ 4): ~200 levels ~20000 states ~49356 transitions
pnml2lts-mc( 0/ 4): ~204 levels ~40000 states ~86688 transitions
pnml2lts-mc( 0/ 4): ~204 levels ~80000 states ~151204 transitions
pnml2lts-mc( 0/ 4): ~204 levels ~160000 states ~293072 transitions
pnml2lts-mc( 0/ 4): ~223 levels ~320000 states ~559196 transitions
pnml2lts-mc( 0/ 4): ~223 levels ~640000 states ~1146864 transitions
pnml2lts-mc( 0/ 4): ~223 levels ~1280000 states ~2400584 transitions
pnml2lts-mc( 2/ 4): ~198 levels ~2560000 states ~5355760 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4265170
pnml2lts-mc( 0/ 4): unique states count: 4265907
pnml2lts-mc( 0/ 4): unique transitions count: 8872716
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 4584505
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4265915
pnml2lts-mc( 0/ 4): - cum. max stack depth: 839
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4265915 states 8872738 transitions, fanout: 2.080
pnml2lts-mc( 0/ 4): Total exploration time 172.830 sec (172.750 sec minimum, 172.795 sec on average)
pnml2lts-mc( 0/ 4): States per second: 24683, Transitions per second: 51338
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 96.7MB, 23.6 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 12.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 886 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 96.7MB (~256.0MB paged-in)
ltl formula name Echo-PT-d02r11-LTLCardinality-10
ltl formula formula --ltl=/tmp/1767/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 1000 places, 874 transitions and 4567 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.150 real 0.050 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1767/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1767/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1767/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1767/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 999 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 886 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): ~241 levels ~10000 states ~55688 transitions
pnml2lts-mc( 0/ 4): ~241 levels ~20000 states ~99768 transitions
pnml2lts-mc( 0/ 4): ~241 levels ~40000 states ~190492 transitions
pnml2lts-mc( 0/ 4): ~241 levels ~80000 states ~391836 transitions
pnml2lts-mc( 0/ 4): ~241 levels ~160000 states ~793584 transitions
pnml2lts-mc( 1/ 4): ~241 levels ~320000 states ~1607036 transitions
pnml2lts-mc( 1/ 4): ~241 levels ~640000 states ~3449980 transitions
pnml2lts-mc( 1/ 4): ~241 levels ~1280000 states ~7485280 transitions
pnml2lts-mc( 1/ 4): ~241 levels ~2560000 states ~16202028 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4703594
pnml2lts-mc( 0/ 4): unique states count: 4704376
pnml2lts-mc( 0/ 4): unique transitions count: 32555490
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 27826446
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4704383
pnml2lts-mc( 0/ 4): - cum. max stack depth: 966
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4704383 states 32555513 transitions, fanout: 6.920
pnml2lts-mc( 0/ 4): Total exploration time 191.040 sec (191.020 sec minimum, 191.027 sec on average)
pnml2lts-mc( 0/ 4): States per second: 24625, Transitions per second: 170412
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 100.1MB, 22.2 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 14.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 886 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 100.1MB (~256.0MB paged-in)
ltl formula name Echo-PT-d02r11-LTLCardinality-12
ltl formula formula --ltl=/tmp/1767/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 1000 places, 874 transitions and 4567 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.150 real 0.050 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1767/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1767/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1767/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1767/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 999 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 886 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( 2/ 4): ~240 levels ~10000 states ~52796 transitions
pnml2lts-mc( 1/ 4): ~239 levels ~20000 states ~93976 transitions
pnml2lts-mc( 1/ 4): ~239 levels ~40000 states ~183084 transitions
pnml2lts-mc( 1/ 4): ~239 levels ~80000 states ~368224 transitions
pnml2lts-mc( 1/ 4): ~239 levels ~160000 states ~785716 transitions
pnml2lts-mc( 3/ 4): ~241 levels ~320000 states ~1647012 transitions
pnml2lts-mc( 3/ 4): ~241 levels ~640000 states ~3532972 transitions
pnml2lts-mc( 1/ 4): ~239 levels ~1280000 states ~7374968 transitions
pnml2lts-mc( 1/ 4): ~239 levels ~2560000 states ~16013080 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4368449
pnml2lts-mc( 0/ 4): unique states count: 4369247
pnml2lts-mc( 0/ 4): unique transitions count: 31755904
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 27361849
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4369254
pnml2lts-mc( 0/ 4): - cum. max stack depth: 963
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4369254 states 31755928 transitions, fanout: 7.268
pnml2lts-mc( 0/ 4): Total exploration time 178.200 sec (178.190 sec minimum, 178.197 sec on average)
pnml2lts-mc( 0/ 4): States per second: 24519, Transitions per second: 178204
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 97.5MB, 23.3 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 13.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 886 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 97.5MB (~256.0MB paged-in)
ltl formula name Echo-PT-d02r11-LTLCardinality-14
ltl formula formula --ltl=/tmp/1767/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 1000 places, 874 transitions and 4567 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.120 real 0.030 user 0.040 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1767/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1767/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1767/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1767/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 999 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 982 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( 2/ 4): ~243 levels ~10000 states ~52812 transitions
pnml2lts-mc( 2/ 4): ~243 levels ~20000 states ~98720 transitions
pnml2lts-mc( 2/ 4): ~243 levels ~40000 states ~190004 transitions
pnml2lts-mc( 2/ 4): ~243 levels ~80000 states ~387000 transitions
pnml2lts-mc( 2/ 4): ~243 levels ~160000 states ~800104 transitions
pnml2lts-mc( 2/ 4): ~243 levels ~320000 states ~1742856 transitions
pnml2lts-mc( 2/ 4): ~243 levels ~640000 states ~3755364 transitions
pnml2lts-mc( 0/ 4): ~239 levels ~1280000 states ~7710116 transitions
pnml2lts-mc( 2/ 4): ~243 levels ~2560000 states ~17571276 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4072209
pnml2lts-mc( 0/ 4): unique states count: 4073007
pnml2lts-mc( 0/ 4): unique transitions count: 34413060
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 30303480
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4073016
pnml2lts-mc( 0/ 4): - cum. max stack depth: 966
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4073016 states 34413116 transitions, fanout: 8.449
pnml2lts-mc( 0/ 4): Total exploration time 170.440 sec (170.360 sec minimum, 170.380 sec on average)
pnml2lts-mc( 0/ 4): States per second: 23897, Transitions per second: 201908
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 95.2MB, 24.4 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 12.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 886 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 95.2MB (~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-d02r11"
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-d02r11, 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-171636266100083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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