About the Execution of LTSMin+red for JoinFreeModules-PT-0200
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1387.396 | 1251319.00 | 1630039.00 | 3049.30 | TTFFFFFFFF?TTFFF | normal |
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.r504-tall-171649612000059.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 JoinFreeModules-PT-0200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612000059
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 11 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 613K 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 JoinFreeModules-PT-0200-LTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-0200-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717218876141
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0200
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:14:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:14:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:14:37] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2024-06-01 05:14:37] [INFO ] Transformed 1001 places.
[2024-06-01 05:14:37] [INFO ] Transformed 1601 transitions.
[2024-06-01 05:14:37] [INFO ] Parsed PT model containing 1001 places and 1601 transitions and 4602 arcs in 236 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0200-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 76 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
// Phase 1: matrix 1601 rows 1000 cols
[2024-06-01 05:14:37] [INFO ] Computed 200 invariants in 27 ms
[2024-06-01 05:14:37] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20483ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20518ms
[2024-06-01 05:14:58] [INFO ] Invariant cache hit.
[2024-06-01 05:14:58] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-06-01 05:14:58] [INFO ] Invariant cache hit.
[2024-06-01 05:14:59] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 05:14:59] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-06-01 05:14:59] [INFO ] Invariant cache hit.
[2024-06-01 05:14:59] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60337ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60355ms
Finished structural reductions in LTL mode , in 1 iterations and 81758 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Support contains 34 out of 1000 places after structural reductions.
[2024-06-01 05:15:59] [INFO ] Flatten gal took : 132 ms
[2024-06-01 05:15:59] [INFO ] Flatten gal took : 62 ms
[2024-06-01 05:16:00] [INFO ] Input system was already deterministic with 1601 transitions.
Support contains 33 out of 1000 places (down from 34) after GAL structural reductions.
RANDOM walk for 40394 steps (8 resets) in 867 ms. (46 steps per ms) remains 12/23 properties
BEST_FIRST walk for 40004 steps (8 resets) in 774 ms. (51 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 601 ms. (66 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 607 ms. (65 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 535 ms. (74 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 474 ms. (84 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 502 ms. (79 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 500 ms. (79 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 567 ms. (70 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 471 ms. (84 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 474 ms. (84 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 489 ms. (81 steps per ms) remains 4/5 properties
[2024-06-01 05:16:02] [INFO ] Invariant cache hit.
[2024-06-01 05:16:02] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 20/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/2601 variables, and 35 constraints, problems are : Problem set: 0 solved, 4 unsolved in 331 ms.
Refiners :[Positive P Invariants (semi-flows): 5/200 constraints, State Equation: 25/1000 constraints, ReadFeed: 5/200 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 20/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 05:16:02] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 14 ms to minimize.
[2024-06-01 05:16:02] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 40/65 variables, 25/32 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/2601 variables, and 41 constraints, problems are : Problem set: 0 solved, 4 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 5/200 constraints, State Equation: 25/1000 constraints, ReadFeed: 5/200 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 625ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 506 steps, including 0 resets, run visited all 4 properties in 9 ms. (steps per millisecond=56 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 21 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(p1))))))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 26 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-06-01 05:16:03] [INFO ] Invariant cache hit.
[2024-06-01 05:16:03] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 2.0)
(s3 4.0)
(s4 5.0)
(s5 5.0)
(s6 2.0)
(s8 4.0)
(s9 5.0)
(s10 5.0)
(s11 2.0)
(s13 4.0)
(s14 5.0)
(s15 5.0)
(s16 2.0)
(s18 4.0)
(s19 5.0)
(s20 5.0)
(s21 2.0)
(s23 4.0)
(s24 5.0)
(s25 5.0)
(s26 2.0)
(s28 4.0)
(s29 5.0)
(s30 5.0)
(s31 2.0)
(s33 4.0)
(s34 5.0)
(s35 5.0)
(s36 2.0)
(s38 4.0)
(s39 5.0)
(s40 5.0)
(s41 2.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s48 4.0)
(s49 5.0)
(s50 5.0)
(s51 2.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s58 4.0)
(s59 5.0)
(s60 5.0)
(s61 2.0)
(s63 4.0)
(s64 5.0)
(s65 5.0)
(s66 2.0)
(s68 4.0)
(s69 5.0)
(s70 5.0)
(s71 2.0)
(s73 4.0)
(s74 5.0)
(s75 5.0)
(s76 2.0)
(s78 4.0)
(s79 5.0)
(s80 5.0)
(s81 2.0)
(s83 4.0)
(s84 5.0)
(s85 5.0)
(s86 2.0)
(s88 4.0)
(s89 5.0)
(s90 5.0)
(s91 2.0)
(s93 4.0)
(s94 5.0)
(s95 5.0)
(s96 2.0)
(s98 4.0)
(s99 5.0)
(s100 5.0)
(s101 2.0)
(s103 4.0)
(s104 5.0)
(s105 5.0)
(s106 2.0)
(s108 4.0)
(s109 5.0)
(s110 5.0)
(s111 2.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s118 4.0)
(s119 5.0)
(s120 5.0)
(s121 2.0)
(s123 4.0)
(s124 5.0)
(s125 5.0)
(s126 2.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s131 2.0)
(s133 4.0)
(s134 5.0)
(s135 5.0)
(s136 2.0)
(s138 4.0)
(s139 5.0)
(s140 5.0)
(s141 2.0)
(s143 4.0)
(s144 5.0)
(s145 5.0)
(s146 2.0)
(s148 4.0)
(s149 5.0)
(s150 5.0)
(s151 2.0)
(s153 4.0)
(s154 5.0)
(s155 5.0)
(s156 2.0)
(s158 4.0)
(s159 5.0)
(s160 5.0)
(s161 2.0)
(s163 4.0)
(s164 5.0)
(s165 5.0)
(s166 2.0)
(s168 4.0)
(s169 5.0)
(s170 5.0)
(s171 2.0)
(s173 4.0)
(s174 5.0)
(s175 5.0)
(s176 2.0)
(s178 4.0)
(s179 5.0)
(s180 5.0)
(s181 2.0)
(s183 4.0)
(s184 5.0)
(s185 5.0)
(s186 2.0)
(s188 4.0)
(s189 5.0)
(s190 5.0)
(s191 2.0)
(s193 4.0)
(s194 5.0)
(s195 5.0)
(s196 2.0)
(s198 4.0)
(s199 5.0)
(s200 5.0)
(s201 2.0)
(s203 4.0)
(s204 5.0)
(s205 5.0)
(s206 2.0)
(s208 4.0)
(s209 5.0)
(s210 5.0)
(s211 2.0)
(s213 4.0)
(s214 5.0)
(s215 5.0)
(s216 2.0)
(s218 4.0)
(s219 5.0)
(s220 5.0)
(s221 2.0)
(s223 4.0)
(s224 5.0)
(s225 5.0)
(s226 2.0)
(s228 4.0)
(s229 5.0)
(s230 5.0)
(s231 2.0)
(s233 4.0)
(s234 5.0)
(s235 5.0)
(s236 2.0)
(s238 4.0)
(s239 5.0)
(s240 5.0)
(s241 2.0)
(s243 4.0)
(s244 5.0)
(s245 5.0)
(s246 2.0)
(s248 4.0)
(s249 5.0)
(s250 5.0)
(s251 2.0)
(s253 4.0)
(s254 5.0)
(s255 5.0)
(s256 2.0)
(s258 4.0)
(s259 5.0)
(s260 5.0)
(s261 2.0)
(s263 4.0)
(s264 5.0)
(s265 5.0)
(s266 2.0)
(s268 4.0)
(s269 5.0)
(s270 5.0)
(s271 2.0)
(s273 4.0)
(s274 5.0)
(s275 5.0)
(s276 2.0)
(s278 4.0)
(s279 5.0)
(s280 5.0)
(s281 2.0)
(s283 4.0)
(s284 5.0)
(s285 5.0)
(s286 2.0)
(s288 4.0)
(s289 5.0)
(s290 5.0)
(s291 2.0)
(s293 4.0)
(s294 5.0)
(s295 5.0)
(s296 2.0)
(s298 4.0)
(s299 5.0)
(s300 5.0)
(s301 2.0)
(s303 4.0)
(s304 5.0)
(s305 5.0)
(s306 2.0)
(s308 4.0)
(s309 5.0)
(s310 5.0)
(s311 2.0)
(s313 4.0)
(s314 5.0)
(s315 5.0)
(s316 2.0)
(s318 4.0)
(s319 5.0)
(s320 5.0)
(s321 2.0)
(s323 4.0)
(s324 5.0)
(s325 5.0)
(s326 2.0)
(s328 4.0)
(s329 5.0)
(s330 5.0)
(s331 2.0)
(s333 4.0)
(s334 5.0)
(s335 5.0)
(s336 2.0)
(s338 4.0)
(s339 5.0)
(s340 5.0)
(s341 2.0)
(s343 4.0)
(s344 5.0)
(s345 5.0)
(s346 2.0)
(s348 4.0)
(s349 5.0)
(s350 5.0)
(s351 2.0)
(s353 4.0)
(s354 5.0)
(s355 5.0)
(s356 2.0)
(s358 4.0)
(s359 5.0)
(s360 5.0)
(s361 2.0)
(s363 4.0)
(s364 5.0)
(s365 5.0)
(s366 2.0)
(s368 4.0)
(s369 5.0)
(s370 5.0)
(s371 2.0)
(s373 4.0)
(s374 5.0)
(s375 5.0)
(s376 2.0)
(s378 4.0)
(s379 5.0)
(s380 5.0)
(s381 2.0)
(s383 4.0)
(s384 5.0)
(s385 5.0)
(s386 2.0)
(s388 4.0)
(s389 5.0)
(s390 5.0)
(s391 2.0)
(s393 4.0)
(s394 5.0)
(s395 5.0)
(s396 2.0)
(s398 4.0)
(s399 5.0)
(s400 5.0)
(s401 2.0)
(s403 4.0)
(s404 5.0)
(s405 5.0)
(s406 2.0)
(s408 4.0)
(s409 5.0)
(s410 5.0)
(s411 2.0)
(s413 4.0)
(s414 5.0)
(s415 5.0)
(s416 2.0)
(s418 4.0)
(s419 5.0)
(s420 5.0)
(s421 2.0)
(s423 4.0)
(s424 5.0)
(s425 5.0)
(s426 2.0)
(s428 4.0)
(s429 5.0)
(s430 5.0)
(s431 2.0)
(s433 4.0)
(s434 5.0)
(s435 5.0)
(s436 2.0)
(s438 4.0)
(s439 5.0)
(s440 5.0)
(s441 2.0)
(s443 4.0)
(s444 5.0)
(s445 5.0)
(s446 2.0)
(s448 4.0)
(s449 5.0)
(s450 5.0)
(s451 2.0)
(s453 4.0)
(s454 5.0)
(s455 5.0)
(s456 2.0)
(s458 4.0)
(s459 5.0)
(s460 5.0)
(s461 2.0)
(s463 4.0)
(s464 5.0)
(s465 5.0)
(s466 2.0)
(s468 4.0)
(s469 5.0)
(s470 5.0)
(s471 2.0)
(s473 4.0)
(s474 5.0)
(s475 5.0)
(s476 2.0)
(s478 4.0)
(s479 5.0)
(s480 5.0)
(s481 2.0)
(s483 4.0)
(s484 5.0)
(s485 5.0)
(s486 2.0)
(s488 4.0)
(s489 5.0)
(s490 5.0)
(s491 2.0)
(s493 4.0)
(s494 5.0)
(s495 timeout
5.0)
(s496 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20376ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20388ms
[2024-06-01 05:16:23] [INFO ] Invariant cache hit.
[2024-06-01 05:16:23] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-06-01 05:16:23] [INFO ] Invariant cache hit.
[2024-06-01 05:16:24] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 05:16:24] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-06-01 05:16:24] [INFO ] Invariant cache hit.
[2024-06-01 05:16:24] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 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 Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60280ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60294ms
Finished structural reductions in LTL mode , in 1 iterations and 81389 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLCardinality-00
Product exploration explored 100000 steps with 33333 reset in 3024 ms.
Product exploration explored 100000 steps with 33333 reset in 3127 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 28 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA JoinFreeModules-PT-0200-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0200-LTLCardinality-00 finished in 89412 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||X(F((p0&&F(p1))))))))'
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 78 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-06-01 05:17:32] [INFO ] Invariant cache hit.
[2024-06-01 05:17:32] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20242ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20252ms
[2024-06-01 05:17:52] [INFO ] Invariant cache hit.
[2024-06-01 05:17:53] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-06-01 05:17:53] [INFO ] Invariant cache hit.
[2024-06-01 05:17:53] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 05:17:53] [INFO ] Implicit Places using invariants and state equation in 539 ms returned []
Implicit Place search using SMT with State Equation took 683 ms to find 0 implicit places.
[2024-06-01 05:17:53] [INFO ] Redundant transitions in 77 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-06-01 05:17:53] [INFO ] Invariant cache hit.
[2024-06-01 05:17:53] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60259ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60268ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 81379 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLCardinality-02
Product exploration explored 100000 steps with 81 reset in 5761 ms.
Stack based approach found an accepted trace after 4330 steps with 3 reset with depth 945 and stack size 945 in 240 ms.
FORMULA JoinFreeModules-PT-0200-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0200-LTLCardinality-02 finished in 87524 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, 1601/1601 transitions.
Applied a total of 0 rules in 49 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-06-01 05:19:00] [INFO ] Invariant cache hit.
[2024-06-01 05:19:00] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20245ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20255ms
[2024-06-01 05:19:20] [INFO ] Invariant cache hit.
[2024-06-01 05:19:20] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-01 05:19:20] [INFO ] Invariant cache hit.
[2024-06-01 05:19:21] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 05:19:21] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
[2024-06-01 05:19:21] [INFO ] Redundant transitions in 23 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-06-01 05:19:21] [INFO ] Invariant cache hit.
[2024-06-01 05:19:21] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 2.0)
(s2 0.0)
(s3 4.0)
(s4 192.0)
(s5 5.0)
(s6 189.0)
(s7 0.0)
(s8 4.0)
(s9 5.0)
(s10 5.0)
(s11 189.0)
(s12 0.0)
(s13 4.0)
(s14 5.0)
(s15 5.0)
(s16 2.0)
(s17 187.0)
(s18 4.0)
(s19 5.0)
(s20 5.0)
(s21 2.0)
(s22 0.0)
(s23 4.0)
(s24 192.0)
(s25 5.0)
(s26 2.0)
(s27 0.0)
(s28 191.0)
(s29 5.0)
(s30 5.0)
(s31 2.0)
(s32 0.0)
(s33 4.0)
(s34 192.0)
(s35 5.0)
(s36 2.0)
(s37 0.0)
(s38 191.0)
(s39 5.0)
(s40 5.0)
(s41 189.0)
(s42 0.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s47 0.0)
(s48 4.0)
(s49 192.0)
(s50 5.0)
(s51 2.0)
(s52 187.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s57 0.0)
(s58 4.0)
(s59 192.0)
(s60 192.0)
(s61 2.0)
(s62 0.0)
(s63 4.0)
(s64 5.0)
(s65 5.0)
(s66 2.0)
(s67 187.0)
(s68 4.0)
(s69 5.0)
(s70 5.0)
(s71 2.0)
(s72 187.0)
(s73 4.0)
(s74 5.0)
(s75 5.0)
(s76 2.0)
(s77 0.0)
(s78 191.0)
(s79 5.0)
(s80 192.0)
(s81 2.0)
(s82 0.0)
(s83 4.0)
(s84 5.0)
(s85 5.0)
(s86 2.0)
(s87 187.0)
(s88 4.0)
(s89 5.0)
(s90 192.0)
(s91 2.0)
(s92 0.0)
(s93 4.0)
(s94 5.0)
(s95 192.0)
(s96 2.0)
(s97 0.0)
(s98 4.0)
(s99 5.0)
(s100 192.0)
(s101 2.0)
(s102 0.0)
(s103 4.0)
(s104 5.0)
(s105 5.0)
(s106 189.0)
(s107 0.0)
(s108 4.0)
(s109 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 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 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60285ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60295ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 81325 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLCardinality-03
Product exploration timeout after 96230 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 1786 steps with 0 reset with depth 1787 and stack size 1787 in 111 ms.
FORMULA JoinFreeModules-PT-0200-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0200-LTLCardinality-03 finished in 91500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 47 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-06-01 05:20:31] [INFO ] Invariant cache hit.
[2024-06-01 05:20:31] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20258ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20267ms
[2024-06-01 05:20:51] [INFO ] Invariant cache hit.
[2024-06-01 05:20:52] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-01 05:20:52] [INFO ] Invariant cache hit.
[2024-06-01 05:20:52] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 05:20:52] [INFO ] Implicit Places using invariants and state equation in 569 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
[2024-06-01 05:20:52] [INFO ] Redundant transitions in 81 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-06-01 05:20:52] [INFO ] Invariant cache hit.
[2024-06-01 05:20:52] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 192)
(s1 2)
(s2 0)
(s3 4)
(s4 5)
(s5 5)
(s6 2)
(s7 0)
(s8 191)
(s9 5)
(s10 5)
(s11 189)
(s12 0)
(s13 4)
(s14 5)
(s15 192)
(s16 2)
(s17 0)
(s18 4)
(s19 5)
(s20 5)
(s21 2)
(s22 0)
(s23 191)
(s24 5)
(s25 192)
(s26 2)
(s27 0)
(s28 4)
(s29 5)
(s30 5)
(s31 2)
(s32 187)
(s33 4)
(s34 5)
(s35 192)
(s36 2)
(s37 0)
(s38 4)
(s39 5)
(s40 5)
(s41 189)
(s42 0)
(s43 4)
(s44 5)
(s45 5)
(s46 2)
(s47 187)
(s48 4)
(s49 5)
(s50 5)
(s51 2)
(s52 0)
(s53 4)
(s54 192)
(s55 5)
(s56 2)
(s57 0)
(s58 4)
(s59 192)
(s60 192)
(s61 2)
(s62 0)
(s63 4)
(s64 5)
(s65 5)
(s66 2)
(s67 187)
(s68 4)
(s69 5)
(s70 5)
(s71 189)
(s72 0)
(s73 4)
(s74 5)
(s75 192)
(s76 2)
(s77 0)
(s78 4)
(s79 5)
(s80 5)
(s81 2)
(s82 0)
(s83 191)
(s84 5)
(s85 5)
(s86 189)
(s87 0)
(s88 4)
(s89 5)
(s90 5)
(s91 2)
(s92 0)
(s93 191)
(s94 5)
(s95 5)
(s96 2)
(s97 0)
(s98 191)
(s99 5)
(s100 5)
(s101 189)
(s102 0)
(s103 4)
(s104 5)
(s105 5)
(s106 189)
(s107 0)
(s108 4)
(s109 5)
(s110 192)
(s111 2)
(s112 0)
(s113 4)
(s114 5)
(s115 5)
(s116 2)
(s117 0)
(s118 4)
(s119 192)
(s120 5)
(s121 2)
(s122 187)
(s123 4)
(s124 5)
(s125 5)
(s126 2)
(s127 0)
(s128 4)
(s129 192)
(s130 5)
(s131 2)
(s132 187)
(s133 4)
(s134 5)
(s135 5)
(s136 2)
(s137 187)
(s138 4)
(s139 5)
(s140 5)
(s141 189)
(s142 0)
(s143 4)
(s144 5)
(s145 5)
(s146 2)
(s147 187)
(s148 4)
(s149 5)
(s150 5)
(s151 2)
(s152 187)
(s153 4)
(s154 5)
(s155 192)
(s156 2)
(s157 0)
(s158 4)
(s159 5)
(s160 192)
(s161 2)
(s162 0)
(s163 4)
(s164 5)
(s165 5)
(s166 2)
(s167 187)
(s168 4)
(s169 5)
(s170 5)
(s171 2)
(s172 0)
(s173 191)
(s174 5)
(s175 5)
(s176 2)
(s177 0)
(s178 4)
(s179 192)
(s180 5)
(s181 2)
(s182 187)
(s183 4)
(s184 5)
(s185 5)
(s186 2)
(s187 187)
(s188 4)
(s189 5)
(s190 5)
(s191 2)
(s192 0)
(s193 4)
(s194 192)
(s195 5)
(s196 2)
(s197 0)
(s198 4)
(s199 192)
(s200 192)
(s201 2)
(s202 0)
(s203 4)
(s204 5)
(s205 5)
(s206 189)
(s207 0)
(s208 4)
(s209 5)
(s210 5)
(s211 2)
(s212 0)
(s213 4)
(s214 192)
(s215 5)
(s216 2)
(s217 187)
(s218 4)
(s219 5)
(s220 5)
(s221 189)
(s222 0)
(s223 4)
(s224 5)
(s225 5)
(s226 189)
(s227 0)
(s228 4)
(s229 5)
(s230 5)
(s231 189)
(s232 0)
(s233 4)
(s234 5)
(s235 5)
(s236 189)
(s237 0)
(s238 4)
(s239 5)
(s240 5)
(s241 2)
(s242 187)
(s243 4)
(s244 5)
(s245 5)
(s246 189)
(s247 0)
(s248 4)
(s249 5)
(s250 5)
(s251 2)
(s252 187)
(s253 4)
(s254 5)
(s255 5)
(s256 2)
(s257 0)
(s258 4)
(s259 192)
(s260 5)
(s261 2)
(s262 187)
(s263 4)
(s264 5)
(s265 5)
(s266 2)
(s267 0)
(s268 191)
(s269 5)
(s270 192)
(s271 2)
(s272 0)
(s273 4)
(s274 5)
(s275 5)
(s276 2)
(s277 187)
(s278 4)
(s279 5)
(s280 192)
(s281 2)
(s282 0)
(s283 4)
(s284 5)
(s285 5)
(s286 2)
(s287 187)
(s288 4)
(s289 5)
(s290 5)
(s291 189)
(s292 0)
(s293 4)
(s294 5)
(s295 5)
(s296 2)
(s297 187)
(s298 4)
(s299 5)
(s300 5)
(s301 189)
(s302 0)
(s303 4)
(s304 5)
(s305 5)
(s306 2)
(s307 187)
(s308 4)
(s309 5)
(s310 5)
(s311 2)
(s312 0)
(s313 191)
(s314 5)
(s315 5)
(s316 189)
(s317 0)
(s318 4)
(s319 5)
(s320 5)
(s321 2)
(s322 0)
(s323 4)
(s324 192)
(s325 5)
(s326 2)
(s327 0)
(s328 191)
(s329 5)
(s330 5)
(s331 2)
(s332 187)
(s333 4)
(s334 5)
(s335 5)
(s336 2)
(s337 187)
(s338 4)
(s339 5)
(s340 192)
(s341 2)
(s342 0)
(s343 4)
(s344 5)
(s345 5)
(s346 2)
(s347 0)
(s348 4)
(s349 192)
(s350 192)
(s351 2)
(s352 0)
(s353 4)
(s354 5)
(s355 192)
(s356 2)
(s357 0)
(s358 4)
(s359 5)
(s360 192)
(s361 2)
(s362 0)
(s363 4)
(s364 5)
(s365 5)
(s366 2)
(s367 0)
(s368 191)
(s369 5)
(s370 5)
(s371 189)
(s372 0)
(s373 4)
(s374 5)
(s375 5)
(s376 2)
(s377 0)
(s378 191)
(s379 5)
(s380 5)
(s381 2)
(s382 187)
(s383 4)
(s384 5)
(s385 5)
(s386 189)
(s387 0)
(s388 4)
(s389 5)
(s390 5)
(s391 2)
(s392 0)
(s393 4)
(s394 192)
(s395 5)
(s396 189)
(s397 0)
(s398 4)
(s399 5)
(s400 5)
(s401 2)
(s402 187)
(s403 4)
(s404 5)
(s405 5)
(s406 2)
(s407 187)
(s408 4)
(s409 5)
(s410 192)
(s411 2)
(s412 0)
(s413 4)
(s414 5)
(s415 5)
(s416 189)
(s417 0)
(s418 4)
(s419 5)
(s420 5)
(s421 2)
(s422 0)
(s423 4)
(s424 192)
(s425 5)
(s426 189)
(s427 0)
(s428 4)
(s429 5)
(s430 5)
(s431 2)
(s432 0)
(s433 4)
(s434 192)
(s435 5)
(s436 2)
(s437 0)
(s438 4)
(s439 192)
(s440 5)
(s441 189)
(s442 0)
(s443 4)
(s444 5)
(s445 5)
(s446 189)
(s447 0)
(s448 4)
(s449 5)
(s450 192)
(s451 2)
(s452 0)
(s453 4)
(s454 5)
(s455 5)
(s456 2)
(s457 0)
(s458 4)
(s459 192)
(s460 5)
(s461 2)
(s462 187)
(s463 4)
(s464 5)
(s465 5)
(s466 2)
(s467 0)
(s468 4)
(s469 192)
(s470 5)
(s471 2)
(s472 187)
(s473 4)
(s474 5)
(s475 5)
(s476 2)
(s477 0)
(s478 191)
(s479 5)
(s480 5)
(s481 189)
(s482 0)
(s483 4)
(s484 5)
(s485 5)
(s486 2)
(s487 0)
(s488 4)
(s489 192)
(s490 192)
(s491 2)
(s492 0)
(s493 4)
(s494 5)
(s495 5)
(s496 189)
(s497 0)
(s498 4)
(s499 5)
(s500 5)
(s501 2)
(s502 0)
(s503 4)
(s504 192)
(s505 5)
(s506 2)
(s507 187)
(s508 4)
(s509 5)
(s510 192)
(s511 2)
(s512 0)
(s513 4)
(s514 5)
(s515 5)
(s516 2)
(s517 0)
(s518 191)
(s519 5)
(s520 5)
(s521 2)
(s522 0)
(s523 191)
(s524 5)
(s525 5)
(s526 2)
(s527 0)
(s528 191)
(s529 5)
(s530 5)
(s531 2)
(s532 0)
(s533 191)
(s534 5)
(s535 5)
(s536 2)
(s537 0)
(s538 191)
(s539 5)
(s540 5)
(s541 189)
(s542 0)
(s543 4)
(s544 5)
(s545 5)
(s546 2)
(s547 187)
(s548 4)
(s549 5)
(s550 5)
(s551 2)
(s552 0)
(s553 191)
(s554 5)
(s555 5)
(s556 2)
(s557 187)
(s558 4)
(s559 5)
(s560 5)
(s561 2)
(s562 0)
(s563 191)
(s564 5)
(s565 5)
(s566 2)
(s567 0)
(s568 191)
(s569 5)
(s570 192)
(s571 2)
(s572 0)
(s573 4)
(s574 5)
(s575 5)
(s576 2)
(s577 0)
(s578 191)
(s579 5)
(s580 5)
(s581 189)
(s582 0)
(s583 4)
(s584 5)
(s585 5)
(s586 189)
(s587 0)
(s588 4)
(s589 5)
(s590 5)
(s591 2)
(s592 187)
(s593 4)
(s594 5)
(s595 192)
(s596 2)
(s597 0)
(s598 4)
(s599 5)
(s600 192)
(s601 2)
(s602 0)
(s603 4)
(s604 5)
(s605 5)
(s606 2)
(s607 0)
(s608 4)
(s609 192)
(s610 5)
(s611 2)
(s612 187)
(s613 4)
(s614 5)
(s615 5)
(s616 189)
(s617 0)
(s618 4)
(s619 5)
(s620 5)
(s621 2)
(s622 187)
(s623 4)
(s624 5)
(s625 5)
(s626 2)
(s627 187)
(s628 4)
(s629 5)
(s630 5)
(s631 2)
(s632 187)
(s633 4)
(s634 5)
(s635 5)
(s636 2)
(s637 187)
(s638 4)
(s639 5)
(s640 5)
(s641 2)
(s642 0)
(s643 4)
(s644 192)
(s645 5)
(s646 2)
(s647 0)
(s648 191)
(s649 5)
(s650 5)
(s651 2)
(s652 0)
(s653 191)
(s654 5)
(s655 5)
(s656 2)
(s657 0)
(s658 4)
(s659 192)
(s660 5)
(s661 2)
(s662 0)
(s663 191)
(s664 5)
(s665 5)
(s666 2)
(s667 0)
(s668 4)
(s669 192)
(s670 5)
(s671 2)
(s672 187)
(s673 4)
(s674 5)
(s675 5)
(s676 2)
(s677 0)
(s678 191)
(s679 5)
(s680 5)
(s681 2)
(s682 0)
(s683 191)
(s684 5)
(s685 5)
(s686 2)
(s687 0)
(s688 4)
(s689 192)
(s690 5)
(s691 2)
(s692 187)
(s693 4)
(s694 5)
(s695 5)
(s696 189)
(s697 0)
(s698 4)
(s699 5)
(s700 192)
(s701 2)
(s702 0)
(s703 4)
(s704 5)
(s705 5)
(s706 2)
(s707 187)
(s708 4)
(s709 5)
(s710 5)
(s711 2)
(s712 0)
(s713 4)
(s714 192)
(s715 5)
(s716 189)
(s717 0)
(s718 4)
(s719 5)
(s720 5)
(s721 189)
(s722 0)
(s723 4)
(s724 5)
(s725 5)
(s726 2)
(s727 187)
(s728 4)
(s729 5)
(s730 192)
(s731 2)
(s732 0)
(s733 4)
(s734 5)
(s735 5)
(s736 2)
(s737 0)
(s738 191)
(s739 5)
(s740 5)
(s741 2)
(s742 0)
(s743 191)
(s744 5)
(s745 192)
(s746 2)
(s747 0)
(s748 4)
(s749 5)
(s750 5)
(s751 2)
(s752 0)
(s753 4)
(s754 192)
(s755 5)
(s756 189)
(s757 0)
(s758 4)
(s759 5)
(s760 192)
(s761 2)
(s762 0)
(s763 4)
(s764 5)
(s765 5)
(s766 2)
(s767 0)
(s768 191)
(s769 5)
(s770 5)
(s771 2)
(s772 187)
(s773 4)
(s774 5)
(s775 5)
(s776 2)
(s777 187)
(s778 4)
(s779 5)
(s780 5)
(s781 2)
(s782 187)
(s783 4)
(s784 5)
(s785 5)
(s786 2)
(s787 0)
(s788 4)
(s789 192)
(s790 5)
(s791 189)
(s792 0)
(s793 4)
(s794 5)
(s795 5)
(s796 2)
(s797 0)
(s798 timeout
4) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60275ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60288ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 81407 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0200-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLCardinality-04 finished in 81481 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, 1601/1601 transitions.
Applied a total of 0 rules in 12 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-06-01 05:21:53] [INFO ] Invariant cache hit.
[2024-06-01 05:21:53] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20233ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20243ms
[2024-06-01 05:22:13] [INFO ] Invariant cache hit.
[2024-06-01 05:22:13] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-06-01 05:22:13] [INFO ] Invariant cache hit.
[2024-06-01 05:22:13] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 05:22:14] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 675 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-06-01 05:22:14] [INFO ] Invariant cache hit.
[2024-06-01 05:22:14] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 192)
(s1 2)
(s2 0)
(s3 4)
(s4 5)
(s5 5)
(s6 2)
(s7 0)
(s8 191)
(s9 5)
(s10 5)
(s11 189)
(s12 0)
(s13 4)
(s14 5)
(s15 192)
(s16 2)
(s17 0)
(s18 4)
(s19 5)
(s20 5)
(s21 2)
(s22 0)
(s23 191)
(s24 5)
(s25 192)
(s26 2)
(s27 0)
(s28 4)
(s29 5)
(s30 5)
(s31 2)
(s32 187)
(s33 4)
(s34 5)
(s35 192)
(s36 2)
(s37 0)
(s38 4)
(s39 5)
(s40 5)
(s41 189)
(s42 0)
(s43 4)
(s44 5)
(s45 5)
(s46 2)
(s47 187)
(s48 4)
(s49 5)
(s50 5)
(s51 2)
(s52 0)
(s53 4)
(s54 192)
(s55 5)
(s56 2)
(s57 0)
(s58 4)
(s59 192)
(s60 192)
(s61 2)
(s62 0)
(s63 4)
(s64 5)
(s65 5)
(s66 2)
(s67 187)
(s68 4)
(s69 5)
(s70 5)
(s71 189)
(s72 0)
(s73 4)
(s74 5)
(s75 192)
(s76 2)
(s77 0)
(s78 4)
(s79 5)
(s80 5)
(s81 2)
(s82 0)
(s83 191)
(s84 5)
(s85 5)
(s86 189)
(s87 0)
(s88 4)
(s89 5)
(s90 5)
(s91 2)
(s92 0)
(s93 191)
(s94 5)
(s95 5)
(s96 2)
(s97 0)
(s98 191)
(s99 5)
(s100 5)
(s101 189)
(s102 0)
(s103 4)
(s104 5)
(s105 5)
(s106 189)
(s107 0)
(s108 4)
(s109 5)
(s110 192)
(s111 2)
(s112 0)
(s113 4)
(s114 5)
(s115 5)
(s116 2)
(s117 0)
(s118 4)
(s119 192)
(s120 5)
(s121 2)
(s122 187)
(s123 4)
(s124 5)
(s125 5)
(s126 2)
(s127 0)
(s128 4)
(s129 192)
(s130 5)
(s131 2)
(s132 187)
(s133 4)
(s134 5)
(s135 5)
(s136 2)
(s137 187)
(s138 4)
(s139 5)
(s140 5)
(s141 189)
(s142 0)
(s143 4)
(s144 5)
(s145 5)
(s146 2)
(s147 187)
(s148 4)
(s149 5)
(s150 5)
(s151 2)
(s152 187)
(s153 4)
(s154 5)
(s155 192)
(s156 2)
(s157 0)
(s158 4)
(s159 5)
(s160 192)
(s161 2)
(s162 0)
(s163 4)
(s164 5)
(s165 5)
(s166 2)
(s167 187)
(s168 4)
(s169 5)
(s170 5)
(s171 2)
(s172 0)
(s173 191)
(s174 5)
(s175 5)
(s176 2)
(s177 0)
(s178 4)
(s179 192)
(s180 5)
(s181 2)
(s182 187)
(s183 4)
(s184 5)
(s185 5)
(s186 2)
(s187 187)
(s188 4)
(s189 5)
(s190 5)
(s191 2)
(s192 0)
(s193 4)
(s194 192)
(s195 5)
(s196 2)
(s197 0)
(s198 4)
(s199 192)
(s200 192)
(s201 2)
(s202 0)
(s203 4)
(s204 5)
(s205 5)
(s206 189)
(s207 0)
(s208 4)
(s209 5)
(s210 5)
(s211 2)
(s212 0)
(s213 4)
(s214 192)
(s215 5)
(s216 2)
(s217 187)
(s218 4)
(s219 5)
(s220 5)
(s221 189)
(s222 0)
(s223 4)
(s224 5)
(s225 5)
(s226 189)
(s227 0)
(s228 4)
(s229 5)
(s230 5)
(s231 189)
(s232 0)
(s233 4)
(s234 5)
(s235 5)
(s236 189)
(s237 0)
(s238 4)
(s239 5)
(s240 5)
(s241 2)
(s242 187)
(s243 4)
(s244 5)
(s245 5)
(s246 189)
(s247 0)
(s248 4)
(s249 5)
(s250 5)
(s251 2)
(s252 187)
(s253 4)
(s254 5)
(s255 5)
(s256 2)
(s257 0)
(s258 4)
(s259 192)
(s260 5)
(s261 2)
(s262 187)
(s263 4)
(s264 5)
(s265 5)
(s266 2)
(s267 0)
(s268 191)
(s269 5)
(s270 192)
(s271 2)
(s272 0)
(s273 4)
(s274 5)
(s275 5)
(s276 2)
(s277 187)
(s278 4)
(s279 5)
(s280 192)
(s281 2)
(s282 0)
(s283 4)
(s284 5)
(s285 5)
(s286 2)
(s287 187)
(s288 4)
(s289 5)
(s290 5)
(s291 189)
(s292 0)
(s293 timeout
4) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60285ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60295ms
Finished structural reductions in LTL mode , in 1 iterations and 81229 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLCardinality-05
Product exploration timeout after 96890 steps with 0 reset in 10002 ms.
Entered a terminal (fully accepting) state of product in 947 steps with 0 reset in 51 ms.
FORMULA JoinFreeModules-PT-0200-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLCardinality-05 finished in 91379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 54 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-06-01 05:23:24] [INFO ] Invariant cache hit.
[2024-06-01 05:23:24] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20229ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20238ms
[2024-06-01 05:23:44] [INFO ] Invariant cache hit.
[2024-06-01 05:23:44] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-06-01 05:23:44] [INFO ] Invariant cache hit.
[2024-06-01 05:23:45] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 05:23:45] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
[2024-06-01 05:23:45] [INFO ] Redundant transitions in 21 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-06-01 05:23:45] [INFO ] Invariant cache hit.
[2024-06-01 05:23:45] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60308ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60318ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 81323 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0200-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLCardinality-06 finished in 81415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 3 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-06-01 05:24:45] [INFO ] Invariant cache hit.
[2024-06-01 05:24:45] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 2.0)
(s3 4.0)
(s4 5.0)
(s5 5.0)
(s6 2.0)
(s8 4.0)
(s9 5.0)
(s10 5.0)
(s11 2.0)
(s13 4.0)
(s14 5.0)
(s15 5.0)
(s16 2.0)
(s18 4.0)
(s19 5.0)
(s20 5.0)
(s21 2.0)
(s23 4.0)
(s24 5.0)
(s25 5.0)
(s26 2.0)
(s28 4.0)
(s29 5.0)
(s30 5.0)
(s31 2.0)
(s33 4.0)
(s34 5.0)
(s35 5.0)
(s36 2.0)
(s38 4.0)
(s39 5.0)
(s40 5.0)
(s41 2.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s48 4.0)
(s49 5.0)
(s50 5.0)
(s51 2.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s58 4.0)
(s59 5.0)
(s60 5.0)
(s61 2.0)
(s63 4.0)
(s64 5.0)
(s65 5.0)
(s66 2.0)
(s68 4.0)
(s69 5.0)
(s70 5.0)
(s71 2.0)
(s73 4.0)
(s74 5.0)
(s75 5.0)
(s76 2.0)
(s78 4.0)
(s79 5.0)
(s80 5.0)
(s81 2.0)
(s83 4.0)
(s84 5.0)
(s85 5.0)
(s86 2.0)
(s88 4.0)
(s89 5.0)
(s90 5.0)
(s91 2.0)
(s93 4.0)
(s94 5.0)
(s95 5.0)
(s96 2.0)
(s98 4.0)
(s99 5.0)
(s100 5.0)
(s101 2.0)
(s103 4.0)
(s104 5.0)
(s105 5.0)
(s106 2.0)
(s108 4.0)
(s109 5.0)
(s110 5.0)
(s111 2.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s118 4.0)
(s119 5.0)
(s120 5.0)
(s121 2.0)
(s123 4.0)
(s124 5.0)
(s125 5.0)
(s126 2.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s131 2.0)
(s133 4.0)
(s134 5.0)
(s135 5.0)
(s136 2.0)
(s138 4.0)
(s139 5.0)
(s140 5.0)
(s141 2.0)
(s143 4.0)
(s144 5.0)
(s145 5.0)
(s146 2.0)
(s148 4.0)
(s149 5.0)
(s150 5.0)
(s151 2.0)
(s153 4.0)
(s154 5.0)
(s155 5.0)
(s156 2.0)
(s158 4.0)
(s159 5.0)
(s160 5.0)
(s161 2.0)
(s163 4.0)
(s164 5.0)
(s165 5.0)
(s166 2.0)
(s168 4.0)
(s169 5.0)
(s170 5.0)
(s171 2.0)
(s173 4.0)
(s174 5.0)
(s175 5.0)
(s176 2.0)
(s178 4.0)
(s179 5.0)
(s180 5.0)
(s181 2.0)
(s183 4.0)
(s184 5.0)
(s185 5.0)
(s186 2.0)
(s188 4.0)
(s189 5.0)
(s190 5.0)
(s191 2.0)
(s193 4.0)
(s194 5.0)
(s195 5.0)
(s196 2.0)
(s198 4.0)
(s199 5.0)
(s200 5.0)
(s201 2.0)
(s203 4.0)
(s204 5.0)
(s205 5.0)
(s206 2.0)
(s208 4.0)
(s209 5.0)
(s210 5.0)
(s211 2.0)
(s213 4.0)
(s214 5.0)
(s215 5.0)
(s216 2.0)
(s218 4.0)
(s219 5.0)
(s220 5.0)
(s221 2.0)
(s223 4.0)
(s224 5.0)
(s225 5.0)
(s226 2.0)
(s228 4.0)
(s229 5.0)
(s230 5.0)
(s231 2.0)
(s233 4.0)
(s234 5.0)
(s235 5.0)
(s236 2.0)
(s238 4.0)
(s239 5.0)
(s240 5.0)
(s241 2.0)
(s243 4.0)
(s244 5.0)
(s245 5.0)
(s246 2.0)
(s248 4.0)
(s249 5.0)
(s250 5.0)
(s251 2.0)
(s253 4.0)
(s254 5.0)
(s255 5.0)
(s256 2.0)
(s258 4.0)
(s259 5.0)
(s260 5.0)
(s261 2.0)
(s263 4.0)
(s264 5.0)
(s265 5.0)
(s266 2.0)
(s268 4.0)
(s269 5.0)
(s270 5.0)
(s271 2.0)
(s273 4.0)
(s274 5.0)
(s275 5.0)
(s276 2.0)
(s278 4.0)
(s279 5.0)
(s280 5.0)
(s281 2.0)
(s283 4.0)
(s284 5.0)
(s285 5.0)
(s286 2.0)
(s288 4.0)
(s289 5.0)
(s290 5.0)
(s291 2.0)
(s293 4.0)
(s294 5.0)
(s295 5.0)
(s296 2.0)
(s298 4.0)
(s299 5.0)
(s300 5.0)
(s301 2.0)
(s303 4.0)
(s304 5.0)
(s305 5.0)
(s306 2.0)
(s308 4.0)
(s309 5.0)
(s310 5.0)
(s311 2.0)
(s313 4.0)
(s314 5.0)
(s315 5.0)
(s316 2.0)
(s318 4.0)
(s319 5.0)
(s320 5.0)
(s321 2.0)
(s323 4.0)
(s324 5.0)
(s325 5.0)
(s326 2.0)
(s328 4.0)
(s329 5.0)
(s330 5.0)
(s331 2.0)
(s333 4.0)
(s334 5.0)
(s335 5.0)
(s336 2.0)
(s338 4.0)
(s339 5.0)
(s340 5.0)
(s341 2.0)
(s343 4.0)
(s344 5.0)
(s345 5.0)
(s346 2.0)
(s348 4.0)
(s349 5.0)
(s350 5.0)
(s351 2.0)
(s353 4.0)
(s354 5.0)
(s355 5.0)
(s356 2.0)
(s358 4.0)
(s359 5.0)
(s360 5.0)
(s361 2.0)
(s363 4.0)
(s364 5.0)
(s365 5.0)
(s366 2.0)timeout
(s368 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20236ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20245ms
[2024-06-01 05:25:06] [INFO ] Invariant cache hit.
[2024-06-01 05:25:06] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-01 05:25:06] [INFO ] Invariant cache hit.
[2024-06-01 05:25:06] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 05:25:06] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-06-01 05:25:06] [INFO ] Invariant cache hit.
[2024-06-01 05:25:06] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 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 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 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 Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60269ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60279ms
Finished structural reductions in LTL mode , in 1 iterations and 81202 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLCardinality-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0200-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLCardinality-08 finished in 81419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&G((X(p2) U p3))))'
Support contains 6 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-06-01 05:26:07] [INFO ] Invariant cache hit.
[2024-06-01 05:26:07] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20281ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20290ms
[2024-06-01 05:26:27] [INFO ] Invariant cache hit.
[2024-06-01 05:26:27] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-06-01 05:26:27] [INFO ] Invariant cache hit.
[2024-06-01 05:26:28] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 05:26:28] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-06-01 05:26:28] [INFO ] Invariant cache hit.
[2024-06-01 05:26:28] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 2.0)
(s2 0.0)
(s3 4.0)
(s4 192.0)
(s5 5.0)
(s6 189.0)
(s7 0.0)
(s8 4.0)
(s9 5.0)
(s10 5.0)
(s11 189.0)
(s12 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60311ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60324ms
Finished structural reductions in LTL mode , in 1 iterations and 81359 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p1) (NOT p3)), true, (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0200-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLCardinality-09 finished in 81591 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)||(p1&&X(G(p2))))))'
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 41 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-06-01 05:27:28] [INFO ] Invariant cache hit.
[2024-06-01 05:27:28] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 2.0)
(s3 4.0)
(s4 5.0)
(s5 5.0)
(s6 2.0)
(s8 4.0)
(s9 5.0)
(s10 5.0)
(s11 2.0)
(s13 4.0)
(s14 5.0)
(s15 5.0)
(s16 2.0)
(s18 4.0)
(s19 5.0)
(s20 5.0)
(s21 2.0)
(s23 4.0)
(s24 5.0)
(s25 5.0)
(s26 2.0)
(s28 4.0)
(s29 5.0)
(s30 5.0)
(s31 2.0)
(s33 4.0)
(s34 5.0)
(s35 5.0)
(s36 2.0)
(s38 4.0)
(s39 5.0)
(s40 5.0)
(s41 2.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s48 4.0)
(s49 5.0)
(s50 5.0)
(s51 2.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s58 4.0)
(s59 5.0)
(s60 5.0)
(s61 2.0)
(s63 4.0)
(s64 5.0)
(s65 5.0)
(s66 2.0)
(s68 4.0)
(s69 5.0)
(s70 5.0)
(s71 2.0)
(s73 4.0)
(s74 5.0)
(s75 5.0)
(s76 2.0)
(s78 4.0)
(s79 5.0)
(s80 5.0)
(s81 2.0)
(s83 4.0)
(s84 5.0)
(s85 5.0)
(s86 2.0)
(s88 4.0)
(s89 5.0)
(s90 5.0)
(s91 2.0)
(s93 4.0)
(s94 5.0)
(s95 5.0)
(s96 2.0)
(s98 4.0)
(s99 5.0)
(s100 5.0)
(s101 2.0)
(s103 4.0)
(s104 5.0)
(s105 5.0)
(s106 2.0)
(s108 4.0)
(s109 5.0)
(s110 5.0)
(s111 2.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s118 4.0)
(s119 5.0)
(s120 5.0)
(s121 2.0)
(s123 4.0)
(s124 5.0)
(s125 5.0)
(s126 2.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s131 2.0)
(s133 4.0)
(s134 5.0)
(s135 5.0)
(s136 2.0)
(s138 4.0)
(s139 5.0)
(s140 5.0)
(s141 2.0)
(s143 4.0)
(s144 5.0)
(s145 5.0)
(s146 2.0)
(s148 4.0)
(s149 5.0)
(s150 5.0)
(s151 2.0)
(s153 4.0)
(s154 5.0)
(s155 5.0)
(s156 2.0)
(s158 4.0)
(s159 5.0)
(s160 5.0)
(s161 2.0)
(s163 4.0)
(s164 5.0)
(s165 5.0)
(s166 2.0)
(s168 4.0)
(s169 5.0)
(s170 5.0)
(s171 2.0)
(s173 4.0)
(s174 5.0)
(s175 5.0)
(s176 2.0)
(s178 4.0)
(s179 5.0)
(s180 5.0)
(s181 2.0)
(s183 4.0)
(s184 5.0)
(s185 5.0)
(s186 2.0)
(s188 4.0)
(s189 5.0)
(s190 5.0)
(s191 2.0)
(s193 4.0)
(s194 5.0)
(s195 5.0)
(s196 2.0)
(s198 4.0)
(s199 5.0)
(s200 5.0)
(s201 2.0)
(s203 4.0)
(s204 5.0)
(s205 5.0)
(s206 2.0)
(s208 4.0)
(s209 5.0)
(s210 5.0)
(s211 2.0)
(s213 4.0)
(s214 5.0)
(s215 5.0)
(s216 2.0)
(s218 4.0)
(s219 5.0)
(s220 5.0)
(s221 2.0)
(s223 4.0)
(s224 5.0)
(s225 5.0)
(s226 2.0)
(s228 4.0)
(s229 5.0)
(s230 5.0)
(s231 2.0)
(s233 4.0)
(s234 5.0)
(s235 5.0)
(s236 2.0)
(s238 4.0)
(s239 5.0)
(s240 5.0)
(s241 2.0)
(s243 4.0)
(s244 5.0)
(s245 5.0)
(s246 2.0)
(s248 4.0)
(s249 5.0)
(s250 5.0)
(s251 2.0)
(s253 4.0)
(s254 5.0)
(s255 5.0)
(s256 2.0)
(s258 4.0)
(s259 5.0)
(s260 5.0)
(s261 2.0)
(s263 4.0)
(s264 5.0)
(s265 5.0)
(s266 2.0)
(s268 4.0)
(s269 5.0)
(s270 5.0)
(s271 2.0)
(s273 4.0)
(s274 5.0)
(s275 5.0)
(s276 2.0)
(s278 4.0)
(s279 5.0)
(s280 5.0)
(s281 2.0)
(s283 4.0)
(s284 5.0)
(s285 5.0)
(s286 2.0)
(s288 4.0)
(s289 5.0)
(s290 5.0)
(s291 2.0)
(s293 4.0)
(s294 5.0)
(s295 5.0)
(s296 2.0)
(s298 4.0)
(s299 5.0)
(s300 5.0)
(s301 2.0)
(s303 4.0)
(s304 5.0)
(s305 5.0)
(s306 2.0)
(s308 4.0)
(s309 5.0)
(s310 5.0)
(s311 2.0)
(s313 4.0)
(s314 5.0)
(s315 5.0)
(s316 2.0)
(s318 4.0)
(s319 5.0)
(s320 5.0)
(s321 2.0)
(s323 4.0)
(s324 5.0)
(s325 5.0)
(s326 2.0)
(s328 4.0)
(s329 5.0)
(s330 5.0)
(s331 2.0)
(s333 4.0)
(s334 5.0)
(s335 5.0)
(s336 2.0)
(s338 4.0)
(s339 5.0)
(s340 5.0)
(s341 2.0)
(s343 4.0)
(s344 5.0)
(s345 5.0)
(s346 2.0)
(s348 4.0)
(s349 5.0)
(s350 5.0)
(s351 2.0)
(s353 4.0)
(s354 5.0)
(s355 5.0)
(s356 2.0)
(s358 4.0)
(s359 5.0)
(s360 5.0)
(s361 2.0)
(s363 4.0)
(s364 5.0)
(s365 5.0)
(s366 2.0)
(s368 4.0)
(s369 5.0)
(s370 5.0)
(s371 2.0)
(s373 4.0)
(s374 5.0)
(s375 5.0)
(s376 2.0)
(s378 4.0)
(s379 5.0)
(s380 5.0)
(s381 2.0)
(s383 4.0)
(s384 5.0)
(s385 5.0)
(s386 2.0)
(s388 4.0)
(s389 5.0)
(s390 5.0)
(s391 2.0)
(s393 4.0)
(s394 5.0)
(s395 5.0)
(s396 2.0)
(s398 4.0)
(s399 5.0)
(s400 5.0)
(s401 2.0)
(s403 4.0)
(s404 5.0)
(s405 5.0)
(s406 2.0)
(s408 4.0)
(s409 5.0)
(s410 5.0)
(s411 2.0)
(s413 4.0)
(s414 5.0)
(s415 5.0)
(s416 2.0)
(s418 4.0)
(s419 5.0)
(s420 5.0)
(s421 2.0)
(s423 4.0)
(s424 5.0)
(s425 5.0)
(s426 2.0)
(s428 4.0)
(s429 5.0)
(s430 5.0)
(s431 2.0)
(s433 4.0)
(s434 5.0)
(s435 5.0)
(s436 2.0)
(s438 4.0)
(s439 5.0)
(s440 5.0)
(s441 2.0)
(s443 4.0)
(s444 5.0)
(s445 5.0)
(s446 2.0)
(s448 4.0)
(s449 5.0)
(s450 5.0)
(s451 2.0)
(s453 4.0)
(s454 5.0)
(s455 5.0)
(s456 2.0)
(s458 4.0)
(s459 5.0)
(s460 5.0)
(s461 2.0)
(s463 4.0)
(s464 5.0)
(s465 5.0)
(s466 2.0)
(s468 4.0)
(s469 5.0)
(s470 5.0)
(s471 2.0)
(s473 4.0)
(s474 5.0)
(s475 5.0)
(s476 2.0)
(s478 4.0)
(s479 5.0)
(s480 5.0)
(s481 2.0)
(s483 4.0)
(s484 5.0)
(s485 5.0)
(s486 2.0)
(s488 4.0)
(s489 5.0)
(s490 5.0)
(s491 2.0)
(s493 4.0)
(s494 5.0)
(s495 5.0)
(s496 2.0)
(s498 4.0)
(s499 5.0)
(s500 5.0)
(s501 2.0)
(s503 4.0)
(s504 5.0)
(s505 5.0)
(s506 2.0)
(s508 4.0)
(s509 5.0)
(s510 5.0)
(s511 2.0)
(s513 4.0)
(s514 5.0)
(s515 5.0)
(s516 2.0)
(s518 4.0)
(s519 5.0)
(s520 5.0)
(s521 2.0)
(s523 4.0)
(s524 5.0)
(s525 5.0)
(s526 2.0)
(s528 4.0)
(s529 5.0)
(s530 5.0)
(s531 2.0)
(s533 4.0)
(s534 5.0)
(s535 5.0)
(s536 2.0)
(s538 4.0)
(s539 5.0)
(s540 5.0)
(s541 2.0)
(s543 4.0)
(s544 5.0)
(s545 5.0)
(s546 2.0)
(s548 4.0)
(s549 5.0)
(s550 5.0)
(s551 2.0)
(s553 4.0)
(s554 5.0)
(s555 5.0)
(s556 2.0)
(s558 4.0)
(s559 5.0)
(s560 5.0)
(s561 2.0)
(s563 4.0)
(s564 5.0)
(s565 5.0)
(s566 2.0)
(s568 4.0)
(s569 5.0)
(s570 5.0)
(s571 2.0)
(s573 4.0)
(s574 5.0)
(s575 5.0)
(s576 2.0)
(s578 4.0)
(s579 5.0)
(s580 5.0)
(s581 2.0)
(s583 4.0)
(s584 5.0)
(s585 5.0)
(s586 2.0)
(s588 4.0)
(s589 5.0)
(s590 5.0)
(s591 2.0)
(s593 4.0)
(s594 5.0)
(s595 5.0)
(s596 2.0)
(s598 4.0)
(s599 5.0)
(s600 5.0)
(s601 2.0)
(s603 4.0)
(s604 5.0)
(s605 5.0)
(s606 2.0)
(s608 4.0)
(s609 5.0)
(s610 5.0)
(s611 2.0)
(s613 4.0)
(s614 5.0)
(s615 5.0)
(s616 2.0)
(s618 4.0)
(s619 5.0)
(s620 5.0)
(s621 2.0)
(s623 4.0)
(s624 5.0)
(s625 5.0)
(s626 2.0)
(s628 4.0)
(s629 5.0)
(s630 5.0)
(s631 2.0)
(s633 4.0)
(s634 5.0)
(s635 5.0)
(s636 2.0)
(s638 4.0)
(s639 5.0)
(s640 5.0)
(s641 2.0)
(s643 4.0)
(s644 5.0)
(s645 5.0)
(s646 2.0)
(s648 4.0)
(s649 5.0)
(s650 5.0)
(s651 2.0)
(s653 4.0)
(s654 5.0)
(s655 5.0)
(s656 2.0)
(s658 4.0)
(s659 5.0)
(s660 5.0)
(s661 2.0)
(s663 4.0)
(s664 5.0)
(s665 5.0)
(s666 2.0)
(s668 4.0)
(s669 5.0)
(s670 5.0)
(s671 2.0)
(s673 4.0)
(s674 5.0)
(s675 5.0)
(s676 2.0)
(s678 4.0)
(s679 5.0)
(s680 5.0)
(s681 2.0)
(s683 4.0)
(s684 5.0)
(s685 5.0)
(s686 2.0)
(s688 4.0)
(s689 5.0)
(s690 5.0)
(s691 2.0)
(s693 4.0)
(s694 5.0)
(s695 5.0)
(s696 2.0)
(s698 4.0)
(s699 5.0)
(s700 5.0)
(s701 timeout
2.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20242ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20251ms
[2024-06-01 05:27:49] [INFO ] Invariant cache hit.
[2024-06-01 05:27:49] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-01 05:27:49] [INFO ] Invariant cache hit.
[2024-06-01 05:27:49] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 05:27:49] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2024-06-01 05:27:49] [INFO ] Redundant transitions in 19 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-06-01 05:27:49] [INFO ] Invariant cache hit.
[2024-06-01 05:27:49] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 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 Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60280ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60289ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 81257 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 87 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLCardinality-10
Product exploration timeout after 95650 steps with 0 reset in 10001 ms.
Product exploration timeout after 91250 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 99 ms. Reduced automaton from 2 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40126 steps (8 resets) in 429 ms. (93 steps per ms) remains 10/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 510 ms. (78 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 648 ms. (61 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 459 ms. (86 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 402 ms. (99 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 439 ms. (90 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 459 ms. (86 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 400 ms. (99 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 403 ms. (99 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 405 ms. (98 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 432 ms. (92 steps per ms) remains 10/10 properties
[2024-06-01 05:29:13] [INFO ] Invariant cache hit.
[2024-06-01 05:29:13] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 32/52 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/2601 variables, and 28 constraints, problems are : Problem set: 0 solved, 10 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 4/200 constraints, State Equation: 20/1000 constraints, ReadFeed: 4/200 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 05:29:13] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
[2024-06-01 05:29:13] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/2601 variables, and 40 constraints, problems are : Problem set: 0 solved, 10 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 4/200 constraints, State Equation: 20/1000 constraints, ReadFeed: 4/200 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints]
After SMT, in 383ms problems are : Problem set: 0 solved, 10 unsolved
Finished Parikh walk after 6264 steps, including 7 resets, run visited all 10 properties in 94 ms. (steps per millisecond=66 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 97 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (AND p0 p2))), (F (NOT p1)), (F (NOT (OR p0 (NOT p2)))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 27 factoid took 570 ms. Reduced automaton from 2 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 97 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 39 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-06-01 05:29:14] [INFO ] Invariant cache hit.
[2024-06-01 05:29:14] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20266ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20276ms
[2024-06-01 05:29:35] [INFO ] Invariant cache hit.
[2024-06-01 05:29:35] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-06-01 05:29:35] [INFO ] Invariant cache hit.
[2024-06-01 05:29:35] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 05:29:35] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
[2024-06-01 05:29:35] [INFO ] Redundant transitions in 18 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-06-01 05:29:35] [INFO ] Invariant cache hit.
[2024-06-01 05:29:35] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 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 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60306ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60315ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 81332 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 97 ms. Reduced automaton from 2 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40279 steps (8 resets) in 442 ms. (90 steps per ms) remains 10/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 569 ms. (70 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 478 ms. (83 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 482 ms. (82 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 446 ms. (89 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 487 ms. (81 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 461 ms. (86 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 462 ms. (86 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 478 ms. (83 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 462 ms. (86 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 481 ms. (82 steps per ms) remains 10/10 properties
[2024-06-01 05:30:39] [INFO ] Invariant cache hit.
[2024-06-01 05:30:39] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 32/52 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/2601 variables, and 28 constraints, problems are : Problem set: 0 solved, 10 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 4/200 constraints, State Equation: 20/1000 constraints, ReadFeed: 4/200 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 05:30:39] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 05:30:39] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 32/52 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/52 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/2601 variables, and 40 constraints, problems are : Problem set: 0 solved, 10 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 4/200 constraints, State Equation: 20/1000 constraints, ReadFeed: 4/200 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints]
After SMT, in 361ms problems are : Problem set: 0 solved, 10 unsolved
Finished Parikh walk after 13446 steps, including 16 resets, run visited all 10 properties in 171 ms. (steps per millisecond=78 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 174 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p2))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (AND p0 p2))), (F (NOT p1)), (F (NOT (OR p0 (NOT p2)))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 27 factoid took 438 ms. Reduced automaton from 2 states, 10 edges and 3 AP (stutter insensitive) to 2 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 72 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 77 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration timeout after 89920 steps with 0 reset in 10001 ms.
Product exploration timeout after 86200 steps with 0 reset in 10001 ms.
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 34 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-06-01 05:31:00] [INFO ] Invariant cache hit.
[2024-06-01 05:31:00] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20234ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20243ms
[2024-06-01 05:31:21] [INFO ] Invariant cache hit.
[2024-06-01 05:31:21] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-06-01 05:31:21] [INFO ] Invariant cache hit.
[2024-06-01 05:31:21] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 05:31:21] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
[2024-06-01 05:31:21] [INFO ] Redundant transitions in 18 ms returned []
Running 1200 sub problems to find dead transitions.
[2024-06-01 05:31:21] [INFO ] Invariant cache hit.
[2024-06-01 05:31:21] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60265ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60274ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 81239 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Treatment of property JoinFreeModules-PT-0200-LTLCardinality-10 finished in 293331 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((X((p0&&X(p1)))||(p0 U (p2||G(p0)))))))'
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 18 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-06-01 05:32:22] [INFO ] Invariant cache hit.
[2024-06-01 05:32:22] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20236ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20245ms
[2024-06-01 05:32:42] [INFO ] Invariant cache hit.
[2024-06-01 05:32:42] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-06-01 05:32:42] [INFO ] Invariant cache hit.
[2024-06-01 05:32:43] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 05:32:43] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-06-01 05:32:43] [INFO ] Invariant cache hit.
[2024-06-01 05:32:43] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 192)
(s1 2)
(s2 0)
(s3 4)
(s4 5)
(s5 5)
(s6 2)
(s7 0)
(s8 191)
(s9 5)
(s10 5)
(s11 189)
(s12 0)
(s13 4)
(s14 5)
(s15 192)
(s16 2)
(s17 0)
(s18 4)
(s19 5)
(s20 5)
(s21 2)
(s22 0)
(s23 191)
(s24 5)
(s25 192)
(s26 2)
(s27 0)
(s28 4)
(s29 5)
(s30 5)
(s31 2)
(s32 187)
(s33 4)
(s34 5)
(s35 192)
(s36 2)
(s37 0)
(s38 4)
(s39 5)
(s40 5)
(s41 189)
(s42 0)
(s43 4)
(s44 5)
(s45 5)
(s46 2)
(s47 187)
(s48 4)
(s49 5)
(s50 5)
(s51 2)
(s52 0)
(s53 4)
(s54 192)
(s55 5)
(s56 2)
(s57 0)
(s58 4)
(s59 192)
(s60 192)
(s61 2)
(s62 0)
(s63 4)
(s64 5)
(s65 5)
(s66 2)
(s67 187)
(s68 4)
(s69 5)
(s70 5)
(s71 189)
(s72 0)
(s73 4)
(s74 5)
(s75 192)
(s76 2)
(s77 0)
(s78 4)
(s79 5)
(s80 5)
(s81 2)
(s82 0)
(s83 191)
(s84 5)
(s85 5)
(s86 189)
(s87 0)
(s88 4)
(s89 5)
(s90 5)
(s91 2)
(s92 0)
(s93 191)
(s94 5)
(s95 5)
(s96 2)
(s97 0)
(s98 191)
(s99 5)
(s100 5)
(s101 189)
(s102 0)
(s103 4)
(s104 5)
(s105 5)
(s106 189)
(s107 0)
(s108 4)
(s109 5)
(s110 192)
(s111 2)
(s112 0)
(s113 4)
(s114 5)
(s115 5)
(s116 2)
(s117 0)
(s118 4)
(s119 192)
(s120 5)
(s121 2)
(s122 187)
(s123 4)
(s124 5)
(s125 5)
(s126 2)
(s127 0)
(s128 4)
(s129 192)
(s130 5)
(s131 2)
(s132 187)
(s133 4)
(s134 5)
(s135 5)
(s136 2)
(s137 187)
(s138 4)
(s139 5)
(s140 5)
(s141 189)
(s142 0)
(s143 4)
(s144 5)
(s145 5)
(s146 2)
(s147 187)
(s148 4)
(s149 5)
(s150 5)
(s151 2)
(s152 187)
(s153 4)
(s154 5)
(s155 192)
(s156 2)
(s157 0)
(s158 4)
(s159 5)
(s160 192)
(s161 2)
(s162 0)
(s163 4)
(s164 5)
(s165 5)
(s166 2)
(s167 187)
(s168 4)
(s169 5)
(s170 5)
(s171 2)
(s172 0)
(s173 191)
(s174 5)
(s175 5)
(s176 2)
(s177 0)
(s178 4)
(s179 192)
(s180 5)
(s181 2)
(s182 187)
(s183 4)
(s184 5)
(s185 5)
(s186 2)
(s187 187)
(s188 4)
(s189 5)
(s190 5)
(s191 2)
(s192 0)
(s193 4)
(s194 192)
(s195 5)
(s196 2)
(s197 0)
(s198 4)
(s199 192)
(s200 192)
(s201 2)
(s202 0)
(s203 4)
(s204 5)
(s205 5)
(s206 189)
(s207 0)
(s208 4)
(s209 5)
(s210 5)
(s211 2)
(s212 0)
(s213 4)
(s214 192)
(s215 5)
(s216 2)
(s217 187)
(s218 4)
(s219 5)
(s220 5)
(s221 189)
(s222 0)
(s223 4)
(s224 5)
(s225 5)
(s226 189)
(s227 0)
(s228 4)
(s229 5)
(s230 5)
(s231 189)
(s232 0)
(s233 4)
(s234 5)
(s235 5)
(s236 189)
(s237 0)
(s238 4)
(s239 5)
(s240 5)
(s241 2)
(s242 187)
(s243 4)
(s244 5)
(s245 5)
(s246 189)
(s247 0)
(s248 4)
(s249 5)
(s250 5)
(s251 2)
(s252 187)
(s253 4)
(s254 5)
(s255 5)
(s256 2)
(s257 0)
(s258 4)
(s259 192)
(s260 5)
(s261 2)
(s262 187)
(s263 4)
(s264 5)
(s265 5)
(s266 2)
(s267 0)
(s268 191)
(s269 5)
(s270 192)
(s271 2)
(s272 0)
(s273 4)
(s274 5)
(s275 5)
(s276 2)
(s277 187)
(s278 4)
(s279 5)
(s280 192)
(s281 2)
(s282 0)
(s283 4)
(s284 5)
(s285 5)
(s286 2)
(s287 187)
(s288 4)
(s289 5)
(s290 5)
(s291 189)
(s292 0)
(s293 4)
(s294 5)
(s295 5)
(s296 2)
(s297 187)
(s298 4)
(s299 5)
(s300 5)
(s301 189)
(s302 0)
(s303 4)
(s304 5)
(s305 5)
(s306 2)
(s307 187)
(s308 4)
(s309 5)
(s310 5)
(s311 2)
(s312 0)
(s313 191)
(s314 5)
(s315 5)
(s316 189)
(s317 0)
(s318 4)
(s319 5)
(s320 5)
(s321 2)
(s322 0)
(s323 4)
(s324 192)
(s325 5)
(s326 2)
(s327 0)
(s328 191)
(s329 5)
(s330 5)
(s331 2)
(s332 187)
(s333 4)
(s334 5)
(s335 5)
(s336 2)
(s337 187)
(s338 4)
(s339 5)
(s340 192)
(s341 2)
(s342 0)
(s343 4)
(s344 5)
(s345 5)
(s346 2)
(s347 0)
(s348 4)
(s349 192)
(s350 192)
(s351 2)
(s352 0)
(s353 4)
(s354 5)
(s355 192)
(s356 2)
(s357 0)
(s358 4)
(s359 5)
(s360 192)
(s361 2)
(s362 0)
(s363 4)
(s364 5)
(s365 5)
(s366 2)
(s367 0)
(s368 191)
(s369 5)
(s370 5)
(s371 189)
(s372 0)
(s373 4)
(s374 5)
(s375 5)
(s376 2)
(s377 0)
(s378 191)
(s379 5)
(s380 5)
(s381 2)
(s382 187)
(s383 4)
(s384 5)
(s385 5)
(s386 189)
(s387 0)
(s388 4)
(s389 5)
(s390 5)
(s391 2)
(s392 0)
(s393 4)
(s394 192)
(s395 5)
(s396 189)
(s397 0)
(s398 4)
(s399 5)
(s400 5)
(s401 2)
(s402 187)
(s403 4)
(s404 5)
(s405 5)
(s406 2)
(s407 187)
(s408 4)
(s409 5)
(s410 192)
(s411 2)
(s412 0)
(s413 4)
(s414 5)
(s415 5)
(s416 189)
(s417 0)
(s418 4)
(s419 5)
(s420 5)
(s421 2)
(s422 0)
(s423 4)
(s424 192)
(s425 5)
(s426 189)
(s427 0)
(s428 4)
(s429 5)
(s430 5)
(s431 2)
(s432 0)
(s433 4)
(s434 192)
(s435 5)
(s436 2)
(s437 0)
(s438 4)
(s439 192)
(s440 5)
(s441 189)
(s442 0)
(s443 4)
(s444 5)
(s445 5)
(s446 189)
(s447 0)
(s448 4)
(s449 5)
(s450 192)
(s451 2)
(s452 0)
(s453 4)
(s454 5)
(s455 5)
(s456 2)
(s457 0)
(s458 4)
(s459 192)
(s460 5)
(s461 2)
(s462 187)
(s463 4)
(s464 5)
(s465 5)
(s466 2)
(s467 0)
(s468 4)
(s469 192)
(s470 5)
(s471 2)
(s472 187)
(s473 4)
(s474 5)
(s475 5)
(s476 2)
(s477 0)
(s478 191)
(s479 5)
(s480 5)
(s481 189)
(s482 0)
(s483 4)
(s484 5)
(s485 5)
(s486 2)
(s487 0)
(s488 4)
(s489 192)
(s490 192)
(s491 2)
(s492 0)
(s493 4)
(s494 5)
(s495 5)
(s496 189)
(s497 0)
(s498 4)
(s499 5)
(s500 5)
(s501 2)
(s502 0)
(s503 4)
(s504 192)
(s505 5)
(s506 2)
(s507 187)
(s508 4)
(s509 5)
(s510 192)
(s511 2)
(s512 0)
(s513 4)
(s514 5)
(s515 5)
(s516 2)
(s517 0)
(s518 191)
(s519 5)
(s520 5)
(s521 2)
(s522 0)
(s523 191)
(s524 5)
(s525 5)
(s526 2)
(s527 0)
(s528 191)
(s529 5)
(s530 5)
(s531 2)
(s532 0)
(s533 191)
(s534 5)
(s535 5)
(s536 2)
(s537 0)
(s538 191)
(s539 5)
(s540 5)
(s541 189)
(s542 0)
(s543 4)
(s544 5)
(s545 5)
(s546 2)
(s547 187)
(s548 4)
(s549 5)
(s550 5)
(s551 2)
(s552 0)
(s553 191)
(s554 5)
(s555 5)
(s556 2)
(s557 187)
(s558 4)
(s559 5)
(s560 5)
(s561 2)
(s562 0)
(s563 191)
(s564 5)
(s565 5)
(s566 2)
(s567 0)
(s568 191)
(s569 5)
(s570 192)
(s571 2)
(s572 0)
(s573 4)
(s574 5)
(s575 5)
(s576 2)
(s577 0)
(s578 191)
(s579 5)
(s580 5)
(s581 189)
(s582 0)
(s583 4)
(s584 5)
(s585 5)
(s586 189)
(s587 0)
(s588 4)
(s589 5)
(s590 5)
(s591 2)
(s592 187)
(s593 4)
(s594 5)
(s595 192)
(s596 2)
(s597 0)
(s598 4)
(s599 5)
(s600 192)
(s601 2)
(s602 0)
(s603 4)
(s604 5)
(s605 5)
(s606 2)
(s607 0)
(s608 4)
(s609 192)
(s610 5)
(s611 2)
(s612 187)
(s613 4)
(s614 5)
(s615 5)
(s616 189)
(s617 0)
(s618 4)
(s619 5)
(s620 5)
(s621 2)
(s622 187)
(s623 4)
(s624 5)
(s625 5)
(s626 2)
(s627 187)
(s628 4)
(s629 5)
(s630 5)
(s631 2)
(s632 187)
(s633 4)
(s634 5)
(s635 5)
(s636 2)
(s637 187)
(s638 4)
(s639 5)
(s640 5)
(s641 2)
(s642 0)
(s643 4)
(s644 192)
(s645 5)
(s646 2)
(s647 0)
(s648 191)
(s649 5)
(s650 5)
(s651 2)
(s652 0)
(s653 191)
(s654 5)
(s655 5)
(s656 2)
(s657 0)
(s658 4)
(s659 192)
(s660 5)
(s661 2)
(s662 0)
(s663 191)
(s664 5)
(s665 5)
(s666 2)
(s667 0)
(s668 4)
(s669 192)
(s670 5)
(s671 2)
(s672 187)
(s673 4)
(s674 5)
(s675 5)
(s676 2)
(s677 0)
(s678 191)
(s679 5)
(s680 5)
(s681 2)
(s682 0)
(s683 191)
(s684 5)
(s685 5)
(s686 2)
(s687 0)
(s688 4)
(s689 192)
(s690 5)
(s691 2)
(s692 187)
(s693 4)
(s694 5)
(s695 5)
(s696 189)
(s697 0)
(s698 4)
(s699 5)
(s700 192)
(s701 2)
(s702 0)
(s703 4)
(s704 5)
(s705 5)
(s706 2)
(s707 187)
(s708 4)
(s709 5)
(s710 5)
(s711 2)
(s712 0)
(s713 4)
(s714 192)
(s715 5)
(s716 189)
(s717 0)
(s718 4)
(s719 5)
(s720 5)
(s721 189)
(s722 0)
(s723 4)
(s724 5)
(s725 5)
(s726 2)
(s727 187)
(s728 4)
(s729 5)
(s730 192)
(s731 2)
(s732 0)
(s733 4)
(s734 5)
(s735 5)
(s736 2)
(s737 0)
(s738 191)
(s739 5)
(s740 5)
(s741 2)
(s742 0)
(s743 191)
(s744 5)
(s745 192)
(s746 2)
(s747 0)
(s748 4)
(s749 5)
(s750 5)
(s751 2)
(s752 0)
(s753 4)
(s754 192)
(s755 5)
(s756 189)
(s757 0)
(s758 4)
(s759 5)
(s760 192)
(s761 2)
(s762 0)
(s763 4)
(s764 5)
(s765 5)
(s766 2)
(s767 0)
(s768 191)
(s769 5)
(s770 5)
(s771 2)
(s772 187)
(s773 4)
(s774 5)
(s775 5)
(s776 2)
(s777 187)
(s778 4)
(s779 5)
(s780 5)
(s781 2)
(s782 187)
(s783 4)
(s784 5)
(s785 5)
(s786 2)
(s787 0)
(s788 4)
(s789 192)
(s790 5)
(s791 189)
(s792 0)
(s793 4)
(s794 5)
(s795 5)
(s796 2)
(s797 0)
(s798 4)
(s799 192)
(s800 5)
(s801 189)
(s802 0)
(s803 4)
(s804 5)
(s805 5)
(s806 189)
(s807 0)
(s808 4)
(s809 5)
(s810 5)
(s811 2)
(s812 0)
(s813 4)
(s814 192)
(s815 192)
(s816 2)
(s817 0)
(s818 4)
(s819 5)
(s820 192)
(s821 2)
(s822 0)
(s823 4)
(s824 5)
(s825 5)
(s826 189)
(s827 0)
(s828 4)
(s829 5)
(s830 5)
(s831 189)
(s832 0)
(s833 4)
(s834 5)
(s835 5)
(s836 2)
(s837 0)
(s838 4)
(s839 192)
(s840 192)
(s841 2)
(s842 0)
(s843 4)
(s844 5)
(s845 5)
(s846 2)
(s847 0)
(s848 4)
(s849 192)
(s850 5)
(s851 2)
(s852 0)
(s853 4)
(s854 192)
(s855 5)
(s856 2)
(s857 187)
(s858 4)
(s859 5)
(s860 5)
(s861 189)
(s862 0)
(s863 4)
(s864 5)
(s865 5)
(s866 189)
(s867 0)
(s868 4)
(s869 5)
(s870 192)
(s871 2)
(s872 0)
(s873 4)
(s874 5)
(s875 5)
(s876 189)
(s877 0)
(s878 4)
(s879 5)
(s880 5)
(s881 2)
(s882 0)
(s883 4)
(s884 192)
(s885 5)
(s886 189)
(s887 0)
(s888 4)
(s889 5)
(s890 5)
(s891 2)
(s892 0)
(s893 4)
(s894 192)
(s895 5)
(s896 2)
(s897 0)
(s898 4)
(s899 192)
(s900 5)
(s901 189)
(s902 0)
(s903 4)
(s904 5)
(s905 192)
(s906 2)
(s907 0)
(s908 4)
(s909 5)
(s910 5)
(s911 2)
(s912 0)
(s913 4)
(s914 192)
(s915 5)
(s916 189)
(s917 0)
(s918 4)
(s919 5)
(s920 192)
(s921 2)
(s922 0)
(s923 4)
(s924 5)
(s925 5)
(s926 2)
(s927 0)
(s928 191)
(s929 5)
(s930 5)
(s931 189)
(s932 0)
(s933 4)
(s934 timeout
5)
(s935 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60263ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60273ms
Finished structural reductions in LTL mode , in 1 iterations and 81199 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLCardinality-13
Product exploration timeout after 90530 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 2539 steps with 0 reset with depth 2540 and stack size 2540 in 181 ms.
FORMULA JoinFreeModules-PT-0200-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0200-LTLCardinality-13 finished in 91612 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&X(p1)) U G(!p0)))'
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Applied a total of 0 rules in 16 ms. Remains 1000 /1000 variables (removed 0) and now considering 1601/1601 (removed 0) transitions.
Running 1200 sub problems to find dead transitions.
[2024-06-01 05:33:53] [INFO ] Invariant cache hit.
[2024-06-01 05:33:53] [INFO ] State equation strengthened by 200 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
SMT process timed out in 20228ms, After SMT, problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 20237ms
[2024-06-01 05:34:14] [INFO ] Invariant cache hit.
[2024-06-01 05:34:14] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-06-01 05:34:14] [INFO ] Invariant cache hit.
[2024-06-01 05:34:14] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-06-01 05:34:14] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
Running 1200 sub problems to find dead transitions.
[2024-06-01 05:34:14] [INFO ] Invariant cache hit.
[2024-06-01 05:34:14] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (OVERLAPS) 200/1000 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1000/2601 variables, and 200 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 0/1000 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 0/0 constraints]
After SMT, in 60263ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 60276ms
Finished structural reductions in LTL mode , in 1 iterations and 81252 ms. Remains : 1000/1000 places, 1601/1601 transitions.
Stuttering acceptance computed with spot in 136 ms :[p0, true, p0, (OR (NOT p1) p0)]
Running random walk in product with property : JoinFreeModules-PT-0200-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1597 steps with 0 reset in 98 ms.
FORMULA JoinFreeModules-PT-0200-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0200-LTLCardinality-14 finished in 81508 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)||(p1&&X(G(p2))))))'
[2024-06-01 05:35:15] [INFO ] Flatten gal took : 53 ms
[2024-06-01 05:35:15] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 108 ms.
[2024-06-01 05:35:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1000 places, 1601 transitions and 4600 arcs took 25 ms.
Total runtime 1238524 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : JoinFreeModules-PT-0200-LTLCardinality-10
BK_STOP 1717220127460
--------------------
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 JoinFreeModules-PT-0200-LTLCardinality-10
ltl formula formula --ltl=/tmp/1163/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, 1601 transitions and 4600 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.280 real 0.040 user 0.100 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1163/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1163/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1163/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1163/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 1801 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 1625 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): ~2500 levels ~10000 states ~8007712 transitions
pnml2lts-mc( 2/ 4): ~5000 levels ~20000 states ~16034072 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 20500
pnml2lts-mc( 0/ 4): unique transitions count: 16519977
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 4362
pnml2lts-mc( 0/ 4): - claim success count: 20503
pnml2lts-mc( 0/ 4): - cum. max stack depth: 20503
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 20503 states 16520314 transitions, fanout: 805.751
pnml2lts-mc( 0/ 4): Total exploration time 10.390 sec (7.560 sec minimum, 9.033 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1973, Transitions per second: 1590020
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 127.0MB, 16.1 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 24.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 1631 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 127.0MB (~256.0MB paged-in)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="JoinFreeModules-PT-0200"
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 JoinFreeModules-PT-0200, 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 r504-tall-171649612000059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0200.tgz
mv JoinFreeModules-PT-0200 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 '
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 ;