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.r516-tajo-171654446400122.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 ltsminxred
Input is PolyORBLF-COL-S04J04T06, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446400122
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.9K Apr 11 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 11 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 11 17:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 11 17:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 11 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 11 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S04J04T06-CTLFireability-2024-00
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-01
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-02
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-03
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-04
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-05
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-06
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-07
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-08
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-09
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-10
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-11
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-12
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-13
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-14
FORMULA_NAME PolyORBLF-COL-S04J04T06-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717249538996

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S04J04T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:45:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:45:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:45:40] [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-06-01 13:45:41] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 13:45:41] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 696 ms
[2024-06-01 13:45:41] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 554 PT places and 3040.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
[2024-06-01 13:45:41] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 6 ms.
[2024-06-01 13:45:41] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 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 51 to 50
RANDOM walk for 40001 steps (14 resets) in 1747 ms. (22 steps per ms) remains 9/50 properties
BEST_FIRST walk for 40003 steps (8 resets) in 259 ms. (153 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (20 resets) in 241 ms. (165 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 242 ms. (164 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (11 resets) in 312 ms. (127 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (12 resets) in 174 ms. (228 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (10 resets) in 252 ms. (158 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 211 ms. (188 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 363 ms. (109 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 250 ms. (159 steps per ms) remains 9/9 properties
[2024-06-01 13:45:43] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 13:45:43] [INFO ] Computed 26 invariants in 14 ms
[2024-06-01 13:45:43] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem AtomicPropp50 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 33/65 variables, 10/14 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-06-01 13:45:43] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/16 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp48 is UNSAT
After SMT solving in domain Real declared 81/145 variables, and 27 constraints, problems are : Problem set: 9 solved, 0 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/81 constraints, ReadFeed: 0/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 393ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
FORMULA PolyORBLF-COL-S04J04T06-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:45:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 13:45:43] [INFO ] Flatten gal took : 26 ms
FORMULA PolyORBLF-COL-S04J04T06-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:45:43] [INFO ] Flatten gal took : 8 ms
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 13:45:43] [INFO ] Unfolded HLPN to a Petri net with 554 places and 2998 transitions 20754 arcs in 64 ms.
[2024-06-01 13:45:43] [INFO ] Unfolded 14 HLPN properties in 0 ms.
[2024-06-01 13:45:43] [INFO ] Reduced 36 identical enabling conditions.
[2024-06-01 13:45:43] [INFO ] Reduced 264 identical enabling conditions.
[2024-06-01 13:45:43] [INFO ] Reduced 36 identical enabling conditions.
Ensure Unique test removed 1626 transitions
Reduce redundant transitions removed 1626 transitions.
Support contains 445 out of 554 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 554/554 places, 1372/1372 transitions.
Ensure Unique test removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 550 transition count 1372
Applied a total of 4 rules in 32 ms. Remains 550 /554 variables (removed 4) and now considering 1372/1372 (removed 0) transitions.
Running 1368 sub problems to find dead transitions.
[2024-06-01 13:45:43] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 550 cols
[2024-06-01 13:45:44] [INFO ] Computed 46 invariants in 73 ms
[2024-06-01 13:45:44] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 13:45:58] [INFO ] Deduced a trap composed of 75 places in 79 ms of which 3 ms to minimize.
[2024-06-01 13:45:58] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 2 ms to minimize.
[2024-06-01 13:45:58] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 2 ms to minimize.
[2024-06-01 13:45:58] [INFO ] Deduced a trap composed of 75 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:45:58] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:45:59] [INFO ] Deduced a trap composed of 313 places in 266 ms of which 3 ms to minimize.
[2024-06-01 13:45:59] [INFO ] Deduced a trap composed of 167 places in 249 ms of which 4 ms to minimize.
[2024-06-01 13:46:00] [INFO ] Deduced a trap composed of 39 places in 191 ms of which 2 ms to minimize.
[2024-06-01 13:46:01] [INFO ] Deduced a trap composed of 319 places in 381 ms of which 5 ms to minimize.
[2024-06-01 13:46:01] [INFO ] Deduced a trap composed of 320 places in 354 ms of which 5 ms to minimize.
[2024-06-01 13:46:02] [INFO ] Deduced a trap composed of 317 places in 353 ms of which 4 ms to minimize.
[2024-06-01 13:46:02] [INFO ] Deduced a trap composed of 323 places in 355 ms of which 5 ms to minimize.
[2024-06-01 13:46:03] [INFO ] Deduced a trap composed of 311 places in 351 ms of which 4 ms to minimize.
[2024-06-01 13:46:03] [INFO ] Deduced a trap composed of 322 places in 297 ms of which 3 ms to minimize.
[2024-06-01 13:46:03] [INFO ] Deduced a trap composed of 313 places in 319 ms of which 3 ms to minimize.
[2024-06-01 13:46:03] [INFO ] Deduced a trap composed of 307 places in 292 ms of which 3 ms to minimize.
[2024-06-01 13:46:04] [INFO ] Deduced a trap composed of 322 places in 412 ms of which 6 ms to minimize.
[2024-06-01 13:46:04] [INFO ] Deduced a trap composed of 311 places in 437 ms of which 6 ms to minimize.
[2024-06-01 13:46:05] [INFO ] Deduced a trap composed of 315 places in 342 ms of which 3 ms to minimize.
[2024-06-01 13:46:06] [INFO ] Deduced a trap composed of 292 places in 452 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 13:46:06] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 2 ms to minimize.
[2024-06-01 13:46:08] [INFO ] Deduced a trap composed of 265 places in 346 ms of which 5 ms to minimize.
[2024-06-01 13:46:08] [INFO ] Deduced a trap composed of 245 places in 370 ms of which 4 ms to minimize.
SMT process timed out in 24629ms, After SMT, problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 24655ms
[2024-06-01 13:46:08] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-06-01 13:46:08] [INFO ] Invariant cache hit.
[2024-06-01 13:46:08] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-01 13:46:08] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-06-01 13:46:08] [INFO ] Invariant cache hit.
[2024-06-01 13:46:09] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-06-01 13:46:12] [INFO ] Implicit Places using invariants and state equation in 3280 ms returned []
Implicit Place search using SMT with State Equation took 3449 ms to find 0 implicit places.
Running 1368 sub problems to find dead transitions.
[2024-06-01 13:46:12] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-06-01 13:46:12] [INFO ] Invariant cache hit.
[2024-06-01 13:46:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 13:46:28] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 2 ms to minimize.
[2024-06-01 13:46:28] [INFO ] Deduced a trap composed of 75 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:46:28] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:46:28] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 1 ms to minimize.
[2024-06-01 13:46:28] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 1 ms to minimize.
[2024-06-01 13:46:29] [INFO ] Deduced a trap composed of 304 places in 367 ms of which 5 ms to minimize.
[2024-06-01 13:46:29] [INFO ] Deduced a trap composed of 151 places in 338 ms of which 4 ms to minimize.
[2024-06-01 13:46:32] [INFO ] Deduced a trap composed of 297 places in 367 ms of which 7 ms to minimize.
[2024-06-01 13:46:32] [INFO ] Deduced a trap composed of 313 places in 361 ms of which 4 ms to minimize.
[2024-06-01 13:46:32] [INFO ] Deduced a trap composed of 272 places in 424 ms of which 6 ms to minimize.
[2024-06-01 13:46:33] [INFO ] Deduced a trap composed of 333 places in 469 ms of which 31 ms to minimize.
[2024-06-01 13:46:33] [INFO ] Deduced a trap composed of 292 places in 391 ms of which 4 ms to minimize.
[2024-06-01 13:46:34] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 2 ms to minimize.
[2024-06-01 13:46:47] [INFO ] Deduced a trap composed of 303 places in 309 ms of which 4 ms to minimize.
[2024-06-01 13:46:47] [INFO ] Deduced a trap composed of 305 places in 337 ms of which 4 ms to minimize.
SMT process timed out in 35763ms, After SMT, problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 35792ms
Starting structural reductions in LTL mode, iteration 1 : 550/554 places, 1372/1372 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63953 ms. Remains : 550/554 places, 1372/1372 transitions.
Support contains 445 out of 550 places after structural reductions.
[2024-06-01 13:46:48] [INFO ] Flatten gal took : 125 ms
[2024-06-01 13:46:48] [INFO ] Flatten gal took : 114 ms
[2024-06-01 13:46:48] [INFO ] Input system was already deterministic with 1372 transitions.
Support contains 439 out of 550 places (down from 445) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 48 to 45
RANDOM walk for 40000 steps (8 resets) in 1298 ms. (30 steps per ms) remains 6/45 properties
BEST_FIRST walk for 40002 steps (8 resets) in 450 ms. (88 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 445 ms. (89 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 669 ms. (59 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 588 ms. (67 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1215 ms. (32 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 751 ms. (53 steps per ms) remains 6/6 properties
[2024-06-01 13:46:50] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
[2024-06-01 13:46:50] [INFO ] Invariant cache hit.
[2024-06-01 13:46:50] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp47 is UNSAT
At refinement iteration 2 (OVERLAPS) 91/254 variables, 12/14 constraints. Problems are: Problem set: 1 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 2/16 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/254 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
After SMT solving in domain Real declared 528/1898 variables, and 33 constraints, problems are : Problem set: 6 solved, 0 unsolved in 667 ms.
Refiners :[Positive P Invariants (semi-flows): 12/13 constraints, Generalized P Invariants (flows): 21/33 constraints, State Equation: 0/550 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 869ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
[2024-06-01 13:46:51] [INFO ] Flatten gal took : 121 ms
[2024-06-01 13:46:51] [INFO ] Flatten gal took : 109 ms
[2024-06-01 13:46:51] [INFO ] Input system was already deterministic with 1372 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1366
Applied a total of 12 rules in 58 ms. Remains 544 /550 variables (removed 6) and now considering 1366/1372 (removed 6) transitions.
Running 1362 sub problems to find dead transitions.
[2024-06-01 13:46:52] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
// Phase 1: matrix 1342 rows 544 cols
[2024-06-01 13:46:52] [INFO ] Computed 46 invariants in 78 ms
[2024-06-01 13:46:52] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-06-01 13:47:08] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 3 ms to minimize.
[2024-06-01 13:47:08] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 1 ms to minimize.
[2024-06-01 13:47:08] [INFO ] Deduced a trap composed of 74 places in 92 ms of which 2 ms to minimize.
[2024-06-01 13:47:08] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:47:08] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:47:09] [INFO ] Deduced a trap composed of 299 places in 384 ms of which 4 ms to minimize.
[2024-06-01 13:47:09] [INFO ] Deduced a trap composed of 121 places in 337 ms of which 4 ms to minimize.
[2024-06-01 13:47:09] [INFO ] Deduced a trap composed of 164 places in 299 ms of which 4 ms to minimize.
[2024-06-01 13:47:10] [INFO ] Deduced a trap composed of 161 places in 285 ms of which 3 ms to minimize.
[2024-06-01 13:47:11] [INFO ] Deduced a trap composed of 313 places in 349 ms of which 5 ms to minimize.
[2024-06-01 13:47:12] [INFO ] Deduced a trap composed of 289 places in 409 ms of which 4 ms to minimize.
[2024-06-01 13:47:13] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 2 ms to minimize.
[2024-06-01 13:47:15] [INFO ] Deduced a trap composed of 143 places in 298 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/1886 variables, and 55 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/31 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1362/1362 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1362 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 13/55 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-06-01 13:47:24] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 2 ms to minimize.
[2024-06-01 13:47:26] [INFO ] Deduced a trap composed of 323 places in 371 ms of which 4 ms to minimize.
[2024-06-01 13:47:27] [INFO ] Deduced a trap composed of 280 places in 350 ms of which 4 ms to minimize.
[2024-06-01 13:47:34] [INFO ] Deduced a trap composed of 259 places in 327 ms of which 4 ms to minimize.
[2024-06-01 13:47:35] [INFO ] Deduced a trap composed of 274 places in 317 ms of which 5 ms to minimize.
[2024-06-01 13:47:35] [INFO ] Deduced a trap composed of 277 places in 382 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/1886 variables, and 61 constraints, problems are : Problem set: 0 solved, 1362 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 28/31 constraints, State Equation: 0/544 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1362 constraints, Known Traps: 19/19 constraints]
After SMT, in 45192ms problems are : Problem set: 0 solved, 1362 unsolved
Search for dead transitions found 0 dead transitions in 45212ms
Finished structural reductions in LTL mode , in 1 iterations and 45276 ms. Remains : 544/550 places, 1366/1372 transitions.
[2024-06-01 13:47:37] [INFO ] Flatten gal took : 61 ms
[2024-06-01 13:47:37] [INFO ] Flatten gal took : 69 ms
[2024-06-01 13:47:37] [INFO ] Input system was already deterministic with 1366 transitions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 538 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 538 transition count 1360
Applied a total of 24 rules in 66 ms. Remains 538 /550 variables (removed 12) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-06-01 13:47:37] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 538 cols
[2024-06-01 13:47:37] [INFO ] Computed 46 invariants in 50 ms
[2024-06-01 13:47:37] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 13:47:53] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 1 ms to minimize.
[2024-06-01 13:47:53] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 2 ms to minimize.
[2024-06-01 13:47:54] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:47:54] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 1 ms to minimize.
[2024-06-01 13:47:54] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 1 ms to minimize.
[2024-06-01 13:47:55] [INFO ] Deduced a trap composed of 133 places in 389 ms of which 4 ms to minimize.
[2024-06-01 13:47:56] [INFO ] Deduced a trap composed of 309 places in 474 ms of which 33 ms to minimize.
[2024-06-01 13:47:58] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:48:03] [INFO ] Deduced a trap composed of 296 places in 383 ms of which 4 ms to minimize.
SMT process timed out in 25350ms, After SMT, problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 25413ms
Finished structural reductions in LTL mode , in 1 iterations and 25483 ms. Remains : 538/550 places, 1360/1372 transitions.
[2024-06-01 13:48:03] [INFO ] Flatten gal took : 55 ms
[2024-06-01 13:48:03] [INFO ] Flatten gal took : 61 ms
[2024-06-01 13:48:03] [INFO ] Input system was already deterministic with 1360 transitions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1372/1372 transitions.
Applied a total of 0 rules in 13 ms. Remains 550 /550 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Running 1368 sub problems to find dead transitions.
[2024-06-01 13:48:03] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 550 cols
[2024-06-01 13:48:03] [INFO ] Computed 46 invariants in 53 ms
[2024-06-01 13:48:03] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 13:48:19] [INFO ] Deduced a trap composed of 75 places in 165 ms of which 2 ms to minimize.
[2024-06-01 13:48:19] [INFO ] Deduced a trap composed of 75 places in 121 ms of which 2 ms to minimize.
[2024-06-01 13:48:20] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 1 ms to minimize.
[2024-06-01 13:48:20] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 1 ms to minimize.
[2024-06-01 13:48:20] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
[2024-06-01 13:48:21] [INFO ] Deduced a trap composed of 313 places in 441 ms of which 5 ms to minimize.
[2024-06-01 13:48:21] [INFO ] Deduced a trap composed of 167 places in 323 ms of which 4 ms to minimize.
[2024-06-01 13:48:22] [INFO ] Deduced a trap composed of 39 places in 255 ms of which 1 ms to minimize.
[2024-06-01 13:48:23] [INFO ] Deduced a trap composed of 319 places in 355 ms of which 4 ms to minimize.
[2024-06-01 13:48:23] [INFO ] Deduced a trap composed of 320 places in 420 ms of which 3 ms to minimize.
[2024-06-01 13:48:24] [INFO ] Deduced a trap composed of 317 places in 402 ms of which 4 ms to minimize.
[2024-06-01 13:48:24] [INFO ] Deduced a trap composed of 323 places in 435 ms of which 6 ms to minimize.
[2024-06-01 13:48:25] [INFO ] Deduced a trap composed of 311 places in 414 ms of which 4 ms to minimize.
[2024-06-01 13:48:25] [INFO ] Deduced a trap composed of 322 places in 384 ms of which 4 ms to minimize.
[2024-06-01 13:48:26] [INFO ] Deduced a trap composed of 313 places in 392 ms of which 4 ms to minimize.
[2024-06-01 13:48:26] [INFO ] Deduced a trap composed of 307 places in 430 ms of which 4 ms to minimize.
[2024-06-01 13:48:27] [INFO ] Deduced a trap composed of 322 places in 412 ms of which 4 ms to minimize.
[2024-06-01 13:48:27] [INFO ] Deduced a trap composed of 311 places in 304 ms of which 4 ms to minimize.
[2024-06-01 13:48:27] [INFO ] Deduced a trap composed of 315 places in 305 ms of which 3 ms to minimize.
[2024-06-01 13:48:28] [INFO ] Deduced a trap composed of 292 places in 437 ms of which 4 ms to minimize.
SMT process timed out in 25345ms, After SMT, problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 25364ms
Finished structural reductions in LTL mode , in 1 iterations and 25381 ms. Remains : 550/550 places, 1372/1372 transitions.
[2024-06-01 13:48:28] [INFO ] Flatten gal took : 72 ms
[2024-06-01 13:48:28] [INFO ] Flatten gal took : 81 ms
[2024-06-01 13:48:29] [INFO ] Input system was already deterministic with 1372 transitions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 538 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 538 transition count 1360
Applied a total of 24 rules in 38 ms. Remains 538 /550 variables (removed 12) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-06-01 13:48:29] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 538 cols
[2024-06-01 13:48:29] [INFO ] Computed 46 invariants in 31 ms
[2024-06-01 13:48:29] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 13:48:45] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 3 ms to minimize.
[2024-06-01 13:48:45] [INFO ] Deduced a trap composed of 73 places in 108 ms of which 1 ms to minimize.
[2024-06-01 13:48:45] [INFO ] Deduced a trap composed of 73 places in 106 ms of which 2 ms to minimize.
[2024-06-01 13:48:45] [INFO ] Deduced a trap composed of 73 places in 78 ms of which 1 ms to minimize.
[2024-06-01 13:48:46] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:48:46] [INFO ] Deduced a trap composed of 133 places in 370 ms of which 4 ms to minimize.
[2024-06-01 13:48:47] [INFO ] Deduced a trap composed of 309 places in 362 ms of which 4 ms to minimize.
[2024-06-01 13:48:49] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 2 ms to minimize.
[2024-06-01 13:48:53] [INFO ] Deduced a trap composed of 296 places in 391 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10.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 9.0)
(s123 1.0)
(s124 0.0)
(s125 1.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 1.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 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 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/1874 variables, and 51 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 13:49:05] [INFO ] Deduced a trap composed of 310 places in 320 ms of which 4 ms to minimize.
[2024-06-01 13:49:05] [INFO ] Deduced a trap composed of 274 places in 326 ms of which 4 ms to minimize.
[2024-06-01 13:49:05] [INFO ] Deduced a trap composed of 267 places in 304 ms of which 4 ms to minimize.
[2024-06-01 13:49:07] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 10)
(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 9)
(s123 1)
(s124 0)
(s125 1)
(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 1)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(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 1)
(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 1)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 1)
(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 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(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 6)
(s364 0)
(s365 0)
(s366 1)
(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 1)
(s425 0)
(s426 0)
(s427 3)
(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)timeout

(s441 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/1874 variables, and 55 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 13/13 constraints]
After SMT, in 45791ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 45809ms
Finished structural reductions in LTL mode , in 1 iterations and 45863 ms. Remains : 538/550 places, 1360/1372 transitions.
[2024-06-01 13:49:15] [INFO ] Flatten gal took : 46 ms
[2024-06-01 13:49:15] [INFO ] Flatten gal took : 51 ms
[2024-06-01 13:49:15] [INFO ] Input system was already deterministic with 1360 transitions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1372/1372 transitions.
Applied a total of 0 rules in 9 ms. Remains 550 /550 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Running 1368 sub problems to find dead transitions.
[2024-06-01 13:49:15] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 550 cols
[2024-06-01 13:49:15] [INFO ] Computed 46 invariants in 38 ms
[2024-06-01 13:49:15] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 13:49:30] [INFO ] Deduced a trap composed of 75 places in 118 ms of which 2 ms to minimize.
[2024-06-01 13:49:30] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 2 ms to minimize.
[2024-06-01 13:49:30] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 1 ms to minimize.
[2024-06-01 13:49:30] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 1 ms to minimize.
[2024-06-01 13:49:30] [INFO ] Deduced a trap composed of 75 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:49:31] [INFO ] Deduced a trap composed of 313 places in 362 ms of which 4 ms to minimize.
[2024-06-01 13:49:31] [INFO ] Deduced a trap composed of 167 places in 353 ms of which 4 ms to minimize.
[2024-06-01 13:49:32] [INFO ] Deduced a trap composed of 39 places in 243 ms of which 2 ms to minimize.
[2024-06-01 13:49:33] [INFO ] Deduced a trap composed of 319 places in 426 ms of which 5 ms to minimize.
[2024-06-01 13:49:34] [INFO ] Deduced a trap composed of 320 places in 344 ms of which 3 ms to minimize.
[2024-06-01 13:49:34] [INFO ] Deduced a trap composed of 317 places in 374 ms of which 4 ms to minimize.
[2024-06-01 13:49:35] [INFO ] Deduced a trap composed of 323 places in 391 ms of which 4 ms to minimize.
[2024-06-01 13:49:35] [INFO ] Deduced a trap composed of 311 places in 447 ms of which 4 ms to minimize.
[2024-06-01 13:49:36] [INFO ] Deduced a trap composed of 322 places in 388 ms of which 4 ms to minimize.
[2024-06-01 13:49:36] [INFO ] Deduced a trap composed of 313 places in 361 ms of which 4 ms to minimize.
[2024-06-01 13:49:37] [INFO ] Deduced a trap composed of 307 places in 531 ms of which 5 ms to minimize.
[2024-06-01 13:49:37] [INFO ] Deduced a trap composed of 322 places in 384 ms of which 3 ms to minimize.
[2024-06-01 13:49:37] [INFO ] Deduced a trap composed of 311 places in 349 ms of which 3 ms to minimize.
[2024-06-01 13:49:38] [INFO ] Deduced a trap composed of 315 places in 419 ms of which 5 ms to minimize.
[2024-06-01 13:49:39] [INFO ] Deduced a trap composed of 292 places in 456 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 13:49:40] [INFO ] Deduced a trap composed of 75 places in 103 ms of which 1 ms to minimize.
[2024-06-01 13:49:41] [INFO ] Deduced a trap composed of 265 places in 354 ms of which 3 ms to minimize.
SMT process timed out in 25941ms, After SMT, problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 25959ms
Finished structural reductions in LTL mode , in 1 iterations and 25972 ms. Remains : 550/550 places, 1372/1372 transitions.
[2024-06-01 13:49:41] [INFO ] Flatten gal took : 86 ms
[2024-06-01 13:49:41] [INFO ] Flatten gal took : 131 ms
[2024-06-01 13:49:41] [INFO ] Input system was already deterministic with 1372 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 550/550 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 550 transition count 1354
Reduce places removed 18 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 24 rules applied. Total rules applied 42 place count 532 transition count 1348
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 48 place count 526 transition count 1348
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 48 place count 526 transition count 1312
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 120 place count 490 transition count 1312
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 126 place count 484 transition count 1306
Iterating global reduction 3 with 6 rules applied. Total rules applied 132 place count 484 transition count 1306
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 240 place count 430 transition count 1252
Applied a total of 240 rules in 236 ms. Remains 430 /550 variables (removed 120) and now considering 1252/1372 (removed 120) transitions.
Running 1248 sub problems to find dead transitions.
[2024-06-01 13:49:41] [INFO ] Flow matrix only has 1228 transitions (discarded 24 similar events)
// Phase 1: matrix 1228 rows 430 cols
[2024-06-01 13:49:41] [INFO ] Computed 46 invariants in 18 ms
[2024-06-01 13:49:41] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-06-01 13:49:56] [INFO ] Deduced a trap composed of 55 places in 193 ms of which 2 ms to minimize.
[2024-06-01 13:49:56] [INFO ] Deduced a trap composed of 56 places in 177 ms of which 2 ms to minimize.
[2024-06-01 13:49:56] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 2 ms to minimize.
[2024-06-01 13:49:57] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:49:57] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:49:57] [INFO ] Deduced a trap composed of 209 places in 308 ms of which 4 ms to minimize.
[2024-06-01 13:49:57] [INFO ] Deduced a trap composed of 203 places in 380 ms of which 9 ms to minimize.
[2024-06-01 13:49:58] [INFO ] Deduced a trap composed of 222 places in 328 ms of which 3 ms to minimize.
[2024-06-01 13:49:58] [INFO ] Deduced a trap composed of 201 places in 356 ms of which 3 ms to minimize.
[2024-06-01 13:49:59] [INFO ] Deduced a trap composed of 225 places in 314 ms of which 3 ms to minimize.
[2024-06-01 13:49:59] [INFO ] Deduced a trap composed of 223 places in 292 ms of which 3 ms to minimize.
[2024-06-01 13:49:59] [INFO ] Deduced a trap composed of 218 places in 342 ms of which 3 ms to minimize.
[2024-06-01 13:50:00] [INFO ] Deduced a trap composed of 221 places in 347 ms of which 2 ms to minimize.
[2024-06-01 13:50:00] [INFO ] Deduced a trap composed of 211 places in 358 ms of which 3 ms to minimize.
[2024-06-01 13:50:00] [INFO ] Deduced a trap composed of 252 places in 320 ms of which 3 ms to minimize.
[2024-06-01 13:50:01] [INFO ] Deduced a trap composed of 201 places in 331 ms of which 3 ms to minimize.
[2024-06-01 13:50:01] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 426/1658 variables, and 59 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/430 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1248/1248 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/426 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/426 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-06-01 13:50:09] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 2 ms to minimize.
[2024-06-01 13:50:22] [INFO ] Deduced a trap composed of 149 places in 299 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1248 unsolved
[2024-06-01 13:50:25] [INFO ] Deduced a trap composed of 46 places in 203 ms of which 2 ms to minimize.
[2024-06-01 13:50:26] [INFO ] Deduced a trap composed of 106 places in 270 ms of which 41 ms to minimize.
[2024-06-01 13:50:27] [INFO ] Deduced a trap composed of 27 places in 249 ms of which 2 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 426/1658 variables, and 64 constraints, problems are : Problem set: 0 solved, 1248 unsolved in 20057 ms.
Refiners :[Positive P Invariants (semi-flows): 14/16 constraints, Generalized P Invariants (flows): 28/30 constraints, State Equation: 0/430 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1248 constraints, Known Traps: 22/22 constraints]
After SMT, in 45994ms problems are : Problem set: 0 solved, 1248 unsolved
Search for dead transitions found 0 dead transitions in 46021ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 46261 ms. Remains : 430/550 places, 1252/1372 transitions.
[2024-06-01 13:50:27] [INFO ] Flatten gal took : 44 ms
[2024-06-01 13:50:27] [INFO ] Flatten gal took : 47 ms
[2024-06-01 13:50:28] [INFO ] Input system was already deterministic with 1252 transitions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 538 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 538 transition count 1360
Applied a total of 24 rules in 42 ms. Remains 538 /550 variables (removed 12) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-06-01 13:50:28] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 538 cols
[2024-06-01 13:50:28] [INFO ] Computed 46 invariants in 32 ms
[2024-06-01 13:50:28] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 13:50:49] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
[2024-06-01 13:50:50] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 2 ms to minimize.
[2024-06-01 13:50:50] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:50:50] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 1 ms to minimize.
[2024-06-01 13:50:50] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:50:51] [INFO ] Deduced a trap composed of 133 places in 372 ms of which 4 ms to minimize.
[2024-06-01 13:50:52] [INFO ] Deduced a trap composed of 309 places in 330 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/1874 variables, and 49 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 13:50:55] [INFO ] Deduced a trap composed of 73 places in 307 ms of which 27 ms to minimize.
[2024-06-01 13:51:03] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/1874 variables, and 51 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 9/9 constraints]
After SMT, in 44953ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 44979ms
Finished structural reductions in LTL mode , in 1 iterations and 45024 ms. Remains : 538/550 places, 1360/1372 transitions.
[2024-06-01 13:51:13] [INFO ] Flatten gal took : 84 ms
[2024-06-01 13:51:13] [INFO ] Flatten gal took : 70 ms
[2024-06-01 13:51:13] [INFO ] Input system was already deterministic with 1360 transitions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1372/1372 transitions.
Applied a total of 0 rules in 10 ms. Remains 550 /550 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Running 1368 sub problems to find dead transitions.
[2024-06-01 13:51:13] [INFO ] Flow matrix only has 1348 transitions (discarded 24 similar events)
// Phase 1: matrix 1348 rows 550 cols
[2024-06-01 13:51:13] [INFO ] Computed 46 invariants in 39 ms
[2024-06-01 13:51:13] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 13:51:29] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 2 ms to minimize.
[2024-06-01 13:51:29] [INFO ] Deduced a trap composed of 75 places in 151 ms of which 2 ms to minimize.
[2024-06-01 13:51:29] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 1 ms to minimize.
[2024-06-01 13:51:29] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 1 ms to minimize.
[2024-06-01 13:51:29] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 2 ms to minimize.
[2024-06-01 13:51:30] [INFO ] Deduced a trap composed of 313 places in 319 ms of which 3 ms to minimize.
[2024-06-01 13:51:30] [INFO ] Deduced a trap composed of 167 places in 277 ms of which 3 ms to minimize.
[2024-06-01 13:51:31] [INFO ] Deduced a trap composed of 39 places in 230 ms of which 2 ms to minimize.
[2024-06-01 13:51:32] [INFO ] Deduced a trap composed of 319 places in 424 ms of which 4 ms to minimize.
[2024-06-01 13:51:32] [INFO ] Deduced a trap composed of 320 places in 350 ms of which 4 ms to minimize.
[2024-06-01 13:51:33] [INFO ] Deduced a trap composed of 317 places in 448 ms of which 5 ms to minimize.
[2024-06-01 13:51:33] [INFO ] Deduced a trap composed of 323 places in 431 ms of which 6 ms to minimize.
[2024-06-01 13:51:34] [INFO ] Deduced a trap composed of 311 places in 311 ms of which 3 ms to minimize.
[2024-06-01 13:51:34] [INFO ] Deduced a trap composed of 322 places in 490 ms of which 4 ms to minimize.
[2024-06-01 13:51:35] [INFO ] Deduced a trap composed of 313 places in 396 ms of which 4 ms to minimize.
[2024-06-01 13:51:35] [INFO ] Deduced a trap composed of 307 places in 478 ms of which 6 ms to minimize.
[2024-06-01 13:51:36] [INFO ] Deduced a trap composed of 322 places in 427 ms of which 4 ms to minimize.
[2024-06-01 13:51:36] [INFO ] Deduced a trap composed of 311 places in 598 ms of which 5 ms to minimize.
[2024-06-01 13:51:37] [INFO ] Deduced a trap composed of 315 places in 416 ms of which 3 ms to minimize.
[2024-06-01 13:51:38] [INFO ] Deduced a trap composed of 292 places in 410 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/1898 variables, and 62 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 11/13 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/550 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1368/1368 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 31/42 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/546 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1368 unsolved
[2024-06-01 13:51:41] [INFO ] Deduced a trap composed of 75 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:51:43] [INFO ] Deduced a trap composed of 97 places in 398 ms of which 4 ms to minimize.
[2024-06-01 13:51:43] [INFO ] Deduced a trap composed of 297 places in 392 ms of which 4 ms to minimize.
[2024-06-01 13:51:49] [INFO ] Deduced a trap composed of 313 places in 375 ms of which 5 ms to minimize.
[2024-06-01 13:51:49] [INFO ] Deduced a trap composed of 312 places in 428 ms of which 5 ms to minimize.
[2024-06-01 13:51:52] [INFO ] Deduced a trap composed of 15 places in 179 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/1898 variables, and 68 constraints, problems are : Problem set: 0 solved, 1368 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 11/13 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/550 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1368 constraints, Known Traps: 26/26 constraints]
After SMT, in 45553ms problems are : Problem set: 0 solved, 1368 unsolved
Search for dead transitions found 0 dead transitions in 45585ms
Finished structural reductions in LTL mode , in 1 iterations and 45599 ms. Remains : 550/550 places, 1372/1372 transitions.
[2024-06-01 13:51:59] [INFO ] Flatten gal took : 40 ms
[2024-06-01 13:51:59] [INFO ] Flatten gal took : 43 ms
[2024-06-01 13:51:59] [INFO ] Input system was already deterministic with 1372 transitions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 538 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 538 transition count 1360
Applied a total of 24 rules in 19 ms. Remains 538 /550 variables (removed 12) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-06-01 13:51:59] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 538 cols
[2024-06-01 13:51:59] [INFO ] Computed 46 invariants in 44 ms
[2024-06-01 13:51:59] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 13:52:17] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 2 ms to minimize.
[2024-06-01 13:52:17] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 2 ms to minimize.
[2024-06-01 13:52:17] [INFO ] Deduced a trap composed of 73 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:52:17] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:52:17] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:52:18] [INFO ] Deduced a trap composed of 133 places in 358 ms of which 4 ms to minimize.
[2024-06-01 13:52:19] [INFO ] Deduced a trap composed of 309 places in 400 ms of which 3 ms to minimize.
[2024-06-01 13:52:20] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/1874 variables, and 50 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 13:52:29] [INFO ] Deduced a trap composed of 107 places in 262 ms of which 3 ms to minimize.
[2024-06-01 13:52:30] [INFO ] Deduced a trap composed of 78 places in 378 ms of which 4 ms to minimize.
[2024-06-01 13:52:36] [INFO ] Deduced a trap composed of 304 places in 381 ms of which 4 ms to minimize.
[2024-06-01 13:52:36] [INFO ] Deduced a trap composed of 311 places in 407 ms of which 3 ms to minimize.
[2024-06-01 13:52:37] [INFO ] Deduced a trap composed of 304 places in 381 ms of which 4 ms to minimize.
[2024-06-01 13:52:37] [INFO ] Deduced a trap composed of 297 places in 427 ms of which 5 ms to minimize.
[2024-06-01 13:52:37] [INFO ] Deduced a trap composed of 304 places in 369 ms of which 3 ms to minimize.
[2024-06-01 13:52:38] [INFO ] Deduced a trap composed of 330 places in 374 ms of which 4 ms to minimize.
[2024-06-01 13:52:38] [INFO ] Deduced a trap composed of 324 places in 350 ms of which 3 ms to minimize.
[2024-06-01 13:52:39] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/1874 variables, and 60 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 18/18 constraints]
After SMT, in 45928ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 45940ms
Finished structural reductions in LTL mode , in 1 iterations and 45963 ms. Remains : 538/550 places, 1360/1372 transitions.
[2024-06-01 13:52:45] [INFO ] Flatten gal took : 55 ms
[2024-06-01 13:52:45] [INFO ] Flatten gal took : 53 ms
[2024-06-01 13:52:45] [INFO ] Input system was already deterministic with 1360 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 550/550 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 550 transition count 1336
Reduce places removed 36 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 48 rules applied. Total rules applied 84 place count 514 transition count 1324
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 96 place count 502 transition count 1324
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 96 place count 502 transition count 1258
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 228 place count 436 transition count 1258
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 312 place count 394 transition count 1216
Applied a total of 312 rules in 57 ms. Remains 394 /550 variables (removed 156) and now considering 1216/1372 (removed 156) transitions.
Running 1212 sub problems to find dead transitions.
[2024-06-01 13:52:45] [INFO ] Flow matrix only has 1192 transitions (discarded 24 similar events)
// Phase 1: matrix 1192 rows 394 cols
[2024-06-01 13:52:45] [INFO ] Computed 46 invariants in 37 ms
[2024-06-01 13:52:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/390 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-06-01 13:53:00] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:53:00] [INFO ] Deduced a trap composed of 50 places in 72 ms of which 0 ms to minimize.
[2024-06-01 13:53:00] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 0 ms to minimize.
[2024-06-01 13:53:01] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:53:01] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:53:01] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:53:01] [INFO ] Deduced a trap composed of 208 places in 360 ms of which 3 ms to minimize.
[2024-06-01 13:53:02] [INFO ] Deduced a trap composed of 177 places in 352 ms of which 3 ms to minimize.
[2024-06-01 13:53:02] [INFO ] Deduced a trap composed of 161 places in 353 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 390/1586 variables, and 51 constraints, problems are : Problem set: 0 solved, 1212 unsolved in 20054 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/394 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1212/1212 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/390 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-06-01 13:53:14] [INFO ] Deduced a trap composed of 216 places in 207 ms of which 3 ms to minimize.
[2024-06-01 13:53:15] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 2 ms to minimize.
[2024-06-01 13:53:20] [INFO ] Deduced a trap composed of 132 places in 346 ms of which 3 ms to minimize.
[2024-06-01 13:53:21] [INFO ] Deduced a trap composed of 168 places in 265 ms of which 3 ms to minimize.
[2024-06-01 13:53:21] [INFO ] Deduced a trap composed of 165 places in 267 ms of which 2 ms to minimize.
[2024-06-01 13:53:21] [INFO ] Deduced a trap composed of 175 places in 314 ms of which 3 ms to minimize.
[2024-06-01 13:53:22] [INFO ] Deduced a trap composed of 146 places in 430 ms of which 7 ms to minimize.
[2024-06-01 13:53:22] [INFO ] Deduced a trap composed of 173 places in 289 ms of which 2 ms to minimize.
[2024-06-01 13:53:23] [INFO ] Deduced a trap composed of 75 places in 215 ms of which 2 ms to minimize.
[2024-06-01 13:53:24] [INFO ] Deduced a trap composed of 69 places in 196 ms of which 2 ms to minimize.
[2024-06-01 13:53:24] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/390 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 1212 unsolved
[2024-06-01 13:53:29] [INFO ] Deduced a trap composed of 61 places in 282 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 390/1586 variables, and 63 constraints, problems are : Problem set: 0 solved, 1212 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/394 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1212 constraints, Known Traps: 21/21 constraints]
After SMT, in 45811ms problems are : Problem set: 0 solved, 1212 unsolved
Search for dead transitions found 0 dead transitions in 45827ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 45887 ms. Remains : 394/550 places, 1216/1372 transitions.
[2024-06-01 13:53:31] [INFO ] Flatten gal took : 42 ms
[2024-06-01 13:53:31] [INFO ] Flatten gal took : 41 ms
[2024-06-01 13:53:31] [INFO ] Input system was already deterministic with 1216 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 550/550 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 550 transition count 1330
Reduce places removed 42 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 508 transition count 1324
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 96 place count 502 transition count 1324
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 96 place count 502 transition count 1288
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 168 place count 466 transition count 1288
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 288 place count 406 transition count 1228
Applied a total of 288 rules in 99 ms. Remains 406 /550 variables (removed 144) and now considering 1228/1372 (removed 144) transitions.
Running 1224 sub problems to find dead transitions.
[2024-06-01 13:53:31] [INFO ] Flow matrix only has 1204 transitions (discarded 24 similar events)
// Phase 1: matrix 1204 rows 406 cols
[2024-06-01 13:53:31] [INFO ] Computed 46 invariants in 15 ms
[2024-06-01 13:53:31] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 13:53:46] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 1 ms to minimize.
[2024-06-01 13:53:46] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:53:46] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:53:46] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 0 ms to minimize.
[2024-06-01 13:53:46] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 0 ms to minimize.
[2024-06-01 13:53:47] [INFO ] Deduced a trap composed of 175 places in 318 ms of which 3 ms to minimize.
[2024-06-01 13:53:48] [INFO ] Deduced a trap composed of 180 places in 286 ms of which 3 ms to minimize.
[2024-06-01 13:53:48] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:53:50] [INFO ] Deduced a trap composed of 184 places in 313 ms of which 3 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 Real declared 402/1610 variables, and 51 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/406 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/402 variables, 9/51 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
[2024-06-01 13:54:01] [INFO ] Deduced a trap composed of 63 places in 165 ms of which 2 ms to minimize.
[2024-06-01 13:54:01] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 1 ms to minimize.
[2024-06-01 13:54:11] [INFO ] Deduced a trap composed of 144 places in 317 ms of which 2 ms to minimize.
[2024-06-01 13:54:11] [INFO ] Deduced a trap composed of 29 places in 265 ms of which 2 ms to minimize.
[2024-06-01 13:54:12] [INFO ] Deduced a trap composed of 128 places in 272 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 402/1610 variables, and 56 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 20067 ms.
Refiners :[Positive P Invariants (semi-flows): 12/16 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/406 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1224 constraints, Known Traps: 14/14 constraints]
After SMT, in 45032ms problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 45048ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 45163 ms. Remains : 406/550 places, 1228/1372 transitions.
[2024-06-01 13:54:16] [INFO ] Flatten gal took : 60 ms
[2024-06-01 13:54:16] [INFO ] Flatten gal took : 59 ms
[2024-06-01 13:54:16] [INFO ] Input system was already deterministic with 1228 transitions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1366
Applied a total of 12 rules in 30 ms. Remains 544 /550 variables (removed 6) and now considering 1366/1372 (removed 6) transitions.
Running 1362 sub problems to find dead transitions.
[2024-06-01 13:54:16] [INFO ] Flow matrix only has 1342 transitions (discarded 24 similar events)
// Phase 1: matrix 1342 rows 544 cols
[2024-06-01 13:54:17] [INFO ] Computed 46 invariants in 41 ms
[2024-06-01 13:54:17] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 1362 unsolved
[2024-06-01 13:54:34] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 1 ms to minimize.
[2024-06-01 13:54:34] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:54:34] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:54:34] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 1 ms to minimize.
[2024-06-01 13:54:34] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 1 ms to minimize.
[2024-06-01 13:54:35] [INFO ] Deduced a trap composed of 299 places in 381 ms of which 5 ms to minimize.
[2024-06-01 13:54:35] [INFO ] Deduced a trap composed of 121 places in 372 ms of which 19 ms to minimize.
[2024-06-01 13:54:35] [INFO ] Deduced a trap composed of 164 places in 295 ms of which 4 ms to minimize.
[2024-06-01 13:54:36] [INFO ] Deduced a trap composed of 161 places in 282 ms of which 4 ms to minimize.
[2024-06-01 13:54:37] [INFO ] Deduced a trap composed of 313 places in 324 ms of which 5 ms to minimize.
[2024-06-01 13:54:43] [INFO ] Deduced a trap composed of 289 places in 5095 ms of which 4 ms to minimize.
SMT process timed out in 26102ms, After SMT, problems are : Problem set: 0 solved, 1362 unsolved
Search for dead transitions found 0 dead transitions in 26117ms
Finished structural reductions in LTL mode , in 1 iterations and 26151 ms. Remains : 544/550 places, 1366/1372 transitions.
[2024-06-01 13:54:43] [INFO ] Flatten gal took : 60 ms
[2024-06-01 13:54:43] [INFO ] Flatten gal took : 48 ms
[2024-06-01 13:54:43] [INFO ] Input system was already deterministic with 1366 transitions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 1372/1372 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 544 transition count 1366
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 544 transition count 1366
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 538 transition count 1360
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 538 transition count 1360
Applied a total of 24 rules in 28 ms. Remains 538 /550 variables (removed 12) and now considering 1360/1372 (removed 12) transitions.
Running 1356 sub problems to find dead transitions.
[2024-06-01 13:54:43] [INFO ] Flow matrix only has 1336 transitions (discarded 24 similar events)
// Phase 1: matrix 1336 rows 538 cols
[2024-06-01 13:54:43] [INFO ] Computed 46 invariants in 43 ms
[2024-06-01 13:54:43] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 13:55:00] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 2 ms to minimize.
[2024-06-01 13:55:00] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 1 ms to minimize.
[2024-06-01 13:55:01] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:55:01] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:55:01] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:55:01] [INFO ] Deduced a trap composed of 133 places in 308 ms of which 5 ms to minimize.
[2024-06-01 13:55:03] [INFO ] Deduced a trap composed of 309 places in 304 ms of which 4 ms to minimize.
[2024-06-01 13:55:04] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 534/1874 variables, and 50 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1356/1356 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1356 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/534 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/534 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/534 variables, 8/50 constraints. Problems are: Problem set: 0 solved, 1356 unsolved
[2024-06-01 13:55:13] [INFO ] Deduced a trap composed of 107 places in 239 ms of which 2 ms to minimize.
[2024-06-01 13:55:13] [INFO ] Deduced a trap composed of 78 places in 238 ms of which 2 ms to minimize.
[2024-06-01 13:55:18] [INFO ] Deduced a trap composed of 304 places in 378 ms of which 4 ms to minimize.
[2024-06-01 13:55:19] [INFO ] Deduced a trap composed of 311 places in 337 ms of which 3 ms to minimize.
[2024-06-01 13:55:19] [INFO ] Deduced a trap composed of 304 places in 594 ms of which 16 ms to minimize.
[2024-06-01 13:55:20] [INFO ] Deduced a trap composed of 297 places in 458 ms of which 4 ms to minimize.
[2024-06-01 13:55:20] [INFO ] Deduced a trap composed of 304 places in 343 ms of which 4 ms to minimize.
[2024-06-01 13:55:21] [INFO ] Deduced a trap composed of 330 places in 334 ms of which 3 ms to minimize.
[2024-06-01 13:55:21] [INFO ] Deduced a trap composed of 324 places in 383 ms of which 3 ms to minimize.
[2024-06-01 13:55:21] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/1874 variables, and 60 constraints, problems are : Problem set: 0 solved, 1356 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 12/14 constraints, Generalized P Invariants (flows): 30/32 constraints, State Equation: 0/538 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1356 constraints, Known Traps: 18/18 constraints]
After SMT, in 45188ms problems are : Problem set: 0 solved, 1356 unsolved
Search for dead transitions found 0 dead transitions in 45229ms
Finished structural reductions in LTL mode , in 1 iterations and 45259 ms. Remains : 538/550 places, 1360/1372 transitions.
[2024-06-01 13:55:28] [INFO ] Flatten gal took : 65 ms
[2024-06-01 13:55:28] [INFO ] Flatten gal took : 57 ms
[2024-06-01 13:55:28] [INFO ] Input system was already deterministic with 1360 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 550/550 places, 1372/1372 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 550 transition count 1330
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 508 transition count 1330
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 84 place count 508 transition count 1264
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 132 rules applied. Total rules applied 216 place count 442 transition count 1264
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 222 place count 436 transition count 1258
Iterating global reduction 2 with 6 rules applied. Total rules applied 228 place count 436 transition count 1258
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 336 place count 382 transition count 1204
Applied a total of 336 rules in 69 ms. Remains 382 /550 variables (removed 168) and now considering 1204/1372 (removed 168) transitions.
Running 1200 sub problems to find dead transitions.
[2024-06-01 13:55:28] [INFO ] Flow matrix only has 1180 transitions (discarded 24 similar events)
// Phase 1: matrix 1180 rows 382 cols
[2024-06-01 13:55:28] [INFO ] Computed 46 invariants in 13 ms
[2024-06-01 13:55:28] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 13:55:40] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 2 ms to minimize.
[2024-06-01 13:55:40] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 1 ms to minimize.
[2024-06-01 13:55:40] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:55:40] [INFO ] Deduced a trap composed of 47 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:55:40] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 1 ms to minimize.
[2024-06-01 13:55:41] [INFO ] Deduced a trap composed of 173 places in 295 ms of which 3 ms to minimize.
[2024-06-01 13:55:41] [INFO ] Deduced a trap composed of 180 places in 295 ms of which 2 ms to minimize.
[2024-06-01 13:55:41] [INFO ] Deduced a trap composed of 158 places in 306 ms of which 2 ms to minimize.
[2024-06-01 13:55:42] [INFO ] Deduced a trap composed of 157 places in 367 ms of which 3 ms to minimize.
[2024-06-01 13:55:42] [INFO ] Deduced a trap composed of 170 places in 354 ms of which 3 ms to minimize.
[2024-06-01 13:55:43] [INFO ] Deduced a trap composed of 47 places in 94 ms of which 1 ms to minimize.
[2024-06-01 13:55:53] [INFO ] Deduced a trap composed of 126 places in 281 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/1562 variables, and 54 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1200/1200 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 29/42 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 12/54 constraints. Problems are: Problem set: 0 solved, 1200 unsolved
[2024-06-01 13:55:56] [INFO ] Deduced a trap composed of 39 places in 198 ms of which 2 ms to minimize.
[2024-06-01 13:55:57] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 2 ms to minimize.
[2024-06-01 13:55:57] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 2 ms to minimize.
[2024-06-01 13:56:13] [INFO ] Deduced a trap composed of 161 places in 7039 ms of which 5 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 378/1562 variables, and 58 constraints, problems are : Problem set: 0 solved, 1200 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/15 constraints, Generalized P Invariants (flows): 29/31 constraints, State Equation: 0/382 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1200 constraints, Known Traps: 16/16 constraints]
After SMT, in 45221ms problems are : Problem set: 0 solved, 1200 unsolved
Search for dead transitions found 0 dead transitions in 45234ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 45307 ms. Remains : 382/550 places, 1204/1372 transitions.
[2024-06-01 13:56:14] [INFO ] Flatten gal took : 44 ms
[2024-06-01 13:56:14] [INFO ] Flatten gal took : 61 ms
[2024-06-01 13:56:14] [INFO ] Input system was already deterministic with 1204 transitions.
[2024-06-01 13:56:14] [INFO ] Flatten gal took : 62 ms
[2024-06-01 13:56:14] [INFO ] Flatten gal took : 63 ms
[2024-06-01 13:56:14] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 50 ms.
[2024-06-01 13:56:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 550 places, 1372 transitions and 6968 arcs took 8 ms.
Total runtime 633870 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBLF-COL-S04J04T06-CTLFireability-2024-00
Could not compute solution for formula : PolyORBLF-COL-S04J04T06-CTLFireability-2024-01
Could not compute solution for formula : PolyORBLF-COL-S04J04T06-CTLFireability-2024-02
Could not compute solution for formula : PolyORBLF-COL-S04J04T06-CTLFireability-2024-03
Could not compute solution for formula : PolyORBLF-COL-S04J04T06-CTLFireability-2024-04
Could not compute solution for formula : PolyORBLF-COL-S04J04T06-CTLFireability-2024-05
Could not compute solution for formula : PolyORBLF-COL-S04J04T06-CTLFireability-2024-06
Could not compute solution for formula : PolyORBLF-COL-S04J04T06-CTLFireability-2024-07
Could not compute solution for formula : PolyORBLF-COL-S04J04T06-CTLFireability-2024-08
Could not compute solution for formula : PolyORBLF-COL-S04J04T06-CTLFireability-2024-10
Could not compute solution for formula : PolyORBLF-COL-S04J04T06-CTLFireability-2024-11
Could not compute solution for formula : PolyORBLF-COL-S04J04T06-CTLFireability-2024-13
Could not compute solution for formula : PolyORBLF-COL-S04J04T06-CTLFireability-2024-14
Could not compute solution for formula : PolyORBLF-COL-S04J04T06-CTLFireability-2024-15

BK_STOP 1717250175342

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name PolyORBLF-COL-S04J04T06-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1488/ctl_0_
ctl formula name PolyORBLF-COL-S04J04T06-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1488/ctl_1_
ctl formula name PolyORBLF-COL-S04J04T06-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1488/ctl_2_
ctl formula name PolyORBLF-COL-S04J04T06-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1488/ctl_3_
ctl formula name PolyORBLF-COL-S04J04T06-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1488/ctl_4_
ctl formula name PolyORBLF-COL-S04J04T06-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1488/ctl_5_
ctl formula name PolyORBLF-COL-S04J04T06-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1488/ctl_6_
ctl formula name PolyORBLF-COL-S04J04T06-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1488/ctl_7_
ctl formula name PolyORBLF-COL-S04J04T06-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1488/ctl_8_
ctl formula name PolyORBLF-COL-S04J04T06-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1488/ctl_9_
ctl formula name PolyORBLF-COL-S04J04T06-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1488/ctl_10_
ctl formula name PolyORBLF-COL-S04J04T06-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/1488/ctl_11_
ctl formula name PolyORBLF-COL-S04J04T06-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/1488/ctl_12_
ctl formula name PolyORBLF-COL-S04J04T06-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/1488/ctl_13_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="PolyORBLF-COL-S04J04T06"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-COL-S04J04T06, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r516-tajo-171654446400122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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