MCC'2024- Execution of r290-tajo-171654447000388

About the Execution of ITS-Tools for PolyORBNT-COL-S05J60

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
8877.247	3600000.00	7742751.00	879.20	?FFFFF?FFFF?FFFT	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r290-tajo-171654447000388.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is PolyORBNT-COL-S05J60, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r290-tajo-171654447000388
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.7K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 09:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 09:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 10:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 10:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 94K May 18 16:43 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 PolyORBNT-COL-S05J60-LTLFireability-00
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-01
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-02
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-03
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-04
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-05
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-06
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-07
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-08
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-09
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-10
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-11
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-12
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-13
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-14
FORMULA_NAME PolyORBNT-COL-S05J60-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716925457745

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J60
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-28 19:44:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 19:44:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 19:44:20] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 19:44:21] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 19:44:21] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1079 ms
[2024-05-28 19:44:21] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 969 PT places and 2152.0 transition bindings in 62 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 19:44:22] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 7 ms.
[2024-05-28 19:44:22] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 5 formulas.
FORMULA PolyORBNT-COL-S05J60-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-COL-S05J60-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 19 to 17
RANDOM walk for 40006 steps (3200 resets) in 2293 ms. (17 steps per ms) remains 7/17 properties
BEST_FIRST walk for 8302 steps (198 resets) in 89 ms. (92 steps per ms) remains 0/7 properties
[2024-05-28 19:44:23] [INFO ] Flatten gal took : 50 ms
[2024-05-28 19:44:23] [INFO ] Flatten gal took : 4 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 19:44:23] [INFO ] Unfolded HLPN to a Petri net with 969 places and 2030 transitions 12704 arcs in 191 ms.
[2024-05-28 19:44:23] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Deduced a syphon composed of 60 places in 22 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Support contains 636 out of 909 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 904 transition count 1315
Applied a total of 5 rules in 96 ms. Remains 904 /909 variables (removed 5) and now considering 1315/1315 (removed 0) transitions.
Running 1309 sub problems to find dead transitions.
[2024-05-28 19:44:23] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 904 cols
[2024-05-28 19:44:23] [INFO ] Computed 137 invariants in 143 ms
[2024-05-28 19:44:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20133 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 898/2215 variables, and 131 constraints, problems are : Problem set: 0 solved, 1309 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 0/0 constraints]
After SMT, in 45271ms problems are : Problem set: 0 solved, 1309 unsolved
Search for dead transitions found 0 dead transitions in 45334ms
[2024-05-28 19:45:08] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-05-28 19:45:08] [INFO ] Invariant cache hit.
[2024-05-28 19:45:09] [INFO ] Implicit Places using invariants in 569 ms returned []
[2024-05-28 19:45:09] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-05-28 19:45:09] [INFO ] Invariant cache hit.
[2024-05-28 19:45:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:45:14] [INFO ] Implicit Places using invariants and state equation in 4540 ms returned []
Implicit Place search using SMT with State Equation took 5118 ms to find 0 implicit places.
Running 1309 sub problems to find dead transitions.
[2024-05-28 19:45:14] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
[2024-05-28 19:45:14] [INFO ] Invariant cache hit.
[2024-05-28 19:45:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1309 unsolved
Problem TDEAD439 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD475 is UNSAT
Problem TDEAD478 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD556 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/903 variables, 5/136 constraints. Problems are: Problem set: 78 solved, 1231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 903/2215 variables, and 136 constraints, problems are : Problem set: 78 solved, 1231 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1309/1309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 78 solved, 1231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 78 solved, 1231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 78 solved, 1231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 0/131 constraints. Problems are: Problem set: 78 solved, 1231 unsolved
At refinement iteration 3 (OVERLAPS) 5/903 variables, 5/136 constraints. Problems are: Problem set: 78 solved, 1231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 903/2215 variables, and 136 constraints, problems are : Problem set: 78 solved, 1231 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1309 constraints, Known Traps: 0/0 constraints]
After SMT, in 63671ms problems are : Problem set: 78 solved, 1231 unsolved
Search for dead transitions found 78 dead transitions in 63691ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) removed 78 transitions
Starting structural reductions in LTL mode, iteration 1 : 904/909 places, 1237/1315 transitions.
Applied a total of 0 rules in 11 ms. Remains 904 /904 variables (removed 0) and now considering 1237/1237 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114380 ms. Remains : 904/909 places, 1237/1315 transitions.
Support contains 636 out of 904 places after structural reductions.
[2024-05-28 19:46:18] [INFO ] Flatten gal took : 156 ms
[2024-05-28 19:46:18] [INFO ] Flatten gal took : 110 ms
[2024-05-28 19:46:18] [INFO ] Input system was already deterministic with 1237 transitions.
Reduction of identical properties reduced properties to check from 21 to 17
RANDOM walk for 34513 steps (2371 resets) in 882 ms. (39 steps per ms) remains 0/17 properties
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' '!(G(F(p0)))'
Support contains 63 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1237/1237 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 904 transition count 1171
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 838 transition count 1171
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 838 transition count 1106
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 773 transition count 1106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 772 transition count 1105
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 772 transition count 1105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 770 transition count 1103
Applied a total of 268 rules in 275 ms. Remains 770 /904 variables (removed 134) and now considering 1103/1237 (removed 134) transitions.
Running 1097 sub problems to find dead transitions.
[2024-05-28 19:46:19] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
// Phase 1: matrix 1099 rows 770 cols
[2024-05-28 19:46:19] [INFO ] Computed 137 invariants in 83 ms
[2024-05-28 19:46:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:46:33] [INFO ] Deduced a trap composed of 239 places in 431 ms of which 49 ms to minimize.
[2024-05-28 19:46:33] [INFO ] Deduced a trap composed of 233 places in 446 ms of which 7 ms to minimize.
[2024-05-28 19:46:34] [INFO ] Deduced a trap composed of 227 places in 332 ms of which 8 ms to minimize.
[2024-05-28 19:46:34] [INFO ] Deduced a trap composed of 236 places in 304 ms of which 4 ms to minimize.
[2024-05-28 19:46:35] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 4 ms to minimize.
[2024-05-28 19:46:35] [INFO ] Deduced a trap composed of 196 places in 360 ms of which 5 ms to minimize.
[2024-05-28 19:46:35] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2024-05-28 19:46:36] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 4 ms to minimize.
[2024-05-28 19:46:36] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
[2024-05-28 19:46:36] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 4 ms to minimize.
[2024-05-28 19:46:36] [INFO ] Deduced a trap composed of 196 places in 255 ms of which 4 ms to minimize.
[2024-05-28 19:46:37] [INFO ] Deduced a trap composed of 196 places in 313 ms of which 4 ms to minimize.
[2024-05-28 19:46:37] [INFO ] Deduced a trap composed of 196 places in 282 ms of which 4 ms to minimize.
[2024-05-28 19:46:37] [INFO ] Deduced a trap composed of 196 places in 278 ms of which 4 ms to minimize.
[2024-05-28 19:46:38] [INFO ] Deduced a trap composed of 196 places in 321 ms of which 5 ms to minimize.
[2024-05-28 19:46:38] [INFO ] Deduced a trap composed of 196 places in 296 ms of which 5 ms to minimize.
[2024-05-28 19:46:38] [INFO ] Deduced a trap composed of 196 places in 359 ms of which 6 ms to minimize.
[2024-05-28 19:46:39] [INFO ] Deduced a trap composed of 196 places in 289 ms of which 3 ms to minimize.
[2024-05-28 19:46:39] [INFO ] Deduced a trap composed of 196 places in 345 ms of which 5 ms to minimize.
[2024-05-28 19:46:39] [INFO ] Deduced a trap composed of 196 places in 294 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:46:40] [INFO ] Deduced a trap composed of 196 places in 345 ms of which 5 ms to minimize.
[2024-05-28 19:46:41] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 5 ms to minimize.
[2024-05-28 19:46:41] [INFO ] Deduced a trap composed of 196 places in 281 ms of which 4 ms to minimize.
[2024-05-28 19:46:41] [INFO ] Deduced a trap composed of 196 places in 337 ms of which 5 ms to minimize.
[2024-05-28 19:46:42] [INFO ] Deduced a trap composed of 196 places in 347 ms of which 5 ms to minimize.
[2024-05-28 19:46:42] [INFO ] Deduced a trap composed of 196 places in 339 ms of which 6 ms to minimize.
SMT process timed out in 23273ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 23289ms
[2024-05-28 19:46:42] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:46:42] [INFO ] Invariant cache hit.
[2024-05-28 19:46:43] [INFO ] Implicit Places using invariants in 952 ms returned []
[2024-05-28 19:46:43] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:46:43] [INFO ] Invariant cache hit.
[2024-05-28 19:46:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:46:49] [INFO ] Implicit Places using invariants and state equation in 5667 ms returned []
Implicit Place search using SMT with State Equation took 6624 ms to find 0 implicit places.
[2024-05-28 19:46:49] [INFO ] Redundant transitions in 91 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-05-28 19:46:49] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:46:49] [INFO ] Invariant cache hit.
[2024-05-28 19:46:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:47:04] [INFO ] Deduced a trap composed of 245 places in 319 ms of which 6 ms to minimize.
[2024-05-28 19:47:04] [INFO ] Deduced a trap composed of 196 places in 339 ms of which 5 ms to minimize.
[2024-05-28 19:47:05] [INFO ] Deduced a trap composed of 233 places in 342 ms of which 6 ms to minimize.
[2024-05-28 19:47:05] [INFO ] Deduced a trap composed of 196 places in 327 ms of which 5 ms to minimize.
[2024-05-28 19:47:05] [INFO ] Deduced a trap composed of 230 places in 280 ms of which 5 ms to minimize.
[2024-05-28 19:47:06] [INFO ] Deduced a trap composed of 196 places in 290 ms of which 4 ms to minimize.
[2024-05-28 19:47:06] [INFO ] Deduced a trap composed of 196 places in 367 ms of which 8 ms to minimize.
[2024-05-28 19:47:07] [INFO ] Deduced a trap composed of 245 places in 357 ms of which 5 ms to minimize.
[2024-05-28 19:47:07] [INFO ] Deduced a trap composed of 196 places in 320 ms of which 5 ms to minimize.
[2024-05-28 19:47:07] [INFO ] Deduced a trap composed of 196 places in 296 ms of which 5 ms to minimize.
[2024-05-28 19:47:08] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
[2024-05-28 19:47:08] [INFO ] Deduced a trap composed of 196 places in 317 ms of which 6 ms to minimize.
[2024-05-28 19:47:08] [INFO ] Deduced a trap composed of 196 places in 340 ms of which 9 ms to minimize.
[2024-05-28 19:47:09] [INFO ] Deduced a trap composed of 254 places in 313 ms of which 5 ms to minimize.
[2024-05-28 19:47:09] [INFO ] Deduced a trap composed of 196 places in 318 ms of which 5 ms to minimize.
[2024-05-28 19:47:09] [INFO ] Deduced a trap composed of 196 places in 316 ms of which 8 ms to minimize.
[2024-05-28 19:47:10] [INFO ] Deduced a trap composed of 242 places in 310 ms of which 5 ms to minimize.
[2024-05-28 19:47:10] [INFO ] Deduced a trap composed of 196 places in 317 ms of which 5 ms to minimize.
[2024-05-28 19:47:10] [INFO ] Deduced a trap composed of 196 places in 305 ms of which 5 ms to minimize.
[2024-05-28 19:47:11] [INFO ] Deduced a trap composed of 242 places in 387 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:47:12] [INFO ] Deduced a trap composed of 254 places in 288 ms of which 5 ms to minimize.
[2024-05-28 19:47:12] [INFO ] Deduced a trap composed of 245 places in 348 ms of which 4 ms to minimize.
[2024-05-28 19:47:12] [INFO ] Deduced a trap composed of 248 places in 382 ms of which 6 ms to minimize.
[2024-05-28 19:47:13] [INFO ] Deduced a trap composed of 196 places in 381 ms of which 6 ms to minimize.
[2024-05-28 19:47:13] [INFO ] Deduced a trap composed of 251 places in 372 ms of which 9 ms to minimize.
[2024-05-28 19:47:14] [INFO ] Deduced a trap composed of 196 places in 380 ms of which 6 ms to minimize.
[2024-05-28 19:47:14] [INFO ] Deduced a trap composed of 233 places in 338 ms of which 5 ms to minimize.
[2024-05-28 19:47:15] [INFO ] Deduced a trap composed of 236 places in 359 ms of which 5 ms to minimize.
[2024-05-28 19:47:15] [INFO ] Deduced a trap composed of 196 places in 361 ms of which 5 ms to minimize.
[2024-05-28 19:47:15] [INFO ] Deduced a trap composed of 230 places in 330 ms of which 6 ms to minimize.
[2024-05-28 19:47:16] [INFO ] Deduced a trap composed of 260 places in 336 ms of which 6 ms to minimize.
[2024-05-28 19:47:16] [INFO ] Deduced a trap composed of 236 places in 339 ms of which 5 ms to minimize.
[2024-05-28 19:47:16] [INFO ] Deduced a trap composed of 196 places in 287 ms of which 4 ms to minimize.
[2024-05-28 19:47:17] [INFO ] Deduced a trap composed of 196 places in 339 ms of which 5 ms to minimize.
[2024-05-28 19:47:17] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 5 ms to minimize.
[2024-05-28 19:47:17] [INFO ] Deduced a trap composed of 196 places in 314 ms of which 5 ms to minimize.
[2024-05-28 19:47:18] [INFO ] Deduced a trap composed of 196 places in 313 ms of which 5 ms to minimize.
[2024-05-28 19:47:18] [INFO ] Deduced a trap composed of 196 places in 284 ms of which 5 ms to minimize.
[2024-05-28 19:47:18] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 4 ms to minimize.
[2024-05-28 19:47:19] [INFO ] Deduced a trap composed of 196 places in 339 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:47:27] [INFO ] Deduced a trap composed of 200 places in 386 ms of which 6 ms to minimize.
[2024-05-28 19:47:27] [INFO ] Deduced a trap composed of 196 places in 360 ms of which 7 ms to minimize.
[2024-05-28 19:47:28] [INFO ] Deduced a trap composed of 196 places in 314 ms of which 5 ms to minimize.
[2024-05-28 19:47:28] [INFO ] Deduced a trap composed of 196 places in 319 ms of which 5 ms to minimize.
[2024-05-28 19:47:28] [INFO ] Deduced a trap composed of 200 places in 409 ms of which 5 ms to minimize.
[2024-05-28 19:47:29] [INFO ] Deduced a trap composed of 196 places in 350 ms of which 6 ms to minimize.
[2024-05-28 19:47:29] [INFO ] Deduced a trap composed of 200 places in 331 ms of which 5 ms to minimize.
[2024-05-28 19:47:30] [INFO ] Deduced a trap composed of 196 places in 350 ms of which 5 ms to minimize.
[2024-05-28 19:47:30] [INFO ] Deduced a trap composed of 200 places in 327 ms of which 5 ms to minimize.
[2024-05-28 19:47:30] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 6 ms to minimize.
[2024-05-28 19:47:31] [INFO ] Deduced a trap composed of 196 places in 339 ms of which 5 ms to minimize.
[2024-05-28 19:47:31] [INFO ] Deduced a trap composed of 200 places in 348 ms of which 5 ms to minimize.
[2024-05-28 19:47:31] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 4 ms to minimize.
[2024-05-28 19:47:32] [INFO ] Deduced a trap composed of 196 places in 333 ms of which 6 ms to minimize.
[2024-05-28 19:47:32] [INFO ] Deduced a trap composed of 196 places in 329 ms of which 5 ms to minimize.
[2024-05-28 19:47:32] [INFO ] Deduced a trap composed of 196 places in 362 ms of which 5 ms to minimize.
[2024-05-28 19:47:33] [INFO ] Deduced a trap composed of 200 places in 325 ms of which 5 ms to minimize.
[2024-05-28 19:47:33] [INFO ] Deduced a trap composed of 196 places in 363 ms of which 6 ms to minimize.
[2024-05-28 19:47:34] [INFO ] Deduced a trap composed of 200 places in 377 ms of which 5 ms to minimize.
[2024-05-28 19:47:34] [INFO ] Deduced a trap composed of 196 places in 357 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:47:37] [INFO ] Deduced a trap composed of 249 places in 343 ms of which 5 ms to minimize.
[2024-05-28 19:47:37] [INFO ] Deduced a trap composed of 248 places in 310 ms of which 5 ms to minimize.
[2024-05-28 19:47:37] [INFO ] Deduced a trap composed of 237 places in 282 ms of which 4 ms to minimize.
[2024-05-28 19:47:38] [INFO ] Deduced a trap composed of 230 places in 365 ms of which 5 ms to minimize.
[2024-05-28 19:47:38] [INFO ] Deduced a trap composed of 248 places in 337 ms of which 5 ms to minimize.
[2024-05-28 19:47:39] [INFO ] Deduced a trap composed of 255 places in 349 ms of which 6 ms to minimize.
[2024-05-28 19:47:39] [INFO ] Deduced a trap composed of 237 places in 338 ms of which 5 ms to minimize.
[2024-05-28 19:47:39] [INFO ] Deduced a trap composed of 248 places in 330 ms of which 5 ms to minimize.
[2024-05-28 19:47:40] [INFO ] Deduced a trap composed of 242 places in 316 ms of which 4 ms to minimize.
[2024-05-28 19:47:40] [INFO ] Deduced a trap composed of 236 places in 342 ms of which 6 ms to minimize.
[2024-05-28 19:47:40] [INFO ] Deduced a trap composed of 254 places in 352 ms of which 6 ms to minimize.
[2024-05-28 19:47:41] [INFO ] Deduced a trap composed of 245 places in 337 ms of which 5 ms to minimize.
[2024-05-28 19:47:42] [INFO ] Deduced a trap composed of 196 places in 395 ms of which 6 ms to minimize.
[2024-05-28 19:47:42] [INFO ] Deduced a trap composed of 196 places in 358 ms of which 5 ms to minimize.
[2024-05-28 19:47:43] [INFO ] Deduced a trap composed of 216 places in 376 ms of which 6 ms to minimize.
[2024-05-28 19:47:43] [INFO ] Deduced a trap composed of 196 places in 279 ms of which 4 ms to minimize.
[2024-05-28 19:47:43] [INFO ] Deduced a trap composed of 196 places in 281 ms of which 4 ms to minimize.
[2024-05-28 19:47:44] [INFO ] Deduced a trap composed of 196 places in 355 ms of which 5 ms to minimize.
[2024-05-28 19:47:44] [INFO ] Deduced a trap composed of 261 places in 358 ms of which 5 ms to minimize.
[2024-05-28 19:47:44] [INFO ] Deduced a trap composed of 196 places in 355 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 212 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 80/80 constraints]
After SMT, in 62988ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 63006ms
Starting structural reductions in SI_LTL mode, iteration 1 : 770/904 places, 1103/1237 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93307 ms. Remains : 770/904 places, 1103/1237 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLFireability-00
Product exploration explored 100000 steps with 5586 reset in 925 ms.
Product exploration explored 100000 steps with 5607 reset in 1016 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 313 steps (16 resets) in 10 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 63 out of 770 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 44 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Running 1097 sub problems to find dead transitions.
[2024-05-28 19:47:55] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:47:55] [INFO ] Invariant cache hit.
[2024-05-28 19:47:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:48:08] [INFO ] Deduced a trap composed of 245 places in 320 ms of which 5 ms to minimize.
[2024-05-28 19:48:08] [INFO ] Deduced a trap composed of 196 places in 358 ms of which 5 ms to minimize.
[2024-05-28 19:48:09] [INFO ] Deduced a trap composed of 233 places in 351 ms of which 6 ms to minimize.
[2024-05-28 19:48:09] [INFO ] Deduced a trap composed of 196 places in 349 ms of which 5 ms to minimize.
[2024-05-28 19:48:10] [INFO ] Deduced a trap composed of 230 places in 297 ms of which 4 ms to minimize.
[2024-05-28 19:48:10] [INFO ] Deduced a trap composed of 196 places in 331 ms of which 6 ms to minimize.
[2024-05-28 19:48:10] [INFO ] Deduced a trap composed of 196 places in 282 ms of which 8 ms to minimize.
[2024-05-28 19:48:11] [INFO ] Deduced a trap composed of 245 places in 311 ms of which 6 ms to minimize.
[2024-05-28 19:48:11] [INFO ] Deduced a trap composed of 196 places in 318 ms of which 5 ms to minimize.
[2024-05-28 19:48:11] [INFO ] Deduced a trap composed of 196 places in 327 ms of which 6 ms to minimize.
[2024-05-28 19:48:12] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 5 ms to minimize.
[2024-05-28 19:48:12] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 4 ms to minimize.
[2024-05-28 19:48:12] [INFO ] Deduced a trap composed of 196 places in 311 ms of which 5 ms to minimize.
[2024-05-28 19:48:13] [INFO ] Deduced a trap composed of 254 places in 282 ms of which 4 ms to minimize.
[2024-05-28 19:48:13] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 4 ms to minimize.
[2024-05-28 19:48:13] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 3 ms to minimize.
[2024-05-28 19:48:14] [INFO ] Deduced a trap composed of 242 places in 275 ms of which 4 ms to minimize.
[2024-05-28 19:48:14] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 4 ms to minimize.
[2024-05-28 19:48:14] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 5 ms to minimize.
[2024-05-28 19:48:15] [INFO ] Deduced a trap composed of 242 places in 261 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:48:15] [INFO ] Deduced a trap composed of 254 places in 278 ms of which 4 ms to minimize.
[2024-05-28 19:48:16] [INFO ] Deduced a trap composed of 245 places in 281 ms of which 4 ms to minimize.
[2024-05-28 19:48:16] [INFO ] Deduced a trap composed of 248 places in 355 ms of which 15 ms to minimize.
[2024-05-28 19:48:17] [INFO ] Deduced a trap composed of 196 places in 358 ms of which 6 ms to minimize.
[2024-05-28 19:48:17] [INFO ] Deduced a trap composed of 251 places in 329 ms of which 5 ms to minimize.
[2024-05-28 19:48:18] [INFO ] Deduced a trap composed of 196 places in 334 ms of which 5 ms to minimize.
SMT process timed out in 22862ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 22876ms
[2024-05-28 19:48:18] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:48:18] [INFO ] Invariant cache hit.
[2024-05-28 19:48:18] [INFO ] Implicit Places using invariants in 867 ms returned []
[2024-05-28 19:48:18] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:48:18] [INFO ] Invariant cache hit.
[2024-05-28 19:48:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:48:25] [INFO ] Implicit Places using invariants and state equation in 6272 ms returned []
Implicit Place search using SMT with State Equation took 7145 ms to find 0 implicit places.
[2024-05-28 19:48:25] [INFO ] Redundant transitions in 71 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-05-28 19:48:25] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:48:25] [INFO ] Invariant cache hit.
[2024-05-28 19:48:25] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:48:38] [INFO ] Deduced a trap composed of 245 places in 296 ms of which 6 ms to minimize.
[2024-05-28 19:48:39] [INFO ] Deduced a trap composed of 196 places in 355 ms of which 4 ms to minimize.
[2024-05-28 19:48:39] [INFO ] Deduced a trap composed of 233 places in 279 ms of which 4 ms to minimize.
[2024-05-28 19:48:39] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 4 ms to minimize.
[2024-05-28 19:48:40] [INFO ] Deduced a trap composed of 230 places in 242 ms of which 3 ms to minimize.
[2024-05-28 19:48:40] [INFO ] Deduced a trap composed of 196 places in 304 ms of which 3 ms to minimize.
[2024-05-28 19:48:40] [INFO ] Deduced a trap composed of 196 places in 308 ms of which 4 ms to minimize.
[2024-05-28 19:48:41] [INFO ] Deduced a trap composed of 245 places in 246 ms of which 4 ms to minimize.
[2024-05-28 19:48:41] [INFO ] Deduced a trap composed of 196 places in 320 ms of which 5 ms to minimize.
[2024-05-28 19:48:41] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:48:42] [INFO ] Deduced a trap composed of 196 places in 324 ms of which 6 ms to minimize.
[2024-05-28 19:48:42] [INFO ] Deduced a trap composed of 196 places in 320 ms of which 5 ms to minimize.
[2024-05-28 19:48:42] [INFO ] Deduced a trap composed of 196 places in 321 ms of which 5 ms to minimize.
[2024-05-28 19:48:43] [INFO ] Deduced a trap composed of 254 places in 299 ms of which 5 ms to minimize.
[2024-05-28 19:48:43] [INFO ] Deduced a trap composed of 196 places in 310 ms of which 4 ms to minimize.
[2024-05-28 19:48:43] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-05-28 19:48:43] [INFO ] Deduced a trap composed of 242 places in 255 ms of which 4 ms to minimize.
[2024-05-28 19:48:44] [INFO ] Deduced a trap composed of 196 places in 286 ms of which 4 ms to minimize.
[2024-05-28 19:48:44] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:48:44] [INFO ] Deduced a trap composed of 242 places in 314 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:48:45] [INFO ] Deduced a trap composed of 254 places in 318 ms of which 6 ms to minimize.
[2024-05-28 19:48:45] [INFO ] Deduced a trap composed of 245 places in 296 ms of which 5 ms to minimize.
[2024-05-28 19:48:46] [INFO ] Deduced a trap composed of 248 places in 267 ms of which 4 ms to minimize.
[2024-05-28 19:48:46] [INFO ] Deduced a trap composed of 196 places in 348 ms of which 5 ms to minimize.
[2024-05-28 19:48:47] [INFO ] Deduced a trap composed of 251 places in 244 ms of which 4 ms to minimize.
[2024-05-28 19:48:47] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 5 ms to minimize.
[2024-05-28 19:48:47] [INFO ] Deduced a trap composed of 233 places in 282 ms of which 4 ms to minimize.
[2024-05-28 19:48:48] [INFO ] Deduced a trap composed of 236 places in 335 ms of which 4 ms to minimize.
[2024-05-28 19:48:48] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 4 ms to minimize.
[2024-05-28 19:48:48] [INFO ] Deduced a trap composed of 230 places in 247 ms of which 4 ms to minimize.
[2024-05-28 19:48:48] [INFO ] Deduced a trap composed of 260 places in 285 ms of which 4 ms to minimize.
[2024-05-28 19:48:49] [INFO ] Deduced a trap composed of 236 places in 265 ms of which 4 ms to minimize.
[2024-05-28 19:48:49] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 4 ms to minimize.
[2024-05-28 19:48:49] [INFO ] Deduced a trap composed of 196 places in 281 ms of which 4 ms to minimize.
[2024-05-28 19:48:50] [INFO ] Deduced a trap composed of 196 places in 360 ms of which 5 ms to minimize.
[2024-05-28 19:48:50] [INFO ] Deduced a trap composed of 196 places in 331 ms of which 6 ms to minimize.
[2024-05-28 19:48:50] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 3 ms to minimize.
[2024-05-28 19:48:51] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 4 ms to minimize.
[2024-05-28 19:48:51] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:48:51] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:49:03] [INFO ] Deduced a trap composed of 200 places in 329 ms of which 4 ms to minimize.
[2024-05-28 19:49:03] [INFO ] Deduced a trap composed of 196 places in 317 ms of which 5 ms to minimize.
[2024-05-28 19:49:04] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 5 ms to minimize.
[2024-05-28 19:49:04] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2024-05-28 19:49:04] [INFO ] Deduced a trap composed of 200 places in 261 ms of which 4 ms to minimize.
[2024-05-28 19:49:04] [INFO ] Deduced a trap composed of 196 places in 277 ms of which 4 ms to minimize.
[2024-05-28 19:49:05] [INFO ] Deduced a trap composed of 200 places in 284 ms of which 4 ms to minimize.
[2024-05-28 19:49:05] [INFO ] Deduced a trap composed of 196 places in 335 ms of which 4 ms to minimize.
[2024-05-28 19:49:05] [INFO ] Deduced a trap composed of 200 places in 279 ms of which 4 ms to minimize.
[2024-05-28 19:49:06] [INFO ] Deduced a trap composed of 196 places in 300 ms of which 4 ms to minimize.
[2024-05-28 19:49:06] [INFO ] Deduced a trap composed of 196 places in 329 ms of which 4 ms to minimize.
[2024-05-28 19:49:06] [INFO ] Deduced a trap composed of 200 places in 284 ms of which 4 ms to minimize.
[2024-05-28 19:49:07] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 4 ms to minimize.
[2024-05-28 19:49:07] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2024-05-28 19:49:07] [INFO ] Deduced a trap composed of 196 places in 310 ms of which 6 ms to minimize.
[2024-05-28 19:49:08] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
[2024-05-28 19:49:08] [INFO ] Deduced a trap composed of 200 places in 252 ms of which 3 ms to minimize.
[2024-05-28 19:49:08] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 3 ms to minimize.
[2024-05-28 19:49:08] [INFO ] Deduced a trap composed of 200 places in 254 ms of which 4 ms to minimize.
[2024-05-28 19:49:09] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:49:12] [INFO ] Deduced a trap composed of 249 places in 306 ms of which 5 ms to minimize.
[2024-05-28 19:49:12] [INFO ] Deduced a trap composed of 248 places in 282 ms of which 4 ms to minimize.
[2024-05-28 19:49:12] [INFO ] Deduced a trap composed of 237 places in 262 ms of which 4 ms to minimize.
[2024-05-28 19:49:13] [INFO ] Deduced a trap composed of 230 places in 248 ms of which 4 ms to minimize.
[2024-05-28 19:49:13] [INFO ] Deduced a trap composed of 248 places in 238 ms of which 4 ms to minimize.
[2024-05-28 19:49:13] [INFO ] Deduced a trap composed of 255 places in 311 ms of which 4 ms to minimize.
[2024-05-28 19:49:14] [INFO ] Deduced a trap composed of 237 places in 225 ms of which 4 ms to minimize.
[2024-05-28 19:49:14] [INFO ] Deduced a trap composed of 248 places in 243 ms of which 4 ms to minimize.
[2024-05-28 19:49:14] [INFO ] Deduced a trap composed of 242 places in 232 ms of which 4 ms to minimize.
[2024-05-28 19:49:14] [INFO ] Deduced a trap composed of 236 places in 260 ms of which 3 ms to minimize.
[2024-05-28 19:49:15] [INFO ] Deduced a trap composed of 254 places in 239 ms of which 24 ms to minimize.
[2024-05-28 19:49:15] [INFO ] Deduced a trap composed of 245 places in 258 ms of which 3 ms to minimize.
[2024-05-28 19:49:16] [INFO ] Deduced a trap composed of 196 places in 303 ms of which 3 ms to minimize.
[2024-05-28 19:49:16] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 4 ms to minimize.
[2024-05-28 19:49:16] [INFO ] Deduced a trap composed of 216 places in 241 ms of which 4 ms to minimize.
[2024-05-28 19:49:16] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2024-05-28 19:49:17] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 4 ms to minimize.
[2024-05-28 19:49:17] [INFO ] Deduced a trap composed of 196 places in 294 ms of which 4 ms to minimize.
[2024-05-28 19:49:17] [INFO ] Deduced a trap composed of 261 places in 274 ms of which 8 ms to minimize.
[2024-05-28 19:49:18] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 212 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 80/80 constraints]
After SMT, in 63178ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 63205ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 93361 ms. Remains : 770/770 places, 1103/1103 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 271 steps (13 resets) in 8 ms. (30 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5573 reset in 864 ms.
Product exploration explored 100000 steps with 5633 reset in 697 ms.
Built C files in :
/tmp/ltsmin2112341567236925760
[2024-05-28 19:49:30] [INFO ] Computing symmetric may disable matrix : 1103 transitions.
[2024-05-28 19:49:30] [INFO ] Computation of Complete disable matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:49:30] [INFO ] Computing symmetric may enable matrix : 1103 transitions.
[2024-05-28 19:49:30] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:49:30] [INFO ] Computing Do-Not-Accords matrix : 1103 transitions.
[2024-05-28 19:49:30] [INFO ] Computation of Completed DNA matrix. took 39 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:49:31] [INFO ] Built C files in 339ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2112341567236925760
Running compilation step : cd /tmp/ltsmin2112341567236925760;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2112341567236925760;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2112341567236925760;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 63 out of 770 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 49 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Running 1097 sub problems to find dead transitions.
[2024-05-28 19:49:34] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:49:34] [INFO ] Invariant cache hit.
[2024-05-28 19:49:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:49:48] [INFO ] Deduced a trap composed of 245 places in 251 ms of which 4 ms to minimize.
[2024-05-28 19:49:48] [INFO ] Deduced a trap composed of 196 places in 285 ms of which 4 ms to minimize.
[2024-05-28 19:49:48] [INFO ] Deduced a trap composed of 233 places in 274 ms of which 4 ms to minimize.
[2024-05-28 19:49:49] [INFO ] Deduced a trap composed of 196 places in 606 ms of which 20 ms to minimize.
[2024-05-28 19:49:49] [INFO ] Deduced a trap composed of 230 places in 338 ms of which 5 ms to minimize.
[2024-05-28 19:49:50] [INFO ] Deduced a trap composed of 196 places in 351 ms of which 5 ms to minimize.
[2024-05-28 19:49:50] [INFO ] Deduced a trap composed of 196 places in 325 ms of which 5 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 245 places in 338 ms of which 4 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 196 places in 284 ms of which 4 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
[2024-05-28 19:49:51] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 3 ms to minimize.
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 4 ms to minimize.
[2024-05-28 19:49:52] [INFO ] Deduced a trap composed of 254 places in 255 ms of which 3 ms to minimize.
[2024-05-28 19:49:53] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 4 ms to minimize.
[2024-05-28 19:49:53] [INFO ] Deduced a trap composed of 196 places in 291 ms of which 4 ms to minimize.
[2024-05-28 19:49:53] [INFO ] Deduced a trap composed of 242 places in 248 ms of which 4 ms to minimize.
[2024-05-28 19:49:54] [INFO ] Deduced a trap composed of 196 places in 328 ms of which 5 ms to minimize.
[2024-05-28 19:49:54] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 3 ms to minimize.
[2024-05-28 19:49:54] [INFO ] Deduced a trap composed of 242 places in 321 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:49:55] [INFO ] Deduced a trap composed of 254 places in 417 ms of which 6 ms to minimize.
[2024-05-28 19:49:56] [INFO ] Deduced a trap composed of 245 places in 429 ms of which 7 ms to minimize.
[2024-05-28 19:49:56] [INFO ] Deduced a trap composed of 248 places in 336 ms of which 5 ms to minimize.
[2024-05-28 19:49:57] [INFO ] Deduced a trap composed of 196 places in 345 ms of which 5 ms to minimize.
[2024-05-28 19:49:57] [INFO ] Deduced a trap composed of 251 places in 357 ms of which 5 ms to minimize.
SMT process timed out in 23420ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 23433ms
[2024-05-28 19:49:57] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:49:57] [INFO ] Invariant cache hit.
[2024-05-28 19:49:58] [INFO ] Implicit Places using invariants in 790 ms returned []
[2024-05-28 19:49:58] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:49:58] [INFO ] Invariant cache hit.
[2024-05-28 19:49:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:50:03] [INFO ] Implicit Places using invariants and state equation in 5603 ms returned []
Implicit Place search using SMT with State Equation took 6395 ms to find 0 implicit places.
[2024-05-28 19:50:03] [INFO ] Redundant transitions in 24 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-05-28 19:50:03] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 19:50:03] [INFO ] Invariant cache hit.
[2024-05-28 19:50:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:50:18] [INFO ] Deduced a trap composed of 245 places in 340 ms of which 4 ms to minimize.
[2024-05-28 19:50:18] [INFO ] Deduced a trap composed of 196 places in 292 ms of which 4 ms to minimize.
[2024-05-28 19:50:18] [INFO ] Deduced a trap composed of 233 places in 310 ms of which 4 ms to minimize.
[2024-05-28 19:50:19] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 3 ms to minimize.
[2024-05-28 19:50:19] [INFO ] Deduced a trap composed of 230 places in 292 ms of which 3 ms to minimize.
[2024-05-28 19:50:19] [INFO ] Deduced a trap composed of 196 places in 236 ms of which 4 ms to minimize.
[2024-05-28 19:50:20] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 4 ms to minimize.
[2024-05-28 19:50:20] [INFO ] Deduced a trap composed of 245 places in 272 ms of which 4 ms to minimize.
[2024-05-28 19:50:20] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
[2024-05-28 19:50:21] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 4 ms to minimize.
[2024-05-28 19:50:21] [INFO ] Deduced a trap composed of 196 places in 278 ms of which 3 ms to minimize.
[2024-05-28 19:50:21] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 17 ms to minimize.
[2024-05-28 19:50:21] [INFO ] Deduced a trap composed of 196 places in 275 ms of which 4 ms to minimize.
[2024-05-28 19:50:22] [INFO ] Deduced a trap composed of 254 places in 253 ms of which 4 ms to minimize.
[2024-05-28 19:50:22] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 4 ms to minimize.
[2024-05-28 19:50:22] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
[2024-05-28 19:50:23] [INFO ] Deduced a trap composed of 242 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:50:23] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
[2024-05-28 19:50:23] [INFO ] Deduced a trap composed of 196 places in 309 ms of which 7 ms to minimize.
[2024-05-28 19:50:24] [INFO ] Deduced a trap composed of 242 places in 247 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:50:24] [INFO ] Deduced a trap composed of 254 places in 314 ms of which 5 ms to minimize.
[2024-05-28 19:50:25] [INFO ] Deduced a trap composed of 245 places in 332 ms of which 5 ms to minimize.
[2024-05-28 19:50:25] [INFO ] Deduced a trap composed of 248 places in 244 ms of which 4 ms to minimize.
[2024-05-28 19:50:25] [INFO ] Deduced a trap composed of 196 places in 330 ms of which 4 ms to minimize.
[2024-05-28 19:50:26] [INFO ] Deduced a trap composed of 251 places in 275 ms of which 4 ms to minimize.
[2024-05-28 19:50:26] [INFO ] Deduced a trap composed of 196 places in 281 ms of which 4 ms to minimize.
[2024-05-28 19:50:26] [INFO ] Deduced a trap composed of 233 places in 253 ms of which 4 ms to minimize.
[2024-05-28 19:50:27] [INFO ] Deduced a trap composed of 236 places in 273 ms of which 4 ms to minimize.
[2024-05-28 19:50:27] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 4 ms to minimize.
[2024-05-28 19:50:27] [INFO ] Deduced a trap composed of 230 places in 240 ms of which 4 ms to minimize.
[2024-05-28 19:50:27] [INFO ] Deduced a trap composed of 260 places in 255 ms of which 4 ms to minimize.
[2024-05-28 19:50:28] [INFO ] Deduced a trap composed of 236 places in 265 ms of which 3 ms to minimize.
[2024-05-28 19:50:28] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 4 ms to minimize.
[2024-05-28 19:50:28] [INFO ] Deduced a trap composed of 196 places in 348 ms of which 4 ms to minimize.
[2024-05-28 19:50:29] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-05-28 19:50:29] [INFO ] Deduced a trap composed of 196 places in 225 ms of which 3 ms to minimize.
[2024-05-28 19:50:29] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 3 ms to minimize.
[2024-05-28 19:50:29] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 4 ms to minimize.
[2024-05-28 19:50:30] [INFO ] Deduced a trap composed of 196 places in 217 ms of which 3 ms to minimize.
[2024-05-28 19:50:30] [INFO ] Deduced a trap composed of 196 places in 231 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:50:42] [INFO ] Deduced a trap composed of 200 places in 381 ms of which 5 ms to minimize.
[2024-05-28 19:50:42] [INFO ] Deduced a trap composed of 196 places in 358 ms of which 5 ms to minimize.
[2024-05-28 19:50:42] [INFO ] Deduced a trap composed of 196 places in 338 ms of which 5 ms to minimize.
[2024-05-28 19:50:43] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 3 ms to minimize.
[2024-05-28 19:50:43] [INFO ] Deduced a trap composed of 200 places in 273 ms of which 4 ms to minimize.
[2024-05-28 19:50:43] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 3 ms to minimize.
[2024-05-28 19:50:43] [INFO ] Deduced a trap composed of 200 places in 252 ms of which 4 ms to minimize.
[2024-05-28 19:50:44] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 3 ms to minimize.
[2024-05-28 19:50:44] [INFO ] Deduced a trap composed of 200 places in 249 ms of which 3 ms to minimize.
[2024-05-28 19:50:44] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-05-28 19:50:45] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 3 ms to minimize.
[2024-05-28 19:50:45] [INFO ] Deduced a trap composed of 200 places in 313 ms of which 4 ms to minimize.
[2024-05-28 19:50:45] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 4 ms to minimize.
[2024-05-28 19:50:45] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2024-05-28 19:50:46] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 3 ms to minimize.
[2024-05-28 19:50:46] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 4 ms to minimize.
[2024-05-28 19:50:46] [INFO ] Deduced a trap composed of 200 places in 288 ms of which 3 ms to minimize.
[2024-05-28 19:50:47] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 3 ms to minimize.
[2024-05-28 19:50:47] [INFO ] Deduced a trap composed of 200 places in 311 ms of which 3 ms to minimize.
[2024-05-28 19:50:47] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 19:50:50] [INFO ] Deduced a trap composed of 249 places in 341 ms of which 5 ms to minimize.
[2024-05-28 19:50:50] [INFO ] Deduced a trap composed of 248 places in 334 ms of which 8 ms to minimize.
[2024-05-28 19:50:51] [INFO ] Deduced a trap composed of 237 places in 331 ms of which 5 ms to minimize.
[2024-05-28 19:50:51] [INFO ] Deduced a trap composed of 230 places in 317 ms of which 5 ms to minimize.
[2024-05-28 19:50:52] [INFO ] Deduced a trap composed of 248 places in 304 ms of which 4 ms to minimize.
[2024-05-28 19:50:52] [INFO ] Deduced a trap composed of 255 places in 317 ms of which 4 ms to minimize.
[2024-05-28 19:50:52] [INFO ] Deduced a trap composed of 237 places in 263 ms of which 5 ms to minimize.
[2024-05-28 19:50:53] [INFO ] Deduced a trap composed of 248 places in 321 ms of which 5 ms to minimize.
[2024-05-28 19:50:53] [INFO ] Deduced a trap composed of 242 places in 283 ms of which 5 ms to minimize.
[2024-05-28 19:50:53] [INFO ] Deduced a trap composed of 236 places in 232 ms of which 4 ms to minimize.
[2024-05-28 19:50:53] [INFO ] Deduced a trap composed of 254 places in 227 ms of which 4 ms to minimize.
[2024-05-28 19:50:54] [INFO ] Deduced a trap composed of 245 places in 314 ms of which 3 ms to minimize.
[2024-05-28 19:50:54] [INFO ] Deduced a trap composed of 196 places in 348 ms of which 3 ms to minimize.
[2024-05-28 19:50:55] [INFO ] Deduced a trap composed of 196 places in 292 ms of which 4 ms to minimize.
[2024-05-28 19:50:55] [INFO ] Deduced a trap composed of 216 places in 337 ms of which 5 ms to minimize.
[2024-05-28 19:50:55] [INFO ] Deduced a trap composed of 196 places in 310 ms of which 5 ms to minimize.
[2024-05-28 19:50:56] [INFO ] Deduced a trap composed of 196 places in 300 ms of which 5 ms to minimize.
[2024-05-28 19:50:56] [INFO ] Deduced a trap composed of 196 places in 282 ms of which 4 ms to minimize.
[2024-05-28 19:50:56] [INFO ] Deduced a trap composed of 261 places in 273 ms of which 4 ms to minimize.
[2024-05-28 19:50:57] [INFO ] Deduced a trap composed of 196 places in 281 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 212 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 80/80 constraints]
After SMT, in 62944ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62960ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 92875 ms. Remains : 770/770 places, 1103/1103 transitions.
Built C files in :
/tmp/ltsmin14579348711690453415
[2024-05-28 19:51:06] [INFO ] Computing symmetric may disable matrix : 1103 transitions.
[2024-05-28 19:51:06] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:51:06] [INFO ] Computing symmetric may enable matrix : 1103 transitions.
[2024-05-28 19:51:07] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:51:07] [INFO ] Computing Do-Not-Accords matrix : 1103 transitions.
[2024-05-28 19:51:07] [INFO ] Computation of Completed DNA matrix. took 24 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 19:51:07] [INFO ] Built C files in 353ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14579348711690453415
Running compilation step : cd /tmp/ltsmin14579348711690453415;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14579348711690453415;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14579348711690453415;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 19:51:10] [INFO ] Flatten gal took : 94 ms
[2024-05-28 19:51:10] [INFO ] Flatten gal took : 92 ms
[2024-05-28 19:51:10] [INFO ] Time to serialize gal into /tmp/LTL10030734622270727751.gal : 17 ms
[2024-05-28 19:51:10] [INFO ] Time to serialize properties into /tmp/LTL2049003442950565067.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10030734622270727751.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5967878633078139112.hoa' '-atoms' '/tmp/LTL2049003442950565067.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2049003442950565067.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5967878633078139112.hoa
Detected timeout of ITS tools.
[2024-05-28 19:51:25] [INFO ] Flatten gal took : 44 ms
[2024-05-28 19:51:25] [INFO ] Flatten gal took : 46 ms
[2024-05-28 19:51:25] [INFO ] Time to serialize gal into /tmp/LTL7173734076638571309.gal : 11 ms
[2024-05-28 19:51:25] [INFO ] Time to serialize properties into /tmp/LTL11800706376443392193.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7173734076638571309.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11800706376443392193.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((FetchJobB<1)||(mo2<1))||(f2_49<1))&&(((FetchJobB<1)||(mo2<1))||(f2_47<1)))&&((((FetchJobB<1)||(mo2<1))||(f2_45<1))&&(...2521
Formula 0 simplified : FG!"(((((((((FetchJobB<1)||(mo2<1))||(f2_49<1))&&(((FetchJobB<1)||(mo2<1))||(f2_47<1)))&&((((FetchJobB<1)||(mo2<1))||(f2_45<1))&&(((...2515
Detected timeout of ITS tools.
[2024-05-28 19:51:41] [INFO ] Flatten gal took : 48 ms
[2024-05-28 19:51:41] [INFO ] Applying decomposition
[2024-05-28 19:51:41] [INFO ] Flatten gal took : 41 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5986286262564140317.txt' '-o' '/tmp/graph5986286262564140317.bin' '-w' '/tmp/graph5986286262564140317.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5986286262564140317.bin' '-l' '-1' '-v' '-w' '/tmp/graph5986286262564140317.weights' '-q' '0' '-e' '0.001'
[2024-05-28 19:51:41] [INFO ] Decomposing Gal with order
[2024-05-28 19:51:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 19:51:42] [INFO ] Removed a total of 1290 redundant transitions.
[2024-05-28 19:51:42] [INFO ] Flatten gal took : 666 ms
[2024-05-28 19:51:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 553 labels/synchronizations in 99 ms.
[2024-05-28 19:51:42] [INFO ] Time to serialize gal into /tmp/LTL18176973230579767779.gal : 38 ms
[2024-05-28 19:51:42] [INFO ] Time to serialize properties into /tmp/LTL15276024102066972643.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18176973230579767779.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15276024102066972643.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("(((((((((i0.u0.FetchJobB<1)||(i0.u0.mo2<1))||(i0.u0.f2_49<1))&&(((i0.u0.FetchJobB<1)||(i0.u0.mo2<1))||(i0.u0.f2_47<1)))&&((((i...3619
Formula 0 simplified : FG!"(((((((((i0.u0.FetchJobB<1)||(i0.u0.mo2<1))||(i0.u0.f2_49<1))&&(((i0.u0.FetchJobB<1)||(i0.u0.mo2<1))||(i0.u0.f2_47<1)))&&((((i0....3613
Detected timeout of ITS tools.
Treatment of property PolyORBNT-COL-S05J60-LTLFireability-00 finished in 338687 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(p1) U p2))))'
Support contains 5 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1237/1237 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1236
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1236
Applied a total of 2 rules in 47 ms. Remains 903 /904 variables (removed 1) and now considering 1236/1237 (removed 1) transitions.
Running 1230 sub problems to find dead transitions.
[2024-05-28 19:51:57] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
// Phase 1: matrix 1232 rows 903 cols
[2024-05-28 19:51:57] [INFO ] Computed 137 invariants in 18 ms
[2024-05-28 19:51:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-28 19:52:39] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 137 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 1/1 constraints]
After SMT, in 42945ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 42963ms
[2024-05-28 19:52:40] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:52:40] [INFO ] Invariant cache hit.
[2024-05-28 19:52:41] [INFO ] Implicit Places using invariants in 876 ms returned []
[2024-05-28 19:52:41] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:52:41] [INFO ] Invariant cache hit.
[2024-05-28 19:52:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:52:50] [INFO ] Implicit Places using invariants and state equation in 8597 ms returned []
Implicit Place search using SMT with State Equation took 9489 ms to find 0 implicit places.
Running 1230 sub problems to find dead transitions.
[2024-05-28 19:52:50] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:52:50] [INFO ] Invariant cache hit.
[2024-05-28 19:52:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 (/ 2.0 3.0))
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 (/ 1.0 3.0))
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 (/ 1.0 3.0))
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 (/ 2.0 3.0))
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 (/ 3.0 4.0))
(s384 4.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 9.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 1.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 1.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-28 19:53:45] [INFO ] Deduced a trap composed of 304 places in 301 ms of which 4 ms to minimize.
[2024-05-28 19:53:46] [INFO ] Deduced a trap composed of 12 places in 339 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 138 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 2/2 constraints]
After SMT, in 62552ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 62566ms
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1236/1237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115075 ms. Remains : 903/904 places, 1236/1237 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J60-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLFireability-01 finished in 115257 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&&F((G(!p1)||G(p0)))))))'
Support contains 1 out of 904 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1237/1237 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1236
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1236
Applied a total of 2 rules in 27 ms. Remains 903 /904 variables (removed 1) and now considering 1236/1237 (removed 1) transitions.
Running 1230 sub problems to find dead transitions.
[2024-05-28 19:53:53] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:53:53] [INFO ] Invariant cache hit.
[2024-05-28 19:53:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 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 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 42377ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 42389ms
[2024-05-28 19:54:35] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:54:35] [INFO ] Invariant cache hit.
[2024-05-28 19:54:36] [INFO ] Implicit Places using invariants in 959 ms returned []
[2024-05-28 19:54:36] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:54:36] [INFO ] Invariant cache hit.
[2024-05-28 19:54:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:54:41] [INFO ] Implicit Places using invariants and state equation in 5010 ms returned []
Implicit Place search using SMT with State Equation took 5987 ms to find 0 implicit places.
Running 1230 sub problems to find dead transitions.
[2024-05-28 19:54:41] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:54:41] [INFO ] Invariant cache hit.
[2024-05-28 19:54:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-28 19:55:39] [INFO ] Deduced a trap composed of 304 places in 427 ms of which 6 ms to minimize.
[2024-05-28 19:55:40] [INFO ] Deduced a trap composed of 12 places in 386 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 138 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 2/2 constraints]
After SMT, in 62341ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 62361ms
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1236/1237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110772 ms. Remains : 903/904 places, 1236/1237 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLFireability-03
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-COL-S05J60-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLFireability-03 finished in 110870 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(X((F(p3)||p2))||p1))))'
Support contains 67 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1237/1237 transitions.
Applied a total of 0 rules in 14 ms. Remains 904 /904 variables (removed 0) and now considering 1237/1237 (removed 0) transitions.
Running 1231 sub problems to find dead transitions.
[2024-05-28 19:55:43] [INFO ] Flow matrix only has 1233 transitions (discarded 4 similar events)
// Phase 1: matrix 1233 rows 904 cols
[2024-05-28 19:55:43] [INFO ] Computed 137 invariants in 24 ms
[2024-05-28 19:55:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 2.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 (/ 2.0 3.0))
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 (/ 2.0 3.0))
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 (/ 2.0 3.0))
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 1.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 (/ 1.0 2.0))
(s384 4.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 9.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 (/ 2.0 3.0))
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 (/ 2.0 3.0))
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 (/ 2.0 3.0))
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 1.0)
(s696 1.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 2.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 (/ 1.0 3.0))
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 timeout
(/ 1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2137 variables, and 131 constraints, problems are : Problem set: 0 solved, 1231 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1231/1231 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
[2024-05-28 19:56:14] [INFO ] Deduced a trap composed of 14 places in 268 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1231 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 898/2137 variables, and 132 constraints, problems are : Problem set: 0 solved, 1231 unsolved in 20017 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1231 constraints, Known Traps: 1/1 constraints]
After SMT, in 42733ms problems are : Problem set: 0 solved, 1231 unsolved
Search for dead transitions found 0 dead transitions in 42743ms
[2024-05-28 19:56:26] [INFO ] Flow matrix only has 1233 transitions (discarded 4 similar events)
[2024-05-28 19:56:26] [INFO ] Invariant cache hit.
[2024-05-28 19:56:27] [INFO ] Implicit Places using invariants in 785 ms returned []
[2024-05-28 19:56:27] [INFO ] Flow matrix only has 1233 transitions (discarded 4 similar events)
[2024-05-28 19:56:27] [INFO ] Invariant cache hit.
[2024-05-28 19:56:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:56:32] [INFO ] Implicit Places using invariants and state equation in 5325 ms returned []
Implicit Place search using SMT with State Equation took 6126 ms to find 0 implicit places.
Running 1231 sub problems to find dead transitions.
[2024-05-28 19:56:32] [INFO ] Flow matrix only has 1233 transitions (discarded 4 similar events)
[2024-05-28 19:56:32] [INFO ] Invariant cache hit.
[2024-05-28 19:56:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 1.0)
(s108 0.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 (/ 1.0 3.0))
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 (/ 1.0 3.0))
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 (/ 1.0 3.0))
(s310 1.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 4.0)
(s385 0.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 9.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 1.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 1.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 1.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 1.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 5/903 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 903/2137 variables, and 136 constraints, problems are : Problem set: 0 solved, 1231 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1231/1231 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/898 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/898 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/898 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
At refinement iteration 3 (OVERLAPS) 5/903 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1231 unsolved
[2024-05-28 19:57:30] [INFO ] Deduced a trap composed of 137 places in 450 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 903/2137 variables, and 137 constraints, problems are : Problem set: 0 solved, 1231 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/904 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1231 constraints, Known Traps: 1/1 constraints]
After SMT, in 63479ms problems are : Problem set: 0 solved, 1231 unsolved
Search for dead transitions found 0 dead transitions in 63503ms
Finished structural reductions in LTL mode , in 1 iterations and 112395 ms. Remains : 904/904 places, 1237/1237 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p2)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J60-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLFireability-04 finished in 112603 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(X(p1))||G(!p2)||p0)) U p1))'
Support contains 72 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1237/1237 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1236
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1236
Applied a total of 2 rules in 26 ms. Remains 903 /904 variables (removed 1) and now considering 1236/1237 (removed 1) transitions.
Running 1230 sub problems to find dead transitions.
[2024-05-28 19:57:36] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
// Phase 1: matrix 1232 rows 903 cols
[2024-05-28 19:57:36] [INFO ] Computed 137 invariants in 16 ms
[2024-05-28 19:57:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 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 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 42733ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 42743ms
[2024-05-28 19:58:19] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:58:19] [INFO ] Invariant cache hit.
[2024-05-28 19:58:20] [INFO ] Implicit Places using invariants in 907 ms returned []
[2024-05-28 19:58:20] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:58:20] [INFO ] Invariant cache hit.
[2024-05-28 19:58:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:58:26] [INFO ] Implicit Places using invariants and state equation in 5876 ms returned []
Implicit Place search using SMT with State Equation took 6821 ms to find 0 implicit places.
Running 1230 sub problems to find dead transitions.
[2024-05-28 19:58:26] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 19:58:26] [INFO ] Invariant cache hit.
[2024-05-28 19:58:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 (/ 2.0 3.0))
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 (/ 2.0 3.0))
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 (/ 2.0 3.0))
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 4.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 9.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-28 19:59:21] [INFO ] Deduced a trap composed of 304 places in 399 ms of which 5 ms to minimize.
[2024-05-28 19:59:22] [INFO ] Deduced a trap composed of 12 places in 442 ms of which 6 ms to minimize.
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 902/2135 variables, and 138 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 2/2 constraints]
After SMT, in 62750ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 62769ms
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1236/1237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112366 ms. Remains : 903/904 places, 1236/1237 transitions.
Stuttering acceptance computed with spot in 344 ms :[(NOT p1), (NOT p1), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p1) p2), (NOT p1), true, (AND p2 (NOT p1)), p2]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLFireability-05
Entered a terminal (fully accepting) state of product in 11896 steps with 834 reset in 108 ms.
FORMULA PolyORBNT-COL-S05J60-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLFireability-05 finished in 112842 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G((F(p2)&&p1))))'
Support contains 369 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1237/1237 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 904 transition count 1233
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 900 transition count 1232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 899 transition count 1232
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 10 place count 899 transition count 1169
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 136 place count 836 transition count 1169
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 835 transition count 1168
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 835 transition count 1168
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 142 place count 833 transition count 1166
Applied a total of 142 rules in 147 ms. Remains 833 /904 variables (removed 71) and now considering 1166/1237 (removed 71) transitions.
Running 1160 sub problems to find dead transitions.
[2024-05-28 19:59:29] [INFO ] Flow matrix only has 1162 transitions (discarded 4 similar events)
// Phase 1: matrix 1162 rows 833 cols
[2024-05-28 19:59:29] [INFO ] Computed 137 invariants in 26 ms
[2024-05-28 19:59:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-05-28 19:59:44] [INFO ] Deduced a trap composed of 260 places in 350 ms of which 4 ms to minimize.
[2024-05-28 19:59:44] [INFO ] Deduced a trap composed of 260 places in 358 ms of which 6 ms to minimize.
[2024-05-28 19:59:44] [INFO ] Deduced a trap composed of 260 places in 344 ms of which 6 ms to minimize.
[2024-05-28 19:59:45] [INFO ] Deduced a trap composed of 260 places in 302 ms of which 4 ms to minimize.
[2024-05-28 19:59:45] [INFO ] Deduced a trap composed of 260 places in 364 ms of which 4 ms to minimize.
[2024-05-28 19:59:46] [INFO ] Deduced a trap composed of 260 places in 434 ms of which 32 ms to minimize.
[2024-05-28 19:59:46] [INFO ] Deduced a trap composed of 260 places in 471 ms of which 19 ms to minimize.
[2024-05-28 19:59:47] [INFO ] Deduced a trap composed of 260 places in 370 ms of which 5 ms to minimize.
[2024-05-28 19:59:47] [INFO ] Deduced a trap composed of 260 places in 304 ms of which 4 ms to minimize.
[2024-05-28 19:59:47] [INFO ] Deduced a trap composed of 260 places in 292 ms of which 4 ms to minimize.
[2024-05-28 19:59:48] [INFO ] Deduced a trap composed of 260 places in 291 ms of which 5 ms to minimize.
[2024-05-28 19:59:48] [INFO ] Deduced a trap composed of 260 places in 390 ms of which 5 ms to minimize.
[2024-05-28 19:59:49] [INFO ] Deduced a trap composed of 260 places in 389 ms of which 5 ms to minimize.
[2024-05-28 19:59:49] [INFO ] Deduced a trap composed of 260 places in 372 ms of which 6 ms to minimize.
[2024-05-28 19:59:49] [INFO ] Deduced a trap composed of 260 places in 343 ms of which 6 ms to minimize.
[2024-05-28 19:59:50] [INFO ] Deduced a trap composed of 260 places in 295 ms of which 4 ms to minimize.
[2024-05-28 19:59:50] [INFO ] Deduced a trap composed of 260 places in 257 ms of which 4 ms to minimize.
[2024-05-28 19:59:50] [INFO ] Deduced a trap composed of 260 places in 259 ms of which 4 ms to minimize.
[2024-05-28 19:59:50] [INFO ] Deduced a trap composed of 260 places in 251 ms of which 4 ms to minimize.
[2024-05-28 19:59:51] [INFO ] Deduced a trap composed of 260 places in 260 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-05-28 19:59:52] [INFO ] Deduced a trap composed of 296 places in 374 ms of which 6 ms to minimize.
SMT process timed out in 22834ms, After SMT, problems are : Problem set: 0 solved, 1160 unsolved
Search for dead transitions found 0 dead transitions in 22863ms
[2024-05-28 19:59:52] [INFO ] Flow matrix only has 1162 transitions (discarded 4 similar events)
[2024-05-28 19:59:52] [INFO ] Invariant cache hit.
[2024-05-28 19:59:53] [INFO ] Implicit Places using invariants in 799 ms returned []
[2024-05-28 19:59:53] [INFO ] Flow matrix only has 1162 transitions (discarded 4 similar events)
[2024-05-28 19:59:53] [INFO ] Invariant cache hit.
[2024-05-28 19:59:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 19:59:57] [INFO ] Implicit Places using invariants and state equation in 4351 ms returned []
Implicit Place search using SMT with State Equation took 5154 ms to find 0 implicit places.
[2024-05-28 19:59:57] [INFO ] Redundant transitions in 27 ms returned []
Running 1160 sub problems to find dead transitions.
[2024-05-28 19:59:57] [INFO ] Flow matrix only has 1162 transitions (discarded 4 similar events)
[2024-05-28 19:59:57] [INFO ] Invariant cache hit.
[2024-05-28 19:59:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-05-28 20:00:13] [INFO ] Deduced a trap composed of 260 places in 389 ms of which 5 ms to minimize.
[2024-05-28 20:00:13] [INFO ] Deduced a trap composed of 260 places in 334 ms of which 6 ms to minimize.
[2024-05-28 20:00:14] [INFO ] Deduced a trap composed of 260 places in 363 ms of which 5 ms to minimize.
[2024-05-28 20:00:14] [INFO ] Deduced a trap composed of 260 places in 393 ms of which 6 ms to minimize.
[2024-05-28 20:00:15] [INFO ] Deduced a trap composed of 260 places in 326 ms of which 6 ms to minimize.
[2024-05-28 20:00:15] [INFO ] Deduced a trap composed of 260 places in 291 ms of which 4 ms to minimize.
[2024-05-28 20:00:15] [INFO ] Deduced a trap composed of 260 places in 348 ms of which 6 ms to minimize.
[2024-05-28 20:00:16] [INFO ] Deduced a trap composed of 260 places in 358 ms of which 5 ms to minimize.
[2024-05-28 20:00:16] [INFO ] Deduced a trap composed of 260 places in 334 ms of which 4 ms to minimize.
[2024-05-28 20:00:16] [INFO ] Deduced a trap composed of 260 places in 382 ms of which 6 ms to minimize.
[2024-05-28 20:00:17] [INFO ] Deduced a trap composed of 260 places in 365 ms of which 6 ms to minimize.
[2024-05-28 20:00:17] [INFO ] Deduced a trap composed of 260 places in 347 ms of which 6 ms to minimize.
[2024-05-28 20:00:18] [INFO ] Deduced a trap composed of 260 places in 331 ms of which 5 ms to minimize.
[2024-05-28 20:00:18] [INFO ] Deduced a trap composed of 260 places in 367 ms of which 4 ms to minimize.
[2024-05-28 20:00:18] [INFO ] Deduced a trap composed of 260 places in 339 ms of which 4 ms to minimize.
[2024-05-28 20:00:19] [INFO ] Deduced a trap composed of 260 places in 388 ms of which 5 ms to minimize.
[2024-05-28 20:00:19] [INFO ] Deduced a trap composed of 260 places in 341 ms of which 6 ms to minimize.
[2024-05-28 20:00:20] [INFO ] Deduced a trap composed of 260 places in 312 ms of which 4 ms to minimize.
[2024-05-28 20:00:20] [INFO ] Deduced a trap composed of 260 places in 287 ms of which 4 ms to minimize.
[2024-05-28 20:00:20] [INFO ] Deduced a trap composed of 293 places in 374 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-05-28 20:00:21] [INFO ] Deduced a trap composed of 296 places in 316 ms of which 5 ms to minimize.
[2024-05-28 20:00:22] [INFO ] Deduced a trap composed of 296 places in 286 ms of which 4 ms to minimize.
[2024-05-28 20:00:22] [INFO ] Deduced a trap composed of 290 places in 229 ms of which 4 ms to minimize.
[2024-05-28 20:00:22] [INFO ] Deduced a trap composed of 311 places in 252 ms of which 4 ms to minimize.
[2024-05-28 20:00:23] [INFO ] Deduced a trap composed of 296 places in 301 ms of which 4 ms to minimize.
[2024-05-28 20:00:23] [INFO ] Deduced a trap composed of 296 places in 275 ms of which 5 ms to minimize.
[2024-05-28 20:00:23] [INFO ] Deduced a trap composed of 287 places in 231 ms of which 4 ms to minimize.
[2024-05-28 20:00:24] [INFO ] Deduced a trap composed of 293 places in 373 ms of which 5 ms to minimize.
[2024-05-28 20:00:24] [INFO ] Deduced a trap composed of 293 places in 353 ms of which 5 ms to minimize.
[2024-05-28 20:00:24] [INFO ] Deduced a trap composed of 260 places in 349 ms of which 6 ms to minimize.
[2024-05-28 20:00:25] [INFO ] Deduced a trap composed of 260 places in 357 ms of which 6 ms to minimize.
[2024-05-28 20:00:25] [INFO ] Deduced a trap composed of 260 places in 349 ms of which 6 ms to minimize.
[2024-05-28 20:00:26] [INFO ] Deduced a trap composed of 260 places in 318 ms of which 6 ms to minimize.
[2024-05-28 20:00:26] [INFO ] Deduced a trap composed of 260 places in 356 ms of which 6 ms to minimize.
[2024-05-28 20:00:27] [INFO ] Deduced a trap composed of 260 places in 396 ms of which 6 ms to minimize.
[2024-05-28 20:00:27] [INFO ] Deduced a trap composed of 260 places in 402 ms of which 6 ms to minimize.
[2024-05-28 20:00:28] [INFO ] Deduced a trap composed of 260 places in 413 ms of which 8 ms to minimize.
[2024-05-28 20:00:28] [INFO ] Deduced a trap composed of 260 places in 343 ms of which 5 ms to minimize.
[2024-05-28 20:00:28] [INFO ] Deduced a trap composed of 260 places in 322 ms of which 6 ms to minimize.
[2024-05-28 20:00:29] [INFO ] Deduced a trap composed of 260 places in 280 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/828 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 828/1995 variables, and 172 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 127/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/833 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1160/1160 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-05-28 20:00:34] [INFO ] Deduced a trap composed of 283 places in 433 ms of which 6 ms to minimize.
[2024-05-28 20:00:34] [INFO ] Deduced a trap composed of 286 places in 404 ms of which 6 ms to minimize.
[2024-05-28 20:00:35] [INFO ] Deduced a trap composed of 284 places in 402 ms of which 6 ms to minimize.
[2024-05-28 20:00:35] [INFO ] Deduced a trap composed of 284 places in 325 ms of which 4 ms to minimize.
[2024-05-28 20:00:35] [INFO ] Deduced a trap composed of 285 places in 396 ms of which 5 ms to minimize.
[2024-05-28 20:00:36] [INFO ] Deduced a trap composed of 282 places in 345 ms of which 5 ms to minimize.
[2024-05-28 20:00:36] [INFO ] Deduced a trap composed of 288 places in 386 ms of which 7 ms to minimize.
[2024-05-28 20:00:36] [INFO ] Deduced a trap composed of 289 places in 301 ms of which 4 ms to minimize.
[2024-05-28 20:00:37] [INFO ] Deduced a trap composed of 292 places in 294 ms of which 4 ms to minimize.
[2024-05-28 20:00:37] [INFO ] Deduced a trap composed of 290 places in 316 ms of which 4 ms to minimize.
[2024-05-28 20:00:38] [INFO ] Deduced a trap composed of 286 places in 372 ms of which 4 ms to minimize.
[2024-05-28 20:00:38] [INFO ] Deduced a trap composed of 283 places in 303 ms of which 4 ms to minimize.
[2024-05-28 20:00:38] [INFO ] Deduced a trap composed of 285 places in 281 ms of which 4 ms to minimize.
[2024-05-28 20:00:39] [INFO ] Deduced a trap composed of 286 places in 408 ms of which 6 ms to minimize.
[2024-05-28 20:00:39] [INFO ] Deduced a trap composed of 290 places in 374 ms of which 5 ms to minimize.
[2024-05-28 20:00:40] [INFO ] Deduced a trap composed of 286 places in 346 ms of which 5 ms to minimize.
[2024-05-28 20:00:40] [INFO ] Deduced a trap composed of 287 places in 361 ms of which 5 ms to minimize.
[2024-05-28 20:00:40] [INFO ] Deduced a trap composed of 288 places in 348 ms of which 6 ms to minimize.
[2024-05-28 20:00:41] [INFO ] Deduced a trap composed of 284 places in 429 ms of which 8 ms to minimize.
[2024-05-28 20:00:41] [INFO ] Deduced a trap composed of 291 places in 400 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/828 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 828/1995 variables, and 192 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 127/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/833 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1160 constraints, Known Traps: 60/60 constraints]
After SMT, in 63269ms problems are : Problem set: 0 solved, 1160 unsolved
Search for dead transitions found 0 dead transitions in 63288ms
Starting structural reductions in SI_LTL mode, iteration 1 : 833/904 places, 1166/1237 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 91496 ms. Remains : 833/904 places, 1166/1237 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLFireability-06
Product exploration explored 100000 steps with 4458 reset in 3135 ms.
Product exploration explored 100000 steps with 4464 reset in 2603 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 (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 176 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
RANDOM walk for 197 steps (5 resets) in 9 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 13 factoid took 252 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Support contains 366 out of 833 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 833/833 places, 1166/1166 transitions.
Applied a total of 0 rules in 73 ms. Remains 833 /833 variables (removed 0) and now considering 1166/1166 (removed 0) transitions.
Running 1160 sub problems to find dead transitions.
[2024-05-28 20:01:07] [INFO ] Flow matrix only has 1162 transitions (discarded 4 similar events)
[2024-05-28 20:01:07] [INFO ] Invariant cache hit.
[2024-05-28 20:01:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-05-28 20:01:23] [INFO ] Deduced a trap composed of 260 places in 449 ms of which 6 ms to minimize.
[2024-05-28 20:01:23] [INFO ] Deduced a trap composed of 260 places in 332 ms of which 5 ms to minimize.
[2024-05-28 20:01:23] [INFO ] Deduced a trap composed of 260 places in 380 ms of which 6 ms to minimize.
[2024-05-28 20:01:24] [INFO ] Deduced a trap composed of 260 places in 297 ms of which 5 ms to minimize.
[2024-05-28 20:01:24] [INFO ] Deduced a trap composed of 260 places in 261 ms of which 5 ms to minimize.
[2024-05-28 20:01:24] [INFO ] Deduced a trap composed of 260 places in 279 ms of which 5 ms to minimize.
[2024-05-28 20:01:25] [INFO ] Deduced a trap composed of 260 places in 263 ms of which 4 ms to minimize.
[2024-05-28 20:01:25] [INFO ] Deduced a trap composed of 260 places in 262 ms of which 5 ms to minimize.
[2024-05-28 20:01:25] [INFO ] Deduced a trap composed of 260 places in 320 ms of which 6 ms to minimize.
[2024-05-28 20:01:26] [INFO ] Deduced a trap composed of 260 places in 334 ms of which 6 ms to minimize.
[2024-05-28 20:01:26] [INFO ] Deduced a trap composed of 260 places in 363 ms of which 6 ms to minimize.
[2024-05-28 20:01:26] [INFO ] Deduced a trap composed of 260 places in 304 ms of which 4 ms to minimize.
[2024-05-28 20:01:27] [INFO ] Deduced a trap composed of 260 places in 290 ms of which 4 ms to minimize.
[2024-05-28 20:01:27] [INFO ] Deduced a trap composed of 260 places in 334 ms of which 4 ms to minimize.
[2024-05-28 20:01:27] [INFO ] Deduced a trap composed of 260 places in 315 ms of which 5 ms to minimize.
[2024-05-28 20:01:28] [INFO ] Deduced a trap composed of 260 places in 367 ms of which 6 ms to minimize.
[2024-05-28 20:01:28] [INFO ] Deduced a trap composed of 260 places in 331 ms of which 5 ms to minimize.
[2024-05-28 20:01:29] [INFO ] Deduced a trap composed of 260 places in 354 ms of which 6 ms to minimize.
[2024-05-28 20:01:29] [INFO ] Deduced a trap composed of 260 places in 380 ms of which 5 ms to minimize.
[2024-05-28 20:01:30] [INFO ] Deduced a trap composed of 293 places in 380 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-05-28 20:01:30] [INFO ] Deduced a trap composed of 296 places in 350 ms of which 5 ms to minimize.
SMT process timed out in 23387ms, After SMT, problems are : Problem set: 0 solved, 1160 unsolved
Search for dead transitions found 0 dead transitions in 23406ms
[2024-05-28 20:01:30] [INFO ] Flow matrix only has 1162 transitions (discarded 4 similar events)
[2024-05-28 20:01:30] [INFO ] Invariant cache hit.
[2024-05-28 20:01:31] [INFO ] Implicit Places using invariants in 820 ms returned []
[2024-05-28 20:01:31] [INFO ] Flow matrix only has 1162 transitions (discarded 4 similar events)
[2024-05-28 20:01:31] [INFO ] Invariant cache hit.
[2024-05-28 20:01:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:01:36] [INFO ] Implicit Places using invariants and state equation in 4530 ms returned []
Implicit Place search using SMT with State Equation took 5352 ms to find 0 implicit places.
[2024-05-28 20:01:36] [INFO ] Redundant transitions in 26 ms returned []
Running 1160 sub problems to find dead transitions.
[2024-05-28 20:01:36] [INFO ] Flow matrix only has 1162 transitions (discarded 4 similar events)
[2024-05-28 20:01:36] [INFO ] Invariant cache hit.
[2024-05-28 20:01:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-05-28 20:01:51] [INFO ] Deduced a trap composed of 260 places in 417 ms of which 6 ms to minimize.
[2024-05-28 20:01:51] [INFO ] Deduced a trap composed of 260 places in 396 ms of which 6 ms to minimize.
[2024-05-28 20:01:51] [INFO ] Deduced a trap composed of 260 places in 323 ms of which 5 ms to minimize.
[2024-05-28 20:01:52] [INFO ] Deduced a trap composed of 260 places in 263 ms of which 4 ms to minimize.
[2024-05-28 20:01:52] [INFO ] Deduced a trap composed of 260 places in 307 ms of which 4 ms to minimize.
[2024-05-28 20:01:52] [INFO ] Deduced a trap composed of 260 places in 320 ms of which 4 ms to minimize.
[2024-05-28 20:01:53] [INFO ] Deduced a trap composed of 260 places in 260 ms of which 4 ms to minimize.
[2024-05-28 20:01:53] [INFO ] Deduced a trap composed of 260 places in 325 ms of which 4 ms to minimize.
[2024-05-28 20:01:53] [INFO ] Deduced a trap composed of 260 places in 275 ms of which 4 ms to minimize.
[2024-05-28 20:01:54] [INFO ] Deduced a trap composed of 260 places in 305 ms of which 4 ms to minimize.
[2024-05-28 20:01:54] [INFO ] Deduced a trap composed of 260 places in 261 ms of which 4 ms to minimize.
[2024-05-28 20:01:54] [INFO ] Deduced a trap composed of 260 places in 263 ms of which 4 ms to minimize.
[2024-05-28 20:01:55] [INFO ] Deduced a trap composed of 260 places in 315 ms of which 4 ms to minimize.
[2024-05-28 20:01:55] [INFO ] Deduced a trap composed of 260 places in 259 ms of which 4 ms to minimize.
[2024-05-28 20:01:55] [INFO ] Deduced a trap composed of 260 places in 273 ms of which 4 ms to minimize.
[2024-05-28 20:01:56] [INFO ] Deduced a trap composed of 260 places in 335 ms of which 4 ms to minimize.
[2024-05-28 20:01:56] [INFO ] Deduced a trap composed of 260 places in 257 ms of which 4 ms to minimize.
[2024-05-28 20:01:56] [INFO ] Deduced a trap composed of 260 places in 402 ms of which 6 ms to minimize.
[2024-05-28 20:01:57] [INFO ] Deduced a trap composed of 260 places in 460 ms of which 4 ms to minimize.
[2024-05-28 20:01:57] [INFO ] Deduced a trap composed of 293 places in 340 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-05-28 20:01:58] [INFO ] Deduced a trap composed of 296 places in 341 ms of which 6 ms to minimize.
[2024-05-28 20:01:59] [INFO ] Deduced a trap composed of 296 places in 311 ms of which 5 ms to minimize.
[2024-05-28 20:01:59] [INFO ] Deduced a trap composed of 290 places in 337 ms of which 6 ms to minimize.
[2024-05-28 20:01:59] [INFO ] Deduced a trap composed of 311 places in 362 ms of which 6 ms to minimize.
[2024-05-28 20:02:00] [INFO ] Deduced a trap composed of 296 places in 312 ms of which 6 ms to minimize.
[2024-05-28 20:02:00] [INFO ] Deduced a trap composed of 296 places in 372 ms of which 6 ms to minimize.
[2024-05-28 20:02:00] [INFO ] Deduced a trap composed of 287 places in 334 ms of which 8 ms to minimize.
[2024-05-28 20:02:01] [INFO ] Deduced a trap composed of 293 places in 362 ms of which 5 ms to minimize.
[2024-05-28 20:02:01] [INFO ] Deduced a trap composed of 293 places in 392 ms of which 6 ms to minimize.
[2024-05-28 20:02:02] [INFO ] Deduced a trap composed of 260 places in 350 ms of which 5 ms to minimize.
[2024-05-28 20:02:02] [INFO ] Deduced a trap composed of 260 places in 297 ms of which 4 ms to minimize.
[2024-05-28 20:02:03] [INFO ] Deduced a trap composed of 260 places in 332 ms of which 4 ms to minimize.
[2024-05-28 20:02:03] [INFO ] Deduced a trap composed of 260 places in 301 ms of which 4 ms to minimize.
[2024-05-28 20:02:04] [INFO ] Deduced a trap composed of 260 places in 399 ms of which 6 ms to minimize.
[2024-05-28 20:02:04] [INFO ] Deduced a trap composed of 260 places in 374 ms of which 5 ms to minimize.
[2024-05-28 20:02:04] [INFO ] Deduced a trap composed of 260 places in 334 ms of which 4 ms to minimize.
[2024-05-28 20:02:05] [INFO ] Deduced a trap composed of 260 places in 355 ms of which 4 ms to minimize.
[2024-05-28 20:02:05] [INFO ] Deduced a trap composed of 260 places in 340 ms of which 4 ms to minimize.
[2024-05-28 20:02:05] [INFO ] Deduced a trap composed of 260 places in 274 ms of which 4 ms to minimize.
[2024-05-28 20:02:06] [INFO ] Deduced a trap composed of 260 places in 278 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/828 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 828/1995 variables, and 172 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 127/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/833 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1160/1160 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/828 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/828 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/828 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
[2024-05-28 20:02:11] [INFO ] Deduced a trap composed of 283 places in 299 ms of which 5 ms to minimize.
[2024-05-28 20:02:12] [INFO ] Deduced a trap composed of 286 places in 287 ms of which 4 ms to minimize.
[2024-05-28 20:02:12] [INFO ] Deduced a trap composed of 284 places in 290 ms of which 4 ms to minimize.
[2024-05-28 20:02:12] [INFO ] Deduced a trap composed of 284 places in 391 ms of which 5 ms to minimize.
[2024-05-28 20:02:13] [INFO ] Deduced a trap composed of 285 places in 393 ms of which 4 ms to minimize.
[2024-05-28 20:02:13] [INFO ] Deduced a trap composed of 282 places in 338 ms of which 4 ms to minimize.
[2024-05-28 20:02:14] [INFO ] Deduced a trap composed of 288 places in 385 ms of which 4 ms to minimize.
[2024-05-28 20:02:14] [INFO ] Deduced a trap composed of 289 places in 304 ms of which 5 ms to minimize.
[2024-05-28 20:02:14] [INFO ] Deduced a trap composed of 292 places in 297 ms of which 4 ms to minimize.
[2024-05-28 20:02:15] [INFO ] Deduced a trap composed of 290 places in 320 ms of which 6 ms to minimize.
[2024-05-28 20:02:15] [INFO ] Deduced a trap composed of 286 places in 405 ms of which 6 ms to minimize.
[2024-05-28 20:02:16] [INFO ] Deduced a trap composed of 283 places in 399 ms of which 5 ms to minimize.
[2024-05-28 20:02:16] [INFO ] Deduced a trap composed of 285 places in 403 ms of which 5 ms to minimize.
[2024-05-28 20:02:17] [INFO ] Deduced a trap composed of 286 places in 374 ms of which 5 ms to minimize.
[2024-05-28 20:02:17] [INFO ] Deduced a trap composed of 290 places in 386 ms of which 5 ms to minimize.
[2024-05-28 20:02:17] [INFO ] Deduced a trap composed of 286 places in 352 ms of which 4 ms to minimize.
[2024-05-28 20:02:18] [INFO ] Deduced a trap composed of 287 places in 295 ms of which 4 ms to minimize.
[2024-05-28 20:02:18] [INFO ] Deduced a trap composed of 288 places in 264 ms of which 4 ms to minimize.
[2024-05-28 20:02:19] [INFO ] Deduced a trap composed of 284 places in 338 ms of which 4 ms to minimize.
[2024-05-28 20:02:19] [INFO ] Deduced a trap composed of 291 places in 436 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/828 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1160 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 828/1995 variables, and 192 constraints, problems are : Problem set: 0 solved, 1160 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 127/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/833 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1160 constraints, Known Traps: 60/60 constraints]
After SMT, in 62523ms problems are : Problem set: 0 solved, 1160 unsolved
Search for dead transitions found 0 dead transitions in 62541ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 91412 ms. Remains : 833/833 places, 1166/1166 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 54 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
RANDOM walk for 228 steps (7 resets) in 11 ms. (19 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4469 reset in 2598 ms.
Product exploration explored 100000 steps with 4490 reset in 2596 ms.
Built C files in :
/tmp/ltsmin1806655472678228161
[2024-05-28 20:02:44] [INFO ] Computing symmetric may disable matrix : 1166 transitions.
[2024-05-28 20:02:44] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:02:44] [INFO ] Computing symmetric may enable matrix : 1166 transitions.
[2024-05-28 20:02:44] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:02:44] [INFO ] Computing Do-Not-Accords matrix : 1166 transitions.
[2024-05-28 20:02:44] [INFO ] Computation of Completed DNA matrix. took 29 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:02:44] [INFO ] Built C files in 489ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1806655472678228161
Running compilation step : cd /tmp/ltsmin1806655472678228161;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1806655472678228161;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1806655472678228161;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 366 out of 833 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 833/833 places, 1166/1166 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 833 transition count 1164
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 831 transition count 1164
Applied a total of 4 rules in 33 ms. Remains 831 /833 variables (removed 2) and now considering 1164/1166 (removed 2) transitions.
Running 1158 sub problems to find dead transitions.
[2024-05-28 20:02:47] [INFO ] Flow matrix only has 1160 transitions (discarded 4 similar events)
// Phase 1: matrix 1160 rows 831 cols
[2024-05-28 20:02:47] [INFO ] Computed 137 invariants in 45 ms
[2024-05-28 20:02:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/826 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/826 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
[2024-05-28 20:03:04] [INFO ] Deduced a trap composed of 258 places in 404 ms of which 6 ms to minimize.
[2024-05-28 20:03:04] [INFO ] Deduced a trap composed of 258 places in 367 ms of which 6 ms to minimize.
[2024-05-28 20:03:04] [INFO ] Deduced a trap composed of 286 places in 352 ms of which 5 ms to minimize.
[2024-05-28 20:03:05] [INFO ] Deduced a trap composed of 258 places in 311 ms of which 5 ms to minimize.
[2024-05-28 20:03:05] [INFO ] Deduced a trap composed of 284 places in 308 ms of which 4 ms to minimize.
[2024-05-28 20:03:05] [INFO ] Deduced a trap composed of 258 places in 367 ms of which 6 ms to minimize.
[2024-05-28 20:03:06] [INFO ] Deduced a trap composed of 258 places in 368 ms of which 6 ms to minimize.
[2024-05-28 20:03:06] [INFO ] Deduced a trap composed of 258 places in 575 ms of which 18 ms to minimize.
[2024-05-28 20:03:07] [INFO ] Deduced a trap composed of 258 places in 510 ms of which 7 ms to minimize.
[2024-05-28 20:03:07] [INFO ] Deduced a trap composed of 258 places in 359 ms of which 4 ms to minimize.
[2024-05-28 20:03:08] [INFO ] Deduced a trap composed of 258 places in 345 ms of which 5 ms to minimize.
[2024-05-28 20:03:08] [INFO ] Deduced a trap composed of 258 places in 339 ms of which 5 ms to minimize.
[2024-05-28 20:03:08] [INFO ] Deduced a trap composed of 258 places in 284 ms of which 4 ms to minimize.
[2024-05-28 20:03:09] [INFO ] Deduced a trap composed of 258 places in 279 ms of which 4 ms to minimize.
[2024-05-28 20:03:09] [INFO ] Deduced a trap composed of 258 places in 328 ms of which 6 ms to minimize.
[2024-05-28 20:03:09] [INFO ] Deduced a trap composed of 258 places in 314 ms of which 4 ms to minimize.
[2024-05-28 20:03:10] [INFO ] Deduced a trap composed of 258 places in 275 ms of which 4 ms to minimize.
[2024-05-28 20:03:10] [INFO ] Deduced a trap composed of 258 places in 248 ms of which 4 ms to minimize.
[2024-05-28 20:03:10] [INFO ] Deduced a trap composed of 258 places in 247 ms of which 4 ms to minimize.
[2024-05-28 20:03:11] [INFO ] Deduced a trap composed of 258 places in 254 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/826 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 826/1991 variables, and 152 constraints, problems are : Problem set: 0 solved, 1158 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 127/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/831 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1158/1158 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/826 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/826 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/826 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
[2024-05-28 20:03:13] [INFO ] Deduced a trap composed of 402 places in 247 ms of which 4 ms to minimize.
[2024-05-28 20:03:13] [INFO ] Deduced a trap composed of 258 places in 275 ms of which 4 ms to minimize.
[2024-05-28 20:03:13] [INFO ] Deduced a trap composed of 258 places in 263 ms of which 4 ms to minimize.
[2024-05-28 20:03:13] [INFO ] Deduced a trap composed of 258 places in 254 ms of which 8 ms to minimize.
[2024-05-28 20:03:14] [INFO ] Deduced a trap composed of 258 places in 310 ms of which 4 ms to minimize.
[2024-05-28 20:03:14] [INFO ] Deduced a trap composed of 258 places in 269 ms of which 4 ms to minimize.
[2024-05-28 20:03:14] [INFO ] Deduced a trap composed of 258 places in 280 ms of which 4 ms to minimize.
[2024-05-28 20:03:15] [INFO ] Deduced a trap composed of 258 places in 265 ms of which 5 ms to minimize.
[2024-05-28 20:03:15] [INFO ] Deduced a trap composed of 258 places in 271 ms of which 4 ms to minimize.
[2024-05-28 20:03:15] [INFO ] Deduced a trap composed of 258 places in 260 ms of which 4 ms to minimize.
[2024-05-28 20:03:15] [INFO ] Deduced a trap composed of 258 places in 254 ms of which 4 ms to minimize.
[2024-05-28 20:03:16] [INFO ] Deduced a trap composed of 258 places in 247 ms of which 4 ms to minimize.
[2024-05-28 20:03:16] [INFO ] Deduced a trap composed of 258 places in 259 ms of which 4 ms to minimize.
[2024-05-28 20:03:16] [INFO ] Deduced a trap composed of 258 places in 255 ms of which 4 ms to minimize.
[2024-05-28 20:03:16] [INFO ] Deduced a trap composed of 258 places in 251 ms of which 4 ms to minimize.
[2024-05-28 20:03:17] [INFO ] Deduced a trap composed of 262 places in 302 ms of which 4 ms to minimize.
[2024-05-28 20:03:17] [INFO ] Deduced a trap composed of 258 places in 264 ms of which 4 ms to minimize.
[2024-05-28 20:03:17] [INFO ] Deduced a trap composed of 258 places in 260 ms of which 4 ms to minimize.
[2024-05-28 20:03:18] [INFO ] Deduced a trap composed of 262 places in 266 ms of which 4 ms to minimize.
[2024-05-28 20:03:18] [INFO ] Deduced a trap composed of 258 places in 259 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/826 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 2)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 1)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 1)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 826/1991 variables, and 172 constraints, problems are : Problem set: 0 solved, 1158 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 127/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/831 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1158 constraints, Known Traps: 40/40 constraints]
After SMT, in 43203ms problems are : Problem set: 0 solved, 1158 unsolved
Search for dead transitions found 0 dead transitions in 43215ms
[2024-05-28 20:03:31] [INFO ] Flow matrix only has 1160 transitions (discarded 4 similar events)
[2024-05-28 20:03:31] [INFO ] Invariant cache hit.
[2024-05-28 20:03:31] [INFO ] Implicit Places using invariants in 575 ms returned []
[2024-05-28 20:03:31] [INFO ] Flow matrix only has 1160 transitions (discarded 4 similar events)
[2024-05-28 20:03:31] [INFO ] Invariant cache hit.
[2024-05-28 20:03:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:03:34] [INFO ] Implicit Places using invariants and state equation in 2779 ms returned []
Implicit Place search using SMT with State Equation took 3370 ms to find 0 implicit places.
[2024-05-28 20:03:34] [INFO ] Redundant transitions in 24 ms returned []
Running 1158 sub problems to find dead transitions.
[2024-05-28 20:03:34] [INFO ] Flow matrix only has 1160 transitions (discarded 4 similar events)
[2024-05-28 20:03:34] [INFO ] Invariant cache hit.
[2024-05-28 20:03:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/826 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/826 variables, 5/132 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
[2024-05-28 20:03:50] [INFO ] Deduced a trap composed of 285 places in 414 ms of which 6 ms to minimize.
[2024-05-28 20:03:51] [INFO ] Deduced a trap composed of 288 places in 351 ms of which 5 ms to minimize.
[2024-05-28 20:03:51] [INFO ] Deduced a trap composed of 298 places in 328 ms of which 5 ms to minimize.
[2024-05-28 20:03:51] [INFO ] Deduced a trap composed of 301 places in 313 ms of which 4 ms to minimize.
[2024-05-28 20:03:52] [INFO ] Deduced a trap composed of 310 places in 352 ms of which 4 ms to minimize.
[2024-05-28 20:03:52] [INFO ] Deduced a trap composed of 289 places in 291 ms of which 5 ms to minimize.
[2024-05-28 20:03:53] [INFO ] Deduced a trap composed of 295 places in 291 ms of which 4 ms to minimize.
[2024-05-28 20:03:53] [INFO ] Deduced a trap composed of 258 places in 246 ms of which 4 ms to minimize.
[2024-05-28 20:03:53] [INFO ] Deduced a trap composed of 258 places in 263 ms of which 3 ms to minimize.
[2024-05-28 20:03:54] [INFO ] Deduced a trap composed of 258 places in 306 ms of which 4 ms to minimize.
[2024-05-28 20:03:54] [INFO ] Deduced a trap composed of 258 places in 326 ms of which 4 ms to minimize.
[2024-05-28 20:03:55] [INFO ] Deduced a trap composed of 258 places in 376 ms of which 5 ms to minimize.
[2024-05-28 20:03:55] [INFO ] Deduced a trap composed of 258 places in 388 ms of which 6 ms to minimize.
[2024-05-28 20:03:55] [INFO ] Deduced a trap composed of 258 places in 358 ms of which 5 ms to minimize.
[2024-05-28 20:03:56] [INFO ] Deduced a trap composed of 258 places in 365 ms of which 6 ms to minimize.
[2024-05-28 20:03:56] [INFO ] Deduced a trap composed of 258 places in 349 ms of which 5 ms to minimize.
[2024-05-28 20:03:57] [INFO ] Deduced a trap composed of 257 places in 368 ms of which 6 ms to minimize.
[2024-05-28 20:03:57] [INFO ] Deduced a trap composed of 301 places in 380 ms of which 6 ms to minimize.
[2024-05-28 20:04:00] [INFO ] Deduced a trap composed of 293 places in 2383 ms of which 6 ms to minimize.
[2024-05-28 20:04:00] [INFO ] Deduced a trap composed of 258 places in 387 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/826 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1158 unsolved
[2024-05-28 20:04:01] [INFO ] Deduced a trap composed of 307 places in 382 ms of which 5 ms to minimize.
[2024-05-28 20:04:01] [INFO ] Deduced a trap composed of 258 places in 391 ms of which 6 ms to minimize.
[2024-05-28 20:04:02] [INFO ] Deduced a trap composed of 258 places in 375 ms of which 5 ms to minimize.
[2024-05-28 20:04:02] [INFO ] Deduced a trap composed of 258 places in 371 ms of which 5 ms to minimize.
[2024-05-28 20:04:03] [INFO ] Deduced a trap composed of 258 places in 367 ms of which 5 ms to minimize.
[2024-05-28 20:04:03] [INFO ] Deduced a trap composed of 258 places in 326 ms of which 5 ms to minimize.
[2024-05-28 20:04:04] [INFO ] Deduced a trap composed of 298 places in 418 ms of which 6 ms to minimize.
[2024-05-28 20:04:04] [INFO ] Deduced a trap composed of 258 places in 368 ms of which 5 ms to minimize.
[2024-05-28 20:04:04] [INFO ] Deduced a trap composed of 258 places in 386 ms of which 6 ms to minimize.
[2024-05-28 20:04:05] [INFO ] Deduced a trap composed of 258 places in 366 ms of which 5 ms to minimize.
[2024-05-28 20:04:05] [INFO ] Deduced a trap composed of 258 places in 350 ms of which 6 ms to minimize.
[2024-05-28 20:04:06] [INFO ] Deduced a trap composed of 258 places in 406 ms of which 5 ms to minimize.
[2024-05-28 20:04:06] [INFO ] Deduced a trap composed of 258 places in 405 ms of which 6 ms to minimize.
[2024-05-28 20:04:06] [INFO ] Deduced a trap composed of 258 places in 405 ms of which 6 ms to minimize.
[2024-05-28 20:04:07] [INFO ] Deduced a trap composed of 258 places in 301 ms of which 4 ms to minimize.
[2024-05-28 20:04:07] [INFO ] Deduced a trap composed of 258 places in 388 ms of which 6 ms to minimize.
[2024-05-28 20:04:07] [INFO ] Deduced a trap composed of 258 places in 387 ms of which 5 ms to minimize.
SMT process timed out in 33474ms, After SMT, problems are : Problem set: 0 solved, 1158 unsolved
Search for dead transitions found 0 dead transitions in 33491ms
Starting structural reductions in SI_LTL mode, iteration 1 : 831/833 places, 1164/1166 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80155 ms. Remains : 831/833 places, 1164/1166 transitions.
Built C files in :
/tmp/ltsmin5984050139281546072
[2024-05-28 20:04:08] [INFO ] Computing symmetric may disable matrix : 1164 transitions.
[2024-05-28 20:04:08] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:04:08] [INFO ] Computing symmetric may enable matrix : 1164 transitions.
[2024-05-28 20:04:08] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:04:08] [INFO ] Computing Do-Not-Accords matrix : 1164 transitions.
[2024-05-28 20:04:08] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:04:08] [INFO ] Built C files in 428ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5984050139281546072
Running compilation step : cd /tmp/ltsmin5984050139281546072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5984050139281546072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5984050139281546072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 20:04:11] [INFO ] Flatten gal took : 83 ms
[2024-05-28 20:04:11] [INFO ] Flatten gal took : 69 ms
[2024-05-28 20:04:11] [INFO ] Time to serialize gal into /tmp/LTL14251287825735736033.gal : 9 ms
[2024-05-28 20:04:11] [INFO ] Time to serialize properties into /tmp/LTL18352899642136541734.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14251287825735736033.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17146136933287034163.hoa' '-atoms' '/tmp/LTL18352899642136541734.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL18352899642136541734.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17146136933287034163.hoa
Detected timeout of ITS tools.
[2024-05-28 20:04:26] [INFO ] Flatten gal took : 94 ms
[2024-05-28 20:04:26] [INFO ] Flatten gal took : 75 ms
[2024-05-28 20:04:27] [INFO ] Time to serialize gal into /tmp/LTL12867968921512151329.gal : 15 ms
[2024-05-28 20:04:27] [INFO ] Time to serialize properties into /tmp/LTL1744408371966368086.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12867968921512151329.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1744408371966368086.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F(G("(((((((((((CreatedJobs_30<1)||(Perform_Work_B_6<1))&&((CreatedJobs_0<1)||(Perform_Work_B_0<1)))&&(((CreatedJobs_40<1)||(Perfo...14596
Formula 0 simplified : GF!"(((((((((((CreatedJobs_30<1)||(Perform_Work_B_6<1))&&((CreatedJobs_0<1)||(Perform_Work_B_0<1)))&&(((CreatedJobs_40<1)||(Perform_...14584
Detected timeout of ITS tools.
[2024-05-28 20:04:42] [INFO ] Flatten gal took : 90 ms
[2024-05-28 20:04:42] [INFO ] Applying decomposition
[2024-05-28 20:04:42] [INFO ] Flatten gal took : 67 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8536967052761114955.txt' '-o' '/tmp/graph8536967052761114955.bin' '-w' '/tmp/graph8536967052761114955.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8536967052761114955.bin' '-l' '-1' '-v' '-w' '/tmp/graph8536967052761114955.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:04:42] [INFO ] Decomposing Gal with order
[2024-05-28 20:04:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:04:42] [INFO ] Removed a total of 1332 redundant transitions.
[2024-05-28 20:04:42] [INFO ] Flatten gal took : 181 ms
[2024-05-28 20:04:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 258 labels/synchronizations in 37 ms.
[2024-05-28 20:04:42] [INFO ] Time to serialize gal into /tmp/LTL3599282833949902783.gal : 17 ms
[2024-05-28 20:04:42] [INFO ] Time to serialize properties into /tmp/LTL12451168440434815808.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3599282833949902783.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12451168440434815808.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F(G("(((((((((((i13.i0.u59.CreatedJobs_30<1)||(i13.i0.u5.Perform_Work_B_6<1))&&((i1.u54.CreatedJobs_0<1)||(i1.u1.Perform_Work_B_0<...19943
Formula 0 simplified : GF!"(((((((((((i13.i0.u59.CreatedJobs_30<1)||(i13.i0.u5.Perform_Work_B_6<1))&&((i1.u54.CreatedJobs_0<1)||(i1.u1.Perform_Work_B_0<1))...19931
Detected timeout of ITS tools.
Treatment of property PolyORBNT-COL-S05J60-LTLFireability-06 finished in 328517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(X(G(p0))))&&G(p1))))'
Support contains 126 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1237/1237 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 904 transition count 1171
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 838 transition count 1171
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 838 transition count 1106
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 773 transition count 1106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 772 transition count 1105
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 772 transition count 1105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 770 transition count 1103
Applied a total of 268 rules in 132 ms. Remains 770 /904 variables (removed 134) and now considering 1103/1237 (removed 134) transitions.
Running 1097 sub problems to find dead transitions.
[2024-05-28 20:04:58] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
// Phase 1: matrix 1099 rows 770 cols
[2024-05-28 20:04:58] [INFO ] Computed 137 invariants in 34 ms
[2024-05-28 20:04:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:05:13] [INFO ] Deduced a trap composed of 239 places in 305 ms of which 5 ms to minimize.
[2024-05-28 20:05:13] [INFO ] Deduced a trap composed of 233 places in 332 ms of which 5 ms to minimize.
[2024-05-28 20:05:14] [INFO ] Deduced a trap composed of 227 places in 325 ms of which 4 ms to minimize.
[2024-05-28 20:05:14] [INFO ] Deduced a trap composed of 236 places in 364 ms of which 5 ms to minimize.
[2024-05-28 20:05:14] [INFO ] Deduced a trap composed of 196 places in 342 ms of which 5 ms to minimize.
[2024-05-28 20:05:15] [INFO ] Deduced a trap composed of 196 places in 325 ms of which 5 ms to minimize.
[2024-05-28 20:05:15] [INFO ] Deduced a trap composed of 196 places in 371 ms of which 5 ms to minimize.
[2024-05-28 20:05:16] [INFO ] Deduced a trap composed of 196 places in 354 ms of which 10 ms to minimize.
[2024-05-28 20:05:16] [INFO ] Deduced a trap composed of 196 places in 320 ms of which 4 ms to minimize.
[2024-05-28 20:05:16] [INFO ] Deduced a trap composed of 196 places in 326 ms of which 5 ms to minimize.
[2024-05-28 20:05:17] [INFO ] Deduced a trap composed of 196 places in 308 ms of which 5 ms to minimize.
[2024-05-28 20:05:17] [INFO ] Deduced a trap composed of 196 places in 329 ms of which 5 ms to minimize.
[2024-05-28 20:05:17] [INFO ] Deduced a trap composed of 196 places in 387 ms of which 6 ms to minimize.
[2024-05-28 20:05:18] [INFO ] Deduced a trap composed of 196 places in 356 ms of which 5 ms to minimize.
[2024-05-28 20:05:18] [INFO ] Deduced a trap composed of 196 places in 365 ms of which 5 ms to minimize.
[2024-05-28 20:05:18] [INFO ] Deduced a trap composed of 196 places in 328 ms of which 5 ms to minimize.
[2024-05-28 20:05:19] [INFO ] Deduced a trap composed of 196 places in 282 ms of which 4 ms to minimize.
[2024-05-28 20:05:19] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2024-05-28 20:05:19] [INFO ] Deduced a trap composed of 196 places in 331 ms of which 5 ms to minimize.
[2024-05-28 20:05:20] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:05:20] [INFO ] Deduced a trap composed of 196 places in 331 ms of which 5 ms to minimize.
[2024-05-28 20:05:21] [INFO ] Deduced a trap composed of 196 places in 334 ms of which 5 ms to minimize.
[2024-05-28 20:05:21] [INFO ] Deduced a trap composed of 196 places in 329 ms of which 5 ms to minimize.
SMT process timed out in 23737ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 23758ms
[2024-05-28 20:05:21] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 20:05:21] [INFO ] Invariant cache hit.
[2024-05-28 20:05:22] [INFO ] Implicit Places using invariants in 837 ms returned []
[2024-05-28 20:05:22] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 20:05:22] [INFO ] Invariant cache hit.
[2024-05-28 20:05:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:05:28] [INFO ] Implicit Places using invariants and state equation in 5512 ms returned []
Implicit Place search using SMT with State Equation took 6351 ms to find 0 implicit places.
[2024-05-28 20:05:28] [INFO ] Redundant transitions in 7 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-05-28 20:05:28] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 20:05:28] [INFO ] Invariant cache hit.
[2024-05-28 20:05:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:05:42] [INFO ] Deduced a trap composed of 245 places in 294 ms of which 4 ms to minimize.
[2024-05-28 20:05:42] [INFO ] Deduced a trap composed of 196 places in 304 ms of which 4 ms to minimize.
[2024-05-28 20:05:42] [INFO ] Deduced a trap composed of 233 places in 352 ms of which 5 ms to minimize.
[2024-05-28 20:05:43] [INFO ] Deduced a trap composed of 196 places in 382 ms of which 6 ms to minimize.
[2024-05-28 20:05:43] [INFO ] Deduced a trap composed of 230 places in 344 ms of which 5 ms to minimize.
[2024-05-28 20:05:44] [INFO ] Deduced a trap composed of 196 places in 356 ms of which 5 ms to minimize.
[2024-05-28 20:05:44] [INFO ] Deduced a trap composed of 196 places in 353 ms of which 5 ms to minimize.
[2024-05-28 20:05:45] [INFO ] Deduced a trap composed of 245 places in 375 ms of which 5 ms to minimize.
[2024-05-28 20:05:45] [INFO ] Deduced a trap composed of 196 places in 283 ms of which 3 ms to minimize.
[2024-05-28 20:05:45] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2024-05-28 20:05:45] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 5 ms to minimize.
[2024-05-28 20:05:46] [INFO ] Deduced a trap composed of 196 places in 276 ms of which 4 ms to minimize.
[2024-05-28 20:05:46] [INFO ] Deduced a trap composed of 196 places in 293 ms of which 3 ms to minimize.
[2024-05-28 20:05:46] [INFO ] Deduced a trap composed of 254 places in 247 ms of which 4 ms to minimize.
[2024-05-28 20:05:47] [INFO ] Deduced a trap composed of 196 places in 311 ms of which 5 ms to minimize.
[2024-05-28 20:05:47] [INFO ] Deduced a trap composed of 196 places in 309 ms of which 4 ms to minimize.
[2024-05-28 20:05:47] [INFO ] Deduced a trap composed of 242 places in 279 ms of which 4 ms to minimize.
[2024-05-28 20:05:48] [INFO ] Deduced a trap composed of 196 places in 236 ms of which 4 ms to minimize.
[2024-05-28 20:05:48] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 4 ms to minimize.
[2024-05-28 20:05:48] [INFO ] Deduced a trap composed of 242 places in 241 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:05:49] [INFO ] Deduced a trap composed of 254 places in 320 ms of which 5 ms to minimize.
[2024-05-28 20:05:49] [INFO ] Deduced a trap composed of 245 places in 248 ms of which 3 ms to minimize.
[2024-05-28 20:05:50] [INFO ] Deduced a trap composed of 248 places in 323 ms of which 5 ms to minimize.
[2024-05-28 20:05:50] [INFO ] Deduced a trap composed of 196 places in 329 ms of which 6 ms to minimize.
[2024-05-28 20:05:50] [INFO ] Deduced a trap composed of 251 places in 241 ms of which 3 ms to minimize.
[2024-05-28 20:05:51] [INFO ] Deduced a trap composed of 196 places in 303 ms of which 4 ms to minimize.
[2024-05-28 20:05:51] [INFO ] Deduced a trap composed of 233 places in 247 ms of which 3 ms to minimize.
[2024-05-28 20:05:51] [INFO ] Deduced a trap composed of 236 places in 251 ms of which 3 ms to minimize.
[2024-05-28 20:05:52] [INFO ] Deduced a trap composed of 196 places in 328 ms of which 5 ms to minimize.
[2024-05-28 20:05:52] [INFO ] Deduced a trap composed of 230 places in 261 ms of which 4 ms to minimize.
[2024-05-28 20:05:52] [INFO ] Deduced a trap composed of 260 places in 264 ms of which 4 ms to minimize.
[2024-05-28 20:05:52] [INFO ] Deduced a trap composed of 236 places in 249 ms of which 3 ms to minimize.
[2024-05-28 20:05:53] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 4 ms to minimize.
[2024-05-28 20:05:53] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 3 ms to minimize.
[2024-05-28 20:05:53] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 3 ms to minimize.
[2024-05-28 20:05:54] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 4 ms to minimize.
[2024-05-28 20:05:54] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
[2024-05-28 20:05:54] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 3 ms to minimize.
[2024-05-28 20:05:54] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 3 ms to minimize.
[2024-05-28 20:05:55] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:06:05] [INFO ] Deduced a trap composed of 200 places in 379 ms of which 5 ms to minimize.
[2024-05-28 20:06:06] [INFO ] Deduced a trap composed of 196 places in 349 ms of which 5 ms to minimize.
[2024-05-28 20:06:06] [INFO ] Deduced a trap composed of 196 places in 369 ms of which 5 ms to minimize.
[2024-05-28 20:06:06] [INFO ] Deduced a trap composed of 196 places in 286 ms of which 4 ms to minimize.
[2024-05-28 20:06:07] [INFO ] Deduced a trap composed of 200 places in 228 ms of which 5 ms to minimize.
[2024-05-28 20:06:07] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 3 ms to minimize.
[2024-05-28 20:06:07] [INFO ] Deduced a trap composed of 200 places in 240 ms of which 4 ms to minimize.
[2024-05-28 20:06:08] [INFO ] Deduced a trap composed of 196 places in 319 ms of which 4 ms to minimize.
[2024-05-28 20:06:08] [INFO ] Deduced a trap composed of 200 places in 303 ms of which 6 ms to minimize.
[2024-05-28 20:06:08] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 4 ms to minimize.
[2024-05-28 20:06:08] [INFO ] Deduced a trap composed of 196 places in 279 ms of which 4 ms to minimize.
[2024-05-28 20:06:09] [INFO ] Deduced a trap composed of 200 places in 267 ms of which 4 ms to minimize.
[2024-05-28 20:06:09] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 3 ms to minimize.
[2024-05-28 20:06:09] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 4 ms to minimize.
[2024-05-28 20:06:10] [INFO ] Deduced a trap composed of 196 places in 282 ms of which 4 ms to minimize.
[2024-05-28 20:06:10] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 4 ms to minimize.
[2024-05-28 20:06:10] [INFO ] Deduced a trap composed of 200 places in 291 ms of which 4 ms to minimize.
[2024-05-28 20:06:10] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
[2024-05-28 20:06:11] [INFO ] Deduced a trap composed of 200 places in 277 ms of which 4 ms to minimize.
[2024-05-28 20:06:11] [INFO ] Deduced a trap composed of 196 places in 277 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:06:14] [INFO ] Deduced a trap composed of 249 places in 264 ms of which 4 ms to minimize.
[2024-05-28 20:06:14] [INFO ] Deduced a trap composed of 248 places in 307 ms of which 6 ms to minimize.
[2024-05-28 20:06:15] [INFO ] Deduced a trap composed of 237 places in 317 ms of which 4 ms to minimize.
[2024-05-28 20:06:15] [INFO ] Deduced a trap composed of 230 places in 298 ms of which 4 ms to minimize.
[2024-05-28 20:06:15] [INFO ] Deduced a trap composed of 248 places in 276 ms of which 4 ms to minimize.
[2024-05-28 20:06:16] [INFO ] Deduced a trap composed of 255 places in 275 ms of which 4 ms to minimize.
[2024-05-28 20:06:16] [INFO ] Deduced a trap composed of 237 places in 265 ms of which 5 ms to minimize.
[2024-05-28 20:06:16] [INFO ] Deduced a trap composed of 248 places in 261 ms of which 4 ms to minimize.
[2024-05-28 20:06:16] [INFO ] Deduced a trap composed of 242 places in 245 ms of which 4 ms to minimize.
[2024-05-28 20:06:17] [INFO ] Deduced a trap composed of 236 places in 239 ms of which 4 ms to minimize.
[2024-05-28 20:06:17] [INFO ] Deduced a trap composed of 254 places in 259 ms of which 4 ms to minimize.
[2024-05-28 20:06:17] [INFO ] Deduced a trap composed of 245 places in 338 ms of which 5 ms to minimize.
[2024-05-28 20:06:18] [INFO ] Deduced a trap composed of 196 places in 392 ms of which 6 ms to minimize.
[2024-05-28 20:06:18] [INFO ] Deduced a trap composed of 196 places in 324 ms of which 17 ms to minimize.
[2024-05-28 20:06:19] [INFO ] Deduced a trap composed of 216 places in 305 ms of which 4 ms to minimize.
[2024-05-28 20:06:19] [INFO ] Deduced a trap composed of 196 places in 307 ms of which 3 ms to minimize.
[2024-05-28 20:06:19] [INFO ] Deduced a trap composed of 196 places in 363 ms of which 6 ms to minimize.
[2024-05-28 20:06:20] [INFO ] Deduced a trap composed of 196 places in 306 ms of which 4 ms to minimize.
[2024-05-28 20:06:20] [INFO ] Deduced a trap composed of 261 places in 290 ms of which 4 ms to minimize.
[2024-05-28 20:06:20] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 212 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 80/80 constraints]
After SMT, in 62320ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62330ms
Starting structural reductions in SI_LTL mode, iteration 1 : 770/904 places, 1103/1237 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92596 ms. Remains : 770/904 places, 1103/1237 transitions.
Stuttering acceptance computed with spot in 457 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLFireability-08
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J60-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLFireability-08 finished in 93098 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(F(((!p2 U G(p0))||p1)))))))'
Support contains 64 out of 904 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1237/1237 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1236
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1236
Applied a total of 2 rules in 34 ms. Remains 903 /904 variables (removed 1) and now considering 1236/1237 (removed 1) transitions.
Running 1230 sub problems to find dead transitions.
[2024-05-28 20:06:31] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
// Phase 1: matrix 1232 rows 903 cols
[2024-05-28 20:06:31] [INFO ] Computed 137 invariants in 18 ms
[2024-05-28 20:06:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 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 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 43099ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 43114ms
[2024-05-28 20:07:14] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 20:07:14] [INFO ] Invariant cache hit.
[2024-05-28 20:07:15] [INFO ] Implicit Places using invariants in 1065 ms returned []
[2024-05-28 20:07:15] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 20:07:15] [INFO ] Invariant cache hit.
[2024-05-28 20:07:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:07:21] [INFO ] Implicit Places using invariants and state equation in 6042 ms returned []
Implicit Place search using SMT with State Equation took 7135 ms to find 0 implicit places.
Running 1230 sub problems to find dead transitions.
[2024-05-28 20:07:21] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 20:07:21] [INFO ] Invariant cache hit.
[2024-05-28 20:07:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-28 20:08:19] [INFO ] Deduced a trap composed of 304 places in 365 ms of which 4 ms to minimize.
[2024-05-28 20:08:20] [INFO ] Deduced a trap composed of 12 places in 351 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 138 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 2/2 constraints]
After SMT, in 63005ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 63027ms
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1236/1237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113319 ms. Remains : 903/904 places, 1236/1237 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J60-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLFireability-10 finished in 113551 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(F(!p0))||G(p1))))'
Support contains 64 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1237/1237 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1236
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1236
Applied a total of 2 rules in 39 ms. Remains 903 /904 variables (removed 1) and now considering 1236/1237 (removed 1) transitions.
Running 1230 sub problems to find dead transitions.
[2024-05-28 20:08:24] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 20:08:24] [INFO ] Invariant cache hit.
[2024-05-28 20:08:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 2)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 1)
(s187 0)
(s188 timeout
0)
(s189 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 43380ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 43398ms
[2024-05-28 20:09:07] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 20:09:07] [INFO ] Invariant cache hit.
[2024-05-28 20:09:08] [INFO ] Implicit Places using invariants in 1031 ms returned []
[2024-05-28 20:09:08] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 20:09:08] [INFO ] Invariant cache hit.
[2024-05-28 20:09:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:09:13] [INFO ] Implicit Places using invariants and state equation in 4605 ms returned []
Implicit Place search using SMT with State Equation took 5639 ms to find 0 implicit places.
Running 1230 sub problems to find dead transitions.
[2024-05-28 20:09:13] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 20:09:13] [INFO ] Invariant cache hit.
[2024-05-28 20:09:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-28 20:10:11] [INFO ] Deduced a trap composed of 304 places in 409 ms of which 6 ms to minimize.
[2024-05-28 20:10:11] [INFO ] Deduced a trap composed of 12 places in 378 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 138 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 2/2 constraints]
After SMT, in 62319ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 62343ms
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1236/1237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111431 ms. Remains : 903/904 places, 1236/1237 transitions.
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLFireability-11
Product exploration explored 100000 steps with 6889 reset in 685 ms.
Product exploration explored 100000 steps with 6909 reset in 728 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 p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 144 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) p0), p0, p0]
RANDOM walk for 40000 steps (2713 resets) in 307 ms. (129 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (453 resets) in 1296 ms. (30 steps per ms) remains 1/1 properties
[2024-05-28 20:10:18] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 20:10:18] [INFO ] Invariant cache hit.
[2024-05-28 20:10:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 510/574 variables, 64/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 574/2135 variables, and 65 constraints, problems are : Problem set: 1 solved, 0 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 64/131 constraints, Generalized P Invariants (flows): 1/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 311ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 8 factoid took 173 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) p0), p0, p0]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) p0), p0, p0]
Support contains 64 out of 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1236/1236 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 903 transition count 1171
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 838 transition count 1171
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 130 place count 838 transition count 1106
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 260 place count 773 transition count 1106
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 266 place count 770 transition count 1103
Applied a total of 266 rules in 94 ms. Remains 770 /903 variables (removed 133) and now considering 1103/1236 (removed 133) transitions.
Running 1097 sub problems to find dead transitions.
[2024-05-28 20:10:19] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
// Phase 1: matrix 1099 rows 770 cols
[2024-05-28 20:10:19] [INFO ] Computed 137 invariants in 31 ms
[2024-05-28 20:10:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:10:33] [INFO ] Deduced a trap composed of 239 places in 235 ms of which 4 ms to minimize.
[2024-05-28 20:10:33] [INFO ] Deduced a trap composed of 233 places in 232 ms of which 4 ms to minimize.
[2024-05-28 20:10:34] [INFO ] Deduced a trap composed of 227 places in 245 ms of which 4 ms to minimize.
[2024-05-28 20:10:34] [INFO ] Deduced a trap composed of 236 places in 280 ms of which 4 ms to minimize.
[2024-05-28 20:10:34] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
[2024-05-28 20:10:35] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 4 ms to minimize.
[2024-05-28 20:10:35] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 4 ms to minimize.
[2024-05-28 20:10:35] [INFO ] Deduced a trap composed of 196 places in 255 ms of which 4 ms to minimize.
[2024-05-28 20:10:35] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 4 ms to minimize.
[2024-05-28 20:10:36] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 3 ms to minimize.
[2024-05-28 20:10:36] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 4 ms to minimize.
[2024-05-28 20:10:36] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 3 ms to minimize.
[2024-05-28 20:10:36] [INFO ] Deduced a trap composed of 196 places in 236 ms of which 4 ms to minimize.
[2024-05-28 20:10:37] [INFO ] Deduced a trap composed of 196 places in 326 ms of which 5 ms to minimize.
[2024-05-28 20:10:37] [INFO ] Deduced a trap composed of 196 places in 307 ms of which 5 ms to minimize.
[2024-05-28 20:10:37] [INFO ] Deduced a trap composed of 196 places in 282 ms of which 4 ms to minimize.
[2024-05-28 20:10:38] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 3 ms to minimize.
[2024-05-28 20:10:38] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 3 ms to minimize.
[2024-05-28 20:10:38] [INFO ] Deduced a trap composed of 196 places in 255 ms of which 4 ms to minimize.
[2024-05-28 20:10:38] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:10:39] [INFO ] Deduced a trap composed of 196 places in 324 ms of which 5 ms to minimize.
[2024-05-28 20:10:40] [INFO ] Deduced a trap composed of 196 places in 321 ms of which 5 ms to minimize.
[2024-05-28 20:10:40] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 3 ms to minimize.
[2024-05-28 20:10:40] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 3 ms to minimize.
[2024-05-28 20:10:40] [INFO ] Deduced a trap composed of 196 places in 292 ms of which 5 ms to minimize.
[2024-05-28 20:10:41] [INFO ] Deduced a trap composed of 196 places in 311 ms of which 5 ms to minimize.
[2024-05-28 20:10:41] [INFO ] Deduced a trap composed of 196 places in 255 ms of which 4 ms to minimize.
[2024-05-28 20:10:41] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 4 ms to minimize.
[2024-05-28 20:10:42] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 4 ms to minimize.
[2024-05-28 20:10:42] [INFO ] Deduced a trap composed of 196 places in 315 ms of which 3 ms to minimize.
[2024-05-28 20:10:42] [INFO ] Deduced a trap composed of 196 places in 295 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 163 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 31/163 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:10:46] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 3 ms to minimize.
[2024-05-28 20:10:53] [INFO ] Deduced a trap composed of 140 places in 339 ms of which 6 ms to minimize.
[2024-05-28 20:10:54] [INFO ] Deduced a trap composed of 180 places in 298 ms of which 3 ms to minimize.
[2024-05-28 20:10:54] [INFO ] Deduced a trap composed of 290 places in 255 ms of which 4 ms to minimize.
[2024-05-28 20:10:54] [INFO ] Deduced a trap composed of 300 places in 265 ms of which 4 ms to minimize.
[2024-05-28 20:10:55] [INFO ] Deduced a trap composed of 13 places in 371 ms of which 5 ms to minimize.
[2024-05-28 20:10:59] [INFO ] Deduced a trap composed of 242 places in 296 ms of which 5 ms to minimize.
[2024-05-28 20:11:00] [INFO ] Deduced a trap composed of 251 places in 284 ms of which 5 ms to minimize.
[2024-05-28 20:11:00] [INFO ] Deduced a trap composed of 239 places in 256 ms of which 4 ms to minimize.
[2024-05-28 20:11:00] [INFO ] Deduced a trap composed of 257 places in 268 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 10/173 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:11:02] [INFO ] Deduced a trap composed of 220 places in 365 ms of which 5 ms to minimize.
SMT process timed out in 43563ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 43580ms
[2024-05-28 20:11:02] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 20:11:02] [INFO ] Invariant cache hit.
[2024-05-28 20:11:03] [INFO ] Implicit Places using invariants in 897 ms returned []
[2024-05-28 20:11:03] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 20:11:03] [INFO ] Invariant cache hit.
[2024-05-28 20:11:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:11:10] [INFO ] Implicit Places using invariants and state equation in 6579 ms returned []
Implicit Place search using SMT with State Equation took 7492 ms to find 0 implicit places.
[2024-05-28 20:11:10] [INFO ] Redundant transitions in 24 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-05-28 20:11:10] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 20:11:10] [INFO ] Invariant cache hit.
[2024-05-28 20:11:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:11:23] [INFO ] Deduced a trap composed of 245 places in 270 ms of which 4 ms to minimize.
[2024-05-28 20:11:24] [INFO ] Deduced a trap composed of 196 places in 255 ms of which 4 ms to minimize.
[2024-05-28 20:11:24] [INFO ] Deduced a trap composed of 233 places in 246 ms of which 4 ms to minimize.
[2024-05-28 20:11:24] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 4 ms to minimize.
[2024-05-28 20:11:25] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 4 ms to minimize.
[2024-05-28 20:11:25] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 3 ms to minimize.
[2024-05-28 20:11:25] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 3 ms to minimize.
[2024-05-28 20:11:25] [INFO ] Deduced a trap composed of 245 places in 251 ms of which 3 ms to minimize.
[2024-05-28 20:11:26] [INFO ] Deduced a trap composed of 196 places in 281 ms of which 4 ms to minimize.
[2024-05-28 20:11:26] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 4 ms to minimize.
[2024-05-28 20:11:26] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 4 ms to minimize.
[2024-05-28 20:11:27] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 3 ms to minimize.
[2024-05-28 20:11:27] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 3 ms to minimize.
[2024-05-28 20:11:27] [INFO ] Deduced a trap composed of 254 places in 249 ms of which 4 ms to minimize.
[2024-05-28 20:11:27] [INFO ] Deduced a trap composed of 196 places in 233 ms of which 3 ms to minimize.
[2024-05-28 20:11:28] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 4 ms to minimize.
[2024-05-28 20:11:28] [INFO ] Deduced a trap composed of 242 places in 267 ms of which 4 ms to minimize.
[2024-05-28 20:11:28] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
[2024-05-28 20:11:29] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 4 ms to minimize.
[2024-05-28 20:11:29] [INFO ] Deduced a trap composed of 242 places in 240 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:11:30] [INFO ] Deduced a trap composed of 254 places in 253 ms of which 3 ms to minimize.
[2024-05-28 20:11:30] [INFO ] Deduced a trap composed of 245 places in 262 ms of which 3 ms to minimize.
[2024-05-28 20:11:30] [INFO ] Deduced a trap composed of 248 places in 253 ms of which 4 ms to minimize.
[2024-05-28 20:11:30] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 4 ms to minimize.
[2024-05-28 20:11:31] [INFO ] Deduced a trap composed of 251 places in 245 ms of which 4 ms to minimize.
[2024-05-28 20:11:31] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 4 ms to minimize.
[2024-05-28 20:11:31] [INFO ] Deduced a trap composed of 233 places in 244 ms of which 3 ms to minimize.
[2024-05-28 20:11:32] [INFO ] Deduced a trap composed of 236 places in 224 ms of which 4 ms to minimize.
[2024-05-28 20:11:32] [INFO ] Deduced a trap composed of 196 places in 236 ms of which 4 ms to minimize.
[2024-05-28 20:11:32] [INFO ] Deduced a trap composed of 230 places in 224 ms of which 4 ms to minimize.
[2024-05-28 20:11:32] [INFO ] Deduced a trap composed of 260 places in 231 ms of which 4 ms to minimize.
[2024-05-28 20:11:33] [INFO ] Deduced a trap composed of 236 places in 236 ms of which 4 ms to minimize.
[2024-05-28 20:11:33] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 4 ms to minimize.
[2024-05-28 20:11:33] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 3 ms to minimize.
[2024-05-28 20:11:33] [INFO ] Deduced a trap composed of 196 places in 290 ms of which 4 ms to minimize.
[2024-05-28 20:11:34] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
[2024-05-28 20:11:34] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 4 ms to minimize.
[2024-05-28 20:11:34] [INFO ] Deduced a trap composed of 196 places in 222 ms of which 4 ms to minimize.
[2024-05-28 20:11:35] [INFO ] Deduced a trap composed of 196 places in 343 ms of which 5 ms to minimize.
[2024-05-28 20:11:35] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:11:48] [INFO ] Deduced a trap composed of 200 places in 287 ms of which 4 ms to minimize.
[2024-05-28 20:11:48] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
[2024-05-28 20:11:48] [INFO ] Deduced a trap composed of 196 places in 275 ms of which 4 ms to minimize.
[2024-05-28 20:11:49] [INFO ] Deduced a trap composed of 196 places in 282 ms of which 4 ms to minimize.
[2024-05-28 20:11:49] [INFO ] Deduced a trap composed of 200 places in 288 ms of which 4 ms to minimize.
[2024-05-28 20:11:49] [INFO ] Deduced a trap composed of 196 places in 296 ms of which 5 ms to minimize.
[2024-05-28 20:11:50] [INFO ] Deduced a trap composed of 200 places in 295 ms of which 5 ms to minimize.
[2024-05-28 20:11:50] [INFO ] Deduced a trap composed of 196 places in 335 ms of which 4 ms to minimize.
[2024-05-28 20:11:50] [INFO ] Deduced a trap composed of 200 places in 287 ms of which 4 ms to minimize.
[2024-05-28 20:11:51] [INFO ] Deduced a trap composed of 196 places in 287 ms of which 4 ms to minimize.
[2024-05-28 20:11:51] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 4 ms to minimize.
[2024-05-28 20:11:51] [INFO ] Deduced a trap composed of 200 places in 301 ms of which 4 ms to minimize.
[2024-05-28 20:11:51] [INFO ] Deduced a trap composed of 196 places in 328 ms of which 4 ms to minimize.
[2024-05-28 20:11:52] [INFO ] Deduced a trap composed of 196 places in 286 ms of which 4 ms to minimize.
[2024-05-28 20:11:52] [INFO ] Deduced a trap composed of 196 places in 276 ms of which 4 ms to minimize.
[2024-05-28 20:11:52] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 4 ms to minimize.
[2024-05-28 20:11:53] [INFO ] Deduced a trap composed of 200 places in 277 ms of which 4 ms to minimize.
[2024-05-28 20:11:53] [INFO ] Deduced a trap composed of 196 places in 284 ms of which 4 ms to minimize.
[2024-05-28 20:11:53] [INFO ] Deduced a trap composed of 200 places in 275 ms of which 4 ms to minimize.
[2024-05-28 20:11:54] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:11:56] [INFO ] Deduced a trap composed of 249 places in 307 ms of which 4 ms to minimize.
[2024-05-28 20:11:57] [INFO ] Deduced a trap composed of 248 places in 281 ms of which 4 ms to minimize.
[2024-05-28 20:11:57] [INFO ] Deduced a trap composed of 237 places in 260 ms of which 3 ms to minimize.
[2024-05-28 20:11:57] [INFO ] Deduced a trap composed of 230 places in 253 ms of which 4 ms to minimize.
[2024-05-28 20:11:58] [INFO ] Deduced a trap composed of 248 places in 241 ms of which 5 ms to minimize.
[2024-05-28 20:11:58] [INFO ] Deduced a trap composed of 255 places in 279 ms of which 4 ms to minimize.
[2024-05-28 20:11:58] [INFO ] Deduced a trap composed of 237 places in 246 ms of which 4 ms to minimize.
[2024-05-28 20:11:59] [INFO ] Deduced a trap composed of 248 places in 268 ms of which 4 ms to minimize.
[2024-05-28 20:11:59] [INFO ] Deduced a trap composed of 242 places in 250 ms of which 4 ms to minimize.
[2024-05-28 20:11:59] [INFO ] Deduced a trap composed of 236 places in 262 ms of which 4 ms to minimize.
[2024-05-28 20:11:59] [INFO ] Deduced a trap composed of 254 places in 239 ms of which 4 ms to minimize.
[2024-05-28 20:12:00] [INFO ] Deduced a trap composed of 245 places in 290 ms of which 4 ms to minimize.
[2024-05-28 20:12:00] [INFO ] Deduced a trap composed of 196 places in 308 ms of which 4 ms to minimize.
[2024-05-28 20:12:01] [INFO ] Deduced a trap composed of 196 places in 266 ms of which 6 ms to minimize.
[2024-05-28 20:12:01] [INFO ] Deduced a trap composed of 216 places in 265 ms of which 3 ms to minimize.
[2024-05-28 20:12:01] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 4 ms to minimize.
[2024-05-28 20:12:01] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 4 ms to minimize.
[2024-05-28 20:12:02] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 4 ms to minimize.
[2024-05-28 20:12:02] [INFO ] Deduced a trap composed of 261 places in 279 ms of which 4 ms to minimize.
[2024-05-28 20:12:02] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 212 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 80/80 constraints]
After SMT, in 63162ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 63183ms
Starting structural reductions in SI_LTL mode, iteration 1 : 770/903 places, 1103/1236 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114396 ms. Remains : 770/903 places, 1103/1236 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 125 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) p0), p0, p0]
RANDOM walk for 40000 steps (2079 resets) in 416 ms. (95 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (128 resets) in 423 ms. (94 steps per ms) remains 1/1 properties
[2024-05-28 20:12:14] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 20:12:14] [INFO ] Invariant cache hit.
[2024-05-28 20:12:14] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 375/439 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 305/744 variables, 61/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/744 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/756 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 767/1869 variables, and 135 constraints, problems are : Problem set: 1 solved, 0 unsolved in 355 ms.
Refiners :[Positive P Invariants (semi-flows): 128/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 409ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 8 factoid took 155 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) p0), p0, p0]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) p0), p0, p0]
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) p0), p0, p0]
Product exploration explored 100000 steps with 5353 reset in 1073 ms.
Product exploration explored 100000 steps with 5284 reset in 903 ms.
Built C files in :
/tmp/ltsmin18020620819153090904
[2024-05-28 20:12:17] [INFO ] Computing symmetric may disable matrix : 1103 transitions.
[2024-05-28 20:12:17] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:12:17] [INFO ] Computing symmetric may enable matrix : 1103 transitions.
[2024-05-28 20:12:17] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:12:17] [INFO ] Computing Do-Not-Accords matrix : 1103 transitions.
[2024-05-28 20:12:17] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:12:17] [INFO ] Built C files in 236ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18020620819153090904
Running compilation step : cd /tmp/ltsmin18020620819153090904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18020620819153090904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18020620819153090904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 64 out of 770 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 43 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Running 1097 sub problems to find dead transitions.
[2024-05-28 20:12:20] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 20:12:20] [INFO ] Invariant cache hit.
[2024-05-28 20:12:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:12:33] [INFO ] Deduced a trap composed of 245 places in 544 ms of which 4 ms to minimize.
[2024-05-28 20:12:34] [INFO ] Deduced a trap composed of 196 places in 283 ms of which 4 ms to minimize.
[2024-05-28 20:12:34] [INFO ] Deduced a trap composed of 233 places in 445 ms of which 8 ms to minimize.
[2024-05-28 20:12:35] [INFO ] Deduced a trap composed of 196 places in 404 ms of which 4 ms to minimize.
[2024-05-28 20:12:35] [INFO ] Deduced a trap composed of 230 places in 261 ms of which 4 ms to minimize.
[2024-05-28 20:12:35] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2024-05-28 20:12:36] [INFO ] Deduced a trap composed of 196 places in 285 ms of which 3 ms to minimize.
[2024-05-28 20:12:36] [INFO ] Deduced a trap composed of 245 places in 266 ms of which 4 ms to minimize.
[2024-05-28 20:12:36] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 3 ms to minimize.
[2024-05-28 20:12:36] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2024-05-28 20:12:37] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 3 ms to minimize.
[2024-05-28 20:12:37] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 4 ms to minimize.
[2024-05-28 20:12:37] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 3 ms to minimize.
[2024-05-28 20:12:38] [INFO ] Deduced a trap composed of 254 places in 257 ms of which 4 ms to minimize.
[2024-05-28 20:12:38] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 4 ms to minimize.
[2024-05-28 20:12:38] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 4 ms to minimize.
[2024-05-28 20:12:39] [INFO ] Deduced a trap composed of 242 places in 342 ms of which 4 ms to minimize.
[2024-05-28 20:12:39] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 4 ms to minimize.
[2024-05-28 20:12:39] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
[2024-05-28 20:12:39] [INFO ] Deduced a trap composed of 242 places in 278 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:12:40] [INFO ] Deduced a trap composed of 254 places in 243 ms of which 3 ms to minimize.
[2024-05-28 20:12:40] [INFO ] Deduced a trap composed of 245 places in 273 ms of which 4 ms to minimize.
[2024-05-28 20:12:41] [INFO ] Deduced a trap composed of 248 places in 270 ms of which 4 ms to minimize.
[2024-05-28 20:12:41] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 4 ms to minimize.
[2024-05-28 20:12:42] [INFO ] Deduced a trap composed of 251 places in 261 ms of which 4 ms to minimize.
[2024-05-28 20:12:42] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2024-05-28 20:12:42] [INFO ] Deduced a trap composed of 233 places in 264 ms of which 4 ms to minimize.
[2024-05-28 20:12:42] [INFO ] Deduced a trap composed of 236 places in 254 ms of which 3 ms to minimize.
[2024-05-28 20:12:43] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 21 ms to minimize.
SMT process timed out in 22754ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 22770ms
[2024-05-28 20:12:43] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 20:12:43] [INFO ] Invariant cache hit.
[2024-05-28 20:12:43] [INFO ] Implicit Places using invariants in 728 ms returned []
[2024-05-28 20:12:43] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 20:12:43] [INFO ] Invariant cache hit.
[2024-05-28 20:12:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:12:49] [INFO ] Implicit Places using invariants and state equation in 5863 ms returned []
Implicit Place search using SMT with State Equation took 6606 ms to find 0 implicit places.
[2024-05-28 20:12:49] [INFO ] Redundant transitions in 22 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-05-28 20:12:49] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 20:12:49] [INFO ] Invariant cache hit.
[2024-05-28 20:12:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:13:02] [INFO ] Deduced a trap composed of 245 places in 279 ms of which 3 ms to minimize.
[2024-05-28 20:13:03] [INFO ] Deduced a trap composed of 196 places in 290 ms of which 4 ms to minimize.
[2024-05-28 20:13:03] [INFO ] Deduced a trap composed of 233 places in 261 ms of which 4 ms to minimize.
[2024-05-28 20:13:03] [INFO ] Deduced a trap composed of 196 places in 292 ms of which 4 ms to minimize.
[2024-05-28 20:13:03] [INFO ] Deduced a trap composed of 230 places in 267 ms of which 4 ms to minimize.
[2024-05-28 20:13:04] [INFO ] Deduced a trap composed of 196 places in 276 ms of which 3 ms to minimize.
[2024-05-28 20:13:04] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2024-05-28 20:13:04] [INFO ] Deduced a trap composed of 245 places in 264 ms of which 4 ms to minimize.
[2024-05-28 20:13:05] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 3 ms to minimize.
[2024-05-28 20:13:05] [INFO ] Deduced a trap composed of 196 places in 280 ms of which 4 ms to minimize.
[2024-05-28 20:13:05] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 4 ms to minimize.
[2024-05-28 20:13:06] [INFO ] Deduced a trap composed of 196 places in 273 ms of which 4 ms to minimize.
[2024-05-28 20:13:06] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 3 ms to minimize.
[2024-05-28 20:13:06] [INFO ] Deduced a trap composed of 254 places in 269 ms of which 4 ms to minimize.
[2024-05-28 20:13:07] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 4 ms to minimize.
[2024-05-28 20:13:07] [INFO ] Deduced a trap composed of 196 places in 275 ms of which 3 ms to minimize.
[2024-05-28 20:13:07] [INFO ] Deduced a trap composed of 242 places in 277 ms of which 4 ms to minimize.
[2024-05-28 20:13:08] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-05-28 20:13:08] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 4 ms to minimize.
[2024-05-28 20:13:08] [INFO ] Deduced a trap composed of 242 places in 279 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:13:09] [INFO ] Deduced a trap composed of 254 places in 256 ms of which 4 ms to minimize.
[2024-05-28 20:13:09] [INFO ] Deduced a trap composed of 245 places in 262 ms of which 4 ms to minimize.
[2024-05-28 20:13:09] [INFO ] Deduced a trap composed of 248 places in 257 ms of which 4 ms to minimize.
[2024-05-28 20:13:10] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 4 ms to minimize.
[2024-05-28 20:13:10] [INFO ] Deduced a trap composed of 251 places in 262 ms of which 3 ms to minimize.
[2024-05-28 20:13:10] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 4 ms to minimize.
[2024-05-28 20:13:11] [INFO ] Deduced a trap composed of 233 places in 344 ms of which 5 ms to minimize.
[2024-05-28 20:13:11] [INFO ] Deduced a trap composed of 236 places in 333 ms of which 5 ms to minimize.
[2024-05-28 20:13:12] [INFO ] Deduced a trap composed of 196 places in 326 ms of which 5 ms to minimize.
[2024-05-28 20:13:12] [INFO ] Deduced a trap composed of 230 places in 294 ms of which 4 ms to minimize.
[2024-05-28 20:13:12] [INFO ] Deduced a trap composed of 260 places in 245 ms of which 4 ms to minimize.
[2024-05-28 20:13:12] [INFO ] Deduced a trap composed of 236 places in 245 ms of which 4 ms to minimize.
[2024-05-28 20:13:13] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 4 ms to minimize.
[2024-05-28 20:13:13] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 3 ms to minimize.
[2024-05-28 20:13:13] [INFO ] Deduced a trap composed of 196 places in 276 ms of which 3 ms to minimize.
[2024-05-28 20:13:14] [INFO ] Deduced a trap composed of 196 places in 331 ms of which 6 ms to minimize.
[2024-05-28 20:13:14] [INFO ] Deduced a trap composed of 196 places in 303 ms of which 5 ms to minimize.
[2024-05-28 20:13:14] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 4 ms to minimize.
[2024-05-28 20:13:14] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2024-05-28 20:13:15] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:13:28] [INFO ] Deduced a trap composed of 200 places in 357 ms of which 5 ms to minimize.
[2024-05-28 20:13:29] [INFO ] Deduced a trap composed of 196 places in 382 ms of which 5 ms to minimize.
[2024-05-28 20:13:29] [INFO ] Deduced a trap composed of 196 places in 281 ms of which 4 ms to minimize.
[2024-05-28 20:13:29] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 4 ms to minimize.
[2024-05-28 20:13:30] [INFO ] Deduced a trap composed of 200 places in 246 ms of which 3 ms to minimize.
[2024-05-28 20:13:30] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2024-05-28 20:13:30] [INFO ] Deduced a trap composed of 200 places in 252 ms of which 3 ms to minimize.
[2024-05-28 20:13:31] [INFO ] Deduced a trap composed of 196 places in 281 ms of which 3 ms to minimize.
[2024-05-28 20:13:31] [INFO ] Deduced a trap composed of 200 places in 271 ms of which 3 ms to minimize.
[2024-05-28 20:13:31] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 3 ms to minimize.
[2024-05-28 20:13:31] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 3 ms to minimize.
[2024-05-28 20:13:32] [INFO ] Deduced a trap composed of 200 places in 231 ms of which 4 ms to minimize.
[2024-05-28 20:13:32] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 3 ms to minimize.
[2024-05-28 20:13:32] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 4 ms to minimize.
[2024-05-28 20:13:32] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 3 ms to minimize.
[2024-05-28 20:13:33] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 3 ms to minimize.
[2024-05-28 20:13:33] [INFO ] Deduced a trap composed of 200 places in 265 ms of which 3 ms to minimize.
[2024-05-28 20:13:33] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2024-05-28 20:13:34] [INFO ] Deduced a trap composed of 200 places in 259 ms of which 4 ms to minimize.
[2024-05-28 20:13:34] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:13:37] [INFO ] Deduced a trap composed of 249 places in 282 ms of which 3 ms to minimize.
[2024-05-28 20:13:37] [INFO ] Deduced a trap composed of 248 places in 289 ms of which 4 ms to minimize.
[2024-05-28 20:13:37] [INFO ] Deduced a trap composed of 237 places in 256 ms of which 4 ms to minimize.
[2024-05-28 20:13:38] [INFO ] Deduced a trap composed of 230 places in 308 ms of which 5 ms to minimize.
[2024-05-28 20:13:38] [INFO ] Deduced a trap composed of 248 places in 271 ms of which 6 ms to minimize.
[2024-05-28 20:13:38] [INFO ] Deduced a trap composed of 255 places in 306 ms of which 4 ms to minimize.
[2024-05-28 20:13:39] [INFO ] Deduced a trap composed of 237 places in 238 ms of which 4 ms to minimize.
[2024-05-28 20:13:39] [INFO ] Deduced a trap composed of 248 places in 218 ms of which 4 ms to minimize.
[2024-05-28 20:13:39] [INFO ] Deduced a trap composed of 242 places in 232 ms of which 4 ms to minimize.
[2024-05-28 20:13:39] [INFO ] Deduced a trap composed of 236 places in 219 ms of which 3 ms to minimize.
[2024-05-28 20:13:40] [INFO ] Deduced a trap composed of 254 places in 319 ms of which 5 ms to minimize.
[2024-05-28 20:13:40] [INFO ] Deduced a trap composed of 245 places in 366 ms of which 5 ms to minimize.
[2024-05-28 20:13:41] [INFO ] Deduced a trap composed of 196 places in 408 ms of which 5 ms to minimize.
[2024-05-28 20:13:41] [INFO ] Deduced a trap composed of 196 places in 318 ms of which 5 ms to minimize.
[2024-05-28 20:13:41] [INFO ] Deduced a trap composed of 216 places in 321 ms of which 4 ms to minimize.
[2024-05-28 20:13:42] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 4 ms to minimize.
[2024-05-28 20:13:42] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 4 ms to minimize.
[2024-05-28 20:13:42] [INFO ] Deduced a trap composed of 196 places in 321 ms of which 5 ms to minimize.
[2024-05-28 20:13:43] [INFO ] Deduced a trap composed of 261 places in 360 ms of which 5 ms to minimize.
[2024-05-28 20:13:43] [INFO ] Deduced a trap composed of 196 places in 318 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 212 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 80/80 constraints]
After SMT, in 62923ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62937ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 92401 ms. Remains : 770/770 places, 1103/1103 transitions.
Built C files in :
/tmp/ltsmin3363774914361946899
[2024-05-28 20:13:52] [INFO ] Computing symmetric may disable matrix : 1103 transitions.
[2024-05-28 20:13:52] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:13:52] [INFO ] Computing symmetric may enable matrix : 1103 transitions.
[2024-05-28 20:13:52] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:13:53] [INFO ] Computing Do-Not-Accords matrix : 1103 transitions.
[2024-05-28 20:13:53] [INFO ] Computation of Completed DNA matrix. took 28 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:13:53] [INFO ] Built C files in 347ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3363774914361946899
Running compilation step : cd /tmp/ltsmin3363774914361946899;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3363774914361946899;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3363774914361946899;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 20:13:56] [INFO ] Flatten gal took : 59 ms
[2024-05-28 20:13:56] [INFO ] Flatten gal took : 52 ms
[2024-05-28 20:13:56] [INFO ] Time to serialize gal into /tmp/LTL15975186424580227427.gal : 9 ms
[2024-05-28 20:13:56] [INFO ] Time to serialize properties into /tmp/LTL13140808450576095652.prop : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15975186424580227427.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4145178784129298326.hoa' '-atoms' '/tmp/LTL13140808450576095652.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13140808450576095652.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4145178784129298326.hoa
Detected timeout of ITS tools.
[2024-05-28 20:14:11] [INFO ] Flatten gal took : 33 ms
[2024-05-28 20:14:11] [INFO ] Flatten gal took : 34 ms
[2024-05-28 20:14:11] [INFO ] Time to serialize gal into /tmp/LTL5141058561605865398.gal : 7 ms
[2024-05-28 20:14:11] [INFO ] Time to serialize properties into /tmp/LTL1982191527209848655.ltl : 14 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5141058561605865398.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1982191527209848655.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(place_522<3)")))||(G("(((((((((FetchJobB<1)||(mo2<1))||(f2_49<1))&&(((FetchJobB<1)||(mo2<1))||(f2_47<1)))&&((((FetchJobB<1...2548
Formula 0 simplified : X(FG!"(place_522<3)" & F!"(((((((((FetchJobB<1)||(mo2<1))||(f2_49<1))&&(((FetchJobB<1)||(mo2<1))||(f2_47<1)))&&((((FetchJobB<1)||(mo...2538
Detected timeout of ITS tools.
[2024-05-28 20:14:26] [INFO ] Flatten gal took : 62 ms
[2024-05-28 20:14:26] [INFO ] Applying decomposition
[2024-05-28 20:14:26] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2621787349187526333.txt' '-o' '/tmp/graph2621787349187526333.bin' '-w' '/tmp/graph2621787349187526333.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2621787349187526333.bin' '-l' '-1' '-v' '-w' '/tmp/graph2621787349187526333.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:14:26] [INFO ] Decomposing Gal with order
[2024-05-28 20:14:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:14:27] [INFO ] Removed a total of 1264 redundant transitions.
[2024-05-28 20:14:27] [INFO ] Flatten gal took : 241 ms
[2024-05-28 20:14:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 117 labels/synchronizations in 19 ms.
[2024-05-28 20:14:27] [INFO ] Time to serialize gal into /tmp/LTL17823966956155089460.gal : 29 ms
[2024-05-28 20:14:27] [INFO ] Time to serialize properties into /tmp/LTL3175329688147968940.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17823966956155089460.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3175329688147968940.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(i15.u26.place_522<3)")))||(G("(((((((((i0.u1.FetchJobB<1)||(i0.u1.mo2<1))||(i0.u0.f2_49<1))&&(((i0.u1.FetchJobB<1)||(i0.u1...3654
Formula 0 simplified : X(FG!"(i15.u26.place_522<3)" & F!"(((((((((i0.u1.FetchJobB<1)||(i0.u1.mo2<1))||(i0.u0.f2_49<1))&&(((i0.u1.FetchJobB<1)||(i0.u1.mo2<1...3644
Detected timeout of ITS tools.
Treatment of property PolyORBNT-COL-S05J60-LTLFireability-11 finished in 377783 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 G(!p1)))'
Support contains 4 out of 904 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 904/904 places, 1237/1237 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 904 transition count 1172
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 131 place count 839 transition count 1171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 132 place count 838 transition count 1171
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 132 place count 838 transition count 1108
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 258 place count 775 transition count 1108
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 259 place count 774 transition count 1107
Iterating global reduction 3 with 1 rules applied. Total rules applied 260 place count 774 transition count 1107
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 264 place count 772 transition count 1105
Applied a total of 264 rules in 132 ms. Remains 772 /904 variables (removed 132) and now considering 1105/1237 (removed 132) transitions.
Running 1099 sub problems to find dead transitions.
[2024-05-28 20:14:42] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
// Phase 1: matrix 1101 rows 772 cols
[2024-05-28 20:14:42] [INFO ] Computed 137 invariants in 16 ms
[2024-05-28 20:14:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 766/1873 variables, and 131 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1099/1099 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1099 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 3 (OVERLAPS) 4/770 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 1099 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 770/1873 variables, and 135 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1099 constraints, Known Traps: 0/0 constraints]
After SMT, in 43340ms problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 43352ms
[2024-05-28 20:15:25] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-05-28 20:15:25] [INFO ] Invariant cache hit.
[2024-05-28 20:15:26] [INFO ] Implicit Places using invariants in 751 ms returned []
[2024-05-28 20:15:26] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-05-28 20:15:26] [INFO ] Invariant cache hit.
[2024-05-28 20:15:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:15:35] [INFO ] Implicit Places using invariants and state equation in 8713 ms returned []
Implicit Place search using SMT with State Equation took 9468 ms to find 0 implicit places.
[2024-05-28 20:15:35] [INFO ] Redundant transitions in 22 ms returned []
Running 1099 sub problems to find dead transitions.
[2024-05-28 20:15:35] [INFO ] Flow matrix only has 1101 transitions (discarded 4 similar events)
[2024-05-28 20:15:35] [INFO ] Invariant cache hit.
[2024-05-28 20:15:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 3 (OVERLAPS) 4/770 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
(s641 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 0.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 6.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 1.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 4.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 9.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 1.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 1.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 1.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 1.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 1.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 1.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 1.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 1.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 1.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 1.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 1.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 1.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 1.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 1.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 1.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 1.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 1.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 1.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 1.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 1.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 1.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 1.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 1.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 1.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 1.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 1.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 1.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 1.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 1.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 1.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 1.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 1.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 1.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 1.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 1.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 1.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 1.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 1.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 1.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 1.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 1.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 1.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 1.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 1.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 1.0)
(s641 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 770/1873 variables, and 135 constraints, problems are : Problem set: 0 solved, 1099 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 5/7 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1099/1099 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1099 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/766 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/766 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/766 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 3 (OVERLAPS) 4/770 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/770 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD754 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD785 is UNSAT
Problem TDEAD786 is UNSAT
Problem TDEAD787 is UNSAT
Problem TDEAD789 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/772 variables, 2/137 constraints. Problems are: Problem set: 17 solved, 1082 unsolved
[2024-05-28 20:16:37] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 772/1873 variables, and 138 constraints, problems are : Problem set: 17 solved, 1082 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/772 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1099 constraints, Known Traps: 1/1 constraints]
After SMT, in 63127ms problems are : Problem set: 17 solved, 1082 unsolved
Search for dead transitions found 17 dead transitions in 63145ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 772/904 places, 1088/1237 transitions.
Applied a total of 0 rules in 23 ms. Remains 772 /772 variables (removed 0) and now considering 1088/1088 (removed 0) transitions.
[2024-05-28 20:16:38] [INFO ] Redundant transitions in 7 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 116171 ms. Remains : 772/904 places, 1088/1237 transitions.
Stuttering acceptance computed with spot in 80 ms :[p1, true, p1]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLFireability-12
Entered a terminal (fully accepting) state of product in 51 steps with 2 reset in 0 ms.
FORMULA PolyORBNT-COL-S05J60-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-COL-S05J60-LTLFireability-12 finished in 116273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 62 out of 904 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 904/904 places, 1237/1237 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 903 transition count 1236
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 903 transition count 1236
Applied a total of 2 rules in 25 ms. Remains 903 /904 variables (removed 1) and now considering 1236/1237 (removed 1) transitions.
Running 1230 sub problems to find dead transitions.
[2024-05-28 20:16:38] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
// Phase 1: matrix 1232 rows 903 cols
[2024-05-28 20:16:38] [INFO ] Computed 137 invariants in 24 ms
[2024-05-28 20:16:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 897/2135 variables, and 131 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 126/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 0/0 constraints]
After SMT, in 43333ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 43345ms
[2024-05-28 20:17:21] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 20:17:21] [INFO ] Invariant cache hit.
[2024-05-28 20:17:22] [INFO ] Implicit Places using invariants in 921 ms returned []
[2024-05-28 20:17:22] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 20:17:22] [INFO ] Invariant cache hit.
[2024-05-28 20:17:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:17:28] [INFO ] Implicit Places using invariants and state equation in 6036 ms returned []
Implicit Place search using SMT with State Equation took 6973 ms to find 0 implicit places.
Running 1230 sub problems to find dead transitions.
[2024-05-28 20:17:28] [INFO ] Flow matrix only has 1232 transitions (discarded 4 similar events)
[2024-05-28 20:17:28] [INFO ] Invariant cache hit.
[2024-05-28 20:17:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 902/2135 variables, and 136 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1230/1230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/897 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/897 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/897 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 5/902 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 304 places in 304 ms of which 5 ms to minimize.
[2024-05-28 20:18:30] [INFO ] Deduced a trap composed of 12 places in 309 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/2135 variables, and 138 constraints, problems are : Problem set: 0 solved, 1230 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 131/131 constraints, Generalized P Invariants (flows): 5/6 constraints, State Equation: 0/903 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1230 constraints, Known Traps: 2/2 constraints]
After SMT, in 62915ms problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 62926ms
Starting structural reductions in LTL mode, iteration 1 : 903/904 places, 1236/1237 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113275 ms. Remains : 903/904 places, 1236/1237 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 379 ms.
Product exploration explored 100000 steps with 33333 reset in 462 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 9 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-COL-S05J60-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-COL-S05J60-LTLFireability-15 finished in 114281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G((F(p2)&&p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(!p0))||G(p1))))'
Found a Lengthening insensitive property : PolyORBNT-COL-S05J60-LTLFireability-11
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0]
Support contains 64 out of 904 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 904/904 places, 1237/1237 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 904 transition count 1171
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 132 place count 838 transition count 1171
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 132 place count 838 transition count 1106
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 262 place count 773 transition count 1106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 263 place count 772 transition count 1105
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 772 transition count 1105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 268 place count 770 transition count 1103
Applied a total of 268 rules in 82 ms. Remains 770 /904 variables (removed 134) and now considering 1103/1237 (removed 134) transitions.
Running 1097 sub problems to find dead transitions.
[2024-05-28 20:18:33] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
// Phase 1: matrix 1099 rows 770 cols
[2024-05-28 20:18:33] [INFO ] Computed 137 invariants in 37 ms
[2024-05-28 20:18:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:18:48] [INFO ] Deduced a trap composed of 239 places in 313 ms of which 5 ms to minimize.
[2024-05-28 20:18:48] [INFO ] Deduced a trap composed of 233 places in 287 ms of which 5 ms to minimize.
[2024-05-28 20:18:48] [INFO ] Deduced a trap composed of 227 places in 279 ms of which 3 ms to minimize.
[2024-05-28 20:18:48] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 4 ms to minimize.
[2024-05-28 20:18:49] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 3 ms to minimize.
[2024-05-28 20:18:49] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 4 ms to minimize.
[2024-05-28 20:18:49] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 4 ms to minimize.
[2024-05-28 20:18:50] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 4 ms to minimize.
[2024-05-28 20:18:50] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 4 ms to minimize.
[2024-05-28 20:18:50] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 3 ms to minimize.
[2024-05-28 20:18:50] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 4 ms to minimize.
[2024-05-28 20:18:51] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 4 ms to minimize.
[2024-05-28 20:18:51] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 3 ms to minimize.
[2024-05-28 20:18:51] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 4 ms to minimize.
[2024-05-28 20:18:52] [INFO ] Deduced a trap composed of 196 places in 364 ms of which 5 ms to minimize.
[2024-05-28 20:18:52] [INFO ] Deduced a trap composed of 196 places in 303 ms of which 4 ms to minimize.
[2024-05-28 20:18:52] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
[2024-05-28 20:18:52] [INFO ] Deduced a trap composed of 196 places in 285 ms of which 4 ms to minimize.
[2024-05-28 20:18:53] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2024-05-28 20:18:53] [INFO ] Deduced a trap composed of 196 places in 272 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:18:54] [INFO ] Deduced a trap composed of 196 places in 463 ms of which 6 ms to minimize.
[2024-05-28 20:18:54] [INFO ] Deduced a trap composed of 196 places in 470 ms of which 20 ms to minimize.
[2024-05-28 20:18:55] [INFO ] Deduced a trap composed of 196 places in 302 ms of which 4 ms to minimize.
[2024-05-28 20:18:55] [INFO ] Deduced a trap composed of 196 places in 300 ms of which 4 ms to minimize.
[2024-05-28 20:18:56] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 4 ms to minimize.
[2024-05-28 20:18:56] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 4 ms to minimize.
[2024-05-28 20:18:56] [INFO ] Deduced a trap composed of 196 places in 217 ms of which 4 ms to minimize.
[2024-05-28 20:18:56] [INFO ] Deduced a trap composed of 196 places in 220 ms of which 4 ms to minimize.
[2024-05-28 20:18:57] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
SMT process timed out in 23607ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 23619ms
[2024-05-28 20:18:57] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 20:18:57] [INFO ] Invariant cache hit.
[2024-05-28 20:18:57] [INFO ] Implicit Places using invariants in 739 ms returned []
[2024-05-28 20:18:57] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 20:18:57] [INFO ] Invariant cache hit.
[2024-05-28 20:18:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:19:03] [INFO ] Implicit Places using invariants and state equation in 5341 ms returned []
Implicit Place search using SMT with State Equation took 6083 ms to find 0 implicit places.
Running 1097 sub problems to find dead transitions.
[2024-05-28 20:19:03] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 20:19:03] [INFO ] Invariant cache hit.
[2024-05-28 20:19:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:19:18] [INFO ] Deduced a trap composed of 245 places in 339 ms of which 4 ms to minimize.
[2024-05-28 20:19:18] [INFO ] Deduced a trap composed of 196 places in 328 ms of which 5 ms to minimize.
[2024-05-28 20:19:18] [INFO ] Deduced a trap composed of 233 places in 295 ms of which 3 ms to minimize.
[2024-05-28 20:19:18] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 3 ms to minimize.
[2024-05-28 20:19:19] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 3 ms to minimize.
[2024-05-28 20:19:19] [INFO ] Deduced a trap composed of 196 places in 300 ms of which 3 ms to minimize.
[2024-05-28 20:19:19] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 3 ms to minimize.
[2024-05-28 20:19:20] [INFO ] Deduced a trap composed of 245 places in 322 ms of which 3 ms to minimize.
[2024-05-28 20:19:20] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 6 ms to minimize.
[2024-05-28 20:19:21] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 5 ms to minimize.
[2024-05-28 20:19:21] [INFO ] Deduced a trap composed of 196 places in 277 ms of which 4 ms to minimize.
[2024-05-28 20:19:21] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 4 ms to minimize.
[2024-05-28 20:19:21] [INFO ] Deduced a trap composed of 196 places in 322 ms of which 4 ms to minimize.
[2024-05-28 20:19:22] [INFO ] Deduced a trap composed of 254 places in 235 ms of which 4 ms to minimize.
[2024-05-28 20:19:22] [INFO ] Deduced a trap composed of 196 places in 231 ms of which 3 ms to minimize.
[2024-05-28 20:19:22] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 3 ms to minimize.
[2024-05-28 20:19:23] [INFO ] Deduced a trap composed of 242 places in 273 ms of which 3 ms to minimize.
[2024-05-28 20:19:23] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 3 ms to minimize.
[2024-05-28 20:19:23] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 3 ms to minimize.
[2024-05-28 20:19:23] [INFO ] Deduced a trap composed of 242 places in 246 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:19:24] [INFO ] Deduced a trap composed of 254 places in 224 ms of which 4 ms to minimize.
[2024-05-28 20:19:24] [INFO ] Deduced a trap composed of 245 places in 244 ms of which 4 ms to minimize.
[2024-05-28 20:19:25] [INFO ] Deduced a trap composed of 248 places in 242 ms of which 4 ms to minimize.
[2024-05-28 20:19:25] [INFO ] Deduced a trap composed of 196 places in 234 ms of which 4 ms to minimize.
[2024-05-28 20:19:25] [INFO ] Deduced a trap composed of 251 places in 238 ms of which 4 ms to minimize.
[2024-05-28 20:19:25] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 3 ms to minimize.
[2024-05-28 20:19:26] [INFO ] Deduced a trap composed of 233 places in 235 ms of which 3 ms to minimize.
[2024-05-28 20:19:26] [INFO ] Deduced a trap composed of 236 places in 271 ms of which 3 ms to minimize.
[2024-05-28 20:19:26] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 3 ms to minimize.
[2024-05-28 20:19:27] [INFO ] Deduced a trap composed of 230 places in 236 ms of which 4 ms to minimize.
[2024-05-28 20:19:27] [INFO ] Deduced a trap composed of 260 places in 259 ms of which 3 ms to minimize.
[2024-05-28 20:19:27] [INFO ] Deduced a trap composed of 236 places in 235 ms of which 4 ms to minimize.
[2024-05-28 20:19:27] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 4 ms to minimize.
[2024-05-28 20:19:28] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 4 ms to minimize.
[2024-05-28 20:19:28] [INFO ] Deduced a trap composed of 196 places in 233 ms of which 4 ms to minimize.
[2024-05-28 20:19:28] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 3 ms to minimize.
[2024-05-28 20:19:28] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 3 ms to minimize.
[2024-05-28 20:19:29] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 4 ms to minimize.
[2024-05-28 20:19:29] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 3 ms to minimize.
[2024-05-28 20:19:29] [INFO ] Deduced a trap composed of 196 places in 233 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 4.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 9.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 0.0)
(s694 4.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:19:41] [INFO ] Deduced a trap composed of 200 places in 372 ms of which 5 ms to minimize.
[2024-05-28 20:19:42] [INFO ] Deduced a trap composed of 196 places in 314 ms of which 4 ms to minimize.
[2024-05-28 20:19:42] [INFO ] Deduced a trap composed of 196 places in 285 ms of which 4 ms to minimize.
[2024-05-28 20:19:42] [INFO ] Deduced a trap composed of 196 places in 276 ms of which 4 ms to minimize.
[2024-05-28 20:19:42] [INFO ] Deduced a trap composed of 200 places in 277 ms of which 4 ms to minimize.
[2024-05-28 20:19:43] [INFO ] Deduced a trap composed of 196 places in 305 ms of which 4 ms to minimize.
[2024-05-28 20:19:43] [INFO ] Deduced a trap composed of 200 places in 299 ms of which 4 ms to minimize.
[2024-05-28 20:19:43] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 4 ms to minimize.
[2024-05-28 20:19:44] [INFO ] Deduced a trap composed of 200 places in 275 ms of which 4 ms to minimize.
[2024-05-28 20:19:44] [INFO ] Deduced a trap composed of 196 places in 314 ms of which 4 ms to minimize.
[2024-05-28 20:19:44] [INFO ] Deduced a trap composed of 196 places in 313 ms of which 4 ms to minimize.
[2024-05-28 20:19:45] [INFO ] Deduced a trap composed of 200 places in 264 ms of which 4 ms to minimize.
[2024-05-28 20:19:45] [INFO ] Deduced a trap composed of 196 places in 332 ms of which 6 ms to minimize.
[2024-05-28 20:19:45] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 3 ms to minimize.
[2024-05-28 20:19:46] [INFO ] Deduced a trap composed of 196 places in 332 ms of which 5 ms to minimize.
[2024-05-28 20:19:46] [INFO ] Deduced a trap composed of 196 places in 328 ms of which 6 ms to minimize.
[2024-05-28 20:19:46] [INFO ] Deduced a trap composed of 200 places in 250 ms of which 4 ms to minimize.
[2024-05-28 20:19:47] [INFO ] Deduced a trap composed of 196 places in 282 ms of which 4 ms to minimize.
[2024-05-28 20:19:47] [INFO ] Deduced a trap composed of 200 places in 254 ms of which 4 ms to minimize.
[2024-05-28 20:19:47] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:19:50] [INFO ] Deduced a trap composed of 249 places in 286 ms of which 4 ms to minimize.
[2024-05-28 20:19:50] [INFO ] Deduced a trap composed of 248 places in 267 ms of which 4 ms to minimize.
[2024-05-28 20:19:50] [INFO ] Deduced a trap composed of 237 places in 253 ms of which 4 ms to minimize.
[2024-05-28 20:19:51] [INFO ] Deduced a trap composed of 230 places in 228 ms of which 3 ms to minimize.
[2024-05-28 20:19:51] [INFO ] Deduced a trap composed of 248 places in 232 ms of which 4 ms to minimize.
[2024-05-28 20:19:51] [INFO ] Deduced a trap composed of 255 places in 338 ms of which 4 ms to minimize.
[2024-05-28 20:19:52] [INFO ] Deduced a trap composed of 237 places in 261 ms of which 4 ms to minimize.
[2024-05-28 20:19:52] [INFO ] Deduced a trap composed of 248 places in 260 ms of which 4 ms to minimize.
[2024-05-28 20:19:52] [INFO ] Deduced a trap composed of 242 places in 221 ms of which 3 ms to minimize.
[2024-05-28 20:19:52] [INFO ] Deduced a trap composed of 236 places in 224 ms of which 3 ms to minimize.
[2024-05-28 20:19:53] [INFO ] Deduced a trap composed of 254 places in 223 ms of which 4 ms to minimize.
[2024-05-28 20:19:53] [INFO ] Deduced a trap composed of 245 places in 265 ms of which 4 ms to minimize.
[2024-05-28 20:19:54] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 4 ms to minimize.
[2024-05-28 20:19:54] [INFO ] Deduced a trap composed of 196 places in 305 ms of which 5 ms to minimize.
[2024-05-28 20:19:54] [INFO ] Deduced a trap composed of 216 places in 279 ms of which 3 ms to minimize.
[2024-05-28 20:19:54] [INFO ] Deduced a trap composed of 196 places in 236 ms of which 4 ms to minimize.
[2024-05-28 20:19:55] [INFO ] Deduced a trap composed of 196 places in 245 ms of which 4 ms to minimize.
[2024-05-28 20:19:55] [INFO ] Deduced a trap composed of 196 places in 223 ms of which 3 ms to minimize.
[2024-05-28 20:19:55] [INFO ] Deduced a trap composed of 261 places in 280 ms of which 4 ms to minimize.
[2024-05-28 20:19:56] [INFO ] Deduced a trap composed of 196 places in 241 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:20:06] [INFO ] Deduced a trap composed of 196 places in 396 ms of which 6 ms to minimize.
SMT process timed out in 63346ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 63368ms
Starting structural reductions in LI_LTL mode, iteration 1 : 770/904 places, 1103/1237 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 93160 ms. Remains : 770/904 places, 1103/1237 transitions.
Running random walk in product with property : PolyORBNT-COL-S05J60-LTLFireability-11
Product exploration explored 100000 steps with 5252 reset in 827 ms.
Product exploration explored 100000 steps with 5265 reset in 1198 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 p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 143 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) p0), p0, p0]
RANDOM walk for 40000 steps (2095 resets) in 394 ms. (101 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (136 resets) in 615 ms. (64 steps per ms) remains 1/1 properties
[2024-05-28 20:20:09] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 20:20:09] [INFO ] Invariant cache hit.
[2024-05-28 20:20:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 375/439 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 305/744 variables, 61/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/744 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/756 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 767/1869 variables, and 135 constraints, problems are : Problem set: 1 solved, 0 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 128/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 395ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 8 factoid took 207 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) p0), p0, p0]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p1) p0), p0, p0]
Support contains 64 out of 770 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 28 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Running 1097 sub problems to find dead transitions.
[2024-05-28 20:20:10] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 20:20:10] [INFO ] Invariant cache hit.
[2024-05-28 20:20:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:20:26] [INFO ] Deduced a trap composed of 245 places in 344 ms of which 5 ms to minimize.
[2024-05-28 20:20:26] [INFO ] Deduced a trap composed of 196 places in 420 ms of which 18 ms to minimize.
[2024-05-28 20:20:27] [INFO ] Deduced a trap composed of 233 places in 473 ms of which 18 ms to minimize.
[2024-05-28 20:20:27] [INFO ] Deduced a trap composed of 196 places in 208 ms of which 3 ms to minimize.
[2024-05-28 20:20:27] [INFO ] Deduced a trap composed of 230 places in 252 ms of which 4 ms to minimize.
[2024-05-28 20:20:28] [INFO ] Deduced a trap composed of 196 places in 281 ms of which 4 ms to minimize.
[2024-05-28 20:20:28] [INFO ] Deduced a trap composed of 196 places in 226 ms of which 3 ms to minimize.
[2024-05-28 20:20:28] [INFO ] Deduced a trap composed of 245 places in 307 ms of which 4 ms to minimize.
[2024-05-28 20:20:28] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 4 ms to minimize.
[2024-05-28 20:20:29] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 3 ms to minimize.
[2024-05-28 20:20:29] [INFO ] Deduced a trap composed of 196 places in 221 ms of which 3 ms to minimize.
[2024-05-28 20:20:29] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 3 ms to minimize.
[2024-05-28 20:20:30] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 4 ms to minimize.
[2024-05-28 20:20:30] [INFO ] Deduced a trap composed of 254 places in 267 ms of which 4 ms to minimize.
[2024-05-28 20:20:30] [INFO ] Deduced a trap composed of 196 places in 277 ms of which 4 ms to minimize.
[2024-05-28 20:20:30] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 3 ms to minimize.
[2024-05-28 20:20:31] [INFO ] Deduced a trap composed of 242 places in 242 ms of which 3 ms to minimize.
[2024-05-28 20:20:31] [INFO ] Deduced a trap composed of 196 places in 293 ms of which 4 ms to minimize.
[2024-05-28 20:20:31] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 4 ms to minimize.
[2024-05-28 20:20:32] [INFO ] Deduced a trap composed of 242 places in 263 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:20:32] [INFO ] Deduced a trap composed of 254 places in 272 ms of which 4 ms to minimize.
[2024-05-28 20:20:33] [INFO ] Deduced a trap composed of 245 places in 307 ms of which 5 ms to minimize.
SMT process timed out in 23177ms, After SMT, problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 23189ms
[2024-05-28 20:20:33] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 20:20:33] [INFO ] Invariant cache hit.
[2024-05-28 20:20:34] [INFO ] Implicit Places using invariants in 814 ms returned []
[2024-05-28 20:20:34] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 20:20:34] [INFO ] Invariant cache hit.
[2024-05-28 20:20:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:20:39] [INFO ] Implicit Places using invariants and state equation in 5913 ms returned []
Implicit Place search using SMT with State Equation took 6732 ms to find 0 implicit places.
[2024-05-28 20:20:39] [INFO ] Redundant transitions in 25 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-05-28 20:20:39] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 20:20:39] [INFO ] Invariant cache hit.
[2024-05-28 20:20:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:20:52] [INFO ] Deduced a trap composed of 245 places in 236 ms of which 4 ms to minimize.
[2024-05-28 20:20:53] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-05-28 20:20:53] [INFO ] Deduced a trap composed of 233 places in 251 ms of which 4 ms to minimize.
[2024-05-28 20:20:53] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 3 ms to minimize.
[2024-05-28 20:20:54] [INFO ] Deduced a trap composed of 230 places in 248 ms of which 4 ms to minimize.
[2024-05-28 20:20:54] [INFO ] Deduced a trap composed of 196 places in 263 ms of which 4 ms to minimize.
[2024-05-28 20:20:54] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 4 ms to minimize.
[2024-05-28 20:20:55] [INFO ] Deduced a trap composed of 245 places in 239 ms of which 4 ms to minimize.
[2024-05-28 20:20:55] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 4 ms to minimize.
[2024-05-28 20:20:55] [INFO ] Deduced a trap composed of 196 places in 336 ms of which 5 ms to minimize.
[2024-05-28 20:20:55] [INFO ] Deduced a trap composed of 196 places in 310 ms of which 5 ms to minimize.
[2024-05-28 20:20:56] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 3 ms to minimize.
[2024-05-28 20:20:56] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 4 ms to minimize.
[2024-05-28 20:20:56] [INFO ] Deduced a trap composed of 254 places in 295 ms of which 4 ms to minimize.
[2024-05-28 20:20:57] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 3 ms to minimize.
[2024-05-28 20:20:57] [INFO ] Deduced a trap composed of 196 places in 255 ms of which 4 ms to minimize.
[2024-05-28 20:20:57] [INFO ] Deduced a trap composed of 242 places in 263 ms of which 4 ms to minimize.
[2024-05-28 20:20:58] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 4 ms to minimize.
[2024-05-28 20:20:58] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 3 ms to minimize.
[2024-05-28 20:20:58] [INFO ] Deduced a trap composed of 242 places in 267 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:20:59] [INFO ] Deduced a trap composed of 254 places in 256 ms of which 3 ms to minimize.
[2024-05-28 20:20:59] [INFO ] Deduced a trap composed of 245 places in 285 ms of which 4 ms to minimize.
[2024-05-28 20:20:59] [INFO ] Deduced a trap composed of 248 places in 263 ms of which 3 ms to minimize.
[2024-05-28 20:21:00] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 3 ms to minimize.
[2024-05-28 20:21:00] [INFO ] Deduced a trap composed of 251 places in 246 ms of which 4 ms to minimize.
[2024-05-28 20:21:00] [INFO ] Deduced a trap composed of 196 places in 281 ms of which 4 ms to minimize.
[2024-05-28 20:21:01] [INFO ] Deduced a trap composed of 233 places in 249 ms of which 4 ms to minimize.
[2024-05-28 20:21:01] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 3 ms to minimize.
[2024-05-28 20:21:01] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 4 ms to minimize.
[2024-05-28 20:21:01] [INFO ] Deduced a trap composed of 230 places in 244 ms of which 4 ms to minimize.
[2024-05-28 20:21:02] [INFO ] Deduced a trap composed of 260 places in 251 ms of which 4 ms to minimize.
[2024-05-28 20:21:02] [INFO ] Deduced a trap composed of 236 places in 267 ms of which 4 ms to minimize.
[2024-05-28 20:21:02] [INFO ] Deduced a trap composed of 196 places in 274 ms of which 4 ms to minimize.
[2024-05-28 20:21:03] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 4 ms to minimize.
[2024-05-28 20:21:03] [INFO ] Deduced a trap composed of 196 places in 287 ms of which 3 ms to minimize.
[2024-05-28 20:21:03] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
[2024-05-28 20:21:03] [INFO ] Deduced a trap composed of 196 places in 276 ms of which 4 ms to minimize.
[2024-05-28 20:21:04] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
[2024-05-28 20:21:04] [INFO ] Deduced a trap composed of 196 places in 409 ms of which 7 ms to minimize.
[2024-05-28 20:21:05] [INFO ] Deduced a trap composed of 196 places in 572 ms of which 38 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:21:17] [INFO ] Deduced a trap composed of 200 places in 313 ms of which 3 ms to minimize.
[2024-05-28 20:21:17] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 4 ms to minimize.
[2024-05-28 20:21:17] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2024-05-28 20:21:17] [INFO ] Deduced a trap composed of 196 places in 260 ms of which 3 ms to minimize.
[2024-05-28 20:21:18] [INFO ] Deduced a trap composed of 200 places in 257 ms of which 4 ms to minimize.
[2024-05-28 20:21:18] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 3 ms to minimize.
[2024-05-28 20:21:18] [INFO ] Deduced a trap composed of 200 places in 266 ms of which 4 ms to minimize.
[2024-05-28 20:21:19] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 3 ms to minimize.
[2024-05-28 20:21:19] [INFO ] Deduced a trap composed of 200 places in 407 ms of which 6 ms to minimize.
[2024-05-28 20:21:19] [INFO ] Deduced a trap composed of 196 places in 420 ms of which 3 ms to minimize.
[2024-05-28 20:21:20] [INFO ] Deduced a trap composed of 196 places in 339 ms of which 3 ms to minimize.
[2024-05-28 20:21:20] [INFO ] Deduced a trap composed of 200 places in 261 ms of which 3 ms to minimize.
[2024-05-28 20:21:20] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 3 ms to minimize.
[2024-05-28 20:21:21] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 4 ms to minimize.
[2024-05-28 20:21:21] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 3 ms to minimize.
[2024-05-28 20:21:21] [INFO ] Deduced a trap composed of 196 places in 254 ms of which 4 ms to minimize.
[2024-05-28 20:21:21] [INFO ] Deduced a trap composed of 200 places in 252 ms of which 3 ms to minimize.
[2024-05-28 20:21:22] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 4 ms to minimize.
[2024-05-28 20:21:22] [INFO ] Deduced a trap composed of 200 places in 274 ms of which 5 ms to minimize.
[2024-05-28 20:21:22] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:21:25] [INFO ] Deduced a trap composed of 249 places in 269 ms of which 4 ms to minimize.
[2024-05-28 20:21:25] [INFO ] Deduced a trap composed of 248 places in 302 ms of which 5 ms to minimize.
[2024-05-28 20:21:26] [INFO ] Deduced a trap composed of 237 places in 280 ms of which 3 ms to minimize.
[2024-05-28 20:21:26] [INFO ] Deduced a trap composed of 230 places in 236 ms of which 4 ms to minimize.
[2024-05-28 20:21:26] [INFO ] Deduced a trap composed of 248 places in 239 ms of which 4 ms to minimize.
[2024-05-28 20:21:27] [INFO ] Deduced a trap composed of 255 places in 267 ms of which 4 ms to minimize.
[2024-05-28 20:21:27] [INFO ] Deduced a trap composed of 237 places in 223 ms of which 4 ms to minimize.
[2024-05-28 20:21:27] [INFO ] Deduced a trap composed of 248 places in 235 ms of which 4 ms to minimize.
[2024-05-28 20:21:27] [INFO ] Deduced a trap composed of 242 places in 236 ms of which 4 ms to minimize.
[2024-05-28 20:21:28] [INFO ] Deduced a trap composed of 236 places in 277 ms of which 4 ms to minimize.
[2024-05-28 20:21:28] [INFO ] Deduced a trap composed of 254 places in 247 ms of which 4 ms to minimize.
[2024-05-28 20:21:28] [INFO ] Deduced a trap composed of 245 places in 264 ms of which 4 ms to minimize.
[2024-05-28 20:21:29] [INFO ] Deduced a trap composed of 196 places in 294 ms of which 4 ms to minimize.
[2024-05-28 20:21:29] [INFO ] Deduced a trap composed of 196 places in 292 ms of which 4 ms to minimize.
[2024-05-28 20:21:29] [INFO ] Deduced a trap composed of 216 places in 288 ms of which 4 ms to minimize.
[2024-05-28 20:21:30] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
[2024-05-28 20:21:30] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 3 ms to minimize.
[2024-05-28 20:21:30] [INFO ] Deduced a trap composed of 196 places in 252 ms of which 3 ms to minimize.
[2024-05-28 20:21:31] [INFO ] Deduced a trap composed of 261 places in 272 ms of which 4 ms to minimize.
[2024-05-28 20:21:31] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:21:42] [INFO ] Deduced a trap composed of 196 places in 315 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 213 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 81/81 constraints]
After SMT, in 62717ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62727ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 92711 ms. Remains : 770/770 places, 1103/1103 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 122 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) p0), p0, p0]
RANDOM walk for 40001 steps (2057 resets) in 572 ms. (69 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (130 resets) in 679 ms. (58 steps per ms) remains 1/1 properties
[2024-05-28 20:21:43] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 20:21:43] [INFO ] Invariant cache hit.
[2024-05-28 20:21:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 375/439 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/439 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 305/744 variables, 61/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/744 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 12/756 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 767/1869 variables, and 135 constraints, problems are : Problem set: 1 solved, 0 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 128/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 307ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0)]
Knowledge based reduction with 8 factoid took 137 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) p0), p0, p0]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) p0), p0, p0]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) p0), p0, p0]
Product exploration explored 100000 steps with 5250 reset in 1062 ms.
Product exploration explored 100000 steps with 5290 reset in 881 ms.
Built C files in :
/tmp/ltsmin1743326686628486237
[2024-05-28 20:21:46] [INFO ] Computing symmetric may disable matrix : 1103 transitions.
[2024-05-28 20:21:46] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:21:46] [INFO ] Computing symmetric may enable matrix : 1103 transitions.
[2024-05-28 20:21:46] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:21:46] [INFO ] Computing Do-Not-Accords matrix : 1103 transitions.
[2024-05-28 20:21:46] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:21:46] [INFO ] Built C files in 244ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1743326686628486237
Running compilation step : cd /tmp/ltsmin1743326686628486237;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1743326686628486237;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1743326686628486237;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 64 out of 770 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 19 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Running 1097 sub problems to find dead transitions.
[2024-05-28 20:21:49] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 20:21:49] [INFO ] Invariant cache hit.
[2024-05-28 20:21:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:22:03] [INFO ] Deduced a trap composed of 245 places in 237 ms of which 4 ms to minimize.
[2024-05-28 20:22:03] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 3 ms to minimize.
[2024-05-28 20:22:03] [INFO ] Deduced a trap composed of 233 places in 265 ms of which 4 ms to minimize.
[2024-05-28 20:22:03] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 3 ms to minimize.
[2024-05-28 20:22:04] [INFO ] Deduced a trap composed of 230 places in 240 ms of which 3 ms to minimize.
[2024-05-28 20:22:04] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 3 ms to minimize.
[2024-05-28 20:22:04] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-05-28 20:22:05] [INFO ] Deduced a trap composed of 245 places in 300 ms of which 3 ms to minimize.
[2024-05-28 20:22:05] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 4 ms to minimize.
[2024-05-28 20:22:05] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 3 ms to minimize.
[2024-05-28 20:22:06] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 3 ms to minimize.
[2024-05-28 20:22:06] [INFO ] Deduced a trap composed of 196 places in 255 ms of which 3 ms to minimize.
[2024-05-28 20:22:06] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 3 ms to minimize.
[2024-05-28 20:22:06] [INFO ] Deduced a trap composed of 254 places in 241 ms of which 3 ms to minimize.
[2024-05-28 20:22:07] [INFO ] Deduced a trap composed of 196 places in 233 ms of which 3 ms to minimize.
[2024-05-28 20:22:07] [INFO ] Deduced a trap composed of 196 places in 332 ms of which 5 ms to minimize.
[2024-05-28 20:22:07] [INFO ] Deduced a trap composed of 242 places in 296 ms of which 4 ms to minimize.
[2024-05-28 20:22:08] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 4 ms to minimize.
[2024-05-28 20:22:08] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 3 ms to minimize.
[2024-05-28 20:22:08] [INFO ] Deduced a trap composed of 242 places in 250 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:22:09] [INFO ] Deduced a trap composed of 254 places in 247 ms of which 3 ms to minimize.
[2024-05-28 20:22:09] [INFO ] Deduced a trap composed of 245 places in 325 ms of which 5 ms to minimize.
[2024-05-28 20:22:10] [INFO ] Deduced a trap composed of 248 places in 250 ms of which 3 ms to minimize.
[2024-05-28 20:22:10] [INFO ] Deduced a trap composed of 196 places in 255 ms of which 4 ms to minimize.
[2024-05-28 20:22:10] [INFO ] Deduced a trap composed of 251 places in 235 ms of which 4 ms to minimize.
[2024-05-28 20:22:11] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 4 ms to minimize.
[2024-05-28 20:22:11] [INFO ] Deduced a trap composed of 233 places in 230 ms of which 4 ms to minimize.
[2024-05-28 20:22:11] [INFO ] Deduced a trap composed of 236 places in 295 ms of which 3 ms to minimize.
[2024-05-28 20:22:11] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 3 ms to minimize.
[2024-05-28 20:22:12] [INFO ] Deduced a trap composed of 230 places in 225 ms of which 3 ms to minimize.
[2024-05-28 20:22:12] [INFO ] Deduced a trap composed of 260 places in 244 ms of which 3 ms to minimize.
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 765/1869 variables, and 163 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 31/163 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:22:15] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 2 ms to minimize.
[2024-05-28 20:22:17] [INFO ] Deduced a trap composed of 200 places in 222 ms of which 4 ms to minimize.
[2024-05-28 20:22:17] [INFO ] Deduced a trap composed of 196 places in 294 ms of which 5 ms to minimize.
[2024-05-28 20:22:18] [INFO ] Deduced a trap composed of 200 places in 283 ms of which 5 ms to minimize.
[2024-05-28 20:22:18] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 4 ms to minimize.
[2024-05-28 20:22:18] [INFO ] Deduced a trap composed of 200 places in 253 ms of which 4 ms to minimize.
[2024-05-28 20:22:18] [INFO ] Deduced a trap composed of 196 places in 236 ms of which 3 ms to minimize.
[2024-05-28 20:22:19] [INFO ] Deduced a trap composed of 200 places in 234 ms of which 4 ms to minimize.
[2024-05-28 20:22:19] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 3 ms to minimize.
[2024-05-28 20:22:19] [INFO ] Deduced a trap composed of 200 places in 236 ms of which 4 ms to minimize.
[2024-05-28 20:22:19] [INFO ] Deduced a trap composed of 196 places in 235 ms of which 3 ms to minimize.
[2024-05-28 20:22:20] [INFO ] Deduced a trap composed of 200 places in 222 ms of which 4 ms to minimize.
[2024-05-28 20:22:20] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 4 ms to minimize.
[2024-05-28 20:22:20] [INFO ] Deduced a trap composed of 196 places in 230 ms of which 3 ms to minimize.
[2024-05-28 20:22:20] [INFO ] Deduced a trap composed of 196 places in 220 ms of which 4 ms to minimize.
[2024-05-28 20:22:21] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 4 ms to minimize.
[2024-05-28 20:22:21] [INFO ] Deduced a trap composed of 200 places in 239 ms of which 3 ms to minimize.
[2024-05-28 20:22:21] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 3 ms to minimize.
[2024-05-28 20:22:21] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 4 ms to minimize.
[2024-05-28 20:22:22] [INFO ] Deduced a trap composed of 200 places in 338 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:22:23] [INFO ] Deduced a trap composed of 246 places in 318 ms of which 5 ms to minimize.
[2024-05-28 20:22:24] [INFO ] Deduced a trap composed of 240 places in 258 ms of which 3 ms to minimize.
[2024-05-28 20:22:24] [INFO ] Deduced a trap composed of 240 places in 228 ms of which 4 ms to minimize.
[2024-05-28 20:22:24] [INFO ] Deduced a trap composed of 236 places in 219 ms of which 4 ms to minimize.
[2024-05-28 20:22:24] [INFO ] Deduced a trap composed of 236 places in 224 ms of which 3 ms to minimize.
[2024-05-28 20:22:25] [INFO ] Deduced a trap composed of 227 places in 220 ms of which 3 ms to minimize.
[2024-05-28 20:22:25] [INFO ] Deduced a trap composed of 240 places in 278 ms of which 4 ms to minimize.
[2024-05-28 20:22:25] [INFO ] Deduced a trap composed of 230 places in 302 ms of which 3 ms to minimize.
[2024-05-28 20:22:26] [INFO ] Deduced a trap composed of 239 places in 416 ms of which 7 ms to minimize.
[2024-05-28 20:22:26] [INFO ] Deduced a trap composed of 240 places in 715 ms of which 4 ms to minimize.
[2024-05-28 20:22:27] [INFO ] Deduced a trap composed of 237 places in 244 ms of which 4 ms to minimize.
[2024-05-28 20:22:27] [INFO ] Deduced a trap composed of 243 places in 258 ms of which 3 ms to minimize.
[2024-05-28 20:22:27] [INFO ] Deduced a trap composed of 237 places in 244 ms of which 4 ms to minimize.
[2024-05-28 20:22:27] [INFO ] Deduced a trap composed of 243 places in 250 ms of which 3 ms to minimize.
[2024-05-28 20:22:28] [INFO ] Deduced a trap composed of 200 places in 251 ms of which 4 ms to minimize.
[2024-05-28 20:22:28] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 4 ms to minimize.
[2024-05-28 20:22:28] [INFO ] Deduced a trap composed of 196 places in 302 ms of which 3 ms to minimize.
[2024-05-28 20:22:29] [INFO ] Deduced a trap composed of 196 places in 312 ms of which 4 ms to minimize.
[2024-05-28 20:22:29] [INFO ] Deduced a trap composed of 200 places in 265 ms of which 3 ms to minimize.
[2024-05-28 20:22:29] [INFO ] Deduced a trap composed of 258 places in 284 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/203 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 203 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 71/71 constraints]
After SMT, in 43038ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 43048ms
[2024-05-28 20:22:32] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 20:22:32] [INFO ] Invariant cache hit.
[2024-05-28 20:22:33] [INFO ] Implicit Places using invariants in 999 ms returned []
[2024-05-28 20:22:33] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 20:22:33] [INFO ] Invariant cache hit.
[2024-05-28 20:22:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 20:22:39] [INFO ] Implicit Places using invariants and state equation in 5968 ms returned []
Implicit Place search using SMT with State Equation took 6970 ms to find 0 implicit places.
[2024-05-28 20:22:39] [INFO ] Redundant transitions in 8 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-05-28 20:22:39] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 20:22:39] [INFO ] Invariant cache hit.
[2024-05-28 20:22:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:22:53] [INFO ] Deduced a trap composed of 245 places in 285 ms of which 4 ms to minimize.
[2024-05-28 20:22:53] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 4 ms to minimize.
[2024-05-28 20:22:54] [INFO ] Deduced a trap composed of 233 places in 272 ms of which 4 ms to minimize.
[2024-05-28 20:22:54] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 4 ms to minimize.
[2024-05-28 20:22:54] [INFO ] Deduced a trap composed of 230 places in 265 ms of which 4 ms to minimize.
[2024-05-28 20:22:55] [INFO ] Deduced a trap composed of 196 places in 268 ms of which 4 ms to minimize.
[2024-05-28 20:22:55] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2024-05-28 20:22:55] [INFO ] Deduced a trap composed of 245 places in 268 ms of which 4 ms to minimize.
[2024-05-28 20:22:55] [INFO ] Deduced a trap composed of 196 places in 296 ms of which 3 ms to minimize.
[2024-05-28 20:22:56] [INFO ] Deduced a trap composed of 196 places in 278 ms of which 4 ms to minimize.
[2024-05-28 20:22:56] [INFO ] Deduced a trap composed of 196 places in 264 ms of which 4 ms to minimize.
[2024-05-28 20:22:56] [INFO ] Deduced a trap composed of 196 places in 281 ms of which 4 ms to minimize.
[2024-05-28 20:22:57] [INFO ] Deduced a trap composed of 196 places in 282 ms of which 4 ms to minimize.
[2024-05-28 20:22:57] [INFO ] Deduced a trap composed of 254 places in 266 ms of which 4 ms to minimize.
[2024-05-28 20:22:57] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 4 ms to minimize.
[2024-05-28 20:22:58] [INFO ] Deduced a trap composed of 196 places in 257 ms of which 4 ms to minimize.
[2024-05-28 20:22:58] [INFO ] Deduced a trap composed of 242 places in 271 ms of which 4 ms to minimize.
[2024-05-28 20:22:58] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 3 ms to minimize.
[2024-05-28 20:22:58] [INFO ] Deduced a trap composed of 196 places in 265 ms of which 4 ms to minimize.
[2024-05-28 20:22:59] [INFO ] Deduced a trap composed of 242 places in 261 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:22:59] [INFO ] Deduced a trap composed of 254 places in 241 ms of which 4 ms to minimize.
[2024-05-28 20:23:00] [INFO ] Deduced a trap composed of 245 places in 261 ms of which 4 ms to minimize.
[2024-05-28 20:23:00] [INFO ] Deduced a trap composed of 248 places in 234 ms of which 4 ms to minimize.
[2024-05-28 20:23:00] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 4 ms to minimize.
[2024-05-28 20:23:01] [INFO ] Deduced a trap composed of 251 places in 246 ms of which 4 ms to minimize.
[2024-05-28 20:23:01] [INFO ] Deduced a trap composed of 196 places in 236 ms of which 3 ms to minimize.
[2024-05-28 20:23:01] [INFO ] Deduced a trap composed of 233 places in 245 ms of which 3 ms to minimize.
[2024-05-28 20:23:01] [INFO ] Deduced a trap composed of 236 places in 252 ms of which 3 ms to minimize.
[2024-05-28 20:23:02] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 3 ms to minimize.
[2024-05-28 20:23:02] [INFO ] Deduced a trap composed of 230 places in 228 ms of which 4 ms to minimize.
[2024-05-28 20:23:02] [INFO ] Deduced a trap composed of 260 places in 244 ms of which 4 ms to minimize.
[2024-05-28 20:23:03] [INFO ] Deduced a trap composed of 236 places in 246 ms of which 4 ms to minimize.
[2024-05-28 20:23:03] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
[2024-05-28 20:23:03] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 3 ms to minimize.
[2024-05-28 20:23:03] [INFO ] Deduced a trap composed of 196 places in 232 ms of which 3 ms to minimize.
[2024-05-28 20:23:04] [INFO ] Deduced a trap composed of 196 places in 269 ms of which 4 ms to minimize.
[2024-05-28 20:23:04] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 4 ms to minimize.
[2024-05-28 20:23:04] [INFO ] Deduced a trap composed of 196 places in 249 ms of which 3 ms to minimize.
[2024-05-28 20:23:04] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 4 ms to minimize.
[2024-05-28 20:23:05] [INFO ] Deduced a trap composed of 196 places in 236 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:23:16] [INFO ] Deduced a trap composed of 200 places in 255 ms of which 3 ms to minimize.
[2024-05-28 20:23:16] [INFO ] Deduced a trap composed of 196 places in 310 ms of which 6 ms to minimize.
[2024-05-28 20:23:17] [INFO ] Deduced a trap composed of 196 places in 283 ms of which 4 ms to minimize.
[2024-05-28 20:23:17] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
[2024-05-28 20:23:17] [INFO ] Deduced a trap composed of 200 places in 226 ms of which 4 ms to minimize.
[2024-05-28 20:23:18] [INFO ] Deduced a trap composed of 196 places in 324 ms of which 5 ms to minimize.
[2024-05-28 20:23:18] [INFO ] Deduced a trap composed of 200 places in 321 ms of which 4 ms to minimize.
[2024-05-28 20:23:18] [INFO ] Deduced a trap composed of 196 places in 334 ms of which 4 ms to minimize.
[2024-05-28 20:23:18] [INFO ] Deduced a trap composed of 200 places in 251 ms of which 3 ms to minimize.
[2024-05-28 20:23:19] [INFO ] Deduced a trap composed of 196 places in 276 ms of which 4 ms to minimize.
[2024-05-28 20:23:19] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 3 ms to minimize.
[2024-05-28 20:23:19] [INFO ] Deduced a trap composed of 200 places in 254 ms of which 3 ms to minimize.
[2024-05-28 20:23:20] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 3 ms to minimize.
[2024-05-28 20:23:20] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 3 ms to minimize.
[2024-05-28 20:23:20] [INFO ] Deduced a trap composed of 196 places in 233 ms of which 4 ms to minimize.
[2024-05-28 20:23:21] [INFO ] Deduced a trap composed of 196 places in 299 ms of which 4 ms to minimize.
[2024-05-28 20:23:21] [INFO ] Deduced a trap composed of 200 places in 311 ms of which 3 ms to minimize.
[2024-05-28 20:23:21] [INFO ] Deduced a trap composed of 196 places in 243 ms of which 3 ms to minimize.
[2024-05-28 20:23:22] [INFO ] Deduced a trap composed of 200 places in 275 ms of which 3 ms to minimize.
[2024-05-28 20:23:22] [INFO ] Deduced a trap composed of 196 places in 242 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 20:23:25] [INFO ] Deduced a trap composed of 249 places in 341 ms of which 5 ms to minimize.
[2024-05-28 20:23:25] [INFO ] Deduced a trap composed of 248 places in 317 ms of which 5 ms to minimize.
[2024-05-28 20:23:25] [INFO ] Deduced a trap composed of 237 places in 261 ms of which 4 ms to minimize.
[2024-05-28 20:23:25] [INFO ] Deduced a trap composed of 230 places in 283 ms of which 5 ms to minimize.
[2024-05-28 20:23:26] [INFO ] Deduced a trap composed of 248 places in 256 ms of which 3 ms to minimize.
[2024-05-28 20:23:26] [INFO ] Deduced a trap composed of 255 places in 257 ms of which 4 ms to minimize.
[2024-05-28 20:23:26] [INFO ] Deduced a trap composed of 237 places in 289 ms of which 4 ms to minimize.
[2024-05-28 20:23:27] [INFO ] Deduced a trap composed of 248 places in 232 ms of which 3 ms to minimize.
[2024-05-28 20:23:27] [INFO ] Deduced a trap composed of 242 places in 226 ms of which 4 ms to minimize.
[2024-05-28 20:23:27] [INFO ] Deduced a trap composed of 236 places in 219 ms of which 4 ms to minimize.
[2024-05-28 20:23:27] [INFO ] Deduced a trap composed of 254 places in 210 ms of which 3 ms to minimize.
[2024-05-28 20:23:28] [INFO ] Deduced a trap composed of 245 places in 297 ms of which 3 ms to minimize.
[2024-05-28 20:23:29] [INFO ] Deduced a trap composed of 196 places in 385 ms of which 5 ms to minimize.
[2024-05-28 20:23:29] [INFO ] Deduced a trap composed of 196 places in 580 ms of which 7 ms to minimize.
[2024-05-28 20:23:30] [INFO ] Deduced a trap composed of 216 places in 385 ms of which 5 ms to minimize.
[2024-05-28 20:23:30] [INFO ] Deduced a trap composed of 196 places in 228 ms of which 4 ms to minimize.
[2024-05-28 20:23:30] [INFO ] Deduced a trap composed of 196 places in 240 ms of which 4 ms to minimize.
[2024-05-28 20:23:30] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 3 ms to minimize.
[2024-05-28 20:23:31] [INFO ] Deduced a trap composed of 261 places in 326 ms of which 3 ms to minimize.
[2024-05-28 20:23:31] [INFO ] Deduced a trap composed of 196 places in 237 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 212 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 80/80 constraints]
After SMT, in 62700ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62719ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 112784 ms. Remains : 770/770 places, 1103/1103 transitions.
Built C files in :
/tmp/ltsmin8266233988212979937
[2024-05-28 20:23:42] [INFO ] Computing symmetric may disable matrix : 1103 transitions.
[2024-05-28 20:23:42] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:23:42] [INFO ] Computing symmetric may enable matrix : 1103 transitions.
[2024-05-28 20:23:42] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:23:42] [INFO ] Computing Do-Not-Accords matrix : 1103 transitions.
[2024-05-28 20:23:42] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:23:42] [INFO ] Built C files in 241ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8266233988212979937
Running compilation step : cd /tmp/ltsmin8266233988212979937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8266233988212979937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8266233988212979937;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-28 20:23:45] [INFO ] Flatten gal took : 58 ms
[2024-05-28 20:23:45] [INFO ] Flatten gal took : 48 ms
[2024-05-28 20:23:45] [INFO ] Time to serialize gal into /tmp/LTL8565532410463559735.gal : 7 ms
[2024-05-28 20:23:45] [INFO ] Time to serialize properties into /tmp/LTL15014979416571148095.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8565532410463559735.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8620564470871919851.hoa' '-atoms' '/tmp/LTL15014979416571148095.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL15014979416571148095.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8620564470871919851.hoa
Detected timeout of ITS tools.
[2024-05-28 20:24:00] [INFO ] Flatten gal took : 32 ms
[2024-05-28 20:24:00] [INFO ] Flatten gal took : 47 ms
[2024-05-28 20:24:00] [INFO ] Time to serialize gal into /tmp/LTL11036738787712447636.gal : 13 ms
[2024-05-28 20:24:00] [INFO ] Time to serialize properties into /tmp/LTL8600011525266039624.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11036738787712447636.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8600011525266039624.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(place_522<3)")))||(G("(((((((((FetchJobB<1)||(mo2<1))||(f2_49<1))&&(((FetchJobB<1)||(mo2<1))||(f2_47<1)))&&((((FetchJobB<1...2548
Formula 0 simplified : X(FG!"(place_522<3)" & F!"(((((((((FetchJobB<1)||(mo2<1))||(f2_49<1))&&(((FetchJobB<1)||(mo2<1))||(f2_47<1)))&&((((FetchJobB<1)||(mo...2538
Detected timeout of ITS tools.
[2024-05-28 20:24:15] [INFO ] Flatten gal took : 32 ms
[2024-05-28 20:24:15] [INFO ] Applying decomposition
[2024-05-28 20:24:15] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13094359892872347202.txt' '-o' '/tmp/graph13094359892872347202.bin' '-w' '/tmp/graph13094359892872347202.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13094359892872347202.bin' '-l' '-1' '-v' '-w' '/tmp/graph13094359892872347202.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:24:16] [INFO ] Decomposing Gal with order
[2024-05-28 20:24:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:24:16] [INFO ] Removed a total of 1272 redundant transitions.
[2024-05-28 20:24:16] [INFO ] Flatten gal took : 170 ms
[2024-05-28 20:24:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 121 labels/synchronizations in 10 ms.
[2024-05-28 20:24:16] [INFO ] Time to serialize gal into /tmp/LTL7775948061705483748.gal : 22 ms
[2024-05-28 20:24:16] [INFO ] Time to serialize properties into /tmp/LTL10912814652236797727.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7775948061705483748.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10912814652236797727.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((G(F("(i20.u32.place_522<3)")))||(G("(((((((((i0.u1.FetchJobB<1)||(i0.u1.mo2<1))||(i0.u0.f2_49<1))&&(((i0.u1.FetchJobB<1)||(i0.u1...3648
Formula 0 simplified : X(FG!"(i20.u32.place_522<3)" & F!"(((((((((i0.u1.FetchJobB<1)||(i0.u1.mo2<1))||(i0.u0.f2_49<1))&&(((i0.u1.FetchJobB<1)||(i0.u1.mo2<1...3638
Detected timeout of ITS tools.
Treatment of property PolyORBNT-COL-S05J60-LTLFireability-11 finished in 358379 ms.
[2024-05-28 20:24:31] [INFO ] Flatten gal took : 79 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17610492529609175689
[2024-05-28 20:24:31] [INFO ] Computing symmetric may disable matrix : 1237 transitions.
[2024-05-28 20:24:31] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:24:31] [INFO ] Applying decomposition
[2024-05-28 20:24:31] [INFO ] Computing symmetric may enable matrix : 1237 transitions.
[2024-05-28 20:24:31] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:24:31] [INFO ] Flatten gal took : 78 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5479905202184274483.txt' '-o' '/tmp/graph5479905202184274483.bin' '-w' '/tmp/graph5479905202184274483.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5479905202184274483.bin' '-l' '-1' '-v' '-w' '/tmp/graph5479905202184274483.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:24:31] [INFO ] Decomposing Gal with order
[2024-05-28 20:24:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:24:32] [INFO ] Computing Do-Not-Accords matrix : 1237 transitions.
[2024-05-28 20:24:32] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:24:32] [INFO ] Built C files in 593ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17610492529609175689
Running compilation step : cd /tmp/ltsmin17610492529609175689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-28 20:24:32] [INFO ] Removed a total of 1321 redundant transitions.
[2024-05-28 20:24:32] [INFO ] Flatten gal took : 341 ms
[2024-05-28 20:24:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 466 labels/synchronizations in 51 ms.
[2024-05-28 20:24:32] [INFO ] Time to serialize gal into /tmp/LTLFireability1675108128819470921.gal : 82 ms
[2024-05-28 20:24:32] [INFO ] Time to serialize properties into /tmp/LTLFireability14142743370316078321.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1675108128819470921.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14142743370316078321.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 3 LTL properties
Checking formula 0 : !((G(F("(((((((((i11.u29.FetchJobB<1)||(i11.u29.mo2<1))||(i11.u29.f2_49<1))&&(((i11.u29.FetchJobB<1)||(i11.u29.mo2<1))||(i11.u29.f2_47...3985
Formula 0 simplified : FG!"(((((((((i11.u29.FetchJobB<1)||(i11.u29.mo2<1))||(i11.u29.f2_49<1))&&(((i11.u29.FetchJobB<1)||(i11.u29.mo2<1))||(i11.u29.f2_47<1...3979
Compilation finished in 6738 ms.
Running link step : cd /tmp/ltsmin17610492529609175689;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 110 ms.
Running LTSmin : cd /tmp/ltsmin17610492529609175689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin17610492529609175689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17610492529609175689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>([]((LTLAPp1==true)))||[]((<>((LTLAPp3==true))&&(LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin17610492529609175689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>([]((LTLAPp1==true)))||[]((<>((LTLAPp3==true))&&(LTLAPp2==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin17610492529609175689;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([](<>(!(LTLAPp4==true)))||[]((LTLAPp0==true))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="PolyORBNT-COL-S05J60"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is PolyORBNT-COL-S05J60, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r290-tajo-171654447000388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J60.tgz
mv PolyORBNT-COL-S05J60 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;